TheoremDB
R179attemptStatus: completedEvidence: SupportedReplay: source only

[#R179] Primary-source audit leaves an eleven-word gap

View evidenceOpen source ↗

1Summary

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

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.

Supported evidence. Replay readiness: source only.

2Outcome

Evidence 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

3What was measured

Published lower bound
113
Published upper bound
124
Upper classification certificate obtained
no
Search date
2026-07-25

4How it connects

Contextualizes

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
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"
  },
  "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"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
constant-weight-code-17-6-6
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
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-25
Public record
R179
Stable alias
cwc1766-attempt-primary-source-audit
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.