{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3BFYLXDRBV35SNCAAPKUYXGWLY","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":"d8a88de66158554d2ce7774e137c8008ba472d63e1815070f34f240be9d6984f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-01T21:57:18Z","title_canon_sha256":"988241c575f4637e42937c6c367417330bb27b533b7dfa051109ca87d0a3bbe4"},"schema_version":"1.0","source":{"id":"1908.00641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00641","created_at":"2026-07-04T23:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00641v1","created_at":"2026-07-04T23:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00641","created_at":"2026-07-04T23:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"3BFYLXDRBV35","created_at":"2026-07-04T23:51:07Z"},{"alias_kind":"pith_short_16","alias_value":"3BFYLXDRBV35SNCA","created_at":"2026-07-04T23:51:07Z"},{"alias_kind":"pith_short_8","alias_value":"3BFYLXDR","created_at":"2026-07-04T23:51:07Z"}],"graph_snapshots":[{"event_id":"sha256:f9e75ec7dc00f304c08dc6c647c344caa9b3e0f41f1c2284f6ab74a8f65af669","target":"graph","created_at":"2026-07-04T23:51:07Z","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/1908.00641/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient planning in dynamic and uncertain environments is a fundamental challenge in robotics. In the context of trajectory optimization, the feasibility of paths can change as the environment evolves. Therefore, it can be beneficial to reason about multiple possible paths simultaneously. We build on prior work that considers graph-based trajectories to find solutions in multiple homotopy classes concurrently. Specifically, we extend this previous work to an online setting where the unreachable (in time) part of the graph is pruned and the remaining graph is reoptimized at every time step. A","authors_text":"Byron Boots, Keshav Kolur, Mustafa Mukadam, Sahit Chintalapudi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-01T21:57:18Z","title":"Online Motion Planning Over Multiple Homotopy Classes with Gaussian Process Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00641","kind":"arxiv","version":1},"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:245f2b1544e3cac2eb977854867add72e653f44057286f67bdcf158396dbe3f2","target":"record","created_at":"2026-07-04T23:51:07Z","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":"d8a88de66158554d2ce7774e137c8008ba472d63e1815070f34f240be9d6984f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-01T21:57:18Z","title_canon_sha256":"988241c575f4637e42937c6c367417330bb27b533b7dfa051109ca87d0a3bbe4"},"schema_version":"1.0","source":{"id":"1908.00641","kind":"arxiv","version":1}},"canonical_sha256":"d84b85dc710d77d9344003d54c5cd65e22fd975469d2d14eaf6caba723aa69d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d84b85dc710d77d9344003d54c5cd65e22fd975469d2d14eaf6caba723aa69d3","first_computed_at":"2026-07-04T23:51:07.716921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:07.716921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dFbSdAor/VKMXDTFoW0ZsShKcsYqa2Uy/z4Zx7sff+QEfxwjAI02RYAN33W1gOspOlX1zALa5ytONGa3++UrBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:07.717336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:245f2b1544e3cac2eb977854867add72e653f44057286f67bdcf158396dbe3f2","sha256:f9e75ec7dc00f304c08dc6c647c344caa9b3e0f41f1c2284f6ab74a8f65af669"],"state_sha256":"9c05e3875cbfa4940a99e5fc3185896323554625fcc351de70f481f54f54cb95"}