{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IMXT2YVZ4QBG2CJDYCISHYJKXL","short_pith_number":"pith:IMXT2YVZ","schema_version":"1.0","canonical_sha256":"432f3d62b9e4026d0923c09123e12abad88710ccf8fa09a654982601e12534e3","source":{"kind":"arxiv","id":"1902.05027","version":5},"attestation_state":"computed","paper":{"title":"Proximity Queries for Absolutely Continuous Parametric Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.GR"],"primary_cat":"cs.RO","authors_text":"Andrew Patterson, Arun Lakshmanan, Naira Hovakimyan, Venanzio Cichella","submitted_at":"2019-02-13T17:43:13Z","abstract_excerpt":"In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is generally non-convex and serves as a significant computational bottleneck for motion planning algorithms. In this paper, we present methods for a general class of absolutely continuous parametric curves to compute: (i) the minimum separating distance, (ii) tolerance verification, and (iii) collision detection. Our methods efficiently compute bounds on obstacle prox"},"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":"1902.05027","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-13T17:43:13Z","cross_cats_sorted":["cs.CG","cs.GR"],"title_canon_sha256":"4ddec99ee7c4caf0f4095181e4df8668ab5c6d32caaff64d6acdb52e3e14f39a","abstract_canon_sha256":"62f8a63b26ca7fe5a0651e09a762f6eb77fc22f176f8983403258c0fcd08803e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.344447Z","signature_b64":"pKzJbvLCJdBUwF0PAADvxjPm0iTnnjjPCeXeu2bvz8c4ZoEk/QgTNvTcXkd4mBYcVF7IxLYWc5FhS9KsXcq1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"432f3d62b9e4026d0923c09123e12abad88710ccf8fa09a654982601e12534e3","last_reissued_at":"2026-05-17T23:42:53.343757Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.343757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximity Queries for Absolutely Continuous Parametric Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.GR"],"primary_cat":"cs.RO","authors_text":"Andrew Patterson, Arun Lakshmanan, Naira Hovakimyan, Venanzio Cichella","submitted_at":"2019-02-13T17:43:13Z","abstract_excerpt":"In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is generally non-convex and serves as a significant computational bottleneck for motion planning algorithms. In this paper, we present methods for a general class of absolutely continuous parametric curves to compute: (i) the minimum separating distance, (ii) tolerance verification, and (iii) collision detection. Our methods efficiently compute bounds on obstacle prox"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05027","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":""},"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":"1902.05027","created_at":"2026-05-17T23:42:53.343856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05027v5","created_at":"2026-05-17T23:42:53.343856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05027","created_at":"2026-05-17T23:42:53.343856+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMXT2YVZ4QBG","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMXT2YVZ4QBG2CJD","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMXT2YVZ","created_at":"2026-05-18T12:33:18.533446+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/IMXT2YVZ4QBG2CJDYCISHYJKXL","json":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL.json","graph_json":"https://pith.science/api/pith-number/IMXT2YVZ4QBG2CJDYCISHYJKXL/graph.json","events_json":"https://pith.science/api/pith-number/IMXT2YVZ4QBG2CJDYCISHYJKXL/events.json","paper":"https://pith.science/paper/IMXT2YVZ"},"agent_actions":{"view_html":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL","download_json":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL.json","view_paper":"https://pith.science/paper/IMXT2YVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05027&json=true","fetch_graph":"https://pith.science/api/pith-number/IMXT2YVZ4QBG2CJDYCISHYJKXL/graph.json","fetch_events":"https://pith.science/api/pith-number/IMXT2YVZ4QBG2CJDYCISHYJKXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL/action/storage_attestation","attest_author":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL/action/author_attestation","sign_citation":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL/action/citation_signature","submit_replication":"https://pith.science/pith/IMXT2YVZ4QBG2CJDYCISHYJKXL/action/replication_record"}},"created_at":"2026-05-17T23:42:53.343856+00:00","updated_at":"2026-05-17T23:42:53.343856+00:00"}