{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XUGJ6SU3NAV4LNUIJ6ZG3IO3IV","short_pith_number":"pith:XUGJ6SU3","schema_version":"1.0","canonical_sha256":"bd0c9f4a9b682bc5b6884fb26da1db4560367f42772bc61140058dbcb168aaa8","source":{"kind":"arxiv","id":"2402.14718","version":2},"attestation_state":"computed","paper":{"title":"Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex"],"primary_cat":"quant-ph","authors_text":"Hideki Okawa, Man-Hong Yung, Qing-Guo Zeng, Xian-Zhe Tao","submitted_at":"2024-02-22T17:19:03Z","abstract_excerpt":"Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the particle multiplicity is high, which will be the conditions at future colliders, such as the High Luminosity Large Hadron Collider and Super Proton-Proton Collider. Track reconstruction can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, for which various quantum algorithms have been investigated and evaluated with both a quantum "},"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":"2402.14718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-22T17:19:03Z","cross_cats_sorted":["hep-ex"],"title_canon_sha256":"530ad8511635f575f27198322939e36110a25bb7b20885d1209ff7a15e230a6a","abstract_canon_sha256":"33d3b7fbc4767ac124c4edaf80d13ee8a42904254ed65101dcf986d2ba75ca2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:57.678158Z","signature_b64":"j3s9zS6S3WLlui+yScmDIAWRKBXYlCqq46bU3QiP+pHEo0JLpFV7/REOz6Cb1+1d5o3x9FigCqy2sgfAisOMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd0c9f4a9b682bc5b6884fb26da1db4560367f42772bc61140058dbcb168aaa8","last_reissued_at":"2026-07-05T09:00:57.677604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:57.677604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex"],"primary_cat":"quant-ph","authors_text":"Hideki Okawa, Man-Hong Yung, Qing-Guo Zeng, Xian-Zhe Tao","submitted_at":"2024-02-22T17:19:03Z","abstract_excerpt":"Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the particle multiplicity is high, which will be the conditions at future colliders, such as the High Luminosity Large Hadron Collider and Super Proton-Proton Collider. Track reconstruction can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, for which various quantum algorithms have been investigated and evaluated with both a quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14718","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/2402.14718/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":"2402.14718","created_at":"2026-07-05T09:00:57.677685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.14718v2","created_at":"2026-07-05T09:00:57.677685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14718","created_at":"2026-07-05T09:00:57.677685+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUGJ6SU3NAV4","created_at":"2026-07-05T09:00:57.677685+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUGJ6SU3NAV4LNUI","created_at":"2026-07-05T09:00:57.677685+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUGJ6SU3","created_at":"2026-07-05T09:00:57.677685+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08169","citing_title":"Overview of Applications of Quantum Computing in QCD","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV","json":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV.json","graph_json":"https://pith.science/api/pith-number/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/graph.json","events_json":"https://pith.science/api/pith-number/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/events.json","paper":"https://pith.science/paper/XUGJ6SU3"},"agent_actions":{"view_html":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV","download_json":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV.json","view_paper":"https://pith.science/paper/XUGJ6SU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.14718&json=true","fetch_graph":"https://pith.science/api/pith-number/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/graph.json","fetch_events":"https://pith.science/api/pith-number/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/action/storage_attestation","attest_author":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/action/author_attestation","sign_citation":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/action/citation_signature","submit_replication":"https://pith.science/pith/XUGJ6SU3NAV4LNUIJ6ZG3IO3IV/action/replication_record"}},"created_at":"2026-07-05T09:00:57.677685+00:00","updated_at":"2026-07-05T09:00:57.677685+00:00"}