{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4GBEIECT7SQZGDNXLA4TGOT5SE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4c907bbb436bc0dd49ebe5abf7767abbbecd84f26d4a59f7cee188c7b0a806fa","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T16:48:32Z","title_canon_sha256":"5c9f15aa6b73d7238efd5611a82eec500acf03e4e18523f4dac669bc04515553"},"schema_version":"1.0","source":{"id":"2407.17413","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.17413","created_at":"2026-07-05T10:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"2407.17413v3","created_at":"2026-07-05T10:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17413","created_at":"2026-07-05T10:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"4GBEIECT7SQZ","created_at":"2026-07-05T10:51:24Z"},{"alias_kind":"pith_short_16","alias_value":"4GBEIECT7SQZGDNX","created_at":"2026-07-05T10:51:24Z"},{"alias_kind":"pith_short_8","alias_value":"4GBEIECT","created_at":"2026-07-05T10:51:24Z"}],"graph_snapshots":[{"event_id":"sha256:a0d02efd0e16374ebd0fbf6e30ba0246b57b033f0a5c1d9e034c07764a7dbb64","target":"graph","created_at":"2026-07-05T10:51:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.17413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","cross_cats":["cs.AI","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T16:48:32Z","title":"$A^*$ for Graphs of Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17413","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bdda4073f45fac01a3d934a81fcfff90e4f21c05855313e10f76eedb76aee070","target":"record","created_at":"2026-07-05T10:51:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4c907bbb436bc0dd49ebe5abf7767abbbecd84f26d4a59f7cee188c7b0a806fa","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T16:48:32Z","title_canon_sha256":"5c9f15aa6b73d7238efd5611a82eec500acf03e4e18523f4dac669bc04515553"},"schema_version":"1.0","source":{"id":"2407.17413","kind":"arxiv","version":3}},"canonical_sha256":"e182441053fca1930db75839333a7d910c54316a2a13844986fcb9596ae0f02f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e182441053fca1930db75839333a7d910c54316a2a13844986fcb9596ae0f02f","first_computed_at":"2026-07-05T10:51:24.186145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:24.186145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E3tc+8O33eBsPpzmLqo0ytPvBEv69zjaq1S2wdUKCRETpSjLeQmYpqKREtsgE1L5H5Tg7nqF8A+He3ocaBiuDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:24.186649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.17413","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdda4073f45fac01a3d934a81fcfff90e4f21c05855313e10f76eedb76aee070","sha256:a0d02efd0e16374ebd0fbf6e30ba0246b57b033f0a5c1d9e034c07764a7dbb64"],"state_sha256":"52bea2747c515c7e32a09797041a45623c1ec3c24a8c09da5a62bc57c4c99073"}