{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CDRX4BFT3B3WEVTIHBJRF7EZOT","short_pith_number":"pith:CDRX4BFT","schema_version":"1.0","canonical_sha256":"10e37e04b3d877625668385312fc9974ec515262d49aa434fb0edeb840590c0b","source":{"kind":"arxiv","id":"2509.10338","version":1},"attestation_state":"computed","paper":{"title":"Trusted Repeater Placement in QKD-enabled Optical Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arup Kumar Marik, Basabdatta Palit, Sadananda Behera","submitted_at":"2025-09-12T15:19:44Z","abstract_excerpt":"Quantum Key Distribution (QKD) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using "},"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":"2509.10338","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-09-12T15:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"83cd8039db78def268b555446acdc7812fbcfd56b7546470ac46d7a22db523b9","abstract_canon_sha256":"7d40c389cb0dfac97c22251da57fc77b8626f8e2082f6e47626b12484a1469f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:07.589988Z","signature_b64":"Gn7uTrlYBU3u4mlsbRsTFPb2p1gOQVsis14xytVVljMXWkUUWtJZcgNhIVuJ5aTmMPSU9P9IsBUnjB/DzpBpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10e37e04b3d877625668385312fc9974ec515262d49aa434fb0edeb840590c0b","last_reissued_at":"2026-07-05T12:11:07.589258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:07.589258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trusted Repeater Placement in QKD-enabled Optical Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arup Kumar Marik, Basabdatta Palit, Sadananda Behera","submitted_at":"2025-09-12T15:19:44Z","abstract_excerpt":"Quantum Key Distribution (QKD) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10338","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/2509.10338/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":"2509.10338","created_at":"2026-07-05T12:11:07.589353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10338v1","created_at":"2026-07-05T12:11:07.589353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10338","created_at":"2026-07-05T12:11:07.589353+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDRX4BFT3B3W","created_at":"2026-07-05T12:11:07.589353+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDRX4BFT3B3WEVTI","created_at":"2026-07-05T12:11:07.589353+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDRX4BFT","created_at":"2026-07-05T12:11:07.589353+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/CDRX4BFT3B3WEVTIHBJRF7EZOT","json":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT.json","graph_json":"https://pith.science/api/pith-number/CDRX4BFT3B3WEVTIHBJRF7EZOT/graph.json","events_json":"https://pith.science/api/pith-number/CDRX4BFT3B3WEVTIHBJRF7EZOT/events.json","paper":"https://pith.science/paper/CDRX4BFT"},"agent_actions":{"view_html":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT","download_json":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT.json","view_paper":"https://pith.science/paper/CDRX4BFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10338&json=true","fetch_graph":"https://pith.science/api/pith-number/CDRX4BFT3B3WEVTIHBJRF7EZOT/graph.json","fetch_events":"https://pith.science/api/pith-number/CDRX4BFT3B3WEVTIHBJRF7EZOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT/action/storage_attestation","attest_author":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT/action/author_attestation","sign_citation":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT/action/citation_signature","submit_replication":"https://pith.science/pith/CDRX4BFT3B3WEVTIHBJRF7EZOT/action/replication_record"}},"created_at":"2026-07-05T12:11:07.589353+00:00","updated_at":"2026-07-05T12:11:07.589353+00:00"}