{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QQDJRXCAAZXTK7NPTZO2AGD3TD","short_pith_number":"pith:QQDJRXCA","schema_version":"1.0","canonical_sha256":"840698dc40066f357daf9e5da0187b98d6f99e2d4411e94c526ea05b00a6c758","source":{"kind":"arxiv","id":"2510.15223","version":4},"attestation_state":"computed","paper":{"title":"Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rub\\'en Dar\\'io Guerrero","submitted_at":"2025-10-17T01:11:32Z","abstract_excerpt":"Quantum error correction code discovery has relied on algebraic constructions with predetermined structure or computational search lacking mechanistic interpretability. We introduce a game-theoretic framework recasting code optimization as strategic interactions between competing objectives, where Nash equilibria systematically generate codes with desired properties. We validate the framework by demonstrating it rediscovers the optimal $[\\![15,7,3]\\!]$ quantum Hamming code (Calderbank-Shor-Steane 1996) from competing objectives without predetermined algebraic structure, with equilibrium analys"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2510.15223","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-17T01:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"82a09e98a7df2b248a52b73329c3fe9da236a1ad6496142bf1797fa1636c198d","abstract_canon_sha256":"58abdf51a08cdca15c4c16958904e4b9e8a4ebb742fd31f708a463157f80e308"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:31.702686Z","signature_b64":"HSDvDn/Pf3jV0jEKzJz4Ni1ULZs9w08VplLl2gn1jyp7V1heSo660bzIyS34qcwhO0VVzaL+yFSjTr5beqiXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"840698dc40066f357daf9e5da0187b98d6f99e2d4411e94c526ea05b00a6c758","last_reissued_at":"2026-05-28T01:04:31.702103Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:31.702103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rub\\'en Dar\\'io Guerrero","submitted_at":"2025-10-17T01:11:32Z","abstract_excerpt":"Quantum error correction code discovery has relied on algebraic constructions with predetermined structure or computational search lacking mechanistic interpretability. We introduce a game-theoretic framework recasting code optimization as strategic interactions between competing objectives, where Nash equilibria systematically generate codes with desired properties. We validate the framework by demonstrating it rediscovers the optimal $[\\![15,7,3]\\!]$ quantum Hamming code (Calderbank-Shor-Steane 1996) from competing objectives without predetermined algebraic structure, with equilibrium analys"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We validate the framework by demonstrating it rediscovers the optimal [[15,7,3]] quantum Hamming code (Calderbank-Shor-Steane 1996) from competing objectives without predetermined algebraic structure, with equilibrium analysis providing transparent mechanistic insights into why this topology emerges.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That Nash equilibria arising from strategic interactions among the seven competing objectives will systematically produce codes with the targeted properties even when no algebraic structure is supplied in advance.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A game-theoretic approach using Nash equilibria rediscovers the [[15,7,3]] quantum Hamming code without algebraic priors and generates new code families up to 100 qubits across seven objectives.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1d73a1610e63331be3075e4d0bf339fa17edb607c1f792aa8a5f82e256473653"},"source":{"id":"2510.15223","kind":"arxiv","version":4},"verdict":{"id":"bcc55852-a17d-4ae9-974f-556bd7dfb9aa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T06:58:38.204987Z","strongest_claim":"We validate the framework by demonstrating it rediscovers the optimal [[15,7,3]] quantum Hamming code (Calderbank-Shor-Steane 1996) from competing objectives without predetermined algebraic structure, with equilibrium analysis providing transparent mechanistic insights into why this topology emerges.","one_line_summary":"A game-theoretic approach using Nash equilibria rediscovers the [[15,7,3]] quantum Hamming code without algebraic priors and generates new code families up to 100 qubits across seven objectives.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That Nash equilibria arising from strategic interactions among the seven competing objectives will systematically produce codes with the targeted properties even when no algebraic structure is supplied in advance.","pith_extraction_headline":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.15223/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"cf7cdf60849aa660d3f41d14ad5f49693fbd0272cace56a1b56db61bb6608a21"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.15223","created_at":"2026-05-28T01:04:31.702178+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.15223v4","created_at":"2026-05-28T01:04:31.702178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15223","created_at":"2026-05-28T01:04:31.702178+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQDJRXCAAZXT","created_at":"2026-05-28T01:04:31.702178+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQDJRXCAAZXTK7NP","created_at":"2026-05-28T01:04:31.702178+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQDJRXCA","created_at":"2026-05-28T01:04:31.702178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD","json":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD.json","graph_json":"https://pith.science/api/pith-number/QQDJRXCAAZXTK7NPTZO2AGD3TD/graph.json","events_json":"https://pith.science/api/pith-number/QQDJRXCAAZXTK7NPTZO2AGD3TD/events.json","paper":"https://pith.science/paper/QQDJRXCA"},"agent_actions":{"view_html":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD","download_json":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD.json","view_paper":"https://pith.science/paper/QQDJRXCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.15223&json=true","fetch_graph":"https://pith.science/api/pith-number/QQDJRXCAAZXTK7NPTZO2AGD3TD/graph.json","fetch_events":"https://pith.science/api/pith-number/QQDJRXCAAZXTK7NPTZO2AGD3TD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/action/storage_attestation","attest_author":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/action/author_attestation","sign_citation":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/action/citation_signature","submit_replication":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/action/replication_record"}},"created_at":"2026-05-28T01:04:31.702178+00:00","updated_at":"2026-05-28T01:04:31.702178+00:00"}