{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5BY24DRHDPM7DDPA3YCTEDVTDV","short_pith_number":"pith:5BY24DRH","schema_version":"1.0","canonical_sha256":"e871ae0e271bd9f18de0de05320eb31d64ffe49eee44be20fd22eb16d57c8d85","source":{"kind":"arxiv","id":"2011.11644","version":1},"attestation_state":"computed","paper":{"title":"Purification and Entanglement Routing on Quantum Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Sanchez de la Cerda, Michelle Victora, Prineha Narang, Stefan Krastanov, Steven Willis","submitted_at":"2020-11-23T19:00:01Z","abstract_excerpt":"We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constrai"},"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":"2011.11644","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-11-23T19:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"cf31e1bf61f7220760d9d8a4b00b4baa94cabd68b6dd7876fae3017c2d767451","abstract_canon_sha256":"8dd0a47249201506e5efe45d40ce267734de730cc1d71be8e04d277f2da9434c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:03.698963Z","signature_b64":"Is8vxgnhMfS97jawgf4s3s8092yl1QObXOHeh7gmcaDUnYOsct7ZcJIGlF3Tu+Dpi5ARunu14pyaIrlmtmhkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e871ae0e271bd9f18de0de05320eb31d64ffe49eee44be20fd22eb16d57c8d85","last_reissued_at":"2026-07-05T01:54:03.698544Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:03.698544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Purification and Entanglement Routing on Quantum Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Sanchez de la Cerda, Michelle Victora, Prineha Narang, Stefan Krastanov, Steven Willis","submitted_at":"2020-11-23T19:00:01Z","abstract_excerpt":"We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.11644","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/2011.11644/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":"2011.11644","created_at":"2026-07-05T01:54:03.698610+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.11644v1","created_at":"2026-07-05T01:54:03.698610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11644","created_at":"2026-07-05T01:54:03.698610+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BY24DRHDPM7","created_at":"2026-07-05T01:54:03.698610+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BY24DRHDPM7DDPA","created_at":"2026-07-05T01:54:03.698610+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BY24DRH","created_at":"2026-07-05T01:54:03.698610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22316","citing_title":"Making Quantum Networks Work: Routing, Calibration, and Programmable Quantum Repeaters","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV","json":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV.json","graph_json":"https://pith.science/api/pith-number/5BY24DRHDPM7DDPA3YCTEDVTDV/graph.json","events_json":"https://pith.science/api/pith-number/5BY24DRHDPM7DDPA3YCTEDVTDV/events.json","paper":"https://pith.science/paper/5BY24DRH"},"agent_actions":{"view_html":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV","download_json":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV.json","view_paper":"https://pith.science/paper/5BY24DRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.11644&json=true","fetch_graph":"https://pith.science/api/pith-number/5BY24DRHDPM7DDPA3YCTEDVTDV/graph.json","fetch_events":"https://pith.science/api/pith-number/5BY24DRHDPM7DDPA3YCTEDVTDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV/action/storage_attestation","attest_author":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV/action/author_attestation","sign_citation":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV/action/citation_signature","submit_replication":"https://pith.science/pith/5BY24DRHDPM7DDPA3YCTEDVTDV/action/replication_record"}},"created_at":"2026-07-05T01:54:03.698610+00:00","updated_at":"2026-07-05T01:54:03.698610+00:00"}