{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XT3WKOHJ3CANLUQRRRMGEW2M7J","short_pith_number":"pith:XT3WKOHJ","schema_version":"1.0","canonical_sha256":"bcf76538e9d880d5d2118c58625b4cfa755634ba33482224ff662fa67c1e3c08","source":{"kind":"arxiv","id":"1302.7256","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.7256","created_at":"2026-05-18T03:01:35.938709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7256v1","created_at":"2026-05-18T03:01:35.938709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7256","created_at":"2026-05-18T03:01:35.938709+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT3WKOHJ3CAN","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT3WKOHJ3CANLUQR","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT3WKOHJ","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J","json":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J.json","graph_json":"https://pith.science/api/pith-number/XT3WKOHJ3CANLUQRRRMGEW2M7J/graph.json","events_json":"https://pith.science/api/pith-number/XT3WKOHJ3CANLUQRRRMGEW2M7J/events.json","paper":"https://pith.science/paper/XT3WKOHJ"},"agent_actions":{"view_html":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J","download_json":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J.json","view_paper":"https://pith.science/paper/XT3WKOHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7256&json=true","fetch_graph":"https://pith.science/api/pith-number/XT3WKOHJ3CANLUQRRRMGEW2M7J/graph.json","fetch_events":"https://pith.science/api/pith-number/XT3WKOHJ3CANLUQRRRMGEW2M7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/action/storage_attestation","attest_author":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/action/author_attestation","sign_citation":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/action/citation_signature","submit_replication":"https://pith.science/pith/XT3WKOHJ3CANLUQRRRMGEW2M7J/action/replication_record"}},"created_at":"2026-05-18T03:01:35.938709+00:00","updated_at":"2026-05-18T03:01:35.938709+00:00"}