{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7Q4IDMGK3ZGHTCVRPLJG4BFGBR","short_pith_number":"pith:7Q4IDMGK","canonical_record":{"source":{"id":"1211.0721","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-04T21:20:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"22bb8540e9f53f3c9b7d029e98974c011c9813ed7262a77cc6b6dc39f4a1326f","abstract_canon_sha256":"572d9dd9134f8d05492ddc8302777e35bd55855dd8b511f9039df2bd9032316e"},"schema_version":"1.0"},"canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","source":{"kind":"arxiv","id":"1211.0721","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0721","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0721v6","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0721","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"7Q4IDMGK3ZGH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7Q4IDMGK3ZGHTCVR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7Q4IDMGK","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7Q4IDMGK3ZGHTCVRPLJG4BFGBR","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0721","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-04T21:20:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"22bb8540e9f53f3c9b7d029e98974c011c9813ed7262a77cc6b6dc39f4a1326f","abstract_canon_sha256":"572d9dd9134f8d05492ddc8302777e35bd55855dd8b511f9039df2bd9032316e"},"schema_version":"1.0"},"canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.169383Z","signature_b64":"6XLa3tP4Im1xlCXO+b7BBLJ5Rlkg/2B6yaf4ZS1li1AaDZE1UMYmyoMfLNxt/WrhOmaQPNdU4TKML3iRqWEbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","last_reissued_at":"2026-05-18T02:48:01.168873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.168873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0721","source_version":6,"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-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAIQmAdf/i4w++rQIvrMvi7hTb7k5YHm/k5usNUHSTNY+jKb0m4AJDIFr3Ih8NL+5Nj/87sEJkYpTvvBdytcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:00:39.350025Z"},"content_sha256":"bbb5f544bc850eed8a4533b1587811b8109aece95fa98fa00d81c6a09695ee87","schema_version":"1.0","event_id":"sha256:bbb5f544bc850eed8a4533b1587811b8109aece95fa98fa00d81c6a09695ee87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7Q4IDMGK3ZGHTCVRPLJG4BFGBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superlinear advantage for exact quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2012-11-04T21:20:38Z","abstract_excerpt":"A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm.\n  We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0721","kind":"arxiv","version":6},"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-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00Ovkp96lduw+97T8fTCqLavRTAtHvrN1yeUvighl1+f5imQUaxzUfTKEdqxyYfNlzehBFMr3QqrnHvjitBCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:00:39.350729Z"},"content_sha256":"7ba1dc4bb2eb20f15a7edb88a62e4a1e23c68f99bbe59e5da6e7add55c5ba779","schema_version":"1.0","event_id":"sha256:7ba1dc4bb2eb20f15a7edb88a62e4a1e23c68f99bbe59e5da6e7add55c5ba779"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/bundle.json","state_url":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/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-26T08:00:39Z","links":{"resolver":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR","bundle":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/bundle.json","state":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7Q4IDMGK3ZGHTCVRPLJG4BFGBR","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":"572d9dd9134f8d05492ddc8302777e35bd55855dd8b511f9039df2bd9032316e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-04T21:20:38Z","title_canon_sha256":"22bb8540e9f53f3c9b7d029e98974c011c9813ed7262a77cc6b6dc39f4a1326f"},"schema_version":"1.0","source":{"id":"1211.0721","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0721","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0721v6","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0721","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"7Q4IDMGK3ZGH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7Q4IDMGK3ZGHTCVR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7Q4IDMGK","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:7ba1dc4bb2eb20f15a7edb88a62e4a1e23c68f99bbe59e5da6e7add55c5ba779","target":"graph","created_at":"2026-05-18T02:48:01Z","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":"A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm.\n  We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage ov","authors_text":"Andris Ambainis","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-04T21:20:38Z","title":"Superlinear advantage for exact quantum algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0721","kind":"arxiv","version":6},"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:bbb5f544bc850eed8a4533b1587811b8109aece95fa98fa00d81c6a09695ee87","target":"record","created_at":"2026-05-18T02:48:01Z","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":"572d9dd9134f8d05492ddc8302777e35bd55855dd8b511f9039df2bd9032316e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-04T21:20:38Z","title_canon_sha256":"22bb8540e9f53f3c9b7d029e98974c011c9813ed7262a77cc6b6dc39f4a1326f"},"schema_version":"1.0","source":{"id":"1211.0721","kind":"arxiv","version":6}},"canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","first_computed_at":"2026-05-18T02:48:01.168873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:01.168873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6XLa3tP4Im1xlCXO+b7BBLJ5Rlkg/2B6yaf4ZS1li1AaDZE1UMYmyoMfLNxt/WrhOmaQPNdU4TKML3iRqWEbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:01.169383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0721","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb5f544bc850eed8a4533b1587811b8109aece95fa98fa00d81c6a09695ee87","sha256:7ba1dc4bb2eb20f15a7edb88a62e4a1e23c68f99bbe59e5da6e7add55c5ba779"],"state_sha256":"317f604c7e1831ce91e52403035b5789b5b3ee63c80743f3e28e7bd91bc6fcaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMXabb5hqscfzmhyDXvQbvNU30amzhR59qezlZ+d8mqcdeEg8hlPl+j+y9mLzZ0BioxECdRF4fTbbh/O4gfBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:00:39.354361Z","bundle_sha256":"5737d09ffd37dcb6274a6179912a85f7ef41dfda7e9af8c55c11069f59744f36"}}