{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3ZNE6AYECRZD5UMM5PINP2Y7WE","short_pith_number":"pith:3ZNE6AYE","schema_version":"1.0","canonical_sha256":"de5a4f030414723ed18cebd0d7eb1fb1264d8d336d4454cfea07382eb0e7df28","source":{"kind":"arxiv","id":"1710.04731","version":2},"attestation_state":"computed","paper":{"title":"Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.SY","authors_text":"Claire J. Tomlin, David Fridovich-Keil, Jaime F. Fisac, Sampada Deglurkar, Sylvia L. Herbert","submitted_at":"2017-10-12T21:45:24Z","abstract_excerpt":"Motion planning is an extremely well-studied problem in the robotics community, yet existing work largely falls into one of two categories: computationally efficient but with few if any safety guarantees, or able to give stronger guarantees but at high computational cost. This work builds on a recent development called FaSTrack in which a slow offline computation provides a modular safety guarantee for a faster online planner. We introduce the notion of \"meta-planning\" in which a refined offline computation enables safe switching between different online planners. This provides autonomous syst"},"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":"1710.04731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-12T21:45:24Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"cba5fea145b4fb50f1e1a1c7b2fe43b3690e488d185acb764c372d594cafab15","abstract_canon_sha256":"24c83a1b9af1006ac70442b35d9c453e169ed138cedd31c8fdc7eb2669fe6f11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:50.918101Z","signature_b64":"tSwgH3wl7AZgrYaYaBxCEWuQNjjCnv+CAJUW8Tfb+TUAeoySB/0PEnBoi6RrwVJGFhJ7pOQb+s3k3LSQLz4DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5a4f030414723ed18cebd0d7eb1fb1264d8d336d4454cfea07382eb0e7df28","last_reissued_at":"2026-05-18T00:21:50.917450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:50.917450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.SY","authors_text":"Claire J. Tomlin, David Fridovich-Keil, Jaime F. Fisac, Sampada Deglurkar, Sylvia L. Herbert","submitted_at":"2017-10-12T21:45:24Z","abstract_excerpt":"Motion planning is an extremely well-studied problem in the robotics community, yet existing work largely falls into one of two categories: computationally efficient but with few if any safety guarantees, or able to give stronger guarantees but at high computational cost. This work builds on a recent development called FaSTrack in which a slow offline computation provides a modular safety guarantee for a faster online planner. We introduce the notion of \"meta-planning\" in which a refined offline computation enables safe switching between different online planners. This provides autonomous syst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04731","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":""},"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":"1710.04731","created_at":"2026-05-18T00:21:50.917550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04731v2","created_at":"2026-05-18T00:21:50.917550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04731","created_at":"2026-05-18T00:21:50.917550+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZNE6AYECRZD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZNE6AYECRZD5UMM","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZNE6AYE","created_at":"2026-05-18T12:30:58.224056+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/3ZNE6AYECRZD5UMM5PINP2Y7WE","json":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE.json","graph_json":"https://pith.science/api/pith-number/3ZNE6AYECRZD5UMM5PINP2Y7WE/graph.json","events_json":"https://pith.science/api/pith-number/3ZNE6AYECRZD5UMM5PINP2Y7WE/events.json","paper":"https://pith.science/paper/3ZNE6AYE"},"agent_actions":{"view_html":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE","download_json":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE.json","view_paper":"https://pith.science/paper/3ZNE6AYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04731&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZNE6AYECRZD5UMM5PINP2Y7WE/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZNE6AYECRZD5UMM5PINP2Y7WE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/action/storage_attestation","attest_author":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/action/author_attestation","sign_citation":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/action/citation_signature","submit_replication":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/action/replication_record"}},"created_at":"2026-05-18T00:21:50.917550+00:00","updated_at":"2026-05-18T00:21:50.917550+00:00"}