{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EIUGYCAOGKA7GGJOZPD3ABIMKK","short_pith_number":"pith:EIUGYCAO","canonical_record":{"source":{"id":"2407.08848","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-11T20:15:00Z","cross_cats_sorted":[],"title_canon_sha256":"8b72e2c18adf8c2fabdd866f6f27f82c5d45d51bd6d204d92205696bff66fa25","abstract_canon_sha256":"0c2e7adf787d35032b05b6f3a3ac0f19c9c58c73646f89d5833de7b8923d4cca"},"schema_version":"1.0"},"canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","source":{"kind":"arxiv","id":"2407.08848","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.08848","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"2407.08848v3","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08848","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"EIUGYCAOGKA7","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"pith_short_16","alias_value":"EIUGYCAOGKA7GGJO","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"pith_short_8","alias_value":"EIUGYCAO","created_at":"2026-07-05T09:46:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EIUGYCAOGKA7GGJOZPD3ABIMKK","target":"record","payload":{"canonical_record":{"source":{"id":"2407.08848","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-11T20:15:00Z","cross_cats_sorted":[],"title_canon_sha256":"8b72e2c18adf8c2fabdd866f6f27f82c5d45d51bd6d204d92205696bff66fa25","abstract_canon_sha256":"0c2e7adf787d35032b05b6f3a3ac0f19c9c58c73646f89d5833de7b8923d4cca"},"schema_version":"1.0"},"canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:49.023473Z","signature_b64":"3Sdo6CFNtDin57zcYjug2lJHEBMtAbJAhd5nmA6W2lOS5o/+YYrRFzBFigj1XrtZxr26lYtLNJtkKnC0vrm3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","last_reissued_at":"2026-07-05T09:46:49.022984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:49.022984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.08848","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26nqDuY9ixoo6pvjbD3C08WEJRWJfCt7UI7Ggv34u1mShzFsKZpn2ZOBm6XxGhFK6W+VQkiGvcjrvJuRbJD7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:53:56.993745Z"},"content_sha256":"91614ac999a539fb30d69ee663274e70ba4f4b966cf5aa3c678238291bbf9f99","schema_version":"1.0","event_id":"sha256:91614ac999a539fb30d69ee663274e70ba4f4b966cf5aa3c678238291bbf9f99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EIUGYCAOGKA7GGJOZPD3ABIMKK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bernhard Paus Graesdal, Leslie Pack Kaelbling, Rebecca H. Jiang, Russ Tedrake, Shao Yuan Chew Chia","submitted_at":"2024-07-11T20:15:00Z","abstract_excerpt":"We consider large-scale, implicit-search-based solutions to Shortest Path Problems on Graphs of Convex Sets (GCS). We propose GCS*, a forward heuristic search algorithm that generalizes A* search to the GCS setting, where a continuous-valued decision is made at each graph vertex, and constraints across graph edges couple these decisions, influencing costs and feasibility. Such mixed discrete-continuous planning is needed in many domains, including motion planning around obstacles and planning through contact. This setting provides a unique challenge for best-first search algorithms: the cost a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08848","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.08848/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHRLF3P/WyT/NdZVI6f5cSGg7FfWrpnb0jqZoANPSAU+Dz8cniIjBIW8zpiL+wUM115HXXHEhWxTT3Oa4kODAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:53:56.994236Z"},"content_sha256":"475e8e32a010dcd79db0153002386d0c3b6b9e3a6e6afa819db77ec8da5673ca","schema_version":"1.0","event_id":"sha256:475e8e32a010dcd79db0153002386d0c3b6b9e3a6e6afa819db77ec8da5673ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/bundle.json","state_url":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T20:53:56Z","links":{"resolver":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK","bundle":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/bundle.json","state":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EIUGYCAOGKA7GGJOZPD3ABIMKK","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":"0c2e7adf787d35032b05b6f3a3ac0f19c9c58c73646f89d5833de7b8923d4cca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-11T20:15:00Z","title_canon_sha256":"8b72e2c18adf8c2fabdd866f6f27f82c5d45d51bd6d204d92205696bff66fa25"},"schema_version":"1.0","source":{"id":"2407.08848","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.08848","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"2407.08848v3","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08848","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"EIUGYCAOGKA7","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"pith_short_16","alias_value":"EIUGYCAOGKA7GGJO","created_at":"2026-07-05T09:46:49Z"},{"alias_kind":"pith_short_8","alias_value":"EIUGYCAO","created_at":"2026-07-05T09:46:49Z"}],"graph_snapshots":[{"event_id":"sha256:475e8e32a010dcd79db0153002386d0c3b6b9e3a6e6afa819db77ec8da5673ca","target":"graph","created_at":"2026-07-05T09:46:49Z","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.08848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider large-scale, implicit-search-based solutions to Shortest Path Problems on Graphs of Convex Sets (GCS). We propose GCS*, a forward heuristic search algorithm that generalizes A* search to the GCS setting, where a continuous-valued decision is made at each graph vertex, and constraints across graph edges couple these decisions, influencing costs and feasibility. Such mixed discrete-continuous planning is needed in many domains, including motion planning around obstacles and planning through contact. This setting provides a unique challenge for best-first search algorithms: the cost a","authors_text":"Bernhard Paus Graesdal, Leslie Pack Kaelbling, Rebecca H. Jiang, Russ Tedrake, Shao Yuan Chew Chia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08848","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:91614ac999a539fb30d69ee663274e70ba4f4b966cf5aa3c678238291bbf9f99","target":"record","created_at":"2026-07-05T09:46:49Z","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":"0c2e7adf787d35032b05b6f3a3ac0f19c9c58c73646f89d5833de7b8923d4cca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-11T20:15:00Z","title_canon_sha256":"8b72e2c18adf8c2fabdd866f6f27f82c5d45d51bd6d204d92205696bff66fa25"},"schema_version":"1.0","source":{"id":"2407.08848","kind":"arxiv","version":3}},"canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","first_computed_at":"2026-07-05T09:46:49.022984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:46:49.022984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Sdo6CFNtDin57zcYjug2lJHEBMtAbJAhd5nmA6W2lOS5o/+YYrRFzBFigj1XrtZxr26lYtLNJtkKnC0vrm3Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:46:49.023473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.08848","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91614ac999a539fb30d69ee663274e70ba4f4b966cf5aa3c678238291bbf9f99","sha256:475e8e32a010dcd79db0153002386d0c3b6b9e3a6e6afa819db77ec8da5673ca"],"state_sha256":"cfabf55d0c4673d66eab975402c2c14f83c1a98e95f1de92cbf75bd1bd4591b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFYV45U8aVVp0R9kH/lFCMV8TY0qjd3ZIMLoA8r/sjmdpSjOXYzJ9xSBZUpQ2E9P5nSKow3jCYKXq20cqLFJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:53:56.997719Z","bundle_sha256":"044a6b89429eb54b0cf1b027aef70d95569b12588c1f25127c73853ad8cbe51c"}}