{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7EQWIZ3OCUG6L545EYRBG5RIJE","short_pith_number":"pith:7EQWIZ3O","schema_version":"1.0","canonical_sha256":"f92164676e150de5f79d2622137628493fd0b795a801e20cabeed966b2d08091","source":{"kind":"arxiv","id":"2405.02406","version":2},"attestation_state":"computed","paper":{"title":"Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Don Towsley, Hassan Shapourian, Shahrooz Pouryousef","submitted_at":"2024-05-03T18:04:11Z","abstract_excerpt":"The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.02406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-03T18:04:11Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"79248e9cd694dbdcf357c7a874c2fc51c2d9954f81b384bf976bace7d9c971d9","abstract_canon_sha256":"6a367059b1d6f245515d71602416cd26b1bb7e05da962fc5457bcf2876512e45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:24.194154Z","signature_b64":"t+5hlhI+sBumMvLpL84rt2T3K7Ye2n8rEo2YXWUO6IMYAZ0DFOdKlkAKgrQZDcIJOVnNXow3Ep0Ly/YzFt1aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f92164676e150de5f79d2622137628493fd0b795a801e20cabeed966b2d08091","last_reissued_at":"2026-07-05T08:26:24.193646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:24.193646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Don Towsley, Hassan Shapourian, Shahrooz Pouryousef","submitted_at":"2024-05-03T18:04:11Z","abstract_excerpt":"The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02406","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/2405.02406/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.02406","created_at":"2026-07-05T08:26:24.193696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.02406v2","created_at":"2026-07-05T08:26:24.193696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02406","created_at":"2026-07-05T08:26:24.193696+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EQWIZ3OCUG6","created_at":"2026-07-05T08:26:24.193696+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EQWIZ3OCUG6L545","created_at":"2026-07-05T08:26:24.193696+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EQWIZ3O","created_at":"2026-07-05T08:26:24.193696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31493","citing_title":"An efficient Progressive Swapping to the Middle distribution protocol adapted to imperfect quantum memories in quantum networks","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE","json":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE.json","graph_json":"https://pith.science/api/pith-number/7EQWIZ3OCUG6L545EYRBG5RIJE/graph.json","events_json":"https://pith.science/api/pith-number/7EQWIZ3OCUG6L545EYRBG5RIJE/events.json","paper":"https://pith.science/paper/7EQWIZ3O"},"agent_actions":{"view_html":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE","download_json":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE.json","view_paper":"https://pith.science/paper/7EQWIZ3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.02406&json=true","fetch_graph":"https://pith.science/api/pith-number/7EQWIZ3OCUG6L545EYRBG5RIJE/graph.json","fetch_events":"https://pith.science/api/pith-number/7EQWIZ3OCUG6L545EYRBG5RIJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE/action/storage_attestation","attest_author":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE/action/author_attestation","sign_citation":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE/action/citation_signature","submit_replication":"https://pith.science/pith/7EQWIZ3OCUG6L545EYRBG5RIJE/action/replication_record"}},"created_at":"2026-07-05T08:26:24.193696+00:00","updated_at":"2026-07-05T08:26:24.193696+00:00"}