{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3BFYLXDRBV35SNCAAPKUYXGWLY","short_pith_number":"pith:3BFYLXDR","canonical_record":{"source":{"id":"1908.00641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-01T21:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"988241c575f4637e42937c6c367417330bb27b533b7dfa051109ca87d0a3bbe4","abstract_canon_sha256":"d8a88de66158554d2ce7774e137c8008ba472d63e1815070f34f240be9d6984f"},"schema_version":"1.0"},"canonical_sha256":"d84b85dc710d77d9344003d54c5cd65e22fd975469d2d14eaf6caba723aa69d3","source":{"kind":"arxiv","id":"1908.00641","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3BFYLXDRBV35SNCAAPKUYXGWLY","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-01T21:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"988241c575f4637e42937c6c367417330bb27b533b7dfa051109ca87d0a3bbe4","abstract_canon_sha256":"d8a88de66158554d2ce7774e137c8008ba472d63e1815070f34f240be9d6984f"},"schema_version":"1.0"},"canonical_sha256":"d84b85dc710d77d9344003d54c5cd65e22fd975469d2d14eaf6caba723aa69d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:07.717336Z","signature_b64":"dFbSdAor/VKMXDTFoW0ZsShKcsYqa2Uy/z4Zx7sff+QEfxwjAI02RYAN33W1gOspOlX1zALa5ytONGa3++UrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d84b85dc710d77d9344003d54c5cd65e22fd975469d2d14eaf6caba723aa69d3","last_reissued_at":"2026-07-04T23:51:07.716921Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:07.716921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00641","source_version":1,"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-04T23:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F57A6DFSAqeu3yeQmcLnv5dN0AobQN6pp4RPlc92lE28DTB8eWzKiGtg4ypSdAvd2NewqVZ64a0eH+xagEU3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:03:05.487116Z"},"content_sha256":"245f2b1544e3cac2eb977854867add72e653f44057286f67bdcf158396dbe3f2","schema_version":"1.0","event_id":"sha256:245f2b1544e3cac2eb977854867add72e653f44057286f67bdcf158396dbe3f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3BFYLXDRBV35SNCAAPKUYXGWLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Motion Planning Over Multiple Homotopy Classes with Gaussian Process Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Byron Boots, Keshav Kolur, Mustafa Mukadam, Sahit Chintalapudi","submitted_at":"2019-08-01T21:57:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00641","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/1908.00641/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-04T23:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYgoeyS4keTBUsKtR6Uq38u4Z/ltimSnJTy8cJ5jIzm6kkSDEZMfWWklJ+ioXcD6A9pUbSM0mK7YcT1J5ZbzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:03:05.488070Z"},"content_sha256":"f9e75ec7dc00f304c08dc6c647c344caa9b3e0f41f1c2284f6ab74a8f65af669","schema_version":"1.0","event_id":"sha256:f9e75ec7dc00f304c08dc6c647c344caa9b3e0f41f1c2284f6ab74a8f65af669"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BFYLXDRBV35SNCAAPKUYXGWLY/bundle.json","state_url":"https://pith.science/pith/3BFYLXDRBV35SNCAAPKUYXGWLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BFYLXDRBV35SNCAAPKUYXGWLY/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-16T08:03:05Z","links":{"resolver":"https://pith.science/pith/3BFYLXDRBV35SNCAAPKUYXGWLY","bundle":"https://pith.science/pith/3BFYLXDRBV35SNCAAPKUYXGWLY/bundle.json","state":"https://pith.science/pith/3BFYLXDRBV35SNCAAPKUYXGWLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BFYLXDRBV35SNCAAPKUYXGWLY/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSdmRcfjV/ZzeBRAUEJtpbYKurtzy4G+tMgf04q+2T74b6toWSALOLk2PCmQS494QMo3JVnGLLvCoioc6+KPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:03:05.492819Z","bundle_sha256":"0fbdf2bbb6ad6c9a7d3d850590a0731e0451c9d43098daceeb005a16b1bb8ebc"}}