{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1284",
  "content_hash": null,
  "slug": "binary-code-weight-enumerator-equality-complexity-next-route-20260801",
  "type": "attempt",
  "title": "Complete the stated acceptance conditions",
  "summary": "Give a deterministic polynomial-time algorithm with proof, or prove hardness under a named standard reduction and place the problem in the strongest justified upper complexity class. A hardness proof must map every input to two explicitly constructible binary generator matrices and prove equality of their entire weight enumerators exactly when the source instance is a yes-instance.",
  "relevance": "For Complexity of equality for binary-code weight enumerators, record binary-code-weight-enumerator-equality-complexity-next-route-20260801 (“Complete the stated acceptance conditions”) documents a concrete method, search boundary, or failed route. The record states: Give a deterministic polynomial-time algorithm with proof, or prove hardness under a named standard reduction and place the problem in the strongest justified upper complexity class.",
  "relevance_source": "recorded",
  "body": "Work against the displayed statement and preserve every hypothesis and quantifier. Give a deterministic polynomial-time algorithm with proof, or prove hardness under a named standard reduction and place the problem in the strongest justified upper complexity class. A hardness proof must map every input to two explicitly constructible binary generator matrices and prove equality of their entire weight enumerators exactly when the source instance is a yes-instance. Any computation must retain a replayable witness and a matching exclusion or completeness certificate.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://mathoverflow.net/questions/498913/is-it-hard-to-decide-if-two-codes-have-the-same-weight-enumerator-polynomial",
      "locator": "Editorial research route recorded 2026-08-01."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/498913/is-it-hard-to-decide-if-two-codes-have-the-same-weight-enumerator-polynomial",
    "locator": "Editorial research route recorded 2026-08-01."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1285",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "binary-code-weight-enumerator-equality-complexity",
      "title": "binary code weight enumerator equality complexity",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}