{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YJVNX3ZI7GACKZBPO2GOVOC4T2","short_pith_number":"pith:YJVNX3ZI","canonical_record":{"source":{"id":"2301.07773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-18T20:28:28Z","cross_cats_sorted":["cs.FL","cs.SY","eess.SY"],"title_canon_sha256":"e8a97dab6a42e7dcf5981f1ea003b30038aa995d272b87fe95e5fc399a227099","abstract_canon_sha256":"c09d20aa2ebf4d39f7d1dc78f445eadd6e9cef23e617e86d22c86a16910288a4"},"schema_version":"1.0"},"canonical_sha256":"c26adbef28f98025642f768ceab85c9ea6fe827d6a69063c13f0e47aaf28872d","source":{"kind":"arxiv","id":"2301.07773","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07773","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07773v2","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07773","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"YJVNX3ZI7GAC","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"pith_short_16","alias_value":"YJVNX3ZI7GACKZBP","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"pith_short_8","alias_value":"YJVNX3ZI","created_at":"2026-07-05T06:16:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YJVNX3ZI7GACKZBPO2GOVOC4T2","target":"record","payload":{"canonical_record":{"source":{"id":"2301.07773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-18T20:28:28Z","cross_cats_sorted":["cs.FL","cs.SY","eess.SY"],"title_canon_sha256":"e8a97dab6a42e7dcf5981f1ea003b30038aa995d272b87fe95e5fc399a227099","abstract_canon_sha256":"c09d20aa2ebf4d39f7d1dc78f445eadd6e9cef23e617e86d22c86a16910288a4"},"schema_version":"1.0"},"canonical_sha256":"c26adbef28f98025642f768ceab85c9ea6fe827d6a69063c13f0e47aaf28872d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:15.106151Z","signature_b64":"2VHeLdCzqhmvtNlAUaRQH49zb59D1qFPlqexaRwd7yxSw+6vk6iYVS1ZEx5N4ZjSTqs1c1wRoioods0I6TRRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c26adbef28f98025642f768ceab85c9ea6fe827d6a69063c13f0e47aaf28872d","last_reissued_at":"2026-07-05T06:16:15.105722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:15.105722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.07773","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-07-05T06:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29EjshPGYxz4iyjzQgRzR/l18Z+FvuD8L6FF+pN+lKsPhrCQF23g94lSUalLY2v8IwSNah4Pex/b7j/kThUjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:35:46.395134Z"},"content_sha256":"6f50c1105e863341b04923675351a68124f938f08eb175a97b139c56ea845011","schema_version":"1.0","event_id":"sha256:6f50c1105e863341b04923675351a68124f938f08eb175a97b139c56ea845011"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YJVNX3ZI7GACKZBPO2GOVOC4T2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Logic Motion Planning with Convex Optimization via Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Hai Lin, Vince Kurtz","submitted_at":"2023-01-18T20:28:28Z","abstract_excerpt":"Temporal logic is a concise way of specifying complex tasks. But motion planning to achieve temporal logic specifications is difficult, and existing methods struggle to scale to complex specifications and high-dimensional system dynamics. In this paper, we cast Linear Temporal Logic (LTL) motion planning as a shortest path problem in a Graph of Convex Sets (GCS) and solve it with convex optimization. This approach brings together the best of modern optimization-based temporal logic planners and older automata-theoretic methods, addressing the limitations of each: we avoid clipping and passthro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07773","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/2301.07773/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"},"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-07-05T06:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTSiYhKyGaFU/CKzj5wt2lucYtaTa4N6xV/xgye/XwHEvSIoCNuTh0mU0OKLLgkqoa5hoCo+K7o4RRdu6gj0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:35:46.395551Z"},"content_sha256":"722d3974037af74fb7cebd20caf3c6fef0ccb46adf80991c58587f73dff3d133","schema_version":"1.0","event_id":"sha256:722d3974037af74fb7cebd20caf3c6fef0ccb46adf80991c58587f73dff3d133"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2/bundle.json","state_url":"https://pith.science/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2/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-07-07T13:35:46Z","links":{"resolver":"https://pith.science/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2","bundle":"https://pith.science/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2/bundle.json","state":"https://pith.science/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJVNX3ZI7GACKZBPO2GOVOC4T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YJVNX3ZI7GACKZBPO2GOVOC4T2","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":"c09d20aa2ebf4d39f7d1dc78f445eadd6e9cef23e617e86d22c86a16910288a4","cross_cats_sorted":["cs.FL","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-18T20:28:28Z","title_canon_sha256":"e8a97dab6a42e7dcf5981f1ea003b30038aa995d272b87fe95e5fc399a227099"},"schema_version":"1.0","source":{"id":"2301.07773","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07773","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07773v2","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07773","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"YJVNX3ZI7GAC","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"pith_short_16","alias_value":"YJVNX3ZI7GACKZBP","created_at":"2026-07-05T06:16:15Z"},{"alias_kind":"pith_short_8","alias_value":"YJVNX3ZI","created_at":"2026-07-05T06:16:15Z"}],"graph_snapshots":[{"event_id":"sha256:722d3974037af74fb7cebd20caf3c6fef0ccb46adf80991c58587f73dff3d133","target":"graph","created_at":"2026-07-05T06:16:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.07773/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Temporal logic is a concise way of specifying complex tasks. But motion planning to achieve temporal logic specifications is difficult, and existing methods struggle to scale to complex specifications and high-dimensional system dynamics. In this paper, we cast Linear Temporal Logic (LTL) motion planning as a shortest path problem in a Graph of Convex Sets (GCS) and solve it with convex optimization. This approach brings together the best of modern optimization-based temporal logic planners and older automata-theoretic methods, addressing the limitations of each: we avoid clipping and passthro","authors_text":"Hai Lin, Vince Kurtz","cross_cats":["cs.FL","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-18T20:28:28Z","title":"Temporal Logic Motion Planning with Convex Optimization via Graphs of Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07773","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:6f50c1105e863341b04923675351a68124f938f08eb175a97b139c56ea845011","target":"record","created_at":"2026-07-05T06:16:15Z","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":"c09d20aa2ebf4d39f7d1dc78f445eadd6e9cef23e617e86d22c86a16910288a4","cross_cats_sorted":["cs.FL","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-18T20:28:28Z","title_canon_sha256":"e8a97dab6a42e7dcf5981f1ea003b30038aa995d272b87fe95e5fc399a227099"},"schema_version":"1.0","source":{"id":"2301.07773","kind":"arxiv","version":2}},"canonical_sha256":"c26adbef28f98025642f768ceab85c9ea6fe827d6a69063c13f0e47aaf28872d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c26adbef28f98025642f768ceab85c9ea6fe827d6a69063c13f0e47aaf28872d","first_computed_at":"2026-07-05T06:16:15.105722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:16:15.105722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2VHeLdCzqhmvtNlAUaRQH49zb59D1qFPlqexaRwd7yxSw+6vk6iYVS1ZEx5N4ZjSTqs1c1wRoioods0I6TRRDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:16:15.106151Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.07773","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f50c1105e863341b04923675351a68124f938f08eb175a97b139c56ea845011","sha256:722d3974037af74fb7cebd20caf3c6fef0ccb46adf80991c58587f73dff3d133"],"state_sha256":"2c18c2113e18fb29eb723ec14e62483bd55ae7ad16aad2c8a043dbdfc6f90470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xq4xm0/3tqxYaPBd261VCmwlI2cnAtyGlel0rnBp3zlNlwVVqMb/3f75g8fQgh7T7SKlmUGFu85GiIIgzFtmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:35:46.398559Z","bundle_sha256":"6613b58059d33aaad377ef8e52fc6a05c7e93a9e57d3d8dbe546929ebf0a5aa8"}}