{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VCJQOORKXGUN3HDJ6O5OGMV3Q2","short_pith_number":"pith:VCJQOORK","schema_version":"1.0","canonical_sha256":"a893073a2ab9a8dd9c69f3bae332bb86ae0b5861ced065fe037ace555aa516eb","source":{"kind":"arxiv","id":"2408.01234","version":1},"attestation_state":"computed","paper":{"title":"Entanglement Routing in Quantum Networks: A Comprehensive Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI","quant-ph"],"primary_cat":"cs.ET","authors_text":"Abdella Battou, Amar Abane, Michael Cubeddu, Van Sy Mai","submitted_at":"2024-08-02T12:48:40Z","abstract_excerpt":"Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the"},"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":"2408.01234","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-08-02T12:48:40Z","cross_cats_sorted":["cs.NI","quant-ph"],"title_canon_sha256":"ba5371e15088274353993eed2d1d68cd8bc1d652f31fea15a3e8d508aca7ba94","abstract_canon_sha256":"2c611f41f888994d27e96cdb10583472a121d2c02506b30b86f7e06833e0c1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:29.084423Z","signature_b64":"R0h2T5kxQXe8sA2IIh39Lr6y+UiyvScYPQGnmEU42a35K3JozeeUbJq59zN0yTxajCT4sFACKOI/YsG4oUaABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a893073a2ab9a8dd9c69f3bae332bb86ae0b5861ced065fe037ace555aa516eb","last_reissued_at":"2026-07-05T08:51:29.083967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:29.083967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement Routing in Quantum Networks: A Comprehensive Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI","quant-ph"],"primary_cat":"cs.ET","authors_text":"Abdella Battou, Amar Abane, Michael Cubeddu, Van Sy Mai","submitted_at":"2024-08-02T12:48:40Z","abstract_excerpt":"Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.01234","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/2408.01234/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":"2408.01234","created_at":"2026-07-05T08:51:29.084024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.01234v1","created_at":"2026-07-05T08:51:29.084024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.01234","created_at":"2026-07-05T08:51:29.084024+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCJQOORKXGUN","created_at":"2026-07-05T08:51:29.084024+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCJQOORKXGUN3HDJ","created_at":"2026-07-05T08:51:29.084024+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCJQOORK","created_at":"2026-07-05T08:51:29.084024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18743","citing_title":"Enhancing the teleportation fidelity of a quantum network using purification","ref_index":95,"is_internal_anchor":false},{"citing_arxiv_id":"2501.03210","citing_title":"Simulation of entanglement based quantum networks for performance characterization","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2","json":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2.json","graph_json":"https://pith.science/api/pith-number/VCJQOORKXGUN3HDJ6O5OGMV3Q2/graph.json","events_json":"https://pith.science/api/pith-number/VCJQOORKXGUN3HDJ6O5OGMV3Q2/events.json","paper":"https://pith.science/paper/VCJQOORK"},"agent_actions":{"view_html":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2","download_json":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2.json","view_paper":"https://pith.science/paper/VCJQOORK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.01234&json=true","fetch_graph":"https://pith.science/api/pith-number/VCJQOORKXGUN3HDJ6O5OGMV3Q2/graph.json","fetch_events":"https://pith.science/api/pith-number/VCJQOORKXGUN3HDJ6O5OGMV3Q2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2/action/storage_attestation","attest_author":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2/action/author_attestation","sign_citation":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2/action/citation_signature","submit_replication":"https://pith.science/pith/VCJQOORKXGUN3HDJ6O5OGMV3Q2/action/replication_record"}},"created_at":"2026-07-05T08:51:29.084024+00:00","updated_at":"2026-07-05T08:51:29.084024+00:00"}