{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PIMGMSSN74KLFULV5LUGWLOZX3","short_pith_number":"pith:PIMGMSSN","canonical_record":{"source":{"id":"1712.06349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T11:36:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a1b07496cdd1c308191383b4366f7af40afc0cb3e44ffff47ef06d042835f049","abstract_canon_sha256":"80f6440423d6f3e4b7f5f10a5b3f5121cdeadd6789ed5014f64e5b9f92fe7308"},"schema_version":"1.0"},"canonical_sha256":"7a18664a4dff14b2d175eae86b2dd9befe9b9c10690b85694aa1ebc40b91ca05","source":{"kind":"arxiv","id":"1712.06349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06349","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06349v1","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06349","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"PIMGMSSN74KL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PIMGMSSN74KLFULV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PIMGMSSN","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PIMGMSSN74KLFULV5LUGWLOZX3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T11:36:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a1b07496cdd1c308191383b4366f7af40afc0cb3e44ffff47ef06d042835f049","abstract_canon_sha256":"80f6440423d6f3e4b7f5f10a5b3f5121cdeadd6789ed5014f64e5b9f92fe7308"},"schema_version":"1.0"},"canonical_sha256":"7a18664a4dff14b2d175eae86b2dd9befe9b9c10690b85694aa1ebc40b91ca05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:50.606087Z","signature_b64":"eCg7CyHrzadTz08wm68P1y22LWTtt+vNw27ulxJcPc/LM05CWrdgjezm1qf3y2DmIwt5Tzt0TpZ4yNYvy+OEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a18664a4dff14b2d175eae86b2dd9befe9b9c10690b85694aa1ebc40b91ca05","last_reissued_at":"2026-05-18T00:27:50.605599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:50.605599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06349","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-18T00:27:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Cd3+/+bRWnkH80WKFG32PAnpbErDokJQz450G3jmSvkgBLfDpr3d+ALwfLh/uUybEUvApBfAYjDmDsFfyHbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:20.809870Z"},"content_sha256":"d6062bebc1700330f1915d4d9c4fb485828af0ae1f36d44d3494d09f7d821003","schema_version":"1.0","event_id":"sha256:d6062bebc1700330f1915d4d9c4fb485828af0ae1f36d44d3494d09f7d821003"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PIMGMSSN74KLFULV5LUGWLOZX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Understanding Quantum Algorithms via Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2017-12-18T11:36:40Z","abstract_excerpt":"Query complexity is a model of computation in which we have to compute a function $f(x_1, \\ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there hav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06349","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-18T00:27:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1yBmCsroTq6wjRFTTRvsQ+Q1KPHDdJLWTglfBcA3EIuIBMEkv/tRzaIh0rx5IuJfvvIg9/r4kehfxkt/JteDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:20.810283Z"},"content_sha256":"023dfa91be56b06c5f55ea35316eb12deecfeedf568c189b81ab4662ee0635b2","schema_version":"1.0","event_id":"sha256:023dfa91be56b06c5f55ea35316eb12deecfeedf568c189b81ab4662ee0635b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIMGMSSN74KLFULV5LUGWLOZX3/bundle.json","state_url":"https://pith.science/pith/PIMGMSSN74KLFULV5LUGWLOZX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIMGMSSN74KLFULV5LUGWLOZX3/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-25T15:24:20Z","links":{"resolver":"https://pith.science/pith/PIMGMSSN74KLFULV5LUGWLOZX3","bundle":"https://pith.science/pith/PIMGMSSN74KLFULV5LUGWLOZX3/bundle.json","state":"https://pith.science/pith/PIMGMSSN74KLFULV5LUGWLOZX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIMGMSSN74KLFULV5LUGWLOZX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PIMGMSSN74KLFULV5LUGWLOZX3","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":"80f6440423d6f3e4b7f5f10a5b3f5121cdeadd6789ed5014f64e5b9f92fe7308","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T11:36:40Z","title_canon_sha256":"a1b07496cdd1c308191383b4366f7af40afc0cb3e44ffff47ef06d042835f049"},"schema_version":"1.0","source":{"id":"1712.06349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06349","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06349v1","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06349","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"PIMGMSSN74KL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PIMGMSSN74KLFULV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PIMGMSSN","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:023dfa91be56b06c5f55ea35316eb12deecfeedf568c189b81ab4662ee0635b2","target":"graph","created_at":"2026-05-18T00:27:50Z","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":"Query complexity is a model of computation in which we have to compute a function $f(x_1, \\ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there hav","authors_text":"Andris Ambainis","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T11:36:40Z","title":"Understanding Quantum Algorithms via Query Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06349","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:d6062bebc1700330f1915d4d9c4fb485828af0ae1f36d44d3494d09f7d821003","target":"record","created_at":"2026-05-18T00:27:50Z","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":"80f6440423d6f3e4b7f5f10a5b3f5121cdeadd6789ed5014f64e5b9f92fe7308","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T11:36:40Z","title_canon_sha256":"a1b07496cdd1c308191383b4366f7af40afc0cb3e44ffff47ef06d042835f049"},"schema_version":"1.0","source":{"id":"1712.06349","kind":"arxiv","version":1}},"canonical_sha256":"7a18664a4dff14b2d175eae86b2dd9befe9b9c10690b85694aa1ebc40b91ca05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a18664a4dff14b2d175eae86b2dd9befe9b9c10690b85694aa1ebc40b91ca05","first_computed_at":"2026-05-18T00:27:50.605599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:50.605599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eCg7CyHrzadTz08wm68P1y22LWTtt+vNw27ulxJcPc/LM05CWrdgjezm1qf3y2DmIwt5Tzt0TpZ4yNYvy+OEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:50.606087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6062bebc1700330f1915d4d9c4fb485828af0ae1f36d44d3494d09f7d821003","sha256:023dfa91be56b06c5f55ea35316eb12deecfeedf568c189b81ab4662ee0635b2"],"state_sha256":"758e6c77a019d42e3ecbc3a78fc4a4aa569fe9abecc4e981232a06b7bbdcf944"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXfdc297aJZS63DVRUEI4WnglszncrerIoNfb9SvXOLFUfDRw3yYhww6YQmot97HYuDRM9qGKXpdHu2Wajz1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:24:20.813975Z","bundle_sha256":"211542c5df7ccb35b038183c7a8397d3d4f596cc9b72e43bd5d6f457dec1615e"}}