{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2GVKTKFQYMUP3MBXNIQ6GKRF3T","short_pith_number":"pith:2GVKTKFQ","canonical_record":{"source":{"id":"1705.05987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-17T02:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"30f777dff575c157afa22e0da21cf39fad1704032c02e29d93e8d1b9d9104e3f","abstract_canon_sha256":"2e13ee4a112b3a940ffcc66405ed5fb7852d54bc6838aeeced37683d0cc97dd0"},"schema_version":"1.0"},"canonical_sha256":"d1aaa9a8b0c328fdb0376a21e32a25dcc504bb2bc725b35422d1eaba0e3a7246","source":{"kind":"arxiv","id":"1705.05987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05987","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05987v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05987","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"2GVKTKFQYMUP","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2GVKTKFQYMUP3MBX","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2GVKTKFQ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2GVKTKFQYMUP3MBXNIQ6GKRF3T","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-17T02:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"30f777dff575c157afa22e0da21cf39fad1704032c02e29d93e8d1b9d9104e3f","abstract_canon_sha256":"2e13ee4a112b3a940ffcc66405ed5fb7852d54bc6838aeeced37683d0cc97dd0"},"schema_version":"1.0"},"canonical_sha256":"d1aaa9a8b0c328fdb0376a21e32a25dcc504bb2bc725b35422d1eaba0e3a7246","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.280663Z","signature_b64":"N/TVlPkEhqDS0l9SAEPd/86QrH4022nZ651taUBw1SdW1yEsCKN9QRhA8+g9kWCepNr5Ht6G+b2BhnVwyti6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1aaa9a8b0c328fdb0376a21e32a25dcc504bb2bc725b35422d1eaba0e3a7246","last_reissued_at":"2026-05-18T00:44:19.280199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.280199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05987","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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk5eJ3rALLLMbsncC6+G/Y52xMTFnv0Gw70TadC0j52rF/3WtcldbR1WGr4TI+1P/Zt1H729m08VUtxTHtcxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:42.303819Z"},"content_sha256":"58a0be3b86f0f9dd3a4797cbde762f3fc9e61a20bcfe820654c8852494981034","schema_version":"1.0","event_id":"sha256:58a0be3b86f0f9dd3a4797cbde762f3fc9e61a20bcfe820654c8852494981034"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2GVKTKFQYMUP3MBXNIQ6GKRF3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Functional Gradient Path Planning in 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-05-17T02:18:32Z","abstract_excerpt":"Planning safe paths is a major building block in robot autonomy. It has been an active field of research for several decades, with a plethora of planning methods. Planners can be generally categorised as either trajectory optimisers or sampling-based planners. The latter is the predominant planning paradigm for occupancy maps. Trajectory optimisation entails major algorithmic changes to tackle contextual information gaps caused by incomplete sensor coverage of the map. However, the benefits are substantial, as trajectory optimisers can reason on the trade-off between path safety and efficiency"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05987","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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1tTs1Ykctlu+3z7BYfiyUeKOphQVa8n3BxVfoo/WGK8BB3GC+DN3sVPXaURZ2enVLTMJRDo8yAH/7HfGFkpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:42.304158Z"},"content_sha256":"eb6737325e2dfc21b49a34eec133e679611a74545e4d8c04ecac59dadd4fa4dc","schema_version":"1.0","event_id":"sha256:eb6737325e2dfc21b49a34eec133e679611a74545e4d8c04ecac59dadd4fa4dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T/bundle.json","state_url":"https://pith.science/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T/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:07:42Z","links":{"resolver":"https://pith.science/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T","bundle":"https://pith.science/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T/bundle.json","state":"https://pith.science/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GVKTKFQYMUP3MBXNIQ6GKRF3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2GVKTKFQYMUP3MBXNIQ6GKRF3T","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":"2e13ee4a112b3a940ffcc66405ed5fb7852d54bc6838aeeced37683d0cc97dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-17T02:18:32Z","title_canon_sha256":"30f777dff575c157afa22e0da21cf39fad1704032c02e29d93e8d1b9d9104e3f"},"schema_version":"1.0","source":{"id":"1705.05987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05987","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05987v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05987","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"2GVKTKFQYMUP","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2GVKTKFQYMUP3MBX","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2GVKTKFQ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:eb6737325e2dfc21b49a34eec133e679611a74545e4d8c04ecac59dadd4fa4dc","target":"graph","created_at":"2026-05-18T00:44:19Z","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":"Planning safe paths is a major building block in robot autonomy. It has been an active field of research for several decades, with a plethora of planning methods. Planners can be generally categorised as either trajectory optimisers or sampling-based planners. The latter is the predominant planning paradigm for occupancy maps. Trajectory optimisation entails major algorithmic changes to tackle contextual information gaps caused by incomplete sensor coverage of the map. However, the benefits are substantial, as trajectory optimisers can reason on the trade-off between path safety and efficiency","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-05-17T02:18:32Z","title":"Stochastic Functional Gradient Path Planning in Occupancy Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05987","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:58a0be3b86f0f9dd3a4797cbde762f3fc9e61a20bcfe820654c8852494981034","target":"record","created_at":"2026-05-18T00:44:19Z","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":"2e13ee4a112b3a940ffcc66405ed5fb7852d54bc6838aeeced37683d0cc97dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-17T02:18:32Z","title_canon_sha256":"30f777dff575c157afa22e0da21cf39fad1704032c02e29d93e8d1b9d9104e3f"},"schema_version":"1.0","source":{"id":"1705.05987","kind":"arxiv","version":1}},"canonical_sha256":"d1aaa9a8b0c328fdb0376a21e32a25dcc504bb2bc725b35422d1eaba0e3a7246","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1aaa9a8b0c328fdb0376a21e32a25dcc504bb2bc725b35422d1eaba0e3a7246","first_computed_at":"2026-05-18T00:44:19.280199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:19.280199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/TVlPkEhqDS0l9SAEPd/86QrH4022nZ651taUBw1SdW1yEsCKN9QRhA8+g9kWCepNr5Ht6G+b2BhnVwyti6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:19.280663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a0be3b86f0f9dd3a4797cbde762f3fc9e61a20bcfe820654c8852494981034","sha256:eb6737325e2dfc21b49a34eec133e679611a74545e4d8c04ecac59dadd4fa4dc"],"state_sha256":"42a6ba250c8b1d7d9cae5d4eb9a0592340504d44363332fb264fb71d505f06b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"noSE4XKNpMpw7dkm4FkaWXjNuXsXuq62Rs6q9+CuHrHLLdmbr0t1Fv1OVXLSPFxk0TvZWlgM8QKoz8h2Yxt6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:07:42.306092Z","bundle_sha256":"3a7dd1980da83c9c5a6682be7ad8fc1a324dff1ab10001de9e334ddd14f590db"}}