{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:QGS5NOEN7KUNSBF5HOL7UFNXQX","short_pith_number":"pith:QGS5NOEN","schema_version":"1.0","canonical_sha256":"81a5d6b88dfaa8d904bd3b97fa15b785df9243926fd439e77b12a3ee4aa0d307","source":{"kind":"arxiv","id":"hep-ex/0002021","version":6},"attestation_state":"computed","paper":{"title":"Analytical and Numerical Flash-Algorithms for Track Fits","license":"","headline":"","cross_cats":[],"primary_cat":"hep-ex","authors_text":"M. Dima","submitted_at":"2000-02-07T18:36:31Z","abstract_excerpt":"Flash-algorithm track-reconstruction routines with speed factors 3000-4000 in excess those of traditional iterative routines are presented.\n The methods were successfully tested in the alignment of the Test Beam setup for the ATLAS Pixel Detector\n MCM-D modules yielding a\n 60 fold increase in alignment resolution over iterative routines, for the same amount of alocated CPU time."},"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":"hep-ex/0002021","kind":"arxiv","version":6},"metadata":{"license":"","primary_cat":"hep-ex","submitted_at":"2000-02-07T18:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"b420e1d6afa17416eacec2ed944d3b8e5daace0d8f6ee785f0a31de9a3df751f","abstract_canon_sha256":"f54979e83976b67143bb1e2f2606d5a4cfe1d43029e1eb63ccc61dfe7d40ac3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:43.918404Z","signature_b64":"JElxOGgv0Xu9eGW+JbLmFWMemkkdb53OQfEPgc53Cy+aLzLs2VJpz7gd70256HhW3zgeDp9jMVYzaz7LRyjsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81a5d6b88dfaa8d904bd3b97fa15b785df9243926fd439e77b12a3ee4aa0d307","last_reissued_at":"2026-05-18T01:06:43.917898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:43.917898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytical and Numerical Flash-Algorithms for Track Fits","license":"","headline":"","cross_cats":[],"primary_cat":"hep-ex","authors_text":"M. Dima","submitted_at":"2000-02-07T18:36:31Z","abstract_excerpt":"Flash-algorithm track-reconstruction routines with speed factors 3000-4000 in excess those of traditional iterative routines are presented.\n The methods were successfully tested in the alignment of the Test Beam setup for the ATLAS Pixel Detector\n MCM-D modules yielding a\n 60 fold increase in alignment resolution over iterative routines, for the same amount of alocated CPU time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"hep-ex/0002021","kind":"arxiv","version":6},"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":"hep-ex/0002021","created_at":"2026-05-18T01:06:43.917971+00:00"},{"alias_kind":"arxiv_version","alias_value":"hep-ex/0002021v6","created_at":"2026-05-18T01:06:43.917971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.hep-ex/0002021","created_at":"2026-05-18T01:06:43.917971+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGS5NOEN7KUN","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGS5NOEN7KUNSBF5","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGS5NOEN","created_at":"2026-05-18T12:25:50.254431+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/QGS5NOEN7KUNSBF5HOL7UFNXQX","json":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX.json","graph_json":"https://pith.science/api/pith-number/QGS5NOEN7KUNSBF5HOL7UFNXQX/graph.json","events_json":"https://pith.science/api/pith-number/QGS5NOEN7KUNSBF5HOL7UFNXQX/events.json","paper":"https://pith.science/paper/QGS5NOEN"},"agent_actions":{"view_html":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX","download_json":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX.json","view_paper":"https://pith.science/paper/QGS5NOEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=hep-ex/0002021&json=true","fetch_graph":"https://pith.science/api/pith-number/QGS5NOEN7KUNSBF5HOL7UFNXQX/graph.json","fetch_events":"https://pith.science/api/pith-number/QGS5NOEN7KUNSBF5HOL7UFNXQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX/action/storage_attestation","attest_author":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX/action/author_attestation","sign_citation":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX/action/citation_signature","submit_replication":"https://pith.science/pith/QGS5NOEN7KUNSBF5HOL7UFNXQX/action/replication_record"}},"created_at":"2026-05-18T01:06:43.917971+00:00","updated_at":"2026-05-18T01:06:43.917971+00:00"}