{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YLENHADOHPCVEQFDUPMHIE46UX","short_pith_number":"pith:YLENHADO","schema_version":"1.0","canonical_sha256":"c2c8d3806e3bc55240a3a3d874139ea5d58f23cd6f7f8fb286d502238aea5aa2","source":{"kind":"arxiv","id":"2410.14233","version":3},"attestation_state":"computed","paper":{"title":"Quantum-annealing-inspired algorithms for multijet clustering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["hep-ex","hep-ph"],"primary_cat":"quant-ph","authors_text":"Hideki Okawa, Man-Hong Yung, Qing-Guo Zeng, Xian-Zhe Tao","submitted_at":"2024-10-18T07:31:04Z","abstract_excerpt":"Jet clustering or reconstruction is a crucial component at high energy colliders, a procedure to identify sprays of collimated particles originating from the fragmentation and hadronization of quarks and gluons. It is a complicated combinatorial optimization problem and requires intensive computing resources. In this study, we formulate jet reconstruction as a quadratic unconstrained binary optimization (QUBO) problem and introduce novel quantum-annealing-inspired algorithms for clustering multiple jets in electron-positron collision events. One of these quantum-annealing-inspired algorithms, "},"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":"2410.14233","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-18T07:31:04Z","cross_cats_sorted":["hep-ex","hep-ph"],"title_canon_sha256":"efd4aa442e9daf9b02cba50c4270eec8acf5d9c9db7bc4d33aacb519ee6b9cb1","abstract_canon_sha256":"8e65213313b49bf75ca845967fc54a2b844215b756fcb3c2fc97a78024272f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:02.615930Z","signature_b64":"MvBUi2OHkAp8F2e5txqqdtDtMNjBIdHMiUWI6/vazDxKq4ZQz9rZeSN2L0Qe07Iw3wWB5DllP+8YBhYvWXE6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2c8d3806e3bc55240a3a3d874139ea5d58f23cd6f7f8fb286d502238aea5aa2","last_reissued_at":"2026-07-05T10:43:02.615392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:02.615392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-annealing-inspired algorithms for multijet clustering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["hep-ex","hep-ph"],"primary_cat":"quant-ph","authors_text":"Hideki Okawa, Man-Hong Yung, Qing-Guo Zeng, Xian-Zhe Tao","submitted_at":"2024-10-18T07:31:04Z","abstract_excerpt":"Jet clustering or reconstruction is a crucial component at high energy colliders, a procedure to identify sprays of collimated particles originating from the fragmentation and hadronization of quarks and gluons. It is a complicated combinatorial optimization problem and requires intensive computing resources. In this study, we formulate jet reconstruction as a quadratic unconstrained binary optimization (QUBO) problem and introduce novel quantum-annealing-inspired algorithms for clustering multiple jets in electron-positron collision events. One of these quantum-annealing-inspired algorithms, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14233","kind":"arxiv","version":3},"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/2410.14233/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":"2410.14233","created_at":"2026-07-05T10:43:02.615470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14233v3","created_at":"2026-07-05T10:43:02.615470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14233","created_at":"2026-07-05T10:43:02.615470+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLENHADOHPCV","created_at":"2026-07-05T10:43:02.615470+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLENHADOHPCVEQFD","created_at":"2026-07-05T10:43:02.615470+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLENHADO","created_at":"2026-07-05T10:43:02.615470+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":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX","json":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX.json","graph_json":"https://pith.science/api/pith-number/YLENHADOHPCVEQFDUPMHIE46UX/graph.json","events_json":"https://pith.science/api/pith-number/YLENHADOHPCVEQFDUPMHIE46UX/events.json","paper":"https://pith.science/paper/YLENHADO"},"agent_actions":{"view_html":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX","download_json":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX.json","view_paper":"https://pith.science/paper/YLENHADO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14233&json=true","fetch_graph":"https://pith.science/api/pith-number/YLENHADOHPCVEQFDUPMHIE46UX/graph.json","fetch_events":"https://pith.science/api/pith-number/YLENHADOHPCVEQFDUPMHIE46UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX/action/storage_attestation","attest_author":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX/action/author_attestation","sign_citation":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX/action/citation_signature","submit_replication":"https://pith.science/pith/YLENHADOHPCVEQFDUPMHIE46UX/action/replication_record"}},"created_at":"2026-07-05T10:43:02.615470+00:00","updated_at":"2026-07-05T10:43:02.615470+00:00"}