{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X4EXAOA2DB4VLJEWOAFF3UDX2Q","short_pith_number":"pith:X4EXAOA2","schema_version":"1.0","canonical_sha256":"bf0970381a187955a496700a5dd077d434f182d100b190cf0aa5d27eafe38eee","source":{"kind":"arxiv","id":"1707.01187","version":2},"attestation_state":"computed","paper":{"title":"Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Loick Magnin, Maor Ganz","submitted_at":"2017-07-04T23:57:46Z","abstract_excerpt":"We provide the first quantum (exact) protocol for the Dining Philosophers problem (DP), a central problem in distributed algorithms. It is well known that the problem cannot be solved exactly in the classical setting. We then use our DP protocol to provide a new quantum protocol for the tightly related problem of exact leader election (LE) on a ring, improving significantly in both time and memory complexity over the known LE protocol by Tani et. al. To do this, we show that in some sense the exact DP and exact LE problems are equivalent; interestingly, in the classical non-exact setting they "},"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":"1707.01187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-04T23:57:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b4c7dc3bb5eb274aff8b0578e98619726a48e13c1f8048be4f378f8821ff9c95","abstract_canon_sha256":"17bfae440610d336c385a95f2e36a65fe1efe14df44d7c6e8cd6c1c9041d0998"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.970602Z","signature_b64":"XL1x3uzi9zo64zBAr2eZGtAk58I8sWWKWJ+V+UDpLArKbNP8ipWE1sOQfX9iJQvvlrRMbr3AeT8emYxK0VvRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf0970381a187955a496700a5dd077d434f182d100b190cf0aa5d27eafe38eee","last_reissued_at":"2026-05-18T00:39:11.969840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.969840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Loick Magnin, Maor Ganz","submitted_at":"2017-07-04T23:57:46Z","abstract_excerpt":"We provide the first quantum (exact) protocol for the Dining Philosophers problem (DP), a central problem in distributed algorithms. It is well known that the problem cannot be solved exactly in the classical setting. We then use our DP protocol to provide a new quantum protocol for the tightly related problem of exact leader election (LE) on a ring, improving significantly in both time and memory complexity over the known LE protocol by Tani et. al. To do this, we show that in some sense the exact DP and exact LE problems are equivalent; interestingly, in the classical non-exact setting they "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01187","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":""},"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":"1707.01187","created_at":"2026-05-18T00:39:11.969968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01187v2","created_at":"2026-05-18T00:39:11.969968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01187","created_at":"2026-05-18T00:39:11.969968+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4EXAOA2DB4V","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4EXAOA2DB4VLJEW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4EXAOA2","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02622","citing_title":"Access Control Threatened by Quantum Entanglement","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q","json":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q.json","graph_json":"https://pith.science/api/pith-number/X4EXAOA2DB4VLJEWOAFF3UDX2Q/graph.json","events_json":"https://pith.science/api/pith-number/X4EXAOA2DB4VLJEWOAFF3UDX2Q/events.json","paper":"https://pith.science/paper/X4EXAOA2"},"agent_actions":{"view_html":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q","download_json":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q.json","view_paper":"https://pith.science/paper/X4EXAOA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01187&json=true","fetch_graph":"https://pith.science/api/pith-number/X4EXAOA2DB4VLJEWOAFF3UDX2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/X4EXAOA2DB4VLJEWOAFF3UDX2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q/action/storage_attestation","attest_author":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q/action/author_attestation","sign_citation":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q/action/citation_signature","submit_replication":"https://pith.science/pith/X4EXAOA2DB4VLJEWOAFF3UDX2Q/action/replication_record"}},"created_at":"2026-05-18T00:39:11.969968+00:00","updated_at":"2026-05-18T00:39:11.969968+00:00"}