{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QQDJRXCAAZXTK7NPTZO2AGD3TD","short_pith_number":"pith:QQDJRXCA","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"},"canonical_sha256":"840698dc40066f357daf9e5da0187b98d6f99e2d4411e94c526ea05b00a6c758","source":{"kind":"arxiv","id":"2510.15223","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.15223","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2510.15223v4","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15223","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"QQDJRXCAAZXT","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"QQDJRXCAAZXTK7NP","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"QQDJRXCA","created_at":"2026-05-28T01:04:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QQDJRXCAAZXTK7NPTZO2AGD3TD","target":"record","payload":{"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"},"canonical_sha256":"840698dc40066f357daf9e5da0187b98d6f99e2d4411e94c526ea05b00a6c758","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"},"source_kind":"arxiv","source_id":"2510.15223","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXOnPhuxPLwDzA+QNviQ6kXYne+RWhsKQI6PJuhZn6NpUYvBQDREbi6kVXZ+aPEXYGOZMacsEdmuLPv+lSZACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:34.615430Z"},"content_sha256":"b8396a19334e76b3e8662eecfde674800cba697a464ea08b21dacb81ac92839c","schema_version":"1.0","event_id":"sha256:b8396a19334e76b3e8662eecfde674800cba697a464ea08b21dacb81ac92839c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QQDJRXCAAZXTK7NPTZO2AGD3TD","target":"graph","payload":{"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"},"verdict_id":"bcc55852-a17d-4ae9-974f-556bd7dfb9aa"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zFGOm7bG4ten4Bw+oXClYuV0NMBEAdzTGGvy3LbY7U4mT/4GKIiF7MVuX3G2cot3uF5PdITGl1g+4amvWNkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:34.616226Z"},"content_sha256":"0e2f7e84d8f8cdbe4077b7c9d0d80343728bb06e2d66839b515634184b218d0c","schema_version":"1.0","event_id":"sha256:0e2f7e84d8f8cdbe4077b7c9d0d80343728bb06e2d66839b515634184b218d0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/bundle.json","state_url":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T01:33:34Z","links":{"resolver":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD","bundle":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/bundle.json","state":"https://pith.science/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQDJRXCAAZXTK7NPTZO2AGD3TD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QQDJRXCAAZXTK7NPTZO2AGD3TD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"58abdf51a08cdca15c4c16958904e4b9e8a4ebb742fd31f708a463157f80e308","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-17T01:11:32Z","title_canon_sha256":"82a09e98a7df2b248a52b73329c3fe9da236a1ad6496142bf1797fa1636c198d"},"schema_version":"1.0","source":{"id":"2510.15223","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.15223","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2510.15223v4","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15223","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"QQDJRXCAAZXT","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"QQDJRXCAAZXTK7NP","created_at":"2026-05-28T01:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"QQDJRXCA","created_at":"2026-05-28T01:04:31Z"}],"graph_snapshots":[{"event_id":"sha256:0e2f7e84d8f8cdbe4077b7c9d0d80343728bb06e2d66839b515634184b218d0c","target":"graph","created_at":"2026-05-28T01:04:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives."}],"snapshot_sha256":"1d73a1610e63331be3075e4d0bf339fa17edb607c1f792aa8a5f82e256473653"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"cf7cdf60849aa660d3f41d14ad5f49693fbd0272cace56a1b56db61bb6608a21"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.15223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Rub\\'en Dar\\'io Guerrero","cross_cats":[],"headline":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-17T01:11:32Z","title":"Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.15223","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-18T06:58:38.204987Z","id":"bcc55852-a17d-4ae9-974f-556bd7dfb9aa","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A game-theoretic framework rediscovers the optimal [[15,7,3]] quantum Hamming code by finding Nash equilibria among competing objectives.","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.","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."}},"verdict_id":"bcc55852-a17d-4ae9-974f-556bd7dfb9aa"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b8396a19334e76b3e8662eecfde674800cba697a464ea08b21dacb81ac92839c","target":"record","created_at":"2026-05-28T01:04:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"58abdf51a08cdca15c4c16958904e4b9e8a4ebb742fd31f708a463157f80e308","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-17T01:11:32Z","title_canon_sha256":"82a09e98a7df2b248a52b73329c3fe9da236a1ad6496142bf1797fa1636c198d"},"schema_version":"1.0","source":{"id":"2510.15223","kind":"arxiv","version":4}},"canonical_sha256":"840698dc40066f357daf9e5da0187b98d6f99e2d4411e94c526ea05b00a6c758","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"840698dc40066f357daf9e5da0187b98d6f99e2d4411e94c526ea05b00a6c758","first_computed_at":"2026-05-28T01:04:31.702103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:31.702103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HSDvDn/Pf3jV0jEKzJz4Ni1ULZs9w08VplLl2gn1jyp7V1heSo660bzIyS34qcwhO0VVzaL+yFSjTr5beqiXAg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:31.702686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.15223","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8396a19334e76b3e8662eecfde674800cba697a464ea08b21dacb81ac92839c","sha256:0e2f7e84d8f8cdbe4077b7c9d0d80343728bb06e2d66839b515634184b218d0c"],"state_sha256":"3173020098cbc7b78145e3bc082ecc006e39c0453c2e1d95ad94c5d6cb835834"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYBqQ9uiNzvjLftBAZHIvI2OZoLDS4x7Eg+HqxaGsT9EAXAno0mFVoeXlajqVhkf9AZ8b/Gu3E8xPQiZ3WnlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:33:34.620340Z","bundle_sha256":"0495bf57ffc76a5573e285b263cb817802ca18edeb3cee184d319347f39a32aa"}}