{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RG7U46EA2TUTSNROCJ3YA2T654","short_pith_number":"pith:RG7U46EA","schema_version":"1.0","canonical_sha256":"89bf4e7880d4e939362e1277806a7eef3f66e757fcca2270e4573a6454e7c9bc","source":{"kind":"arxiv","id":"2305.00708","version":1},"attestation_state":"computed","paper":{"title":"Routing Protocols for Quantum Networks: Overview and Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"quant-ph","authors_text":"Binayak Kar, Pankaj Kumar","submitted_at":"2023-05-01T08:15:55Z","abstract_excerpt":"Over the past 50 years, conventional network routing design has undergone substantial growth, evolving from small networks with static nodes to large systems connecting billions of devices. This progress has been achieved through the separation of concerns principle, which entails integrating network functionalities into a graph or random network design and employing specific network protocols to facilitate diverse communication capabilities. This paper aims to highlight the potential of designing routing techniques for quantum networks, which exhibit unique properties due to quantum mechanics"},"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":"2305.00708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-01T08:15:55Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"803a14d11fca1541951ae49b425a7648c9985f2ee2579645077641a9b76c87d8","abstract_canon_sha256":"5ac4872f3aa9d1510cb484cf55697bc599f25e879b3ab9ca702338491a7f9967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:44.257641Z","signature_b64":"SpJO5oLTm0SiASGeMlUENvOBl3h2eMZ6gI5q22DO2NJe6RfEvCDWrQTmaU931JMqzZCyGRdgFeoTKBNwZaLdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89bf4e7880d4e939362e1277806a7eef3f66e757fcca2270e4573a6454e7c9bc","last_reissued_at":"2026-07-05T06:05:44.257205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:44.257205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing Protocols for Quantum Networks: Overview and Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"quant-ph","authors_text":"Binayak Kar, Pankaj Kumar","submitted_at":"2023-05-01T08:15:55Z","abstract_excerpt":"Over the past 50 years, conventional network routing design has undergone substantial growth, evolving from small networks with static nodes to large systems connecting billions of devices. This progress has been achieved through the separation of concerns principle, which entails integrating network functionalities into a graph or random network design and employing specific network protocols to facilitate diverse communication capabilities. This paper aims to highlight the potential of designing routing techniques for quantum networks, which exhibit unique properties due to quantum mechanics"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00708","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/2305.00708/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":"2305.00708","created_at":"2026-07-05T06:05:44.257270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.00708v1","created_at":"2026-07-05T06:05:44.257270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00708","created_at":"2026-07-05T06:05:44.257270+00:00"},{"alias_kind":"pith_short_12","alias_value":"RG7U46EA2TUT","created_at":"2026-07-05T06:05:44.257270+00:00"},{"alias_kind":"pith_short_16","alias_value":"RG7U46EA2TUTSNRO","created_at":"2026-07-05T06:05:44.257270+00:00"},{"alias_kind":"pith_short_8","alias_value":"RG7U46EA","created_at":"2026-07-05T06:05:44.257270+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31347","citing_title":"Entanglement distribution protocols under imperfect fidelity and quantum memory conditions","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25132","citing_title":"Resource Management in Heterogeneous Quantum Repeater Networks","ref_index":231,"is_internal_anchor":false},{"citing_arxiv_id":"2501.03210","citing_title":"Simulation of entanglement based quantum networks for performance characterization","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654","json":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654.json","graph_json":"https://pith.science/api/pith-number/RG7U46EA2TUTSNROCJ3YA2T654/graph.json","events_json":"https://pith.science/api/pith-number/RG7U46EA2TUTSNROCJ3YA2T654/events.json","paper":"https://pith.science/paper/RG7U46EA"},"agent_actions":{"view_html":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654","download_json":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654.json","view_paper":"https://pith.science/paper/RG7U46EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.00708&json=true","fetch_graph":"https://pith.science/api/pith-number/RG7U46EA2TUTSNROCJ3YA2T654/graph.json","fetch_events":"https://pith.science/api/pith-number/RG7U46EA2TUTSNROCJ3YA2T654/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654/action/storage_attestation","attest_author":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654/action/author_attestation","sign_citation":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654/action/citation_signature","submit_replication":"https://pith.science/pith/RG7U46EA2TUTSNROCJ3YA2T654/action/replication_record"}},"created_at":"2026-07-05T06:05:44.257270+00:00","updated_at":"2026-07-05T06:05:44.257270+00:00"}