{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QKRWC6L66ONXTI4CCYVZP6JMK6","short_pith_number":"pith:QKRWC6L6","canonical_record":{"source":{"id":"1703.02582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-07T20:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"882ab48bd5cd3d7a9a27d8fae013bb687849c5062c5fc6cf02fd4bacc235f519","abstract_canon_sha256":"a191139653c1f84b8c76aecfca2be2d37215229443d1e17401962a5a9bbb94e1"},"schema_version":"1.0"},"canonical_sha256":"82a361797ef39b79a382162b97f92c57ae343352680560d6d9f1136abc932941","source":{"kind":"arxiv","id":"1703.02582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02582","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02582v2","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02582","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"QKRWC6L66ONX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKRWC6L66ONXTI4C","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKRWC6L6","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QKRWC6L66ONXTI4CCYVZP6JMK6","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-07T20:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"882ab48bd5cd3d7a9a27d8fae013bb687849c5062c5fc6cf02fd4bacc235f519","abstract_canon_sha256":"a191139653c1f84b8c76aecfca2be2d37215229443d1e17401962a5a9bbb94e1"},"schema_version":"1.0"},"canonical_sha256":"82a361797ef39b79a382162b97f92c57ae343352680560d6d9f1136abc932941","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:01.910760Z","signature_b64":"4NVks7IoAz8bANKykqqPeGX1R5eHBQA+eAAM+PKL+mViI37x/auCvGlX5/wRT0sJph2ftq8G61hQGHiuA5oiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a361797ef39b79a382162b97f92c57ae343352680560d6d9f1136abc932941","last_reissued_at":"2026-05-18T00:49:01.910047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:01.910047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02582","source_version":2,"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:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTq8MDmDC4SaqEkiZ5GuGxu6P/XSmMHgOBMmv1wTue9ppEJ3TV1otPI3P/1VD3YR6DWy8xhtY7OXzc4mC3nUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:32.304411Z"},"content_sha256":"ee66244e266f173663106821d0016dc932980e5f0ba097efc6bf9eef6a2142f2","schema_version":"1.0","event_id":"sha256:ee66244e266f173663106821d0016dc932980e5f0ba097efc6bf9eef6a2142f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QKRWC6L66ONXTI4CCYVZP6JMK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient motion planning for problems lacking optimal substructure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brian Hou, Oren Salzman, Siddhartha Srinivasa","submitted_at":"2017-03-07T20:32:56Z","abstract_excerpt":"We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We suggest a natural cost function that balances path length and risk-exposure time. Specifically, we consider the discrete setting where we are given a graph, or a roadmap, and we wish to compute the minimal-cost path under this cost function. Interestingly, paths defined using our cost function do not have an optimal substructure. Namely, subpa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02582","kind":"arxiv","version":2},"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:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0mNkN9F76Qxf3ZA0acpm2FL3wFECYd6UJ77A+J1nOkLJmF1lu5ZemH2zJz44RDfKXnL5Ofq9/tvP48XkW0eAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:32.304758Z"},"content_sha256":"b8f290e7bd713b206390fc83cdd3b41c56f4ebe4f7114b82084ea921f2be25b5","schema_version":"1.0","event_id":"sha256:b8f290e7bd713b206390fc83cdd3b41c56f4ebe4f7114b82084ea921f2be25b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKRWC6L66ONXTI4CCYVZP6JMK6/bundle.json","state_url":"https://pith.science/pith/QKRWC6L66ONXTI4CCYVZP6JMK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKRWC6L66ONXTI4CCYVZP6JMK6/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-05-31T03:36:32Z","links":{"resolver":"https://pith.science/pith/QKRWC6L66ONXTI4CCYVZP6JMK6","bundle":"https://pith.science/pith/QKRWC6L66ONXTI4CCYVZP6JMK6/bundle.json","state":"https://pith.science/pith/QKRWC6L66ONXTI4CCYVZP6JMK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKRWC6L66ONXTI4CCYVZP6JMK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QKRWC6L66ONXTI4CCYVZP6JMK6","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":"a191139653c1f84b8c76aecfca2be2d37215229443d1e17401962a5a9bbb94e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-07T20:32:56Z","title_canon_sha256":"882ab48bd5cd3d7a9a27d8fae013bb687849c5062c5fc6cf02fd4bacc235f519"},"schema_version":"1.0","source":{"id":"1703.02582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02582","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02582v2","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02582","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"QKRWC6L66ONX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKRWC6L66ONXTI4C","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKRWC6L6","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b8f290e7bd713b206390fc83cdd3b41c56f4ebe4f7114b82084ea921f2be25b5","target":"graph","created_at":"2026-05-18T00:49:01Z","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":"We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We suggest a natural cost function that balances path length and risk-exposure time. Specifically, we consider the discrete setting where we are given a graph, or a roadmap, and we wish to compute the minimal-cost path under this cost function. Interestingly, paths defined using our cost function do not have an optimal substructure. Namely, subpa","authors_text":"Brian Hou, Oren Salzman, Siddhartha Srinivasa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-07T20:32:56Z","title":"Efficient motion planning for problems lacking optimal substructure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02582","kind":"arxiv","version":2},"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:ee66244e266f173663106821d0016dc932980e5f0ba097efc6bf9eef6a2142f2","target":"record","created_at":"2026-05-18T00:49:01Z","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":"a191139653c1f84b8c76aecfca2be2d37215229443d1e17401962a5a9bbb94e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-07T20:32:56Z","title_canon_sha256":"882ab48bd5cd3d7a9a27d8fae013bb687849c5062c5fc6cf02fd4bacc235f519"},"schema_version":"1.0","source":{"id":"1703.02582","kind":"arxiv","version":2}},"canonical_sha256":"82a361797ef39b79a382162b97f92c57ae343352680560d6d9f1136abc932941","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82a361797ef39b79a382162b97f92c57ae343352680560d6d9f1136abc932941","first_computed_at":"2026-05-18T00:49:01.910047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:01.910047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4NVks7IoAz8bANKykqqPeGX1R5eHBQA+eAAM+PKL+mViI37x/auCvGlX5/wRT0sJph2ftq8G61hQGHiuA5oiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:01.910760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee66244e266f173663106821d0016dc932980e5f0ba097efc6bf9eef6a2142f2","sha256:b8f290e7bd713b206390fc83cdd3b41c56f4ebe4f7114b82084ea921f2be25b5"],"state_sha256":"5128c896a6e29cbb9480783b56a98a23929b78d83dbf6daffedeb7d279b085e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beqfM7SA71xop6UpApAbf8XhedqOUJl1gMoY8r/GDsGNCdGh8s2pLB+Uw+HqTWAG2L1onh7iLtWTFrjeErMeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:36:32.306676Z","bundle_sha256":"58f9cef9416102cb0dfe12334972e8de7af01fc7f18f3f1d5447573dfd056272"}}