{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:G4FSGTTOSMN5PCPCQYB3RJE5Z4","short_pith_number":"pith:G4FSGTTO","schema_version":"1.0","canonical_sha256":"370b234e6e931bd789e28603b8a49dcf111745c0a8379eb45646610fbd1cd1df","source":{"kind":"arxiv","id":"quant-ph/9607014","version":2},"attestation_state":"computed","paper":{"title":"A Quantum Algorithm for Finding the Minimum","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Christoph Durr, Peter Hoyer","submitted_at":"1996-07-18T19:12:42Z","abstract_excerpt":"We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c."},"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":"quant-ph/9607014","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-07-18T19:12:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"66bac2b89ac875a502293edbac47a683cf38f2fc5587d45b5fbef273b358d628","abstract_canon_sha256":"f06645965a0c70e9bdc7e3c1a0cede7002e818f964f9155cc302cffcc3a00d07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:08:20.220925Z","signature_b64":"33zHlp8S4UITMme9gC0MtfvwnLIxZLseMul/ZZBCSz87cTJw8bMvNAeUzAxKFM9cTRvHsu+3qrX8H8u5FULkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"370b234e6e931bd789e28603b8a49dcf111745c0a8379eb45646610fbd1cd1df","last_reissued_at":"2026-07-04T15:08:20.220538Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:08:20.220538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Algorithm for Finding the Minimum","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Christoph Durr, Peter Hoyer","submitted_at":"1996-07-18T19:12:42Z","abstract_excerpt":"We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9607014","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9607014/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"quant-ph/9607014","created_at":"2026-07-04T15:08:20.220597+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9607014v2","created_at":"2026-07-04T15:08:20.220597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9607014","created_at":"2026-07-04T15:08:20.220597+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4FSGTTOSMN5","created_at":"2026-07-04T15:08:20.220597+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4FSGTTOSMN5PCPC","created_at":"2026-07-04T15:08:20.220597+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4FSGTTO","created_at":"2026-07-04T15:08:20.220597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":20,"internal_anchor_count":16,"sample":[{"citing_arxiv_id":"2606.24922","citing_title":"Constraint-Aware Quantum Optimization of Defect Configurations in Doped ZrO2: XY-Mixer QAOA and Grover Adaptive Search","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20176","citing_title":"Quantum-Accelerated Self-Consistent Field: A Hybrid Algorithm","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13244","citing_title":"Coupling-Grouped XY-QAOA for Joint Anomaly-Feature Selection","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11843","citing_title":"Quantum iterative approach to the Traveling Salesman Problem","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07322","citing_title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2606.06316","citing_title":"Quantum enhanced rare event discovery and sampling","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":159,"is_internal_anchor":true},{"citing_arxiv_id":"2606.06531","citing_title":"CARVE-Q: Quantum-Proposed, Classically Certified Interactive Driving Repair","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03380","citing_title":"Energy-selective quantum search with Ising Hamiltonian phase oracles","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2606.01426","citing_title":"Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods","ref_index":177,"is_internal_anchor":true},{"citing_arxiv_id":"1906.10175","citing_title":"Machine learning methods in quantum computing theory","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"1907.00529","citing_title":"Exponential-time quantum algorithms for graph coloring problems","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1907.03315","citing_title":"A Quantum Algorithm for Finding $k$-Minima","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18393","citing_title":"Quantum Model for CVRPTW","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19389","citing_title":"Quantum-Native Maximum Likelihood Detection in Random Access Channel with Overloaded MIMO","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2603.26039","citing_title":"Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12139","citing_title":"BoolXLLM: LLM-Assisted Explainability for Boolean Models","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27782","citing_title":"Explicit Quantum Search Algorithm for the Densest k-Subgraph Problem","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26692","citing_title":"Towards Quantum Optimised Malware Containment","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25962","citing_title":"Coherent Rollout Oracles for Finite-Horizon Sequential Decision Problems","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4","json":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4.json","graph_json":"https://pith.science/api/pith-number/G4FSGTTOSMN5PCPCQYB3RJE5Z4/graph.json","events_json":"https://pith.science/api/pith-number/G4FSGTTOSMN5PCPCQYB3RJE5Z4/events.json","paper":"https://pith.science/paper/G4FSGTTO"},"agent_actions":{"view_html":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4","download_json":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4.json","view_paper":"https://pith.science/paper/G4FSGTTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9607014&json=true","fetch_graph":"https://pith.science/api/pith-number/G4FSGTTOSMN5PCPCQYB3RJE5Z4/graph.json","fetch_events":"https://pith.science/api/pith-number/G4FSGTTOSMN5PCPCQYB3RJE5Z4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4/action/storage_attestation","attest_author":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4/action/author_attestation","sign_citation":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4/action/citation_signature","submit_replication":"https://pith.science/pith/G4FSGTTOSMN5PCPCQYB3RJE5Z4/action/replication_record"}},"created_at":"2026-07-04T15:08:20.220597+00:00","updated_at":"2026-07-04T15:08:20.220597+00:00"}