{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:I4ZQQFVSNMXNTCI2MQ2COBDTNZ","short_pith_number":"pith:I4ZQQFVS","schema_version":"1.0","canonical_sha256":"47330816b26b2ed9891a64342704736e4f6a1b597dd9620803d2d5742b5f4de2","source":{"kind":"arxiv","id":"2205.09169","version":2},"attestation_state":"computed","paper":{"title":"Anonymous conference key agreement in linear quantum networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Anna Pappa, Frederik Hahn, Jarn de Jong, Jens Eisert, Nathan Walk","submitted_at":"2022-05-18T18:38:52Z","abstract_excerpt":"Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA), an extension of key distribution to multiple parties, has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity. In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear c"},"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":"2205.09169","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-18T18:38:52Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"4d3ff762dd0350b75794803e34c9de0ed78bd36a87ebefb48d45fe1132ccf1f8","abstract_canon_sha256":"5484cdea00ebdc36ce1274e6ac5091ce45b261fb5aed6c3956e0c6e8b20e1e38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:03.302823Z","signature_b64":"6vJOoX0y9mkPA1ewEjsTS3qJ2R8Zigqqhc94mtxhfa7XDaZ7Jx4TtqOk/msAlzXVupxZyyogFQwJpFqRWsoZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47330816b26b2ed9891a64342704736e4f6a1b597dd9620803d2d5742b5f4de2","last_reissued_at":"2026-07-05T06:53:03.302135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:03.302135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous conference key agreement in linear quantum networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Anna Pappa, Frederik Hahn, Jarn de Jong, Jens Eisert, Nathan Walk","submitted_at":"2022-05-18T18:38:52Z","abstract_excerpt":"Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA), an extension of key distribution to multiple parties, has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity. In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.09169","kind":"arxiv","version":2},"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/2205.09169/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":"2205.09169","created_at":"2026-07-05T06:53:03.302209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.09169v2","created_at":"2026-07-05T06:53:03.302209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.09169","created_at":"2026-07-05T06:53:03.302209+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4ZQQFVSNMXN","created_at":"2026-07-05T06:53:03.302209+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4ZQQFVSNMXNTCI2","created_at":"2026-07-05T06:53:03.302209+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4ZQQFVS","created_at":"2026-07-05T06:53:03.302209+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ","json":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ.json","graph_json":"https://pith.science/api/pith-number/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/graph.json","events_json":"https://pith.science/api/pith-number/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/events.json","paper":"https://pith.science/paper/I4ZQQFVS"},"agent_actions":{"view_html":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ","download_json":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ.json","view_paper":"https://pith.science/paper/I4ZQQFVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.09169&json=true","fetch_graph":"https://pith.science/api/pith-number/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/action/storage_attestation","attest_author":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/action/author_attestation","sign_citation":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/action/citation_signature","submit_replication":"https://pith.science/pith/I4ZQQFVSNMXNTCI2MQ2COBDTNZ/action/replication_record"}},"created_at":"2026-07-05T06:53:03.302209+00:00","updated_at":"2026-07-05T06:53:03.302209+00:00"}