{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:U5AMDU7ARZWRZLVJIFA5E2TWWB","short_pith_number":"pith:U5AMDU7A","schema_version":"1.0","canonical_sha256":"a740c1d3e08e6d1caea94141d26a76b07493d129ee4bdf1729edd486df7f0f8b","source":{"kind":"arxiv","id":"2607.00444","version":1},"attestation_state":"computed","paper":{"title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Hang Ma, Jingtao Tang, Lufan Yang, Zining Mao","submitted_at":"2026-07-01T04:58:00Z","abstract_excerpt":"Spatiotemporal motion planning, especially in multi-robot settings, requires robots to reason about collision-free regions that change over time, which is challenging in continuous spaces when feasible regions are transient and geometrically constrained. We present an algorithmic framework based on graphs of space-time convex sets (ST-GCSs), where collision-free regions are represented as convex sets in space-time and trajectories correspond to paths on the graph together with continuous motions within the selected sets. We formulate time-optimal planning on ST-GCSs as a graph-search problem o"},"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":"2607.00444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-07-01T04:58:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e8d44d393cf0938ed8c7fcbf28e06725283822699f397c0c7b18f08a0b679b19","abstract_canon_sha256":"ef2003f84ae29b447db2dccc656c3f5d9c8d4b25849b0ae8b9f0e91f224698f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:43.543287Z","signature_b64":"IzJZUbz/cnByn7Rskjx196xmMCpmRxbwWOZz1A0WS2iwpjrehue4aCfEspqwBGWRyZHYWQFxaWTKiXHF3bKTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a740c1d3e08e6d1caea94141d26a76b07493d129ee4bdf1729edd486df7f0f8b","last_reissued_at":"2026-07-02T01:17:43.542887Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:43.542887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Hang Ma, Jingtao Tang, Lufan Yang, Zining Mao","submitted_at":"2026-07-01T04:58:00Z","abstract_excerpt":"Spatiotemporal motion planning, especially in multi-robot settings, requires robots to reason about collision-free regions that change over time, which is challenging in continuous spaces when feasible regions are transient and geometrically constrained. We present an algorithmic framework based on graphs of space-time convex sets (ST-GCSs), where collision-free regions are represented as convex sets in space-time and trajectories correspond to paths on the graph together with continuous motions within the selected sets. We formulate time-optimal planning on ST-GCSs as a graph-search problem o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00444","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/2607.00444/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":"2607.00444","created_at":"2026-07-02T01:17:43.542950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00444v1","created_at":"2026-07-02T01:17:43.542950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00444","created_at":"2026-07-02T01:17:43.542950+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5AMDU7ARZWR","created_at":"2026-07-02T01:17:43.542950+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5AMDU7ARZWRZLVJ","created_at":"2026-07-02T01:17:43.542950+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5AMDU7A","created_at":"2026-07-02T01:17:43.542950+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/U5AMDU7ARZWRZLVJIFA5E2TWWB","json":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB.json","graph_json":"https://pith.science/api/pith-number/U5AMDU7ARZWRZLVJIFA5E2TWWB/graph.json","events_json":"https://pith.science/api/pith-number/U5AMDU7ARZWRZLVJIFA5E2TWWB/events.json","paper":"https://pith.science/paper/U5AMDU7A"},"agent_actions":{"view_html":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB","download_json":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB.json","view_paper":"https://pith.science/paper/U5AMDU7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00444&json=true","fetch_graph":"https://pith.science/api/pith-number/U5AMDU7ARZWRZLVJIFA5E2TWWB/graph.json","fetch_events":"https://pith.science/api/pith-number/U5AMDU7ARZWRZLVJIFA5E2TWWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB/action/storage_attestation","attest_author":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB/action/author_attestation","sign_citation":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB/action/citation_signature","submit_replication":"https://pith.science/pith/U5AMDU7ARZWRZLVJIFA5E2TWWB/action/replication_record"}},"created_at":"2026-07-02T01:17:43.542950+00:00","updated_at":"2026-07-02T01:17:43.542950+00:00"}