{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EG3IP4I2ELLGVJPN6BY6GOECJ6","short_pith_number":"pith:EG3IP4I2","canonical_record":{"source":{"id":"1211.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-20T00:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"e64eeca49b57f5c1d92b6e2fa1d8893aec75d014d1acb7910f52db3327ad07d6","abstract_canon_sha256":"aaf637ae006bf5c10f9304af05aa0eef90e85825d3d9ce9e866630d83ba644cb"},"schema_version":"1.0"},"canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","source":{"kind":"arxiv","id":"1211.4637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4637","created_at":"2026-05-18T03:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4637v2","created_at":"2026-05-18T03:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4637","created_at":"2026-05-18T03:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"EG3IP4I2ELLG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EG3IP4I2ELLGVJPN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EG3IP4I2","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EG3IP4I2ELLGVJPN6BY6GOECJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-20T00:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"e64eeca49b57f5c1d92b6e2fa1d8893aec75d014d1acb7910f52db3327ad07d6","abstract_canon_sha256":"aaf637ae006bf5c10f9304af05aa0eef90e85825d3d9ce9e866630d83ba644cb"},"schema_version":"1.0"},"canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:59.123939Z","signature_b64":"SEzVkYtUw8u1ww3DiSTuMICovSxMupFgXXrW7vx5hLERzdQAgi18krHEpZa/S8mY1Ntrt2UiOO/oauthRMTeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","last_reissued_at":"2026-05-18T03:00:59.123209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:59.123209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4637","source_version":2,"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ti0hXxhtUfFsOzOzoDBmieMFm30cNzOh2lrZktvUZjDul4gx4D99bn1Ev2b4ofh7cySf8AcnHgVh4FSpOFVQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:52:43.321611Z"},"content_sha256":"f60fd2d9245584161e34cc5a3a52b43f2450168fea1df6615f1f3e81b2fdbb7a","schema_version":"1.0","event_id":"sha256:f60fd2d9245584161e34cc5a3a52b43f2450168fea1df6615f1f3e81b2fdbb7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EG3IP4I2ELLGVJPN6BY6GOECJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Richard Cleve, Sevag Gharibian","submitted_at":"2012-11-20T00:31:07Z","abstract_excerpt":"We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar run"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4637","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"},"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJKTDCwkcwr1DyWTByFL+a20T6xMbg0sKLPt1gGA4sasJhLXrEHBZCBGJ6rexpBH/XZzQ2moLs2NROcfAtEMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:52:43.321953Z"},"content_sha256":"6f504ba7aba10af69b9132d589eaf51f58710aa938c82c99466b879fffe51eb2","schema_version":"1.0","event_id":"sha256:6f504ba7aba10af69b9132d589eaf51f58710aa938c82c99466b879fffe51eb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/bundle.json","state_url":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/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-20T09:52:43Z","links":{"resolver":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6","bundle":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/bundle.json","state":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EG3IP4I2ELLGVJPN6BY6GOECJ6","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":"aaf637ae006bf5c10f9304af05aa0eef90e85825d3d9ce9e866630d83ba644cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-20T00:31:07Z","title_canon_sha256":"e64eeca49b57f5c1d92b6e2fa1d8893aec75d014d1acb7910f52db3327ad07d6"},"schema_version":"1.0","source":{"id":"1211.4637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4637","created_at":"2026-05-18T03:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4637v2","created_at":"2026-05-18T03:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4637","created_at":"2026-05-18T03:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"EG3IP4I2ELLG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EG3IP4I2ELLGVJPN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EG3IP4I2","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:6f504ba7aba10af69b9132d589eaf51f58710aa938c82c99466b879fffe51eb2","target":"graph","created_at":"2026-05-18T03:00:59Z","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":"We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar run","authors_text":"Dominic W. Berry, Richard Cleve, Sevag Gharibian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-20T00:31:07Z","title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4637","kind":"arxiv","version":2},"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:f60fd2d9245584161e34cc5a3a52b43f2450168fea1df6615f1f3e81b2fdbb7a","target":"record","created_at":"2026-05-18T03:00:59Z","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":"aaf637ae006bf5c10f9304af05aa0eef90e85825d3d9ce9e866630d83ba644cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-20T00:31:07Z","title_canon_sha256":"e64eeca49b57f5c1d92b6e2fa1d8893aec75d014d1acb7910f52db3327ad07d6"},"schema_version":"1.0","source":{"id":"1211.4637","kind":"arxiv","version":2}},"canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","first_computed_at":"2026-05-18T03:00:59.123209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:59.123209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SEzVkYtUw8u1ww3DiSTuMICovSxMupFgXXrW7vx5hLERzdQAgi18krHEpZa/S8mY1Ntrt2UiOO/oauthRMTeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:59.123939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f60fd2d9245584161e34cc5a3a52b43f2450168fea1df6615f1f3e81b2fdbb7a","sha256:6f504ba7aba10af69b9132d589eaf51f58710aa938c82c99466b879fffe51eb2"],"state_sha256":"8da5f9fdf5b146bb063732b74011d8e450c39aaed0c77c8ddc5896cbeebe10d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2emHjePvSskQ1KB1mBbrbZKV4SeMJANAftipYGPZ4AEIXHgJe0ouDuDXpwze+UOTqn94XzKYgidrk+9VFrCuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:52:43.323947Z","bundle_sha256":"44fc08f4422a50a85fcb3a9d15ca62be4970c2e95ba785df62423560639f6f10"}}