{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BLAJZYJP6BXLXT5FPAWX64JFPA","short_pith_number":"pith:BLAJZYJP","schema_version":"1.0","canonical_sha256":"0ac09ce12ff06ebbcfa5782d7f7125782525930930c6b769b599f27886fb9257","source":{"kind":"arxiv","id":"1902.08324","version":1},"attestation_state":"computed","paper":{"title":"A pattern recognition algorithm for quantum annealers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Bapst, Heather Gray, Lucy Linder, Paolo Calafiura, Wahid Bhimji, Wim Lavrijsen","submitted_at":"2019-02-22T00:58:58Z","abstract_excerpt":"The reconstruction of charged particles will be a key computing challenge for the high-luminosity Large Hadron Collider (HL-LHC) where increased data rates lead to large increases in running time for current pattern recognition algorithms. An alternative approach explored here expresses pattern recognition as a Quadratic Unconstrained Binary Optimization (QUBO) using software and quantum annealing. At track densities comparable with current LHC conditions, our approach achieves physics performance competitive with state-of-the-art pattern recognition algorithms. More research will be needed to"},"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":"1902.08324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-22T00:58:58Z","cross_cats_sorted":[],"title_canon_sha256":"094dced68a251d63737aa84fe66a2f6df3452ccb59160f8fc9655bf31e72ae50","abstract_canon_sha256":"6b01b4c2f498690acedc750581f0046772f8a20f86002feaf624517accd8a09c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.654953Z","signature_b64":"Ko3ZL7FS8TBpsIV4qxhXQRx1XWAEfH5cJZuK9ntloxYgpN/tFuolt0Pz2YLzsa9lMRFMsEqap+afLypixU33DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac09ce12ff06ebbcfa5782d7f7125782525930930c6b769b599f27886fb9257","last_reissued_at":"2026-05-17T23:52:57.654279Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.654279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A pattern recognition algorithm for quantum annealers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Bapst, Heather Gray, Lucy Linder, Paolo Calafiura, Wahid Bhimji, Wim Lavrijsen","submitted_at":"2019-02-22T00:58:58Z","abstract_excerpt":"The reconstruction of charged particles will be a key computing challenge for the high-luminosity Large Hadron Collider (HL-LHC) where increased data rates lead to large increases in running time for current pattern recognition algorithms. An alternative approach explored here expresses pattern recognition as a Quadratic Unconstrained Binary Optimization (QUBO) using software and quantum annealing. At track densities comparable with current LHC conditions, our approach achieves physics performance competitive with state-of-the-art pattern recognition algorithms. More research will be needed to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08324","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":"1902.08324","created_at":"2026-05-17T23:52:57.654374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08324v1","created_at":"2026-05-17T23:52:57.654374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08324","created_at":"2026-05-17T23:52:57.654374+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLAJZYJP6BXL","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLAJZYJP6BXLXT5F","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLAJZYJP","created_at":"2026-05-18T12:33:12.712433+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/BLAJZYJP6BXLXT5FPAWX64JFPA","json":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA.json","graph_json":"https://pith.science/api/pith-number/BLAJZYJP6BXLXT5FPAWX64JFPA/graph.json","events_json":"https://pith.science/api/pith-number/BLAJZYJP6BXLXT5FPAWX64JFPA/events.json","paper":"https://pith.science/paper/BLAJZYJP"},"agent_actions":{"view_html":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA","download_json":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA.json","view_paper":"https://pith.science/paper/BLAJZYJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08324&json=true","fetch_graph":"https://pith.science/api/pith-number/BLAJZYJP6BXLXT5FPAWX64JFPA/graph.json","fetch_events":"https://pith.science/api/pith-number/BLAJZYJP6BXLXT5FPAWX64JFPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA/action/storage_attestation","attest_author":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA/action/author_attestation","sign_citation":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA/action/citation_signature","submit_replication":"https://pith.science/pith/BLAJZYJP6BXLXT5FPAWX64JFPA/action/replication_record"}},"created_at":"2026-05-17T23:52:57.654374+00:00","updated_at":"2026-05-17T23:52:57.654374+00:00"}