{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TPH5LA6JAVXJR4VZ2USS7KOAJD","short_pith_number":"pith:TPH5LA6J","schema_version":"1.0","canonical_sha256":"9bcfd583c9056e98f2b9d5252fa9c048f1857a6a89c9692bfec6a9530b8a6487","source":{"kind":"arxiv","id":"2407.14407","version":3},"attestation_state":"computed","paper":{"title":"Routing in Quantum Networks with End-to-End Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Andrea Passarella, Claudio Cicconetti, Marco Conti, Vinay Kumar","submitted_at":"2024-07-19T15:34:51Z","abstract_excerpt":"Given the diverse array of physical systems available for quantum computing and the absence of a well-defined quantum internet protocol stack, the design and optimisation of quantum networking protocols remain largely unexplored. To address this, we introduce an approach that facilitates the establishment of paths capable of delivering end-to-end fidelity above a specified threshold, without requiring detailed knowledge of the quantum network properties. In this study, we define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra shortest path al"},"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":"2407.14407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T15:34:51Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8c7e652e90424a939099c46b474fad53f5c279fb30a86fc682fdf15a51661aa4","abstract_canon_sha256":"1112cea094c6ee1a048d80156e70f311e71ed485df083304e585a120b3ac4b6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:08.655135Z","signature_b64":"26Ix6/3Aq6xZST1I3ukl9xx633OmFppMKNXlHTsEan77Wf9fARzL+IYG5kUITsaf/d7A5CoPVdrrr41kiFbmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bcfd583c9056e98f2b9d5252fa9c048f1857a6a89c9692bfec6a9530b8a6487","last_reissued_at":"2026-06-19T16:11:08.654701Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:08.654701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing in Quantum Networks with End-to-End Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Andrea Passarella, Claudio Cicconetti, Marco Conti, Vinay Kumar","submitted_at":"2024-07-19T15:34:51Z","abstract_excerpt":"Given the diverse array of physical systems available for quantum computing and the absence of a well-defined quantum internet protocol stack, the design and optimisation of quantum networking protocols remain largely unexplored. To address this, we introduce an approach that facilitates the establishment of paths capable of delivering end-to-end fidelity above a specified threshold, without requiring detailed knowledge of the quantum network properties. In this study, we define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra shortest path al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14407","kind":"arxiv","version":3},"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/2407.14407/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":"2407.14407","created_at":"2026-06-19T16:11:08.654760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14407v3","created_at":"2026-06-19T16:11:08.654760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14407","created_at":"2026-06-19T16:11:08.654760+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPH5LA6JAVXJ","created_at":"2026-06-19T16:11:08.654760+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPH5LA6JAVXJR4VZ","created_at":"2026-06-19T16:11:08.654760+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPH5LA6J","created_at":"2026-06-19T16:11:08.654760+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD","json":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD.json","graph_json":"https://pith.science/api/pith-number/TPH5LA6JAVXJR4VZ2USS7KOAJD/graph.json","events_json":"https://pith.science/api/pith-number/TPH5LA6JAVXJR4VZ2USS7KOAJD/events.json","paper":"https://pith.science/paper/TPH5LA6J"},"agent_actions":{"view_html":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD","download_json":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD.json","view_paper":"https://pith.science/paper/TPH5LA6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14407&json=true","fetch_graph":"https://pith.science/api/pith-number/TPH5LA6JAVXJR4VZ2USS7KOAJD/graph.json","fetch_events":"https://pith.science/api/pith-number/TPH5LA6JAVXJR4VZ2USS7KOAJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD/action/storage_attestation","attest_author":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD/action/author_attestation","sign_citation":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD/action/citation_signature","submit_replication":"https://pith.science/pith/TPH5LA6JAVXJR4VZ2USS7KOAJD/action/replication_record"}},"created_at":"2026-06-19T16:11:08.654760+00:00","updated_at":"2026-06-19T16:11:08.654760+00:00"}