TheoremDB

Problem packetResearch packetR99

R99Sourced evidence

The published heuristic search reached 17 violations

View evidenceOpen source ↗
Link to a section

Authored summary

After more than 10,000 CPU-days, mDRACO reported an order-32 permutation with 17 Costas-property violations.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: the reported mDRACO search for an order-32 Costas permutation

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "the reported mDRACO search for an order-32 Costas permutation",
  "bounds": {
    "order": {
      "min": 32,
      "max": 32
    },
    "reported_cpu_days": {
      "min": 10000,
      "max": 10000
    }
  },
  "exhaustive": false
}

Originating problem: Existence of a Costas array of order 32

Authored record and scope
Authored title
The published heuristic search reached 17 violations
Record type
claim
Stored status
reported
Evidence grade
sourced
Recorded scope data
{ "kind": "bounded", "statement": "the reported mDRACO search for an order-32 Costas permutation", "bounds": { "order": { "min": 32, "max": 32 }, "reported_cpu_days": { "min": 10000, "max": 10000 } }, "exhaustive": false }

2Authored explanation

Vulakh and Finkel applied their parallel ant-colony solver to order 32 for more than 10,000 CPU-days. The best permutation reported in the paper has 17 Costas-property violations. The Appendix also lists near solutions with 18 and 19 violations.

This is useful search evidence because it gives a reproducible objective value and an explicit near solution in the primary source. The run was heuristic and did not cover the full permutation space. Seventeen repeated-vector violations therefore supplies neither a witness nor a lower bound on the minimum possible number of violations.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, Vulakh and Finkel 2022, Section 4, page 5771, and Appendix: Arrays discovered

4What was measured

5How it connects

Informs

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R99",
  "content_hash": null,
  "slug": "ca32-claim-mdraco-near-solution",
  "type": "claim",
  "title": "The published heuristic search reached 17 violations",
  "summary": "After more than 10,000 CPU-days, mDRACO reported an order-32 permutation with 17 Costas-property violations.",
  "relevance": "For Existence of a Costas array of order 32, record ca32-claim-mdraco-near-solution (“The published heuristic search reached 17 violations”) records a bound, answer, status fact, or structural consequence. The record states: After more than 10,000 CPU-days, mDRACO reported an order-32 permutation with 17 Costas-property violations.",
  "relevance_source": "recorded",
  "body": "Vulakh and Finkel applied their parallel ant-colony solver to order 32 for more than 10,000 CPU-days. The best permutation reported in the paper has 17 Costas-property violations. The Appendix also lists near solutions with 18 and 19 violations.\n\nThis is useful search evidence because it gives a reproducible objective value and an explicit near solution in the primary source. The run was heuristic and did not cover the full permutation space. Seventeen repeated-vector violations therefore supplies neither a witness nor a lower bound on the minimum possible number of violations.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "bounded",
    "statement": "the reported mDRACO search for an order-32 Costas permutation",
    "bounds": {
      "order": {
        "min": 32,
        "max": 32
      },
      "reported_cpu_days": {
        "min": 10000,
        "max": 10000
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1007/s00500-022-06969-1",
      "locator": "Vulakh and Finkel 2022, Section 4, page 5771, and Appendix: Arrays discovered"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1007/s00500-022-06969-1",
    "locator": "Vulakh and Finkel 2022, Section 4, page 5771, and Appendix: Arrays discovered"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R98",
      "title": "Existence at order 32 remains open",
      "object_type": "claim",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "costas-array-order-32",
      "title": "costas array order 32",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.