{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XT3WKOHJ3CANLUQRRRMGEW2M7J","short_pith_number":"pith:XT3WKOHJ","canonical_record":{"source":{"id":"1302.7256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-28T16:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"4e4437c1c2d4e1d9a2b79d93fb59eb15e971e631c44911f6492e4f921d4caa50","abstract_canon_sha256":"ca71e6edecac7dabb62eacd447764c66c72eb147a17f712a2f49bab3948dfcb9"},"schema_version":"1.0"},"canonical_sha256":"bcf76538e9d880d5d2118c58625b4cfa755634ba33482224ff662fa67c1e3c08","source":{"kind":"arxiv","id":"1302.7256","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7256","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7256v1","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7256","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"XT3WKOHJ3CAN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XT3WKOHJ3CANLUQR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XT3WKOHJ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XT3WKOHJ3CANLUQRRRMGEW2M7J","target":"record","payload":{"canonical_record":{"source":{"id":"1302.7256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-28T16:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"4e4437c1c2d4e1d9a2b79d93fb59eb15e971e631c44911f6492e4f921d4caa50","abstract_canon_sha256":"ca71e6edecac7dabb62eacd447764c66c72eb147a17f712a2f49bab3948dfcb9"},"schema_version":"1.0"},"canonical_sha256":"bcf76538e9d880d5d2118c58625b4cfa755634ba33482224ff662fa67c1e3c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:35.939343Z","signature_b64":"cTSzD+5G2UBzLgcg07MQBdw+PElLHbSMTTIM7/bQFHGfqrNhQyqYPYXz8p7TO/XU9+xIJ6JRMCFyhuREk37iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf76538e9d880d5d2118c58625b4cfa755634ba33482224ff662fa67c1e3c08","last_reissued_at":"2026-05-18T03:01:35.938548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:35.938548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.7256","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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEDhAl80ZmI7lhVTK2o04IZOyN68/27jPJ2dgPf0JrsUzUgD7V8jbISMVg4lgXUe53aR9kITdQnhCGXbz4F6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:52:35.758635Z"},"content_sha256":"8b629f7930a7ce648ebb38aa5f4d973f2ad0e6d316b7add0c86a304b85acf3f4","schema_version":"1.0","event_id":"sha256:8b629f7930a7ce648ebb38aa5f4d973f2ad0e6d316b7add0c86a304b85acf3f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XT3WKOHJ3CANLUQRRRMGEW2M7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-Time Quantum Algorithms for Unstructured Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Itay Hen","submitted_at":"2013-02-28T16:57:43Z","abstract_excerpt":"We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer to as `scrambled output' problems, one has to find a minimum-cost configuration of a given integer-valued n-bit function whose output values have been scrambled in some arbitrary way. Special cases within this set of problems are Grover's search problem of finding a marked item in an unstructured database, certain random energy models, and the functions of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7256","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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UI7IVVaPhvQD2qHLbAD79w4Oe+ALsg9Lzsehssuh+ZCtcR4R07NX55H1VG2HAYQhnek9tU6EKK1WW6UXLBrfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:52:35.759221Z"},"content_sha256":"c17423bf026121fe980e89eca8125660765d56f8093a41d7925f2dbcf366476c","schema_version":"1.0","event_id":"sha256:c17423bf026121fe980e89eca8125660765d56f8093a41d7925f2dbcf366476c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/bundle.json","state_url":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/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-06-07T02:52:35Z","links":{"resolver":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J","bundle":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/bundle.json","state":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XT3WKOHJ3CANLUQRRRMGEW2M7J","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":"ca71e6edecac7dabb62eacd447764c66c72eb147a17f712a2f49bab3948dfcb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-28T16:57:43Z","title_canon_sha256":"4e4437c1c2d4e1d9a2b79d93fb59eb15e971e631c44911f6492e4f921d4caa50"},"schema_version":"1.0","source":{"id":"1302.7256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7256","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7256v1","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7256","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"XT3WKOHJ3CAN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XT3WKOHJ3CANLUQR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XT3WKOHJ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:c17423bf026121fe980e89eca8125660765d56f8093a41d7925f2dbcf366476c","target":"graph","created_at":"2026-05-18T03:01:35Z","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 consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer to as `scrambled output' problems, one has to find a minimum-cost configuration of a given integer-valued n-bit function whose output values have been scrambled in some arbitrary way. Special cases within this set of problems are Grover's search problem of finding a marked item in an unstructured database, certain random energy models, and the functions of th","authors_text":"Itay Hen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-28T16:57:43Z","title":"Continuous-Time Quantum Algorithms for Unstructured Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7256","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:8b629f7930a7ce648ebb38aa5f4d973f2ad0e6d316b7add0c86a304b85acf3f4","target":"record","created_at":"2026-05-18T03:01:35Z","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":"ca71e6edecac7dabb62eacd447764c66c72eb147a17f712a2f49bab3948dfcb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-28T16:57:43Z","title_canon_sha256":"4e4437c1c2d4e1d9a2b79d93fb59eb15e971e631c44911f6492e4f921d4caa50"},"schema_version":"1.0","source":{"id":"1302.7256","kind":"arxiv","version":1}},"canonical_sha256":"bcf76538e9d880d5d2118c58625b4cfa755634ba33482224ff662fa67c1e3c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcf76538e9d880d5d2118c58625b4cfa755634ba33482224ff662fa67c1e3c08","first_computed_at":"2026-05-18T03:01:35.938548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:35.938548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cTSzD+5G2UBzLgcg07MQBdw+PElLHbSMTTIM7/bQFHGfqrNhQyqYPYXz8p7TO/XU9+xIJ6JRMCFyhuREk37iDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:35.939343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.7256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b629f7930a7ce648ebb38aa5f4d973f2ad0e6d316b7add0c86a304b85acf3f4","sha256:c17423bf026121fe980e89eca8125660765d56f8093a41d7925f2dbcf366476c"],"state_sha256":"22c7474f5903f9e6b92dfe971ec03b59030f845d2ca3284aa3246784a0a9c281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twjWlBo/CJaAAIqszlXwojSUgSEqLL8/s/859U2qsApLb8cvs74IF0GhzrSwS8plZqRxvgUkOubpx/X0K4pqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:52:35.762261Z","bundle_sha256":"4530eafb5ad4d68d021b319353cba20214e57598ab7108b05cc5e16d213dd53d"}}