{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KZHPXHFO7RPFJK7JVTIDYNUSHR","short_pith_number":"pith:KZHPXHFO","canonical_record":{"source":{"id":"2511.13657","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-17T18:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"9daa0dc6f379fcabf3a2a85e6cb23f94e7035a7d680dc43efcab62cac9953f51","abstract_canon_sha256":"7c22ea99a9061c3825e4a5664f4a09f943083c8208d148f204396fda1d06a598"},"schema_version":"1.0"},"canonical_sha256":"564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18","source":{"kind":"arxiv","id":"2511.13657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.13657","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2511.13657v1","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.13657","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"KZHPXHFO7RPF","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"KZHPXHFO7RPFJK7J","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"KZHPXHFO","created_at":"2026-05-26T01:03:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KZHPXHFO7RPFJK7JVTIDYNUSHR","target":"record","payload":{"canonical_record":{"source":{"id":"2511.13657","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-17T18:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"9daa0dc6f379fcabf3a2a85e6cb23f94e7035a7d680dc43efcab62cac9953f51","abstract_canon_sha256":"7c22ea99a9061c3825e4a5664f4a09f943083c8208d148f204396fda1d06a598"},"schema_version":"1.0"},"canonical_sha256":"564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:18.809097Z","signature_b64":"QNE9KDCc/mj7Mtbr3+qky9s+7xp6kKGOxpdsC2QrLjF9jDiBSZGiePlw+kazARrY973oMGUlyRzCGuTAFu5KAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18","last_reissued_at":"2026-05-26T01:03:18.808436Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:18.808436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.13657","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-05-26T01:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hZmghcx7oaYmwBNaabLml/KgSopE06qnxS+0lcklZRqD3NiyXsrCXjiS3iNhBxWtQLUNjUc0/YKdBejQ2PZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:17:50.367992Z"},"content_sha256":"fedab7f047689b368d8fc5d00b4528b389e53cafdcb1b5d3384aceddc505afec","schema_version":"1.0","event_id":"sha256:fedab7f047689b368d8fc5d00b4528b389e53cafdcb1b5d3384aceddc505afec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KZHPXHFO7RPFJK7JVTIDYNUSHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eneet Kaur, Kaushik P. Seshadreesan, Nitish Kumar Chandra","submitted_at":"2025-11-17T18:14:38Z","abstract_excerpt":"Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, wi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The three-type categorization captures the dominant practical approaches and that the idealized noise and operation models used for scaling remain representative of near-term hardware constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"602c1cd790a239b0f29adfcdf9e9299430a1c286c33f0167e8ca0acd20342fd8"},"source":{"id":"2511.13657","kind":"arxiv","version":1},"verdict":{"id":"ca43f5b6-7935-4f0c-aee1-e85d1366e809","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T21:48:47.051241Z","strongest_claim":"Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs.","one_line_summary":"Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The three-type categorization captures the dominant practical approaches and that the idealized noise and operation models used for scaling remain representative of near-term hardware constraints.","pith_extraction_headline":"Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.13657/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":37,"sample":[{"doi":"10.1038/nature23460","year":2017,"title":"Roads towards fault- tolerant universal quantum computation","work_id":"fec0e469-93ff-454d-af3f-709e06831efe","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Awesome quantum computing experiments: Benchmarking experimental progress towards fault-tolerant quantum computation,","work_id":"ef83e650-cf4f-40e9-87bc-12d10b92802b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Early fault-tolerant quantum computing,","work_id":"654d1907-71ec-4310-94f3-6eec7d34b9ae","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Distributed quantum computing: A survey,","work_id":"7109c2b8-56a0-49f8-8312-9dec4a011c49","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Review of distributed quantum computing: From single qpu to high performance quantum computing,","work_id":"f2caa36e-5944-42d0-894d-bd5811b03d5a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"3be82b6a60a18f129553b01481b11547ed5bdbb44bb07d24bdfc158e4650f2a5","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e25420868dbf6868f7c6b1882e1d942cb4e94a646bba1d0c183f91d2823b4e28"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"ca43f5b6-7935-4f0c-aee1-e85d1366e809"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+3zrNtyIOVYwAbNpKBlpN7Uu9L3IWXhJok/Sr6e1oxvseGfGHPF4WusDhfQTrB+8s4cA8Rz6IlrkmyB8++oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:17:50.369053Z"},"content_sha256":"6b877db0afa3dc0616a4896db51f765a3dbd67b195f711ca842c114543608d05","schema_version":"1.0","event_id":"sha256:6b877db0afa3dc0616a4896db51f765a3dbd67b195f711ca842c114543608d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR/bundle.json","state_url":"https://pith.science/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR/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-01T08:17:50Z","links":{"resolver":"https://pith.science/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR","bundle":"https://pith.science/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR/bundle.json","state":"https://pith.science/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZHPXHFO7RPFJK7JVTIDYNUSHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KZHPXHFO7RPFJK7JVTIDYNUSHR","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":"7c22ea99a9061c3825e4a5664f4a09f943083c8208d148f204396fda1d06a598","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-17T18:14:38Z","title_canon_sha256":"9daa0dc6f379fcabf3a2a85e6cb23f94e7035a7d680dc43efcab62cac9953f51"},"schema_version":"1.0","source":{"id":"2511.13657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.13657","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2511.13657v1","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.13657","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"KZHPXHFO7RPF","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"KZHPXHFO7RPFJK7J","created_at":"2026-05-26T01:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"KZHPXHFO","created_at":"2026-05-26T01:03:18Z"}],"graph_snapshots":[{"event_id":"sha256:6b877db0afa3dc0616a4896db51f765a3dbd67b195f711ca842c114543608d05","target":"graph","created_at":"2026-05-26T01:03:18Z","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":"Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The three-type categorization captures the dominant practical approaches and that the idealized noise and operation models used for scaling remain representative of near-term hardware constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance."}],"snapshot_sha256":"602c1cd790a239b0f29adfcdf9e9299430a1c286c33f0167e8ca0acd20342fd8"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e25420868dbf6868f7c6b1882e1d942cb4e94a646bba1d0c183f91d2823b4e28"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.13657/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, wi","authors_text":"Eneet Kaur, Kaushik P. Seshadreesan, Nitish Kumar Chandra","cross_cats":[],"headline":"Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-17T18:14:38Z","title":"Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads"},"references":{"count":37,"internal_anchors":2,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"10.1038/nature23460","is_internal_anchor":false,"ref_index":1,"title":"Roads towards fault- tolerant universal quantum computation","work_id":"fec0e469-93ff-454d-af3f-709e06831efe","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Awesome quantum computing experiments: Benchmarking experimental progress towards fault-tolerant quantum computation,","work_id":"ef83e650-cf4f-40e9-87bc-12d10b92802b","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Early fault-tolerant quantum computing,","work_id":"654d1907-71ec-4310-94f3-6eec7d34b9ae","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Distributed quantum computing: A survey,","work_id":"7109c2b8-56a0-49f8-8312-9dec4a011c49","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Review of distributed quantum computing: From single qpu to high performance quantum computing,","work_id":"f2caa36e-5944-42d0-894d-bd5811b03d5a","year":2025}],"snapshot_sha256":"3be82b6a60a18f129553b01481b11547ed5bdbb44bb07d24bdfc158e4650f2a5"},"source":{"id":"2511.13657","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-17T21:48:47.051241Z","id":"ca43f5b6-7935-4f0c-aee1-e85d1366e809","model_set":{"reader":"grok-4.3"},"one_line_summary":"Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance.","strongest_claim":"Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs.","weakest_assumption":"The three-type categorization captures the dominant practical approaches and that the idealized noise and operation models used for scaling remain representative of near-term hardware constraints."}},"verdict_id":"ca43f5b6-7935-4f0c-aee1-e85d1366e809"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fedab7f047689b368d8fc5d00b4528b389e53cafdcb1b5d3384aceddc505afec","target":"record","created_at":"2026-05-26T01:03:18Z","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":"7c22ea99a9061c3825e4a5664f4a09f943083c8208d148f204396fda1d06a598","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-17T18:14:38Z","title_canon_sha256":"9daa0dc6f379fcabf3a2a85e6cb23f94e7035a7d680dc43efcab62cac9953f51"},"schema_version":"1.0","source":{"id":"2511.13657","kind":"arxiv","version":1}},"canonical_sha256":"564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18","first_computed_at":"2026-05-26T01:03:18.808436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:18.808436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QNE9KDCc/mj7Mtbr3+qky9s+7xp6kKGOxpdsC2QrLjF9jDiBSZGiePlw+kazARrY973oMGUlyRzCGuTAFu5KAQ==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:18.809097Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.13657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fedab7f047689b368d8fc5d00b4528b389e53cafdcb1b5d3384aceddc505afec","sha256:6b877db0afa3dc0616a4896db51f765a3dbd67b195f711ca842c114543608d05"],"state_sha256":"c5b3e183b7f8dd3b63bef383a52fd48277cd6ecfa1e328fabafe0cf87d41cb31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WdnLtMUqyrm2N1rxNzuz3UxTo77qFy/vcy8AsgYyDx6vtf5q6FP4EH9zfSfeBeguR3p2trktv6sXmlsjuuJ9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:17:50.373243Z","bundle_sha256":"3c3c6de2f68476c8be5b5e038d258ae2c002c033a6493261034e01c9251c1cb6"}}