{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N7XQ6ZCEVEI6PCCP5WEULAXMQS","short_pith_number":"pith:N7XQ6ZCE","schema_version":"1.0","canonical_sha256":"6fef0f6444a911e7884fed894582ec84bbb972d9fc97c143b947aa77e9cd60cc","source":{"kind":"arxiv","id":"2410.08909","version":1},"attestation_state":"computed","paper":{"title":"Implicit Graph Search for Planning on Graphs of Convex Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chaoqi Liu, Howie Choset, Maxim Likhachev, Ramkumar Natarajan","submitted_at":"2024-10-11T15:29:49Z","abstract_excerpt":"Graphs of Convex Sets (GCS) is a recent method for synthesizing smooth trajectories by decomposing the planning space into convex sets, forming a graph to encode the adjacency relationships within the decomposition, and then simultaneously searching this graph and optimizing parts of the trajectory to obtain the final trajectory. To do this, one must solve a Mixed Integer Convex Program (MICP) and to mitigate computational time, GCS proposes a convex relaxation that is empirically very tight. Despite this tight relaxation, motion planning with GCS for real-world robotics problems translates to"},"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":"2410.08909","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-10-11T15:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"4a783af9f7f7188c1584c071b19a400216002a4371f43acefb7160dba930598f","abstract_canon_sha256":"f2cd3af38cf869ad2b7c7e84e995861d032191c53bfeeb30bddffe2ad6fbcffe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:19.435890Z","signature_b64":"E7eCRnRRgOw26MfCRt8eE28gwFrOn/wp61N6tqJ3CmQToKjPZ2MNeR5m6f7cmnqRFE1h3AJAzK2422kzBBwqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fef0f6444a911e7884fed894582ec84bbb972d9fc97c143b947aa77e9cd60cc","last_reissued_at":"2026-07-05T09:19:19.435404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:19.435404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implicit Graph Search for Planning on Graphs of Convex Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chaoqi Liu, Howie Choset, Maxim Likhachev, Ramkumar Natarajan","submitted_at":"2024-10-11T15:29:49Z","abstract_excerpt":"Graphs of Convex Sets (GCS) is a recent method for synthesizing smooth trajectories by decomposing the planning space into convex sets, forming a graph to encode the adjacency relationships within the decomposition, and then simultaneously searching this graph and optimizing parts of the trajectory to obtain the final trajectory. To do this, one must solve a Mixed Integer Convex Program (MICP) and to mitigate computational time, GCS proposes a convex relaxation that is empirically very tight. Despite this tight relaxation, motion planning with GCS for real-world robotics problems translates to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08909","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/2410.08909/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":"2410.08909","created_at":"2026-07-05T09:19:19.435461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08909v1","created_at":"2026-07-05T09:19:19.435461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08909","created_at":"2026-07-05T09:19:19.435461+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7XQ6ZCEVEI6","created_at":"2026-07-05T09:19:19.435461+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7XQ6ZCEVEI6PCCP","created_at":"2026-07-05T09:19:19.435461+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7XQ6ZCE","created_at":"2026-07-05T09:19:19.435461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00842","citing_title":"A Framework for Motion Planning with Temporal Logic Precedence Specifications via Augmented Graphs of Convex Sets","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS","json":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS.json","graph_json":"https://pith.science/api/pith-number/N7XQ6ZCEVEI6PCCP5WEULAXMQS/graph.json","events_json":"https://pith.science/api/pith-number/N7XQ6ZCEVEI6PCCP5WEULAXMQS/events.json","paper":"https://pith.science/paper/N7XQ6ZCE"},"agent_actions":{"view_html":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS","download_json":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS.json","view_paper":"https://pith.science/paper/N7XQ6ZCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08909&json=true","fetch_graph":"https://pith.science/api/pith-number/N7XQ6ZCEVEI6PCCP5WEULAXMQS/graph.json","fetch_events":"https://pith.science/api/pith-number/N7XQ6ZCEVEI6PCCP5WEULAXMQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS/action/storage_attestation","attest_author":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS/action/author_attestation","sign_citation":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS/action/citation_signature","submit_replication":"https://pith.science/pith/N7XQ6ZCEVEI6PCCP5WEULAXMQS/action/replication_record"}},"created_at":"2026-07-05T09:19:19.435461+00:00","updated_at":"2026-07-05T09:19:19.435461+00:00"}