{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MJJ46LEGHWBFGGEI3DMTXWCYSC","short_pith_number":"pith:MJJ46LEG","canonical_record":{"source":{"id":"1703.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-01T09:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"17537d2a56a34517194401e563410ab92605bf2e2925650469711d84ffa6491d","abstract_canon_sha256":"986a04fa73e3f092d1ff9e2d3d8ac73dbf36365cd525acff57e07550f05695a0"},"schema_version":"1.0"},"canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","source":{"kind":"arxiv","id":"1703.00194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00194","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00194v1","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00194","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"MJJ46LEGHWBF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MJJ46LEGHWBFGGEI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MJJ46LEG","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MJJ46LEGHWBFGGEI3DMTXWCYSC","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-01T09:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"17537d2a56a34517194401e563410ab92605bf2e2925650469711d84ffa6491d","abstract_canon_sha256":"986a04fa73e3f092d1ff9e2d3d8ac73dbf36365cd525acff57e07550f05695a0"},"schema_version":"1.0"},"canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:45.659981Z","signature_b64":"ZRUelR9OXk4EwKE1ETiQQSODVcRWavb3QzCRTSzLoSspkug9Iy7yQ7sz97drYM49wvAkiTkYzZqFiH+GfZ1bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","last_reissued_at":"2026-05-18T00:49:45.659347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:45.659347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00194","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-05-18T00:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wc4lFUHsrlNc1J/2ChP2Zp3mNCcPNU7SN9BW0xOcY2PuU5sb2atQKdWTfAm/f5aYhwoEW0EPk8RahfIwVe43Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:39:03.212006Z"},"content_sha256":"6e65df5b15ac87ae309a2d38370956d3a77b4c6e70ed025dc002c9db82e3496f","schema_version":"1.0","event_id":"sha256:6e65df5b15ac87ae309a2d38370956d3a77b4c6e70ed025dc002c9db82e3496f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MJJ46LEGHWBFGGEI3DMTXWCYSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Functional Gradient for Motion Planning in Continuous Occupancy Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fabio Ramos, Gilad Francis, Lionel Ott","submitted_at":"2017-03-01T09:36:49Z","abstract_excerpt":"Safe path planning is a crucial component in autonomous robotics. The many approaches to find a collision free path can be categorically divided into trajectory optimisers and sampling-based methods. When planning using occupancy maps, the sampling-based approach is the prevalent method. The main drawback of such techniques is that the reasoning about the expected cost of a plan is limited to the search heuristic used by each method. We introduce a novel planning method based on trajectory optimisation to plan safe and efficient paths in continuous occupancy maps. We extend the expressiveness "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00194","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":""},"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-05-18T00:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7EkoOBu4NvnxTMK+eqeQM/x94NF1nkcqY2QNWkeaA/XtrE8Pf5ntVRQ8++3icyIOrjzzsFrEfz2yEdn/JA8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:39:03.212367Z"},"content_sha256":"b52a10f570598d2c4406d6375164ac6071b7acf066f0a810e351e6fd7cd5c341","schema_version":"1.0","event_id":"sha256:b52a10f570598d2c4406d6375164ac6071b7acf066f0a810e351e6fd7cd5c341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/bundle.json","state_url":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/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-06-05T14:39:03Z","links":{"resolver":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC","bundle":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/bundle.json","state":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MJJ46LEGHWBFGGEI3DMTXWCYSC","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":"986a04fa73e3f092d1ff9e2d3d8ac73dbf36365cd525acff57e07550f05695a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-01T09:36:49Z","title_canon_sha256":"17537d2a56a34517194401e563410ab92605bf2e2925650469711d84ffa6491d"},"schema_version":"1.0","source":{"id":"1703.00194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00194","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00194v1","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00194","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"MJJ46LEGHWBF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MJJ46LEGHWBFGGEI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MJJ46LEG","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:b52a10f570598d2c4406d6375164ac6071b7acf066f0a810e351e6fd7cd5c341","target":"graph","created_at":"2026-05-18T00:49:45Z","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"},"paper":{"abstract_excerpt":"Safe path planning is a crucial component in autonomous robotics. The many approaches to find a collision free path can be categorically divided into trajectory optimisers and sampling-based methods. When planning using occupancy maps, the sampling-based approach is the prevalent method. The main drawback of such techniques is that the reasoning about the expected cost of a plan is limited to the search heuristic used by each method. We introduce a novel planning method based on trajectory optimisation to plan safe and efficient paths in continuous occupancy maps. We extend the expressiveness ","authors_text":"Fabio Ramos, Gilad Francis, Lionel Ott","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-01T09:36:49Z","title":"Stochastic Functional Gradient for Motion Planning in Continuous Occupancy Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00194","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:6e65df5b15ac87ae309a2d38370956d3a77b4c6e70ed025dc002c9db82e3496f","target":"record","created_at":"2026-05-18T00:49:45Z","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":"986a04fa73e3f092d1ff9e2d3d8ac73dbf36365cd525acff57e07550f05695a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-01T09:36:49Z","title_canon_sha256":"17537d2a56a34517194401e563410ab92605bf2e2925650469711d84ffa6491d"},"schema_version":"1.0","source":{"id":"1703.00194","kind":"arxiv","version":1}},"canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","first_computed_at":"2026-05-18T00:49:45.659347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:45.659347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZRUelR9OXk4EwKE1ETiQQSODVcRWavb3QzCRTSzLoSspkug9Iy7yQ7sz97drYM49wvAkiTkYzZqFiH+GfZ1bBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:45.659981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e65df5b15ac87ae309a2d38370956d3a77b4c6e70ed025dc002c9db82e3496f","sha256:b52a10f570598d2c4406d6375164ac6071b7acf066f0a810e351e6fd7cd5c341"],"state_sha256":"a6f2e6300eb63be61727d7df4dee38ffcd938695a5b532343ffc61ab11639a52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xYnXKm2AP9kPNSSils8FROvR/n6nOKVAo22mnPiCiJ1BGe8JbMm9ttrVxTiwZeXtdojI4qfrQ9CFSrld1MYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:39:03.214354Z","bundle_sha256":"bd1de5f82e823a5aea58b103ba003d5d47eaa4de731fbdc172459afef0a02e85"}}