{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4GBEIECT7SQZGDNXLA4TGOT5SE","short_pith_number":"pith:4GBEIECT","schema_version":"1.0","canonical_sha256":"e182441053fca1930db75839333a7d910c54316a2a13844986fcb9596ae0f02f","source":{"kind":"arxiv","id":"2407.17413","version":3},"attestation_state":"computed","paper":{"title":"$A^*$ for Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"math.OC","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","submitted_at":"2024-07-24T16:48:32Z","abstract_excerpt":"We present a novel algorithm that fuses the existing convex-programming based approach with heuristic information to find optimality guarantees and near-optimal paths for the Shortest Path Problem in the Graph of Convex Sets (SPP-GCS). Our method, inspired by $A^*$, initiates a best-first-like procedure from a designated subset of vertices and iteratively expands it until further growth is neither possible nor beneficial. Traditionally, obtaining solutions with bounds for an optimization problem involves solving a relaxation, modifying the relaxed solution to a feasible one, and then comparing"},"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":"2407.17413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T16:48:32Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"5c9f15aa6b73d7238efd5611a82eec500acf03e4e18523f4dac669bc04515553","abstract_canon_sha256":"4c907bbb436bc0dd49ebe5abf7767abbbecd84f26d4a59f7cee188c7b0a806fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:24.186649Z","signature_b64":"E3tc+8O33eBsPpzmLqo0ytPvBEv69zjaq1S2wdUKCRETpSjLeQmYpqKREtsgE1L5H5Tg7nqF8A+He3ocaBiuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e182441053fca1930db75839333a7d910c54316a2a13844986fcb9596ae0f02f","last_reissued_at":"2026-07-05T10:51:24.186145Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:24.186145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$A^*$ for Graphs of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"math.OC","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","submitted_at":"2024-07-24T16:48:32Z","abstract_excerpt":"We present a novel algorithm that fuses the existing convex-programming based approach with heuristic information to find optimality guarantees and near-optimal paths for the Shortest Path Problem in the Graph of Convex Sets (SPP-GCS). Our method, inspired by $A^*$, initiates a best-first-like procedure from a designated subset of vertices and iteratively expands it until further growth is neither possible nor beneficial. Traditionally, obtaining solutions with bounds for an optimization problem involves solving a relaxation, modifying the relaxed solution to a feasible one, and then comparing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17413","kind":"arxiv","version":3},"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/2407.17413/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":"2407.17413","created_at":"2026-07-05T10:51:24.186201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17413v3","created_at":"2026-07-05T10:51:24.186201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17413","created_at":"2026-07-05T10:51:24.186201+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GBEIECT7SQZ","created_at":"2026-07-05T10:51:24.186201+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GBEIECT7SQZGDNX","created_at":"2026-07-05T10:51:24.186201+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GBEIECT","created_at":"2026-07-05T10:51:24.186201+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":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE","json":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE.json","graph_json":"https://pith.science/api/pith-number/4GBEIECT7SQZGDNXLA4TGOT5SE/graph.json","events_json":"https://pith.science/api/pith-number/4GBEIECT7SQZGDNXLA4TGOT5SE/events.json","paper":"https://pith.science/paper/4GBEIECT"},"agent_actions":{"view_html":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE","download_json":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE.json","view_paper":"https://pith.science/paper/4GBEIECT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17413&json=true","fetch_graph":"https://pith.science/api/pith-number/4GBEIECT7SQZGDNXLA4TGOT5SE/graph.json","fetch_events":"https://pith.science/api/pith-number/4GBEIECT7SQZGDNXLA4TGOT5SE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE/action/storage_attestation","attest_author":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE/action/author_attestation","sign_citation":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE/action/citation_signature","submit_replication":"https://pith.science/pith/4GBEIECT7SQZGDNXLA4TGOT5SE/action/replication_record"}},"created_at":"2026-07-05T10:51:24.186201+00:00","updated_at":"2026-07-05T10:51:24.186201+00:00"}