{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J6HGKJDVRVO6GWTAD3EMWEOBHA","short_pith_number":"pith:J6HGKJDV","schema_version":"1.0","canonical_sha256":"4f8e6524758d5de35a601ec8cb11c1383b4f18c5251a8b14775d36ff14502265","source":{"kind":"arxiv","id":"2605.23240","version":1},"attestation_state":"computed","paper":{"title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Ancheng Hou, Mingyang Feng, Xiang Yin, Xiao Yu, Yu Chen","submitted_at":"2026-05-22T05:19:43Z","abstract_excerpt":"This paper investigates continuous-time motion planning under Signal Temporal Logic (STL) specifications. The goal is to generate smooth robot trajectories that satisfy high-level logical and timing requirements while respecting low-level motion constraints. To this end, we propose an efficient framework that combines timed-automata reasoning with graphs of convex sets (GCS). An STL specification is first represented by a timed automaton, which is then coupled with a convex decomposition of the configuration space to form a joint transition system encoding both task progress and region occupan"},"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":"2605.23240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-22T05:19:43Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"3940d2beec645ff5babafe3305266504284c88a2a1477eb0d4a0cf9083b2d07d","abstract_canon_sha256":"c02cbdfeefc7aac5206d75fae08b9fd915f3890ab4a12dc039b5fa938e89f705"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:45.229779Z","signature_b64":"7geUDnrPG4/SNgqKMn+vuN36scNT3daYRFWVDpc/bnCDozRYlmO8PnbUQGU0Yp/tDX3XrUI2qKSuNmmdy6tVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f8e6524758d5de35a601ec8cb11c1383b4f18c5251a8b14775d36ff14502265","last_reissued_at":"2026-05-25T02:01:45.229039Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:45.229039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Ancheng Hou, Mingyang Feng, Xiang Yin, Xiao Yu, Yu Chen","submitted_at":"2026-05-22T05:19:43Z","abstract_excerpt":"This paper investigates continuous-time motion planning under Signal Temporal Logic (STL) specifications. The goal is to generate smooth robot trajectories that satisfy high-level logical and timing requirements while respecting low-level motion constraints. To this end, we propose an efficient framework that combines timed-automata reasoning with graphs of convex sets (GCS). An STL specification is first represented by a timed automaton, which is then coupled with a convex decomposition of the configuration space to form a joint transition system encoding both task progress and region occupan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23240","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/2605.23240/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":"2605.23240","created_at":"2026-05-25T02:01:45.229161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23240v1","created_at":"2026-05-25T02:01:45.229161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23240","created_at":"2026-05-25T02:01:45.229161+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6HGKJDVRVO6","created_at":"2026-05-25T02:01:45.229161+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6HGKJDVRVO6GWTA","created_at":"2026-05-25T02:01:45.229161+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6HGKJDV","created_at":"2026-05-25T02:01:45.229161+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/J6HGKJDVRVO6GWTAD3EMWEOBHA","json":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA.json","graph_json":"https://pith.science/api/pith-number/J6HGKJDVRVO6GWTAD3EMWEOBHA/graph.json","events_json":"https://pith.science/api/pith-number/J6HGKJDVRVO6GWTAD3EMWEOBHA/events.json","paper":"https://pith.science/paper/J6HGKJDV"},"agent_actions":{"view_html":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA","download_json":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA.json","view_paper":"https://pith.science/paper/J6HGKJDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23240&json=true","fetch_graph":"https://pith.science/api/pith-number/J6HGKJDVRVO6GWTAD3EMWEOBHA/graph.json","fetch_events":"https://pith.science/api/pith-number/J6HGKJDVRVO6GWTAD3EMWEOBHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA/action/storage_attestation","attest_author":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA/action/author_attestation","sign_citation":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA/action/citation_signature","submit_replication":"https://pith.science/pith/J6HGKJDVRVO6GWTAD3EMWEOBHA/action/replication_record"}},"created_at":"2026-05-25T02:01:45.229161+00:00","updated_at":"2026-05-25T02:01:45.229161+00:00"}