{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KPBRMRK22YD7JH4KFMQF655VAO","short_pith_number":"pith:KPBRMRK2","canonical_record":{"source":{"id":"2606.10399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-09T04:18:13Z","cross_cats_sorted":[],"title_canon_sha256":"27a602b1c9fc211ffe165c70282982f92cdbfda6fd3cd23e73deb4cfc657bc9c","abstract_canon_sha256":"406b2699929db346e51e02f228271eade322057f83e91a8e87f1811406cbd265"},"schema_version":"1.0"},"canonical_sha256":"53c316455ad607f49f8a2b205f77b503930b7f7b675126ac0558bcb7d53ff861","source":{"kind":"arxiv","id":"2606.10399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10399","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10399v1","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10399","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"KPBRMRK22YD7","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"pith_short_16","alias_value":"KPBRMRK22YD7JH4K","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"pith_short_8","alias_value":"KPBRMRK2","created_at":"2026-06-10T01:10:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KPBRMRK22YD7JH4KFMQF655VAO","target":"record","payload":{"canonical_record":{"source":{"id":"2606.10399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-09T04:18:13Z","cross_cats_sorted":[],"title_canon_sha256":"27a602b1c9fc211ffe165c70282982f92cdbfda6fd3cd23e73deb4cfc657bc9c","abstract_canon_sha256":"406b2699929db346e51e02f228271eade322057f83e91a8e87f1811406cbd265"},"schema_version":"1.0"},"canonical_sha256":"53c316455ad607f49f8a2b205f77b503930b7f7b675126ac0558bcb7d53ff861","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:16.016281Z","signature_b64":"CPJg+UHqRAM1An9BmHbJBYy5kHaxJxPeeJNOcZrPDpMeTza9cU8q7otNDDaPtUB0YAJvaDbBuR5vhjY5jtTMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c316455ad607f49f8a2b205f77b503930b7f7b675126ac0558bcb7d53ff861","last_reissued_at":"2026-06-10T01:10:16.015384Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:16.015384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.10399","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-06-10T01:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hqM+chGSq/V5WeJcJlAPIuneXtzktBtViwlEte6vr3aN0nZGCDSNQEUjJE5/ErAO0piqtKkR3ovdqiL0DbnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T01:00:05.751671Z"},"content_sha256":"38c5397992562a0406b1fa0c3f4c90c72a7e38c913a84edba5807e4bb6399994","schema_version":"1.0","event_id":"sha256:38c5397992562a0406b1fa0c3f4c90c72a7e38c913a84edba5807e4bb6399994"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KPBRMRK22YD7JH4KFMQF655VAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-Case and Smoothed Near-Optimality for Color-Code Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Gibney, Jackson Huffstutler","submitted_at":"2026-06-09T04:18:13Z","abstract_excerpt":"Minimum-weight decoding for two-dimensional color codes is NP-hard (Walters and Turner 2026), motivating the search for approximation guarantees beyond worst-case exact decoding. We study a block-based decoder for triangular color-code lattices. The decoder satisfies the deterministic additive guarantee \\(\\lvert E_{\\mathrm{alg}}\\rvert \\leq \\operatorname{OPT}(S)+O(n/\\tau)\\), where \\(n\\) is the number of vertices and \\(\\tau\\) is the wall spacing. We show that this additive guarantee becomes a near-optimal multiplicative guarantee under natural noise models. For constant-rate i.i.d. face noise an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10399","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/2606.10399/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-06-10T01:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGqUA06wAApVYzpBO85GHPBuQNLv9FL/a0XTIiOWi+nHKvYlJR1v1qga1x+rKo8DGm81sI5xQWorhr5O2V99BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T01:00:05.752287Z"},"content_sha256":"f939ea280ad4d0d1c9894a2950037571ac6895f24dabe078db09f17b47195576","schema_version":"1.0","event_id":"sha256:f939ea280ad4d0d1c9894a2950037571ac6895f24dabe078db09f17b47195576"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPBRMRK22YD7JH4KFMQF655VAO/bundle.json","state_url":"https://pith.science/pith/KPBRMRK22YD7JH4KFMQF655VAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPBRMRK22YD7JH4KFMQF655VAO/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-30T01:00:05Z","links":{"resolver":"https://pith.science/pith/KPBRMRK22YD7JH4KFMQF655VAO","bundle":"https://pith.science/pith/KPBRMRK22YD7JH4KFMQF655VAO/bundle.json","state":"https://pith.science/pith/KPBRMRK22YD7JH4KFMQF655VAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPBRMRK22YD7JH4KFMQF655VAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KPBRMRK22YD7JH4KFMQF655VAO","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":"406b2699929db346e51e02f228271eade322057f83e91a8e87f1811406cbd265","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-09T04:18:13Z","title_canon_sha256":"27a602b1c9fc211ffe165c70282982f92cdbfda6fd3cd23e73deb4cfc657bc9c"},"schema_version":"1.0","source":{"id":"2606.10399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10399","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10399v1","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10399","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"KPBRMRK22YD7","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"pith_short_16","alias_value":"KPBRMRK22YD7JH4K","created_at":"2026-06-10T01:10:16Z"},{"alias_kind":"pith_short_8","alias_value":"KPBRMRK2","created_at":"2026-06-10T01:10:16Z"}],"graph_snapshots":[{"event_id":"sha256:f939ea280ad4d0d1c9894a2950037571ac6895f24dabe078db09f17b47195576","target":"graph","created_at":"2026-06-10T01:10:16Z","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/2606.10399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimum-weight decoding for two-dimensional color codes is NP-hard (Walters and Turner 2026), motivating the search for approximation guarantees beyond worst-case exact decoding. We study a block-based decoder for triangular color-code lattices. The decoder satisfies the deterministic additive guarantee \\(\\lvert E_{\\mathrm{alg}}\\rvert \\leq \\operatorname{OPT}(S)+O(n/\\tau)\\), where \\(n\\) is the number of vertices and \\(\\tau\\) is the wall spacing. We show that this additive guarantee becomes a near-optimal multiplicative guarantee under natural noise models. For constant-rate i.i.d. face noise an","authors_text":"Daniel Gibney, Jackson Huffstutler","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-09T04:18:13Z","title":"Average-Case and Smoothed Near-Optimality for Color-Code Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10399","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:38c5397992562a0406b1fa0c3f4c90c72a7e38c913a84edba5807e4bb6399994","target":"record","created_at":"2026-06-10T01:10:16Z","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":"406b2699929db346e51e02f228271eade322057f83e91a8e87f1811406cbd265","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-09T04:18:13Z","title_canon_sha256":"27a602b1c9fc211ffe165c70282982f92cdbfda6fd3cd23e73deb4cfc657bc9c"},"schema_version":"1.0","source":{"id":"2606.10399","kind":"arxiv","version":1}},"canonical_sha256":"53c316455ad607f49f8a2b205f77b503930b7f7b675126ac0558bcb7d53ff861","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53c316455ad607f49f8a2b205f77b503930b7f7b675126ac0558bcb7d53ff861","first_computed_at":"2026-06-10T01:10:16.015384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:16.015384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CPJg+UHqRAM1An9BmHbJBYy5kHaxJxPeeJNOcZrPDpMeTza9cU8q7otNDDaPtUB0YAJvaDbBuR5vhjY5jtTMCA==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:16.016281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38c5397992562a0406b1fa0c3f4c90c72a7e38c913a84edba5807e4bb6399994","sha256:f939ea280ad4d0d1c9894a2950037571ac6895f24dabe078db09f17b47195576"],"state_sha256":"4a5ea4b258f7b67d49700f14e7b4fa30ec929547e283e5ecd84a370d27285670"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"507iaCHHroCaOpXWRrMzwS093SfJQHRFbYll0AsZCrsb9JjOrKk7upkstks4yqERaVjBEDfSV//AKQTaJu8UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T01:00:05.755878Z","bundle_sha256":"49b9755a3f38af847484e5dc919e04dc0750c1546b4e0139d5a96cb6d2e1a8be"}}