{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:27THKTBOIHXRINXH6A4I4DJEVN","short_pith_number":"pith:27THKTBO","canonical_record":{"source":{"id":"1607.02770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-10T18:23:31Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"5257658ca2efcdc959db86c69722e80221b0db9952fd59052ad96f2c79e7b37f","abstract_canon_sha256":"b557f6b91f8779ab2776907537138d7eb2c1edc12641d08939be56e5a87ae8b5"},"schema_version":"1.0"},"canonical_sha256":"d7e6754c2e41ef1436e7f0388e0d24ab7c0538a00c94459d66d0a037527d9b97","source":{"kind":"arxiv","id":"1607.02770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02770","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02770v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02770","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"27THKTBOIHXR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"27THKTBOIHXRINXH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"27THKTBO","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:27THKTBOIHXRINXH6A4I4DJEVN","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-10T18:23:31Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"5257658ca2efcdc959db86c69722e80221b0db9952fd59052ad96f2c79e7b37f","abstract_canon_sha256":"b557f6b91f8779ab2776907537138d7eb2c1edc12641d08939be56e5a87ae8b5"},"schema_version":"1.0"},"canonical_sha256":"d7e6754c2e41ef1436e7f0388e0d24ab7c0538a00c94459d66d0a037527d9b97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:16.182092Z","signature_b64":"ZkKobZZiJDCDgtUGkKxL8NoNgd6d8Gr5jiDLcFUJQfOjxjD7EBSz9ggHnIIB3eAB4Q1orsBKxWHAQAok1CmYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7e6754c2e41ef1436e7f0388e0d24ab7c0538a00c94459d66d0a037527d9b97","last_reissued_at":"2026-05-18T01:11:16.181336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:16.181336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02770","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-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzofbUqdJoiwGyW3schACCS5w4GtuIt3iTbcCHWoamxf2LrDEtn8BGjxdltQz1fndqZskOY0OhHl5xtU++KXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:04:36.602987Z"},"content_sha256":"3bbd388f1798a9d4b5f404d02c928a5df9365610d8cd5ba5aac63b6203d98953","schema_version":"1.0","event_id":"sha256:3bbd388f1798a9d4b5f404d02c928a5df9365610d8cd5ba5aac63b6203d98953"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:27THKTBOIHXRINXH6A4I4DJEVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling-based bottleneck pathfinding with applications to Frechet matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Kiril Solovey","submitted_at":"2016-07-10T18:23:31Z","abstract_excerpt":"We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in $d$-dimensional Euclidean space between given start and goal points, namely paths that minimize the maximal value over a continuous cost map. We present an efficient and simple sampling-based framework for this problem, which is inspired by, and draws ideas from, techniques for robot motion planning. We extend the framework to handle not only standard bottleneck pathfinding, but also the more demanding case, where t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02770","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-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAxZHCmZSV04/XAA8yxkMLG1Mhy+h9KnKnjVPJ7P0o5XvDcaM1DZC53ZGo9sSKnIhIVmLgknU0k26183xAbrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:04:36.603352Z"},"content_sha256":"5b598c2bac8ad47c1062defe4dbf1b6fc8d1e73913d4537b1a92229692734f5a","schema_version":"1.0","event_id":"sha256:5b598c2bac8ad47c1062defe4dbf1b6fc8d1e73913d4537b1a92229692734f5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27THKTBOIHXRINXH6A4I4DJEVN/bundle.json","state_url":"https://pith.science/pith/27THKTBOIHXRINXH6A4I4DJEVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27THKTBOIHXRINXH6A4I4DJEVN/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-03T14:04:36Z","links":{"resolver":"https://pith.science/pith/27THKTBOIHXRINXH6A4I4DJEVN","bundle":"https://pith.science/pith/27THKTBOIHXRINXH6A4I4DJEVN/bundle.json","state":"https://pith.science/pith/27THKTBOIHXRINXH6A4I4DJEVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27THKTBOIHXRINXH6A4I4DJEVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:27THKTBOIHXRINXH6A4I4DJEVN","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":"b557f6b91f8779ab2776907537138d7eb2c1edc12641d08939be56e5a87ae8b5","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-10T18:23:31Z","title_canon_sha256":"5257658ca2efcdc959db86c69722e80221b0db9952fd59052ad96f2c79e7b37f"},"schema_version":"1.0","source":{"id":"1607.02770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02770","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02770v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02770","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"27THKTBOIHXR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"27THKTBOIHXRINXH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"27THKTBO","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:5b598c2bac8ad47c1062defe4dbf1b6fc8d1e73913d4537b1a92229692734f5a","target":"graph","created_at":"2026-05-18T01:11:16Z","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 describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in $d$-dimensional Euclidean space between given start and goal points, namely paths that minimize the maximal value over a continuous cost map. We present an efficient and simple sampling-based framework for this problem, which is inspired by, and draws ideas from, techniques for robot motion planning. We extend the framework to handle not only standard bottleneck pathfinding, but also the more demanding case, where t","authors_text":"Dan Halperin, Kiril Solovey","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-10T18:23:31Z","title":"Sampling-based bottleneck pathfinding with applications to Frechet matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02770","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:3bbd388f1798a9d4b5f404d02c928a5df9365610d8cd5ba5aac63b6203d98953","target":"record","created_at":"2026-05-18T01:11:16Z","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":"b557f6b91f8779ab2776907537138d7eb2c1edc12641d08939be56e5a87ae8b5","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-10T18:23:31Z","title_canon_sha256":"5257658ca2efcdc959db86c69722e80221b0db9952fd59052ad96f2c79e7b37f"},"schema_version":"1.0","source":{"id":"1607.02770","kind":"arxiv","version":1}},"canonical_sha256":"d7e6754c2e41ef1436e7f0388e0d24ab7c0538a00c94459d66d0a037527d9b97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7e6754c2e41ef1436e7f0388e0d24ab7c0538a00c94459d66d0a037527d9b97","first_computed_at":"2026-05-18T01:11:16.181336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:16.181336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkKobZZiJDCDgtUGkKxL8NoNgd6d8Gr5jiDLcFUJQfOjxjD7EBSz9ggHnIIB3eAB4Q1orsBKxWHAQAok1CmYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:16.182092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bbd388f1798a9d4b5f404d02c928a5df9365610d8cd5ba5aac63b6203d98953","sha256:5b598c2bac8ad47c1062defe4dbf1b6fc8d1e73913d4537b1a92229692734f5a"],"state_sha256":"45d1f6710509a75978d47185bc85ca6e3e6b5b058ae78fde5606e9711d519519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3CTeF818lb2mdN+e8W7J4fHNxn9bvAZaSgZfPww5jRopS1WcUSXS93mqAQrUwb+zARQE6LWNwHM74gngS+CDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:04:36.605358Z","bundle_sha256":"990769553c0765a410471b03521a0b3e61f749ffd9925f921ce63f54fc34caaa"}}