{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3ZNE6AYECRZD5UMM5PINP2Y7WE","short_pith_number":"pith:3ZNE6AYE","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"},"canonical_sha256":"de5a4f030414723ed18cebd0d7eb1fb1264d8d336d4454cfea07382eb0e7df28","source":{"kind":"arxiv","id":"1710.04731","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04731","created_at":"2026-05-18T00:21:50Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04731v2","created_at":"2026-05-18T00:21:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04731","created_at":"2026-05-18T00:21:50Z"},{"alias_kind":"pith_short_12","alias_value":"3ZNE6AYECRZD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZNE6AYECRZD5UMM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZNE6AYE","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3ZNE6AYECRZD5UMM5PINP2Y7WE","target":"record","payload":{"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"},"canonical_sha256":"de5a4f030414723ed18cebd0d7eb1fb1264d8d336d4454cfea07382eb0e7df28","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"},"source_kind":"arxiv","source_id":"1710.04731","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tD/lvIboTJuUpmYSCkWIOLeoIFdXWWwkBgMJZCQny91UtF0wmklc+v/BwKEuYEMR69uuABxItS3ruTtHl0XACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:08:33.978215Z"},"content_sha256":"607ba0fffd0f18ffccb7afc5d109c50a733bdaa284d3f9249347632c1c89e832","schema_version":"1.0","event_id":"sha256:607ba0fffd0f18ffccb7afc5d109c50a733bdaa284d3f9249347632c1c89e832"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3ZNE6AYECRZD5UMM5PINP2Y7WE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+HD+HhtFSXiJFuFDZYK0zo2VNvqecCIikQXRpoJhVK08m8sI6ldLjpz1IWwVnRs/eIolgw12QO1uPrnoHUDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:08:33.978585Z"},"content_sha256":"e8a4610da1a5c68494c06548edfd35d586ba660aa2305bee4f14f1fdd7bced01","schema_version":"1.0","event_id":"sha256:e8a4610da1a5c68494c06548edfd35d586ba660aa2305bee4f14f1fdd7bced01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/bundle.json","state_url":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T19:08:33Z","links":{"resolver":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE","bundle":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/bundle.json","state":"https://pith.science/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZNE6AYECRZD5UMM5PINP2Y7WE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ZNE6AYECRZD5UMM5PINP2Y7WE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"24c83a1b9af1006ac70442b35d9c453e169ed138cedd31c8fdc7eb2669fe6f11","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-12T21:45:24Z","title_canon_sha256":"cba5fea145b4fb50f1e1a1c7b2fe43b3690e488d185acb764c372d594cafab15"},"schema_version":"1.0","source":{"id":"1710.04731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04731","created_at":"2026-05-18T00:21:50Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04731v2","created_at":"2026-05-18T00:21:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04731","created_at":"2026-05-18T00:21:50Z"},{"alias_kind":"pith_short_12","alias_value":"3ZNE6AYECRZD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZNE6AYECRZD5UMM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZNE6AYE","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:e8a4610da1a5c68494c06548edfd35d586ba660aa2305bee4f14f1fdd7bced01","target":"graph","created_at":"2026-05-18T00:21:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Claire J. Tomlin, David Fridovich-Keil, Jaime F. Fisac, Sampada Deglurkar, Sylvia L. Herbert","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-12T21:45:24Z","title":"Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04731","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:607ba0fffd0f18ffccb7afc5d109c50a733bdaa284d3f9249347632c1c89e832","target":"record","created_at":"2026-05-18T00:21:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"24c83a1b9af1006ac70442b35d9c453e169ed138cedd31c8fdc7eb2669fe6f11","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-12T21:45:24Z","title_canon_sha256":"cba5fea145b4fb50f1e1a1c7b2fe43b3690e488d185acb764c372d594cafab15"},"schema_version":"1.0","source":{"id":"1710.04731","kind":"arxiv","version":2}},"canonical_sha256":"de5a4f030414723ed18cebd0d7eb1fb1264d8d336d4454cfea07382eb0e7df28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de5a4f030414723ed18cebd0d7eb1fb1264d8d336d4454cfea07382eb0e7df28","first_computed_at":"2026-05-18T00:21:50.917450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:50.917450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tSwgH3wl7AZgrYaYaBxCEWuQNjjCnv+CAJUW8Tfb+TUAeoySB/0PEnBoi6RrwVJGFhJ7pOQb+s3k3LSQLz4DAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:50.918101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:607ba0fffd0f18ffccb7afc5d109c50a733bdaa284d3f9249347632c1c89e832","sha256:e8a4610da1a5c68494c06548edfd35d586ba660aa2305bee4f14f1fdd7bced01"],"state_sha256":"0e0359d6a2d7fe8ea945243ac890450373f41c0dd0a7c8f353c4c490fb43622e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJI4jJ61kg3pSE+Z77t2wigUDhhpY2sSftxfgUsnuru9xPjrZxSkyJkRIAmesIptlqy23rO1mBQhqj5oS4hMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:08:33.980522Z","bundle_sha256":"d030b65c383d9be93a49a0738204ed029f35b6aa486564780c75ed28410fd1c2"}}