{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BOGHALVZG3SYZ3LENVHRNHPKTR","short_pith_number":"pith:BOGHALVZ","schema_version":"1.0","canonical_sha256":"0b8c702eb936e58ced646d4f169dea9c4624eb9035f5e78f7c97f909334ee1f3","source":{"kind":"arxiv","id":"2307.08602","version":2},"attestation_state":"computed","paper":{"title":"CaRT: Certified Safety and Robust Tracking in Learning-based Motion Planning for Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Amir Rahmani, Benjamin Rivi\\`ere, Changrak Choi, Hiroyasu Tsukamoto, Soon-Jo Chung","submitted_at":"2023-07-13T21:51:29Z","abstract_excerpt":"The key innovation of our analytical method, CaRT, lies in establishing a new hierarchical, distributed architecture to guarantee the safety and robustness of a given learning-based motion planning policy. First, in a nominal setting, the analytical form of our CaRT safety filter formally ensures safe maneuvers of nonlinear multi-agent systems, optimally with minimal deviation from the learning-based policy. Second, in off-nominal settings, the analytical form of our CaRT robust filter optimally tracks the certified safe trajectory, generated by the previous layer in the hierarchy, the CaRT sa"},"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":"2307.08602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-07-13T21:51:29Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","eess.SY","math.OC"],"title_canon_sha256":"21ee4077342c063eba77759c7bb02d6d934e92e28af711cb8decddee4b41fcab","abstract_canon_sha256":"93b0dce103a801434cc6d930bad4806df1487fd7611e722f84a6a32fdb430c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:35.482698Z","signature_b64":"Lhu24kdqfqSKd6aRwmt8QHiTsBC5Wp5oinxUkbce7+6rzNhpSzqwcL9eaajzybvsDeG9ig1J9NXcpev+IjP5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8c702eb936e58ced646d4f169dea9c4624eb9035f5e78f7c97f909334ee1f3","last_reissued_at":"2026-07-05T06:40:35.482124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:35.482124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CaRT: Certified Safety and Robust Tracking in Learning-based Motion Planning for Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Amir Rahmani, Benjamin Rivi\\`ere, Changrak Choi, Hiroyasu Tsukamoto, Soon-Jo Chung","submitted_at":"2023-07-13T21:51:29Z","abstract_excerpt":"The key innovation of our analytical method, CaRT, lies in establishing a new hierarchical, distributed architecture to guarantee the safety and robustness of a given learning-based motion planning policy. First, in a nominal setting, the analytical form of our CaRT safety filter formally ensures safe maneuvers of nonlinear multi-agent systems, optimally with minimal deviation from the learning-based policy. Second, in off-nominal settings, the analytical form of our CaRT robust filter optimally tracks the certified safe trajectory, generated by the previous layer in the hierarchy, the CaRT sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08602","kind":"arxiv","version":2},"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/2307.08602/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":"2307.08602","created_at":"2026-07-05T06:40:35.482176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08602v2","created_at":"2026-07-05T06:40:35.482176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08602","created_at":"2026-07-05T06:40:35.482176+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOGHALVZG3SY","created_at":"2026-07-05T06:40:35.482176+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOGHALVZG3SYZ3LE","created_at":"2026-07-05T06:40:35.482176+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOGHALVZ","created_at":"2026-07-05T06:40:35.482176+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/BOGHALVZG3SYZ3LENVHRNHPKTR","json":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR.json","graph_json":"https://pith.science/api/pith-number/BOGHALVZG3SYZ3LENVHRNHPKTR/graph.json","events_json":"https://pith.science/api/pith-number/BOGHALVZG3SYZ3LENVHRNHPKTR/events.json","paper":"https://pith.science/paper/BOGHALVZ"},"agent_actions":{"view_html":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR","download_json":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR.json","view_paper":"https://pith.science/paper/BOGHALVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08602&json=true","fetch_graph":"https://pith.science/api/pith-number/BOGHALVZG3SYZ3LENVHRNHPKTR/graph.json","fetch_events":"https://pith.science/api/pith-number/BOGHALVZG3SYZ3LENVHRNHPKTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR/action/storage_attestation","attest_author":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR/action/author_attestation","sign_citation":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR/action/citation_signature","submit_replication":"https://pith.science/pith/BOGHALVZG3SYZ3LENVHRNHPKTR/action/replication_record"}},"created_at":"2026-07-05T06:40:35.482176+00:00","updated_at":"2026-07-05T06:40:35.482176+00:00"}