{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NJTOVY3J54RTUSYZNNCAO2MLOL","short_pith_number":"pith:NJTOVY3J","canonical_record":{"source":{"id":"2603.22532","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-23T19:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"21592a7ac3b88856c58396fa925bb203246764c6761b47b9e0805bb8beea23a7","abstract_canon_sha256":"c84316bf9c03b4eb13d5d79105425eaca0cd609d53e8b1b85e940e0b52103256"},"schema_version":"1.0"},"canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","source":{"kind":"arxiv","id":"2603.22532","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.22532","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2603.22532v2","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.22532","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"NJTOVY3J54RT","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"NJTOVY3J54RTUSYZ","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"NJTOVY3J","created_at":"2026-08-17T01:09:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NJTOVY3J54RTUSYZNNCAO2MLOL","target":"record","payload":{"canonical_record":{"source":{"id":"2603.22532","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-23T19:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"21592a7ac3b88856c58396fa925bb203246764c6761b47b9e0805bb8beea23a7","abstract_canon_sha256":"c84316bf9c03b4eb13d5d79105425eaca0cd609d53e8b1b85e940e0b52103256"},"schema_version":"1.0"},"canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-17T01:09:56.355090Z","signature_b64":"In9Q7t8JqNcHBL1uG799+OasLzuuSaiw/AnJkDzUUF+VzBf+0FBnVqjIvOvJJkq2RxvcJJeLTKnaPuh6cZi6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","last_reissued_at":"2026-08-17T01:09:56.352788Z","signature_status":"signed_v1","first_computed_at":"2026-08-17T01:09:56.352788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.22532","source_version":2,"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-17T01:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWHZxtk1NPryav+Y1vWuAqm6Yn87F1GzTm1YVtVvRqO07wgRvSoKKbIw6XPD8SedxHRO4gg8NsSXLOnZiO36DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T23:27:31.032161Z"},"content_sha256":"d1a883967a8b1296f4cfff4fc392526e89cee7669366f23c81e587eb08525ffb","schema_version":"1.0","event_id":"sha256:d1a883967a8b1296f4cfff4fc392526e89cee7669366f23c81e587eb08525ffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NJTOVY3J54RTUSYZNNCAO2MLOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance-Finding Algorithms for Quantum Codes and Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abraham Jacob, Mark Webster, Oscar Higgott","submitted_at":"2026-03-23T19:52:23Z","abstract_excerpt":"The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing the overhead required for fault-tolerant quantum computation, but calculating their distance is challenging with existing methods. We generally assess the performance of a quantum code under circuit level error models, and for such scenarios the circuit distance is an important consideration. Calculating circuit distance is in general more difficult than finding the distance of the corresponding code as the detector "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.22532","kind":"arxiv","version":2},"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/2603.22532/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-17T01:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2HxSozOY4eyRquH3qWAUWHiAud9wwf3Gat4B7po/R7e7RJDQdK6RgvFIUmKzXWJZEFd/3MIKOXIrNzHOXxKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T23:27:31.032794Z"},"content_sha256":"b8351c1ea64c8251c36cd43b0fc43eea1936687fd094733eb2820d25a68c6930","schema_version":"1.0","event_id":"sha256:b8351c1ea64c8251c36cd43b0fc43eea1936687fd094733eb2820d25a68c6930"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/bundle.json","state_url":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/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-19T23:27:31Z","links":{"resolver":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL","bundle":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/bundle.json","state":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NJTOVY3J54RTUSYZNNCAO2MLOL","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":"c84316bf9c03b4eb13d5d79105425eaca0cd609d53e8b1b85e940e0b52103256","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-23T19:52:23Z","title_canon_sha256":"21592a7ac3b88856c58396fa925bb203246764c6761b47b9e0805bb8beea23a7"},"schema_version":"1.0","source":{"id":"2603.22532","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.22532","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2603.22532v2","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.22532","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"NJTOVY3J54RT","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"NJTOVY3J54RTUSYZ","created_at":"2026-08-17T01:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"NJTOVY3J","created_at":"2026-08-17T01:09:56Z"}],"graph_snapshots":[{"event_id":"sha256:b8351c1ea64c8251c36cd43b0fc43eea1936687fd094733eb2820d25a68c6930","target":"graph","created_at":"2026-08-17T01:09:56Z","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/2603.22532/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing the overhead required for fault-tolerant quantum computation, but calculating their distance is challenging with existing methods. We generally assess the performance of a quantum code under circuit level error models, and for such scenarios the circuit distance is an important consideration. Calculating circuit distance is in general more difficult than finding the distance of the corresponding code as the detector ","authors_text":"Abraham Jacob, Mark Webster, Oscar Higgott","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.22532","kind":"arxiv","version":2},"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:d1a883967a8b1296f4cfff4fc392526e89cee7669366f23c81e587eb08525ffb","target":"record","created_at":"2026-08-17T01:09:56Z","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":"c84316bf9c03b4eb13d5d79105425eaca0cd609d53e8b1b85e940e0b52103256","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-23T19:52:23Z","title_canon_sha256":"21592a7ac3b88856c58396fa925bb203246764c6761b47b9e0805bb8beea23a7"},"schema_version":"1.0","source":{"id":"2603.22532","kind":"arxiv","version":2}},"canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","first_computed_at":"2026-08-17T01:09:56.352788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-17T01:09:56.352788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"In9Q7t8JqNcHBL1uG799+OasLzuuSaiw/AnJkDzUUF+VzBf+0FBnVqjIvOvJJkq2RxvcJJeLTKnaPuh6cZi6Bg==","signature_status":"signed_v1","signed_at":"2026-08-17T01:09:56.355090Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.22532","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a883967a8b1296f4cfff4fc392526e89cee7669366f23c81e587eb08525ffb","sha256:b8351c1ea64c8251c36cd43b0fc43eea1936687fd094733eb2820d25a68c6930"],"state_sha256":"476183dc2f9e1fa353b08fad89bc67a9ca4c2abf7de06840c5f954c0e9b33df0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxaM6wO+aLgumfyJ+81iLqF65T5yVlm+aHgLYBfGmO1vnsZSfn2cxRPk9pKDTYVCKTh+Mm/fPx4PUTWXLViuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T23:27:31.038621Z","bundle_sha256":"c9f2f97a02a0b53c8baa7ae11334bb0adab33c889ad024a95e61f43504be0b98"}}