{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:I2FMY7KOPPICZS4XRG6ZI3MNDH","short_pith_number":"pith:I2FMY7KO","schema_version":"1.0","canonical_sha256":"468acc7d4e7bd02ccb9789bd946d8d19f342ae9aabcae7860e0f14242dfcdb01","source":{"kind":"arxiv","id":"0712.4213","version":1},"attestation_state":"computed","paper":{"title":"Exact Quantum Algorithms for the Leader Election Problem","license":"","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani","submitted_at":"2007-12-27T10:52:52Z","abstract_excerpt":"This paper gives the first separation of quantum and classical pure (i.e., non-cryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of a celebrated unsolvable problem in classical distributed computing, the ``leader election problem'' on anonymous networks. The goal of the leader election problem is to elect a unique leader from among distributed parties. The paper considers this problem for anonymous networks, in which each party has the same identifier. It is well-known that no classical algorithm can solv"},"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":"0712.4213","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-12-27T10:52:52Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"0d55d82091c341997e3ab5aba50c98270e00d9b17a53629d5cf26813e4c26672","abstract_canon_sha256":"114ab4bde9bac9531086316ae43b07d95795484db4a73d7e9143f30664b40fd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:42.843467Z","signature_b64":"gmRB4lAqb/d7oeQn6oWMhy0dpjg6lQDgczPrRZ+Bv63nmYEeSTkQL/vYYjU6qMZfZXwxn6vWVhSD1v/lk4M/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"468acc7d4e7bd02ccb9789bd946d8d19f342ae9aabcae7860e0f14242dfcdb01","last_reissued_at":"2026-05-18T03:43:42.842758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:42.842758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Quantum Algorithms for the Leader Election Problem","license":"","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani","submitted_at":"2007-12-27T10:52:52Z","abstract_excerpt":"This paper gives the first separation of quantum and classical pure (i.e., non-cryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of a celebrated unsolvable problem in classical distributed computing, the ``leader election problem'' on anonymous networks. The goal of the leader election problem is to elect a unique leader from among distributed parties. The paper considers this problem for anonymous networks, in which each party has the same identifier. It is well-known that no classical algorithm can solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.4213","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":"0712.4213","created_at":"2026-05-18T03:43:42.842868+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.4213v1","created_at":"2026-05-18T03:43:42.842868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.4213","created_at":"2026-05-18T03:43:42.842868+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2FMY7KOPPIC","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2FMY7KOPPICZS4X","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2FMY7KO","created_at":"2026-05-18T12:25:55.427421+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/I2FMY7KOPPICZS4XRG6ZI3MNDH","json":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH.json","graph_json":"https://pith.science/api/pith-number/I2FMY7KOPPICZS4XRG6ZI3MNDH/graph.json","events_json":"https://pith.science/api/pith-number/I2FMY7KOPPICZS4XRG6ZI3MNDH/events.json","paper":"https://pith.science/paper/I2FMY7KO"},"agent_actions":{"view_html":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH","download_json":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH.json","view_paper":"https://pith.science/paper/I2FMY7KO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.4213&json=true","fetch_graph":"https://pith.science/api/pith-number/I2FMY7KOPPICZS4XRG6ZI3MNDH/graph.json","fetch_events":"https://pith.science/api/pith-number/I2FMY7KOPPICZS4XRG6ZI3MNDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/action/storage_attestation","attest_author":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/action/author_attestation","sign_citation":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/action/citation_signature","submit_replication":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/action/replication_record"}},"created_at":"2026-05-18T03:43:42.842868+00:00","updated_at":"2026-05-18T03:43:42.842868+00:00"}