{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OMMZDSUMT6XFSVVZZNFMHGYUJH","short_pith_number":"pith:OMMZDSUM","schema_version":"1.0","canonical_sha256":"731991ca8c9fae5956b9cb4ac39b1449c8c1c8997ad901e6f95e0bfedacffbaa","source":{"kind":"arxiv","id":"1908.04475","version":1},"attestation_state":"computed","paper":{"title":"Charged particle tracking with quantum annealing-inspired optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","hep-ph"],"primary_cat":"quant-ph","authors_text":"Abhishek Anand, Alexander Zlokapa, Daniel Lidar, Javier M. Duarte, Jean-Roch Vlimant, Joshua Job, Maria Spiropulu","submitted_at":"2019-08-13T03:41:40Z","abstract_excerpt":"At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for analysis are expected to face challenges due to scaling with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework and to HL-LHC conditions. F"},"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":"1908.04475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-13T03:41:40Z","cross_cats_sorted":["cs.LG","hep-ph"],"title_canon_sha256":"d9e078ada7b24669154248c4c406dadbbc922a7492caf2f7da5f01755a37a1ad","abstract_canon_sha256":"f28dcbf42f2742724c6440c1f7d523845e4ea3fb29616900e1213767d0376b82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:05.718798Z","signature_b64":"8smXzvVAuRGf0EgZ4D7YJe3uMX+hVatEdNCS7HtVEGfzZLbQq5ruZ4MQvEf8BvR7y2naqzW3jYAmvTXlqTEFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731991ca8c9fae5956b9cb4ac39b1449c8c1c8997ad901e6f95e0bfedacffbaa","last_reissued_at":"2026-07-05T03:44:05.718329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:05.718329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Charged particle tracking with quantum annealing-inspired optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","hep-ph"],"primary_cat":"quant-ph","authors_text":"Abhishek Anand, Alexander Zlokapa, Daniel Lidar, Javier M. Duarte, Jean-Roch Vlimant, Joshua Job, Maria Spiropulu","submitted_at":"2019-08-13T03:41:40Z","abstract_excerpt":"At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for analysis are expected to face challenges due to scaling with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework and to HL-LHC conditions. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04475","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04475/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":"1908.04475","created_at":"2026-07-05T03:44:05.718391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04475v1","created_at":"2026-07-05T03:44:05.718391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04475","created_at":"2026-07-05T03:44:05.718391+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMMZDSUMT6XF","created_at":"2026-07-05T03:44:05.718391+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMMZDSUMT6XFSVVZ","created_at":"2026-07-05T03:44:05.718391+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMMZDSUM","created_at":"2026-07-05T03:44:05.718391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08949","citing_title":"Quantum Algorithms for Jet Clustering","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH","json":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH.json","graph_json":"https://pith.science/api/pith-number/OMMZDSUMT6XFSVVZZNFMHGYUJH/graph.json","events_json":"https://pith.science/api/pith-number/OMMZDSUMT6XFSVVZZNFMHGYUJH/events.json","paper":"https://pith.science/paper/OMMZDSUM"},"agent_actions":{"view_html":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH","download_json":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH.json","view_paper":"https://pith.science/paper/OMMZDSUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04475&json=true","fetch_graph":"https://pith.science/api/pith-number/OMMZDSUMT6XFSVVZZNFMHGYUJH/graph.json","fetch_events":"https://pith.science/api/pith-number/OMMZDSUMT6XFSVVZZNFMHGYUJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH/action/storage_attestation","attest_author":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH/action/author_attestation","sign_citation":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH/action/citation_signature","submit_replication":"https://pith.science/pith/OMMZDSUMT6XFSVVZZNFMHGYUJH/action/replication_record"}},"created_at":"2026-07-05T03:44:05.718391+00:00","updated_at":"2026-07-05T03:44:05.718391+00:00"}