{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ETNO7UJF5222MK7PAMOA6W5V4X","short_pith_number":"pith:ETNO7UJF","canonical_record":{"source":{"id":"2606.18035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-16T15:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"2f5307123684dc6aa29bf7a8fffaf44ca2fbc2f393efa63233c6326fe9a985af","abstract_canon_sha256":"9cf187ee594c61bb28c90745d002abdda71d25ee6a65dbbb7c3b34c055e3fb85"},"schema_version":"1.0"},"canonical_sha256":"24daefd125eeb5a62bef031c0f5bb5e5e8d714bcddb70cc4545ba325c2b7d272","source":{"kind":"arxiv","id":"2606.18035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18035","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18035v1","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18035","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"ETNO7UJF5222","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"ETNO7UJF5222MK7P","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"ETNO7UJF","created_at":"2026-06-19T16:10:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ETNO7UJF5222MK7PAMOA6W5V4X","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-16T15:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"2f5307123684dc6aa29bf7a8fffaf44ca2fbc2f393efa63233c6326fe9a985af","abstract_canon_sha256":"9cf187ee594c61bb28c90745d002abdda71d25ee6a65dbbb7c3b34c055e3fb85"},"schema_version":"1.0"},"canonical_sha256":"24daefd125eeb5a62bef031c0f5bb5e5e8d714bcddb70cc4545ba325c2b7d272","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:46.481548Z","signature_b64":"6mlCLOju2cpsWmeoVvvEZ64A4H+0WL6qulCg64C4YbjFAEavGH+cr8HrtDfDvVd0svMHcYVV1Cp6DDwb0RPaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24daefd125eeb5a62bef031c0f5bb5e5e8d714bcddb70cc4545ba325c2b7d272","last_reissued_at":"2026-06-19T16:10:46.481190Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:46.481190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18035","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-19T16:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WlAU5Rw6v9zRvSP0EyPALcDWaLJD2lWNQeKpSG290At4jnOCw5Ptu0wIgOrM09nyKzKl5gDiY3yH2V1kCpPWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:33:20.888116Z"},"content_sha256":"2794774a81c92fd13c8c429c19c62557cb4ee69a3a62a10325a4db17a0f57923","schema_version":"1.0","event_id":"sha256:2794774a81c92fd13c8c429c19c62557cb4ee69a3a62a10325a4db17a0f57923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ETNO7UJF5222MK7PAMOA6W5V4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximately Decoding the Colour Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mark Walters","submitted_at":"2026-06-16T15:10:22Z","abstract_excerpt":"Recently we showed that minimum weight decoding in the (6.6.6 planar) colour code is NP-hard. However, it remained an open question as to whether it was possible to approximate the minimum weight decoding arbitrarily closely in polynomial time. In this paper we prove that it is possible: for any $\\varepsilon>0$ there is an polynomial time algorithm that, given a syndrome, can find an error-set generating that syndrome whose weight is at most $1+\\varepsilon$ times the weight of the minimum weight decoding. As a consequence we see that, for any $\\varepsilon>0$, there is a polynomial time algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18035","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.18035/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-19T16:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yheHs8FKMhFnoe1pZSiF1csetF9ovQuaV9E/RyQYjaaSoYuvhCHod/gGNEKrHu7x9qkmG1MF/E7LoS7l6xHLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:33:20.888592Z"},"content_sha256":"0c81cdaa93917a5ff56adfdfa14077f48632a218e9b1ce804a1123ac1542de28","schema_version":"1.0","event_id":"sha256:0c81cdaa93917a5ff56adfdfa14077f48632a218e9b1ce804a1123ac1542de28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETNO7UJF5222MK7PAMOA6W5V4X/bundle.json","state_url":"https://pith.science/pith/ETNO7UJF5222MK7PAMOA6W5V4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETNO7UJF5222MK7PAMOA6W5V4X/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-03T16:33:20Z","links":{"resolver":"https://pith.science/pith/ETNO7UJF5222MK7PAMOA6W5V4X","bundle":"https://pith.science/pith/ETNO7UJF5222MK7PAMOA6W5V4X/bundle.json","state":"https://pith.science/pith/ETNO7UJF5222MK7PAMOA6W5V4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETNO7UJF5222MK7PAMOA6W5V4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ETNO7UJF5222MK7PAMOA6W5V4X","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":"9cf187ee594c61bb28c90745d002abdda71d25ee6a65dbbb7c3b34c055e3fb85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-16T15:10:22Z","title_canon_sha256":"2f5307123684dc6aa29bf7a8fffaf44ca2fbc2f393efa63233c6326fe9a985af"},"schema_version":"1.0","source":{"id":"2606.18035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18035","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18035v1","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18035","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"ETNO7UJF5222","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"ETNO7UJF5222MK7P","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"ETNO7UJF","created_at":"2026-06-19T16:10:46Z"}],"graph_snapshots":[{"event_id":"sha256:0c81cdaa93917a5ff56adfdfa14077f48632a218e9b1ce804a1123ac1542de28","target":"graph","created_at":"2026-06-19T16:10:46Z","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.18035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently we showed that minimum weight decoding in the (6.6.6 planar) colour code is NP-hard. However, it remained an open question as to whether it was possible to approximate the minimum weight decoding arbitrarily closely in polynomial time. In this paper we prove that it is possible: for any $\\varepsilon>0$ there is an polynomial time algorithm that, given a syndrome, can find an error-set generating that syndrome whose weight is at most $1+\\varepsilon$ times the weight of the minimum weight decoding. As a consequence we see that, for any $\\varepsilon>0$, there is a polynomial time algorit","authors_text":"Mark Walters","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-16T15:10:22Z","title":"Approximately Decoding the Colour Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18035","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:2794774a81c92fd13c8c429c19c62557cb4ee69a3a62a10325a4db17a0f57923","target":"record","created_at":"2026-06-19T16:10:46Z","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":"9cf187ee594c61bb28c90745d002abdda71d25ee6a65dbbb7c3b34c055e3fb85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-16T15:10:22Z","title_canon_sha256":"2f5307123684dc6aa29bf7a8fffaf44ca2fbc2f393efa63233c6326fe9a985af"},"schema_version":"1.0","source":{"id":"2606.18035","kind":"arxiv","version":1}},"canonical_sha256":"24daefd125eeb5a62bef031c0f5bb5e5e8d714bcddb70cc4545ba325c2b7d272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24daefd125eeb5a62bef031c0f5bb5e5e8d714bcddb70cc4545ba325c2b7d272","first_computed_at":"2026-06-19T16:10:46.481190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:46.481190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6mlCLOju2cpsWmeoVvvEZ64A4H+0WL6qulCg64C4YbjFAEavGH+cr8HrtDfDvVd0svMHcYVV1Cp6DDwb0RPaCw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:46.481548Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2794774a81c92fd13c8c429c19c62557cb4ee69a3a62a10325a4db17a0f57923","sha256:0c81cdaa93917a5ff56adfdfa14077f48632a218e9b1ce804a1123ac1542de28"],"state_sha256":"10bcede65ddc0a44db5967048c60ab22c6abd5d93058a1e902ed5c0dfd131441"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJPCmekuh57Op9RcHkhOK+RMhkjWd25itme+H8j2VuiDLu1fIaVGc7RXh7iXGP5wIW9ajG7iSmb1TxNovuBgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:33:20.891632Z","bundle_sha256":"cb4a5fe5078f293224c3daaddf86e0b4950f83117a21d127f922ba06993fb9d5"}}