{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:75WITCAY7N4BER4U72Q4EDAKXS","short_pith_number":"pith:75WITCAY","schema_version":"1.0","canonical_sha256":"ff6c898818fb78124794fea1c20c0abc8e0f55f8ae50dc32fe06624542917132","source":{"kind":"arxiv","id":"1907.11630","version":1},"attestation_state":"computed","paper":{"title":"Distributed Routing in a Quantum Internet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Axel Dahlberg, Filip Rozpedek, Kaushik Chakraborty, Stephanie Wehner","submitted_at":"2019-07-26T15:30:49Z","abstract_excerpt":"We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in which entanglement between a subset of the nodes is produced continuously in the background. This can in principle allows the rapid creation of entanglement between more distant nodes using the already pre-generated entanglement pairs in the network. The second is an on-demand model, where entanglement production does not commence before a request is made. Our"},"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":"1907.11630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-26T15:30:49Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"33b802d324f4739f74b98c9319eec08faabf2f5760bcc95573b577a068bb6aa4","abstract_canon_sha256":"bd4fb3b7be7c36a6506d07293a32b558aeb714de1f67365526636ed43ee0d6bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:28.462839Z","signature_b64":"+40WRhe4ymyhQq8UeMgNQoryDpi1tFW08Bt71ktspK/zWNTCAdKT+2dljdKI+WuAKrlKLm4UoUX009eXWhIOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff6c898818fb78124794fea1c20c0abc8e0f55f8ae50dc32fe06624542917132","last_reissued_at":"2026-05-17T23:39:28.462148Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:28.462148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Routing in a Quantum Internet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Axel Dahlberg, Filip Rozpedek, Kaushik Chakraborty, Stephanie Wehner","submitted_at":"2019-07-26T15:30:49Z","abstract_excerpt":"We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in which entanglement between a subset of the nodes is produced continuously in the background. This can in principle allows the rapid creation of entanglement between more distant nodes using the already pre-generated entanglement pairs in the network. The second is an on-demand model, where entanglement production does not commence before a request is made. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11630","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":"1907.11630","created_at":"2026-05-17T23:39:28.462242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11630v1","created_at":"2026-05-17T23:39:28.462242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11630","created_at":"2026-05-17T23:39:28.462242+00:00"},{"alias_kind":"pith_short_12","alias_value":"75WITCAY7N4B","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"75WITCAY7N4BER4U","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"75WITCAY","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.22321","citing_title":"RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04767","citing_title":"Scheduling Entanglement Flows in Multi-channel Quantum Networks","ref_index":9,"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":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS","json":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS.json","graph_json":"https://pith.science/api/pith-number/75WITCAY7N4BER4U72Q4EDAKXS/graph.json","events_json":"https://pith.science/api/pith-number/75WITCAY7N4BER4U72Q4EDAKXS/events.json","paper":"https://pith.science/paper/75WITCAY"},"agent_actions":{"view_html":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS","download_json":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS.json","view_paper":"https://pith.science/paper/75WITCAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11630&json=true","fetch_graph":"https://pith.science/api/pith-number/75WITCAY7N4BER4U72Q4EDAKXS/graph.json","fetch_events":"https://pith.science/api/pith-number/75WITCAY7N4BER4U72Q4EDAKXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS/action/storage_attestation","attest_author":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS/action/author_attestation","sign_citation":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS/action/citation_signature","submit_replication":"https://pith.science/pith/75WITCAY7N4BER4U72Q4EDAKXS/action/replication_record"}},"created_at":"2026-05-17T23:39:28.462242+00:00","updated_at":"2026-05-17T23:39:28.462242+00:00"}