{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H5OBBXZCWTR2LOJNQ7TNRY5FBS","short_pith_number":"pith:H5OBBXZC","canonical_record":{"source":{"id":"1708.05855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-19T14:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"d7405357566580bbac8ad02264ba1e4126a5573837eb2c7e1d814769a078f0f8","abstract_canon_sha256":"0a63caa64a71b8879e62cf7174dd0aa71686b2d1733e67d16c913a936c758ab6"},"schema_version":"1.0"},"canonical_sha256":"3f5c10df22b4e3a5b92d87e6d8e3a50c9c65756deafeb70320614a3ae501a962","source":{"kind":"arxiv","id":"1708.05855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05855","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05855v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05855","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"H5OBBXZCWTR2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H5OBBXZCWTR2LOJN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H5OBBXZC","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H5OBBXZCWTR2LOJNQ7TNRY5FBS","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-19T14:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"d7405357566580bbac8ad02264ba1e4126a5573837eb2c7e1d814769a078f0f8","abstract_canon_sha256":"0a63caa64a71b8879e62cf7174dd0aa71686b2d1733e67d16c913a936c758ab6"},"schema_version":"1.0"},"canonical_sha256":"3f5c10df22b4e3a5b92d87e6d8e3a50c9c65756deafeb70320614a3ae501a962","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.985200Z","signature_b64":"ukXlBfI78Oyo10dlFc3eTYk9v+DDJMgL60uNnzrTIfbZp6GdQAnDGNjLDo4Ra7GYMEZ3RjHSwDbidXJ1bSs+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f5c10df22b4e3a5b92d87e6d8e3a50c9c65756deafeb70320614a3ae501a962","last_reissued_at":"2026-05-18T00:37:43.984517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.984517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05855","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQtDoqIgcC7DPs+aRBlzd4nlarSQN8GYxcIeD/13ts/mh8XjBY54N7uUG4+wfhrROXzlm52TCjbixnd7uQmHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:14:30.969448Z"},"content_sha256":"b5bb9e68df5c6a91ade0ab428c80921943a34938077e3bbb9a7c96f9dd8e2349","schema_version":"1.0","event_id":"sha256:b5bb9e68df5c6a91ade0ab428c80921943a34938077e3bbb9a7c96f9dd8e2349"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H5OBBXZCWTR2LOJNQ7TNRY5FBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Distance Functions for Path-Planning in Planar Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Craig Gotsman, Kai Hormann, Renjie Chen","submitted_at":"2017-08-19T14:33:50Z","abstract_excerpt":"Path planning is an important problem in robotics. One way to plan a path between two points $x,y$ within a (not necessarily simply-connected) planar domain $\\Omega$, is to define a non-negative distance function $d(x,y)$ on $\\Omega\\times\\Omega$ such that following the (descending) gradient of this distance function traces such a path. This presents two equally important challenges: A mathematical challenge -- to define $d$ such that $d(x,y)$ has a single minimum for any fixed $y$ (and this is when $x=y$), since a local minimum is in effect a \"dead end\", A computational challenge -- to define "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05855","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngYMocfFK4hutEHnKCJoDvrWqvsYB2ciUo402tAvgaAWpf1GXUa8915yS0UDiK8BS92JpaU4eOTrd46KvBLmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:14:30.970031Z"},"content_sha256":"eb16d47a069e6278bf0ecc6a589929cd60d9adc82007a0f24c60d3add7b404cd","schema_version":"1.0","event_id":"sha256:eb16d47a069e6278bf0ecc6a589929cd60d9adc82007a0f24c60d3add7b404cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS/bundle.json","state_url":"https://pith.science/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS/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-05T05:14:30Z","links":{"resolver":"https://pith.science/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS","bundle":"https://pith.science/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS/bundle.json","state":"https://pith.science/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5OBBXZCWTR2LOJNQ7TNRY5FBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H5OBBXZCWTR2LOJNQ7TNRY5FBS","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":"0a63caa64a71b8879e62cf7174dd0aa71686b2d1733e67d16c913a936c758ab6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-19T14:33:50Z","title_canon_sha256":"d7405357566580bbac8ad02264ba1e4126a5573837eb2c7e1d814769a078f0f8"},"schema_version":"1.0","source":{"id":"1708.05855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05855","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05855v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05855","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"H5OBBXZCWTR2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H5OBBXZCWTR2LOJN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H5OBBXZC","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:eb16d47a069e6278bf0ecc6a589929cd60d9adc82007a0f24c60d3add7b404cd","target":"graph","created_at":"2026-05-18T00:37:43Z","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":"Path planning is an important problem in robotics. One way to plan a path between two points $x,y$ within a (not necessarily simply-connected) planar domain $\\Omega$, is to define a non-negative distance function $d(x,y)$ on $\\Omega\\times\\Omega$ such that following the (descending) gradient of this distance function traces such a path. This presents two equally important challenges: A mathematical challenge -- to define $d$ such that $d(x,y)$ has a single minimum for any fixed $y$ (and this is when $x=y$), since a local minimum is in effect a \"dead end\", A computational challenge -- to define ","authors_text":"Craig Gotsman, Kai Hormann, Renjie Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-19T14:33:50Z","title":"Practical Distance Functions for Path-Planning in Planar Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05855","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:b5bb9e68df5c6a91ade0ab428c80921943a34938077e3bbb9a7c96f9dd8e2349","target":"record","created_at":"2026-05-18T00:37:43Z","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":"0a63caa64a71b8879e62cf7174dd0aa71686b2d1733e67d16c913a936c758ab6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-19T14:33:50Z","title_canon_sha256":"d7405357566580bbac8ad02264ba1e4126a5573837eb2c7e1d814769a078f0f8"},"schema_version":"1.0","source":{"id":"1708.05855","kind":"arxiv","version":1}},"canonical_sha256":"3f5c10df22b4e3a5b92d87e6d8e3a50c9c65756deafeb70320614a3ae501a962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f5c10df22b4e3a5b92d87e6d8e3a50c9c65756deafeb70320614a3ae501a962","first_computed_at":"2026-05-18T00:37:43.984517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.984517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ukXlBfI78Oyo10dlFc3eTYk9v+DDJMgL60uNnzrTIfbZp6GdQAnDGNjLDo4Ra7GYMEZ3RjHSwDbidXJ1bSs+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.985200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5bb9e68df5c6a91ade0ab428c80921943a34938077e3bbb9a7c96f9dd8e2349","sha256:eb16d47a069e6278bf0ecc6a589929cd60d9adc82007a0f24c60d3add7b404cd"],"state_sha256":"0cd321ad697ebad51e03345acb238862f924b3271f490976a000fc9f5cc06029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrLxVi0z6AiedqjWBiF0lATJaEHAp9kRAbiIs07X4PgfG0khAk91Q3skzim/OzPe/4RxaJRkkd61MH0tvdKZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:14:30.973360Z","bundle_sha256":"0198f71601bedb971dc40fb99bb7770a45f5258c35e10bf799ea089a1cb85407"}}