{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LEDALFW4EAFKZ5T4APRE65O2NB","short_pith_number":"pith:LEDALFW4","schema_version":"1.0","canonical_sha256":"59060596dc200aacf67c03e24f75da68612f8ceccfb0e07650585911f299741b","source":{"kind":"arxiv","id":"2209.13711","version":1},"attestation_state":"computed","paper":{"title":"Segment Linking: A Highly Parallelizable Track Reconstruction Algorithm for HL-LHC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex"],"primary_cat":"physics.ins-det","authors_text":"Avraham Yagil, Balaji Venkat Sathia Narayanan, Bei Wang, Emmanouil Vourliotis, Gavin Niendorf, Matev\\v{z} Tadel, Michael Reid, Peter Elmer, Peter Wittich, Philip Chang, Vyacheslav Krutelyov, Yanxi Gu","submitted_at":"2022-09-27T21:52:17Z","abstract_excerpt":"The High Luminosity upgrade of the Large Hadron Collider (HL-LHC) will produce particle collisions with up to 200 simultaneous proton-proton interactions. These unprecedented conditions will create a combinatorial complexity for charged-particle track reconstruction that demands a computational cost that is expected to surpass the projected computing budget using conventional CPUs. Motivated by this and taking into account the prevalence of heterogeneous computing in cutting-edge High Performance Computing centers, we propose an efficient, fast and highly parallelizable bottom-up approach to t"},"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":"2209.13711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.ins-det","submitted_at":"2022-09-27T21:52:17Z","cross_cats_sorted":["hep-ex"],"title_canon_sha256":"69b4a47e452031424d399486f19568796e72596e6e6995ec25974f1a44def330","abstract_canon_sha256":"29bbfca139bdce19969233236b43cdc15d5ee34eeb28329c2246e0b55fb181b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:11.207926Z","signature_b64":"w3zVt5Pp83z94nieTG5T+sbmtCKxiUOYytxwy3NEsWGmJyYZItuoIyewfTp+aEdlmt0n/mTI3a0LEHk6EOIxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59060596dc200aacf67c03e24f75da68612f8ceccfb0e07650585911f299741b","last_reissued_at":"2026-07-05T05:22:11.207479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:11.207479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Segment Linking: A Highly Parallelizable Track Reconstruction Algorithm for HL-LHC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex"],"primary_cat":"physics.ins-det","authors_text":"Avraham Yagil, Balaji Venkat Sathia Narayanan, Bei Wang, Emmanouil Vourliotis, Gavin Niendorf, Matev\\v{z} Tadel, Michael Reid, Peter Elmer, Peter Wittich, Philip Chang, Vyacheslav Krutelyov, Yanxi Gu","submitted_at":"2022-09-27T21:52:17Z","abstract_excerpt":"The High Luminosity upgrade of the Large Hadron Collider (HL-LHC) will produce particle collisions with up to 200 simultaneous proton-proton interactions. These unprecedented conditions will create a combinatorial complexity for charged-particle track reconstruction that demands a computational cost that is expected to surpass the projected computing budget using conventional CPUs. Motivated by this and taking into account the prevalence of heterogeneous computing in cutting-edge High Performance Computing centers, we propose an efficient, fast and highly parallelizable bottom-up approach to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13711","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/2209.13711/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":"2209.13711","created_at":"2026-07-05T05:22:11.207544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.13711v1","created_at":"2026-07-05T05:22:11.207544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13711","created_at":"2026-07-05T05:22:11.207544+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEDALFW4EAFK","created_at":"2026-07-05T05:22:11.207544+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEDALFW4EAFKZ5T4","created_at":"2026-07-05T05:22:11.207544+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEDALFW4","created_at":"2026-07-05T05:22:11.207544+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/LEDALFW4EAFKZ5T4APRE65O2NB","json":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB.json","graph_json":"https://pith.science/api/pith-number/LEDALFW4EAFKZ5T4APRE65O2NB/graph.json","events_json":"https://pith.science/api/pith-number/LEDALFW4EAFKZ5T4APRE65O2NB/events.json","paper":"https://pith.science/paper/LEDALFW4"},"agent_actions":{"view_html":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB","download_json":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB.json","view_paper":"https://pith.science/paper/LEDALFW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.13711&json=true","fetch_graph":"https://pith.science/api/pith-number/LEDALFW4EAFKZ5T4APRE65O2NB/graph.json","fetch_events":"https://pith.science/api/pith-number/LEDALFW4EAFKZ5T4APRE65O2NB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB/action/storage_attestation","attest_author":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB/action/author_attestation","sign_citation":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB/action/citation_signature","submit_replication":"https://pith.science/pith/LEDALFW4EAFKZ5T4APRE65O2NB/action/replication_record"}},"created_at":"2026-07-05T05:22:11.207544+00:00","updated_at":"2026-07-05T05:22:11.207544+00:00"}