{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TV644WZDRT6MLZS6RBBE4HSR3F","short_pith_number":"pith:TV644WZD","canonical_record":{"source":{"id":"2608.02773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-03T18:13:57Z","cross_cats_sorted":[],"title_canon_sha256":"75ea6b0a844dc0c1a5a93556f79b1bf7d0a67c34e13701432e9042546fa60e5b","abstract_canon_sha256":"eabe4c43b7d0adc88dbbddb98c7585648f255d44c7aeb84448f9b2a5e8ee554a"},"schema_version":"1.0"},"canonical_sha256":"9d7dce5b238cfcc5e65e88424e1e51d9543e3f0b81be9ac94d24f9b851e7b72b","source":{"kind":"arxiv","id":"2608.02773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.02773","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"2608.02773v1","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02773","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"TV644WZDRT6M","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"pith_short_16","alias_value":"TV644WZDRT6MLZS6","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"pith_short_8","alias_value":"TV644WZD","created_at":"2026-08-05T00:39:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TV644WZDRT6MLZS6RBBE4HSR3F","target":"record","payload":{"canonical_record":{"source":{"id":"2608.02773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-03T18:13:57Z","cross_cats_sorted":[],"title_canon_sha256":"75ea6b0a844dc0c1a5a93556f79b1bf7d0a67c34e13701432e9042546fa60e5b","abstract_canon_sha256":"eabe4c43b7d0adc88dbbddb98c7585648f255d44c7aeb84448f9b2a5e8ee554a"},"schema_version":"1.0"},"canonical_sha256":"9d7dce5b238cfcc5e65e88424e1e51d9543e3f0b81be9ac94d24f9b851e7b72b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T00:39:58.534074Z","signature_b64":"oTejP7pRyXiFp1ARfGvCyQ3VJ1uZ+mbRu2grA3Bwnl3fXMHbqTUSlR09eIAGbV8TeZNW37fO8Ns856L+u2K8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7dce5b238cfcc5e65e88424e1e51d9543e3f0b81be9ac94d24f9b851e7b72b","last_reissued_at":"2026-08-05T00:39:58.531457Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T00:39:58.531457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.02773","source_version":1,"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-08-05T00:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0dxXY4BTfNKZrZQzXpWO3kA8mKE2vXD5GGTlWPYouHyry6FIFdXumaU2UiSmF7azyfZc01VWJpo3/r2HwosBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:15:48.551002Z"},"content_sha256":"f908e3ece2b12c45db1c10b4b19f8a1c7f80f7abeea777c3a8c0076b0575bd7d","schema_version":"1.0","event_id":"sha256:f908e3ece2b12c45db1c10b4b19f8a1c7f80f7abeea777c3a8c0076b0575bd7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TV644WZDRT6MLZS6RBBE4HSR3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum error correction at ultra-low overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dong-Ling Deng, Weikang Li, Zhide Lu","submitted_at":"2026-08-03T18:13:57Z","abstract_excerpt":"Suppressing errors is the central challenge for useful large-scale quantum computing. While quantum error correction promises a viable solution to this challenge, existing codes typically suffer from trade-offs among encoding efficiency, error threshold, and hardware feasibility. Here, we introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding $1/2$ while maintaining a pseudo-threshold exceeding $0.4\\%$ under the standard circuit-level noise model. Inspired by recent affine-permutation-based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02773","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.02773/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":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T00:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnLMy4cchoUfPnYLFPQQs5rJvlD4vZzIPQ6yJqKP9N1xFHFb+it7ULTet6f1W5YbDLmRTinIXdU7FK7fyA0jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:15:48.551564Z"},"content_sha256":"04ae945d56a548ba11f13e9d7db71eff0636e3a8d35d38de080e19e79446b49b","schema_version":"1.0","event_id":"sha256:04ae945d56a548ba11f13e9d7db71eff0636e3a8d35d38de080e19e79446b49b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV644WZDRT6MLZS6RBBE4HSR3F/bundle.json","state_url":"https://pith.science/pith/TV644WZDRT6MLZS6RBBE4HSR3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV644WZDRT6MLZS6RBBE4HSR3F/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-08-18T08:15:48Z","links":{"resolver":"https://pith.science/pith/TV644WZDRT6MLZS6RBBE4HSR3F","bundle":"https://pith.science/pith/TV644WZDRT6MLZS6RBBE4HSR3F/bundle.json","state":"https://pith.science/pith/TV644WZDRT6MLZS6RBBE4HSR3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV644WZDRT6MLZS6RBBE4HSR3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TV644WZDRT6MLZS6RBBE4HSR3F","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":"eabe4c43b7d0adc88dbbddb98c7585648f255d44c7aeb84448f9b2a5e8ee554a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-03T18:13:57Z","title_canon_sha256":"75ea6b0a844dc0c1a5a93556f79b1bf7d0a67c34e13701432e9042546fa60e5b"},"schema_version":"1.0","source":{"id":"2608.02773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.02773","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"2608.02773v1","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02773","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"TV644WZDRT6M","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"pith_short_16","alias_value":"TV644WZDRT6MLZS6","created_at":"2026-08-05T00:39:58Z"},{"alias_kind":"pith_short_8","alias_value":"TV644WZD","created_at":"2026-08-05T00:39:58Z"}],"graph_snapshots":[{"event_id":"sha256:04ae945d56a548ba11f13e9d7db71eff0636e3a8d35d38de080e19e79446b49b","target":"graph","created_at":"2026-08-05T00:39:58Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.02773/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppressing errors is the central challenge for useful large-scale quantum computing. While quantum error correction promises a viable solution to this challenge, existing codes typically suffer from trade-offs among encoding efficiency, error threshold, and hardware feasibility. Here, we introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding $1/2$ while maintaining a pseudo-threshold exceeding $0.4\\%$ under the standard circuit-level noise model. Inspired by recent affine-permutation-based","authors_text":"Dong-Ling Deng, Weikang Li, Zhide Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-03T18:13:57Z","title":"Quantum error correction at ultra-low overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02773","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f908e3ece2b12c45db1c10b4b19f8a1c7f80f7abeea777c3a8c0076b0575bd7d","target":"record","created_at":"2026-08-05T00:39:58Z","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":"eabe4c43b7d0adc88dbbddb98c7585648f255d44c7aeb84448f9b2a5e8ee554a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-03T18:13:57Z","title_canon_sha256":"75ea6b0a844dc0c1a5a93556f79b1bf7d0a67c34e13701432e9042546fa60e5b"},"schema_version":"1.0","source":{"id":"2608.02773","kind":"arxiv","version":1}},"canonical_sha256":"9d7dce5b238cfcc5e65e88424e1e51d9543e3f0b81be9ac94d24f9b851e7b72b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d7dce5b238cfcc5e65e88424e1e51d9543e3f0b81be9ac94d24f9b851e7b72b","first_computed_at":"2026-08-05T00:39:58.531457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T00:39:58.531457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oTejP7pRyXiFp1ARfGvCyQ3VJ1uZ+mbRu2grA3Bwnl3fXMHbqTUSlR09eIAGbV8TeZNW37fO8Ns856L+u2K8DA==","signature_status":"signed_v1","signed_at":"2026-08-05T00:39:58.534074Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.02773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f908e3ece2b12c45db1c10b4b19f8a1c7f80f7abeea777c3a8c0076b0575bd7d","sha256:04ae945d56a548ba11f13e9d7db71eff0636e3a8d35d38de080e19e79446b49b"],"state_sha256":"cbe5076d57fa2b2e45dd33aa897d57f6228f3e790f9ab7dfdda54fdc019b01e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWusPy81IdeR8QLusAX3QMnJ5tKbeGPdrZotXhvNSflbXlozb6jWVWaXNId8EhtX7/auapg7+uuxpiDE+7NtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:15:48.557824Z","bundle_sha256":"266f32c685e6b1554471da25a53bb2c2ae9db0bc2b4e27e4859c16dbcdf2522c"}}