{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZMYOFPTL4F5CYPX7Z67WVUDNKI","short_pith_number":"pith:ZMYOFPTL","schema_version":"1.0","canonical_sha256":"cb30e2be6be17a2c3effcfbf6ad06d52156aaa93f539f80ef7fc2171886d1729","source":{"kind":"arxiv","id":"2111.07764","version":4},"attestation_state":"computed","paper":{"title":"Fidelity-Guarantee Entanglement Routing in Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Jian Li, Jun Lu, Kaiping Xue, Mingjun Wang, Nenghai Yu, Qibin Sun, Qidong Jia","submitted_at":"2021-11-15T14:07:22Z","abstract_excerpt":"Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum network"},"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":"2111.07764","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-15T14:07:22Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"f9d98faff7ff2040c818ae58b617ce18a9d3ce2f9b033dda3d053e7737147333","abstract_canon_sha256":"20e5f0e1d7032fd9ef32e12553e7719136f25ebe8b045632696a4d2b95286b58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:51.479467Z","signature_b64":"QHyvYYWPusGNtoTqw2/vubOXLcWdk/AGIJJyZJK8p17TCLrqjvgWYR/XCROOkYcyFQCx4drbgUSaOm7ItrpTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb30e2be6be17a2c3effcfbf6ad06d52156aaa93f539f80ef7fc2171886d1729","last_reissued_at":"2026-07-05T04:33:51.478934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:51.478934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fidelity-Guarantee Entanglement Routing in Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Jian Li, Jun Lu, Kaiping Xue, Mingjun Wang, Nenghai Yu, Qibin Sun, Qidong Jia","submitted_at":"2021-11-15T14:07:22Z","abstract_excerpt":"Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.07764","kind":"arxiv","version":4},"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/2111.07764/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":"2111.07764","created_at":"2026-07-05T04:33:51.479003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.07764v4","created_at":"2026-07-05T04:33:51.479003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07764","created_at":"2026-07-05T04:33:51.479003+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMYOFPTL4F5C","created_at":"2026-07-05T04:33:51.479003+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMYOFPTL4F5CYPX7","created_at":"2026-07-05T04:33:51.479003+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMYOFPTL","created_at":"2026-07-05T04:33:51.479003+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18846","citing_title":"Quality of Service in aggregated quantum networks","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI","json":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI.json","graph_json":"https://pith.science/api/pith-number/ZMYOFPTL4F5CYPX7Z67WVUDNKI/graph.json","events_json":"https://pith.science/api/pith-number/ZMYOFPTL4F5CYPX7Z67WVUDNKI/events.json","paper":"https://pith.science/paper/ZMYOFPTL"},"agent_actions":{"view_html":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI","download_json":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI.json","view_paper":"https://pith.science/paper/ZMYOFPTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.07764&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMYOFPTL4F5CYPX7Z67WVUDNKI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMYOFPTL4F5CYPX7Z67WVUDNKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI/action/storage_attestation","attest_author":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI/action/author_attestation","sign_citation":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI/action/citation_signature","submit_replication":"https://pith.science/pith/ZMYOFPTL4F5CYPX7Z67WVUDNKI/action/replication_record"}},"created_at":"2026-07-05T04:33:51.479003+00:00","updated_at":"2026-07-05T04:33:51.479003+00:00"}