{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:42ODNBNDFZTBHCTCZJVJ5GKKE7","short_pith_number":"pith:42ODNBND","schema_version":"1.0","canonical_sha256":"e69c3685a32e66138a62ca6a9e994a27e7ec33866d98b56ea8b51ad897ebdeea","source":{"kind":"arxiv","id":"2507.10878","version":1},"attestation_state":"computed","paper":{"title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexandre Amice, Bernhard Paus Graesdal, Pablo A. Parrilo, Russ Tedrake, Savva Morozov, Tobia Marcucci","submitted_at":"2025-07-15T00:42:02Z","abstract_excerpt":"We study the Shortest-Walk Problem (SWP) in a Graph of Convex Sets (GCS). A GCS is a graph where each vertex is paired with a convex program, and each edge couples adjacent programs via additional costs and constraints. A walk in a GCS is a sequence of vertices connected by edges, where vertices may be repeated. The length of a walk is given by the cumulative optimal value of the corresponding convex programs. To solve the SWP in GCS, we first synthesize a piecewise-quadratic lower bound on the problem's cost-to-go function using semidefinite programming. Then we use this lower bound to guide "},"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":"2507.10878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-07-15T00:42:02Z","cross_cats_sorted":[],"title_canon_sha256":"7d7526a2bf4f61a6edd4796f19534b5f16f77a8610ba6e84785e45c0907e814f","abstract_canon_sha256":"aa33dfc527e9f2a4fd055a281d8fd528bc2d2ad84b2895143fafee93899347d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:27.614601Z","signature_b64":"FswtAks9bPVFkleKgY7kZy5+fEfAw59FHddhrE95WYIlgNCuOxDICi+jJqV6d5MbuVKAzb7JFu4/o4xg/iQeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e69c3685a32e66138a62ca6a9e994a27e7ec33866d98b56ea8b51ad897ebdeea","last_reissued_at":"2026-07-05T11:37:27.614084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:27.614084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexandre Amice, Bernhard Paus Graesdal, Pablo A. Parrilo, Russ Tedrake, Savva Morozov, Tobia Marcucci","submitted_at":"2025-07-15T00:42:02Z","abstract_excerpt":"We study the Shortest-Walk Problem (SWP) in a Graph of Convex Sets (GCS). A GCS is a graph where each vertex is paired with a convex program, and each edge couples adjacent programs via additional costs and constraints. A walk in a GCS is a sequence of vertices connected by edges, where vertices may be repeated. The length of a walk is given by the cumulative optimal value of the corresponding convex programs. To solve the SWP in GCS, we first synthesize a piecewise-quadratic lower bound on the problem's cost-to-go function using semidefinite programming. Then we use this lower bound to guide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10878","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/2507.10878/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":"2507.10878","created_at":"2026-07-05T11:37:27.614148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.10878v1","created_at":"2026-07-05T11:37:27.614148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10878","created_at":"2026-07-05T11:37:27.614148+00:00"},{"alias_kind":"pith_short_12","alias_value":"42ODNBNDFZTB","created_at":"2026-07-05T11:37:27.614148+00:00"},{"alias_kind":"pith_short_16","alias_value":"42ODNBNDFZTBHCTC","created_at":"2026-07-05T11:37:27.614148+00:00"},{"alias_kind":"pith_short_8","alias_value":"42ODNBND","created_at":"2026-07-05T11:37:27.614148+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00444","citing_title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7","json":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7.json","graph_json":"https://pith.science/api/pith-number/42ODNBNDFZTBHCTCZJVJ5GKKE7/graph.json","events_json":"https://pith.science/api/pith-number/42ODNBNDFZTBHCTCZJVJ5GKKE7/events.json","paper":"https://pith.science/paper/42ODNBND"},"agent_actions":{"view_html":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7","download_json":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7.json","view_paper":"https://pith.science/paper/42ODNBND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.10878&json=true","fetch_graph":"https://pith.science/api/pith-number/42ODNBNDFZTBHCTCZJVJ5GKKE7/graph.json","fetch_events":"https://pith.science/api/pith-number/42ODNBNDFZTBHCTCZJVJ5GKKE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7/action/storage_attestation","attest_author":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7/action/author_attestation","sign_citation":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7/action/citation_signature","submit_replication":"https://pith.science/pith/42ODNBNDFZTBHCTCZJVJ5GKKE7/action/replication_record"}},"created_at":"2026-07-05T11:37:27.614148+00:00","updated_at":"2026-07-05T11:37:27.614148+00:00"}