TheoremDB

Problem packetResearch packetR179

R179Recorded attempt

Primary-source audit leaves an eleven-word gap

View evidenceOpen source ↗
Link to a section

Authored summary

The 2007 construction improves the lower bound to 113, while the 2010 classification gives 124 as the upper bound.

The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.

Attempt outcome: completed

Recorded scope: No scope is recorded.

Originating problem: Exact size of a length-17 constant-weight code

Authored record and scope
Authored title
Primary-source audit leaves an eleven-word gap
Record type
attempt
Stored status
completed
Evidence grade
sourced

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The 2007 construction improves the lower bound to 113, while the 2010 classification gives 124 as the upper bound.

Reported outcome

No separate outcome supplied.

Recorded status

completed

Recorded evidence grade

sourced

Recorded scope

No explicit scope supplied.

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

Chee states that the 113-word code was obtained by simulated annealing, length reduction, and local optimization. Its automorphism group is trivial. The paper prints every support, which makes the lower bound independently checkable.

Östergård classifies optimal constant-weight codes in several smaller parameter ranges and develops a double-counting validation scheme for the computer-aided results. The accompanying upper-bound table records 124 for these parameters and cites that paper. The checked sources provide no matching construction and no later exact determination. The research target is therefore an improvement to either endpoint or a complete certificate closing the gap.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

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

Verification source: doi.org ↗, P. R. J. Östergård, Classification of Binary Constant Weight Codes, IEEE Transactions on Information Theory 56 (2010), 3779-3785; Yeow Meng Chee, A New Lower Bound for A(17,6,6), Ars Combinatoria 83 (2007), 361-363

4What was measured

5How it connects

Contextualizes

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R179",
  "content_hash": null,
  "slug": "cwc1766-attempt-primary-source-audit",
  "type": "attempt",
  "title": "Primary-source audit leaves an eleven-word gap",
  "summary": "The 2007 construction improves the lower bound to 113, while the 2010 classification gives 124 as the upper bound.",
  "relevance": "For Exact size of a length-17 constant-weight code, record cwc1766-attempt-primary-source-audit (“Primary-source audit leaves an eleven-word gap”) documents a concrete method, search boundary, or failed route. The record states: The 2007 construction improves the lower bound to 113, while the 2010 classification gives 124 as the upper bound.",
  "relevance_source": "recorded",
  "body": "Chee states that the 113-word code was obtained by simulated annealing, length reduction, and local optimization. Its automorphism group is trivial. The paper prints every support, which makes the lower bound independently checkable.\n\nÖstergård classifies optimal constant-weight codes in several smaller parameter ranges and develops a double-counting validation scheme for the computer-aided results. The accompanying upper-bound table records 124 for these parameters and cites that paper. The checked sources provide no matching construction and no later exact determination. The research target is therefore an improvement to either endpoint or a complete certificate closing the gap.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1109/TIT.2010.2050922",
      "locator": "P. R. J. Östergård, Classification of Binary Constant Weight Codes, IEEE Transactions on Information Theory 56 (2010), 3779-3785; Yeow Meng Chee, A New Lower Bound for A(17,6,6), Ars Combinatoria 83 (2007), 361-363"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1109/TIT.2010.2050922",
    "locator": "P. R. J. Östergård, Classification of Binary Constant Weight Codes, IEEE Transactions on Information Theory 56 (2010), 3779-3785; Yeow Meng Chee, A New Lower Bound for A(17,6,6), Ars Combinatoria 83 (2007), 361-363"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R180",
      "title": "The certified interval is 113 through 124",
      "object_type": "claim",
      "relation": "contextualizes",
      "direction": "outgoing"
    },
    {
      "slug": "constant-weight-code-17-6-6",
      "title": "constant weight code 17 6 6",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A route someone took, recorded so the next person can reuse it or avoid 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.