{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:P73AQJKMZBP4WVXTYY6BYWZJIW","short_pith_number":"pith:P73AQJKM","schema_version":"1.0","canonical_sha256":"7ff608254cc85fcb56f3c63c1c5b294598ef86e30ea502271f645837044292b8","source":{"kind":"arxiv","id":"2112.06300","version":5},"attestation_state":"computed","paper":{"title":"Time of Impact Dataset for Continuous Collision Detection and a Scalable Conservative Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Bolun Wang, Daniele Panozzo, David Belgrod, Marco Attene, Teseo Schneider, Xin Zhao, Zachary Ferguson","submitted_at":"2021-12-12T18:47:55Z","abstract_excerpt":"We introduce a large-scale benchmark for broad- and narrow-phase continuous collision detection (CCD) over linearized trajectories with exact time of impacts and use it to evaluate the accuracy, correctness, and efficiency of 13 state-of-the-art CCD algorithms. Our analysis shows that several methods exhibit problems either in efficiency or accuracy.\n  To overcome these limitations, we introduce an algorithm for CCD designed to be scalable on modern parallel architectures and provably correct when implemented using floating point arithmetic. We integrate our algorithm within the Incremental Po"},"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":"2112.06300","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2021-12-12T18:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"67ca93633d1a009493948085fd6b900fd7eb0053986fe67de147ab74a540389b","abstract_canon_sha256":"f7873bdc715966ad0c8c9c18e37c7c713ac048d33d6aeda9dc1102a7355e4e99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:29.369440Z","signature_b64":"AjcRGXvNUzsYwRo369cykEl+T5XC5ESBtyaiWM8B3NqkZ6caCYB/UUs9JQwnJ0cjdjRct3XDxde9tWpFIWkSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff608254cc85fcb56f3c63c1c5b294598ef86e30ea502271f645837044292b8","last_reissued_at":"2026-07-05T11:17:29.368972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:29.368972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time of Impact Dataset for Continuous Collision Detection and a Scalable Conservative Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Bolun Wang, Daniele Panozzo, David Belgrod, Marco Attene, Teseo Schneider, Xin Zhao, Zachary Ferguson","submitted_at":"2021-12-12T18:47:55Z","abstract_excerpt":"We introduce a large-scale benchmark for broad- and narrow-phase continuous collision detection (CCD) over linearized trajectories with exact time of impacts and use it to evaluate the accuracy, correctness, and efficiency of 13 state-of-the-art CCD algorithms. Our analysis shows that several methods exhibit problems either in efficiency or accuracy.\n  To overcome these limitations, we introduce an algorithm for CCD designed to be scalable on modern parallel architectures and provably correct when implemented using floating point arithmetic. We integrate our algorithm within the Incremental Po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06300","kind":"arxiv","version":5},"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/2112.06300/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":"2112.06300","created_at":"2026-07-05T11:17:29.369030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.06300v5","created_at":"2026-07-05T11:17:29.369030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06300","created_at":"2026-07-05T11:17:29.369030+00:00"},{"alias_kind":"pith_short_12","alias_value":"P73AQJKMZBP4","created_at":"2026-07-05T11:17:29.369030+00:00"},{"alias_kind":"pith_short_16","alias_value":"P73AQJKMZBP4WVXT","created_at":"2026-07-05T11:17:29.369030+00:00"},{"alias_kind":"pith_short_8","alias_value":"P73AQJKM","created_at":"2026-07-05T11:17:29.369030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19892","citing_title":"An Efficient Multilevel Preconditioned Nonlinear Conjugate Gradient Method for Incremental Potential Contact","ref_index":90,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW","json":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW.json","graph_json":"https://pith.science/api/pith-number/P73AQJKMZBP4WVXTYY6BYWZJIW/graph.json","events_json":"https://pith.science/api/pith-number/P73AQJKMZBP4WVXTYY6BYWZJIW/events.json","paper":"https://pith.science/paper/P73AQJKM"},"agent_actions":{"view_html":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW","download_json":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW.json","view_paper":"https://pith.science/paper/P73AQJKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.06300&json=true","fetch_graph":"https://pith.science/api/pith-number/P73AQJKMZBP4WVXTYY6BYWZJIW/graph.json","fetch_events":"https://pith.science/api/pith-number/P73AQJKMZBP4WVXTYY6BYWZJIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW/action/storage_attestation","attest_author":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW/action/author_attestation","sign_citation":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW/action/citation_signature","submit_replication":"https://pith.science/pith/P73AQJKMZBP4WVXTYY6BYWZJIW/action/replication_record"}},"created_at":"2026-07-05T11:17:29.369030+00:00","updated_at":"2026-07-05T11:17:29.369030+00:00"}