{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SSYPTVP6M2DORJNBUL6YKMLCKV","short_pith_number":"pith:SSYPTVP6","schema_version":"1.0","canonical_sha256":"94b0f9d5fe6686e8a5a1a2fd853162555e4b72046c4456bcaafbe7ad1d36f463","source":{"kind":"arxiv","id":"2212.00278","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Conformal Prediction for Motion Planning among Dynamic Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Anushri Dixit, George J. Pappas, Joel W. Burdick, Lars Lindemann, Matthew Cleaveland, Skylar Wei","submitted_at":"2022-12-01T04:54:22Z","abstract_excerpt":"This paper proposes an algorithm for motion planning among dynamic agents using adaptive conformal prediction. We consider a deterministic control system and use trajectory predictors to predict the dynamic agents' future motion, which is assumed to follow an unknown distribution. We then leverage ideas from adaptive conformal prediction to dynamically quantify prediction uncertainty from an online data stream. Particularly, we provide an online algorithm uses delayed agent observations to obtain uncertainty sets for multistep-ahead predictions with probabilistic coverage. These uncertainty se"},"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":"2212.00278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-12-01T04:54:22Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"2fb835bf83682c883718101c19d42103cb81cda0b79db52b683f057b97b41c73","abstract_canon_sha256":"65cfb81396f2c92b83317d493be7f344fb825ea7f67bb42433569dd2e383c40a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:21:32.742801Z","signature_b64":"jeQH5RYgc7sfakglsoxhTunTpYhuJbR2Lyf5uO162jo4SzY5kYm2GonHa9CAxwMqdDW2lJc14AR4DrEeU2a6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94b0f9d5fe6686e8a5a1a2fd853162555e4b72046c4456bcaafbe7ad1d36f463","last_reissued_at":"2026-07-05T05:21:32.742262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:21:32.742262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Conformal Prediction for Motion Planning among Dynamic Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Anushri Dixit, George J. Pappas, Joel W. Burdick, Lars Lindemann, Matthew Cleaveland, Skylar Wei","submitted_at":"2022-12-01T04:54:22Z","abstract_excerpt":"This paper proposes an algorithm for motion planning among dynamic agents using adaptive conformal prediction. We consider a deterministic control system and use trajectory predictors to predict the dynamic agents' future motion, which is assumed to follow an unknown distribution. We then leverage ideas from adaptive conformal prediction to dynamically quantify prediction uncertainty from an online data stream. Particularly, we provide an online algorithm uses delayed agent observations to obtain uncertainty sets for multistep-ahead predictions with probabilistic coverage. These uncertainty se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.00278","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/2212.00278/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":"2212.00278","created_at":"2026-07-05T05:21:32.742343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.00278v1","created_at":"2026-07-05T05:21:32.742343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.00278","created_at":"2026-07-05T05:21:32.742343+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSYPTVP6M2DO","created_at":"2026-07-05T05:21:32.742343+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSYPTVP6M2DORJNB","created_at":"2026-07-05T05:21:32.742343+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSYPTVP6","created_at":"2026-07-05T05:21:32.742343+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2107.07511","citing_title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","ref_index":129,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV","json":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV.json","graph_json":"https://pith.science/api/pith-number/SSYPTVP6M2DORJNBUL6YKMLCKV/graph.json","events_json":"https://pith.science/api/pith-number/SSYPTVP6M2DORJNBUL6YKMLCKV/events.json","paper":"https://pith.science/paper/SSYPTVP6"},"agent_actions":{"view_html":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV","download_json":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV.json","view_paper":"https://pith.science/paper/SSYPTVP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.00278&json=true","fetch_graph":"https://pith.science/api/pith-number/SSYPTVP6M2DORJNBUL6YKMLCKV/graph.json","fetch_events":"https://pith.science/api/pith-number/SSYPTVP6M2DORJNBUL6YKMLCKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV/action/storage_attestation","attest_author":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV/action/author_attestation","sign_citation":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV/action/citation_signature","submit_replication":"https://pith.science/pith/SSYPTVP6M2DORJNBUL6YKMLCKV/action/replication_record"}},"created_at":"2026-07-05T05:21:32.742343+00:00","updated_at":"2026-07-05T05:21:32.742343+00:00"}