{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M72QU66MLIZCDNXJGKRWYT7TSQ","short_pith_number":"pith:M72QU66M","schema_version":"1.0","canonical_sha256":"67f50a7bcc5a3221b6e932a36c4ff39409092b2ec8e6e5da5e388e1c852c9530","source":{"kind":"arxiv","id":"1610.05238","version":1},"attestation_state":"computed","paper":{"title":"Shortcuts to quantum network routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.NI","authors_text":"Eddie Schoute, Iordanis Kerenidis, Laura Mancinska, Stephanie Wehner, Tanvirul Islam","submitted_at":"2016-10-17T18:05:28Z","abstract_excerpt":"A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once.\n  Here, we present an abstraction of a quantum network that allows ideas from comput"},"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":"1610.05238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-17T18:05:28Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"1b80e9410e52d247903c3c669e6ce53ff569c920c82da189fa1e33780798805a","abstract_canon_sha256":"6b96782be8d84686fc01d5c2e08901f5a2847d1ccd83645098ca457c7b875f0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:05.747293Z","signature_b64":"Fxvsnou9A+x0cA9PtDa0Sgc1qOfTbYMxlUPg6dN1/ctSpy70uL5bMVdHhHNeNF9UvisUAkvn5vzT2ANNJF+zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67f50a7bcc5a3221b6e932a36c4ff39409092b2ec8e6e5da5e388e1c852c9530","last_reissued_at":"2026-05-18T01:02:05.746766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:05.746766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortcuts to quantum network routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.NI","authors_text":"Eddie Schoute, Iordanis Kerenidis, Laura Mancinska, Stephanie Wehner, Tanvirul Islam","submitted_at":"2016-10-17T18:05:28Z","abstract_excerpt":"A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once.\n  Here, we present an abstraction of a quantum network that allows ideas from comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05238","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":""},"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":"1610.05238","created_at":"2026-05-18T01:02:05.746845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05238v1","created_at":"2026-05-18T01:02:05.746845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05238","created_at":"2026-05-18T01:02:05.746845+00:00"},{"alias_kind":"pith_short_12","alias_value":"M72QU66MLIZC","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M72QU66MLIZCDNXJ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M72QU66M","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.11630","citing_title":"Distributed Routing in a Quantum Internet","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2511.22321","citing_title":"RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04767","citing_title":"Scheduling Entanglement Flows in Multi-channel Quantum Networks","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09306","citing_title":"SatQNet: Satellite-assisted Quantum Network Entanglement Routing Using Directed Line Graph Neural Networks","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ","json":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ.json","graph_json":"https://pith.science/api/pith-number/M72QU66MLIZCDNXJGKRWYT7TSQ/graph.json","events_json":"https://pith.science/api/pith-number/M72QU66MLIZCDNXJGKRWYT7TSQ/events.json","paper":"https://pith.science/paper/M72QU66M"},"agent_actions":{"view_html":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ","download_json":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ.json","view_paper":"https://pith.science/paper/M72QU66M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05238&json=true","fetch_graph":"https://pith.science/api/pith-number/M72QU66MLIZCDNXJGKRWYT7TSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/M72QU66MLIZCDNXJGKRWYT7TSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ/action/storage_attestation","attest_author":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ/action/author_attestation","sign_citation":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ/action/citation_signature","submit_replication":"https://pith.science/pith/M72QU66MLIZCDNXJGKRWYT7TSQ/action/replication_record"}},"created_at":"2026-05-18T01:02:05.746845+00:00","updated_at":"2026-05-18T01:02:05.746845+00:00"}