{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OAS5GTYORJ7M7VKPPNNIANSXW7","short_pith_number":"pith:OAS5GTYO","schema_version":"1.0","canonical_sha256":"7025d34f0e8a7ecfd54f7b5a803657b7d23673f7c25b8ee1adc380aac39edc0d","source":{"kind":"arxiv","id":"1203.4046","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous QKD on a Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. J. D. Phoenix, S. M. Barnett","submitted_at":"2012-03-19T06:52:56Z","abstract_excerpt":"We show how QKD on a multi-user, multi-path, network can be used to establish a key between any two end users in an asynchronous fashion using the technique of bit-transport. By a suitable adaptation of our previous secret-sharing scheme we show that an attacker has to compromise all of the intermediate relays on the network in order to obtain the key. Thus, two end users can establish a secret key provided they trust at least one of the network relays."},"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":"1203.4046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-03-19T06:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"b197d7be27321e241015d75a67b74dffff1ffea197faf07ef564498b6a2bd981","abstract_canon_sha256":"3ab1a775d2fda66176978fae20eaa1879fe2f72bd79becb4ee87b510998016ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:48.405788Z","signature_b64":"yApdRtCyxM+AGQLN7pkPZo4qSEgpNrrDxcO8BY1BZpMaLYvrvbDdJ/q79/1+iPL6aGwKUlk6ha06TelDDKzNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7025d34f0e8a7ecfd54f7b5a803657b7d23673f7c25b8ee1adc380aac39edc0d","last_reissued_at":"2026-05-18T03:59:48.405413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:48.405413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous QKD on a Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. J. D. Phoenix, S. M. Barnett","submitted_at":"2012-03-19T06:52:56Z","abstract_excerpt":"We show how QKD on a multi-user, multi-path, network can be used to establish a key between any two end users in an asynchronous fashion using the technique of bit-transport. By a suitable adaptation of our previous secret-sharing scheme we show that an attacker has to compromise all of the intermediate relays on the network in order to obtain the key. Thus, two end users can establish a secret key provided they trust at least one of the network relays."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4046","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":"1203.4046","created_at":"2026-05-18T03:59:48.405473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4046v1","created_at":"2026-05-18T03:59:48.405473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4046","created_at":"2026-05-18T03:59:48.405473+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAS5GTYORJ7M","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAS5GTYORJ7M7VKP","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAS5GTYO","created_at":"2026-05-18T12:27:16.716162+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/OAS5GTYORJ7M7VKPPNNIANSXW7","json":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7.json","graph_json":"https://pith.science/api/pith-number/OAS5GTYORJ7M7VKPPNNIANSXW7/graph.json","events_json":"https://pith.science/api/pith-number/OAS5GTYORJ7M7VKPPNNIANSXW7/events.json","paper":"https://pith.science/paper/OAS5GTYO"},"agent_actions":{"view_html":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7","download_json":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7.json","view_paper":"https://pith.science/paper/OAS5GTYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4046&json=true","fetch_graph":"https://pith.science/api/pith-number/OAS5GTYORJ7M7VKPPNNIANSXW7/graph.json","fetch_events":"https://pith.science/api/pith-number/OAS5GTYORJ7M7VKPPNNIANSXW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7/action/storage_attestation","attest_author":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7/action/author_attestation","sign_citation":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7/action/citation_signature","submit_replication":"https://pith.science/pith/OAS5GTYORJ7M7VKPPNNIANSXW7/action/replication_record"}},"created_at":"2026-05-18T03:59:48.405473+00:00","updated_at":"2026-05-18T03:59:48.405473+00:00"}