{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:I2FMY7KOPPICZS4XRG6ZI3MNDH","short_pith_number":"pith:I2FMY7KO","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"},"canonical_sha256":"468acc7d4e7bd02ccb9789bd946d8d19f342ae9aabcae7860e0f14242dfcdb01","source":{"kind":"arxiv","id":"0712.4213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0712.4213","created_at":"2026-05-18T03:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"0712.4213v1","created_at":"2026-05-18T03:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.4213","created_at":"2026-05-18T03:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"I2FMY7KOPPIC","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"I2FMY7KOPPICZS4X","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"I2FMY7KO","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:I2FMY7KOPPICZS4XRG6ZI3MNDH","target":"record","payload":{"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"},"canonical_sha256":"468acc7d4e7bd02ccb9789bd946d8d19f342ae9aabcae7860e0f14242dfcdb01","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"},"source_kind":"arxiv","source_id":"0712.4213","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgWA6D8xcvetJOW6XRS3lVKYZpSNMd9LBP7RxlNVUqTnMtN3fX1Shyt2/hpu9brZ+c2cgmKvMJhsNwvrJtgzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:55:59.698506Z"},"content_sha256":"7a7819e2cee0e10596317cd1b93ea7cdd2eb20bd3b460d09f313512d8a4db3f5","schema_version":"1.0","event_id":"sha256:7a7819e2cee0e10596317cd1b93ea7cdd2eb20bd3b460d09f313512d8a4db3f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:I2FMY7KOPPICZS4XRG6ZI3MNDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddl1NXkRGifh9m0Mp59OYL38lxA39ER9qiOCXxvqXv2/YYZh/ZwZMwrnRVByjPn6au46vUYvK4cdRnc2mWRhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:55:59.699135Z"},"content_sha256":"7b01fd75f30a8eac904abcf3094a07b8339ce64889e13c30456cc6c09865d727","schema_version":"1.0","event_id":"sha256:7b01fd75f30a8eac904abcf3094a07b8339ce64889e13c30456cc6c09865d727"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/bundle.json","state_url":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T13:55:59Z","links":{"resolver":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH","bundle":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/bundle.json","state":"https://pith.science/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2FMY7KOPPICZS4XRG6ZI3MNDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:I2FMY7KOPPICZS4XRG6ZI3MNDH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"114ab4bde9bac9531086316ae43b07d95795484db4a73d7e9143f30664b40fd0","cross_cats_sorted":["cs.DC","cs.DS"],"license":"","primary_cat":"quant-ph","submitted_at":"2007-12-27T10:52:52Z","title_canon_sha256":"0d55d82091c341997e3ab5aba50c98270e00d9b17a53629d5cf26813e4c26672"},"schema_version":"1.0","source":{"id":"0712.4213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0712.4213","created_at":"2026-05-18T03:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"0712.4213v1","created_at":"2026-05-18T03:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.4213","created_at":"2026-05-18T03:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"I2FMY7KOPPIC","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"I2FMY7KOPPICZS4X","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"I2FMY7KO","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:7b01fd75f30a8eac904abcf3094a07b8339ce64889e13c30456cc6c09865d727","target":"graph","created_at":"2026-05-18T03:43:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2007-12-27T10:52:52Z","title":"Exact Quantum Algorithms for the Leader Election Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.4213","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7a7819e2cee0e10596317cd1b93ea7cdd2eb20bd3b460d09f313512d8a4db3f5","target":"record","created_at":"2026-05-18T03:43:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"114ab4bde9bac9531086316ae43b07d95795484db4a73d7e9143f30664b40fd0","cross_cats_sorted":["cs.DC","cs.DS"],"license":"","primary_cat":"quant-ph","submitted_at":"2007-12-27T10:52:52Z","title_canon_sha256":"0d55d82091c341997e3ab5aba50c98270e00d9b17a53629d5cf26813e4c26672"},"schema_version":"1.0","source":{"id":"0712.4213","kind":"arxiv","version":1}},"canonical_sha256":"468acc7d4e7bd02ccb9789bd946d8d19f342ae9aabcae7860e0f14242dfcdb01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"468acc7d4e7bd02ccb9789bd946d8d19f342ae9aabcae7860e0f14242dfcdb01","first_computed_at":"2026-05-18T03:43:42.842758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:42.842758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gmRB4lAqb/d7oeQn6oWMhy0dpjg6lQDgczPrRZ+Bv63nmYEeSTkQL/vYYjU6qMZfZXwxn6vWVhSD1v/lk4M/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:42.843467Z","signed_message":"canonical_sha256_bytes"},"source_id":"0712.4213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a7819e2cee0e10596317cd1b93ea7cdd2eb20bd3b460d09f313512d8a4db3f5","sha256:7b01fd75f30a8eac904abcf3094a07b8339ce64889e13c30456cc6c09865d727"],"state_sha256":"52675dda798e13a9520a9c7eec170832dc7a0310d66ca88e82e0f218e5e9ce73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEa3sVwJNLJFHoizSjLowklOCkcVYyeXSklmqPF+8GvNp9sIcLkq8YP0bbomKnU1eNbrJE/kYT0auZkyW5R7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:55:59.701439Z","bundle_sha256":"6c2feff9c8dbadc759408111f35c2dcb6b97e13263caba08ab13e79400be0763"}}