{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LPC6WEILTK6YZMJIORHNCL4MWF","short_pith_number":"pith:LPC6WEIL","schema_version":"1.0","canonical_sha256":"5bc5eb110b9abd8cb128744ed12f8cb146b017dbb80919ec7ce515686e1b3dea","source":{"kind":"arxiv","id":"1401.7042","version":2},"attestation_state":"computed","paper":{"title":"How to Walk Your Dog in the Mountains with No Magic Leash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amir Nayyeri, Anastasios Sidiropoulos, Mohammad Salavatipour, Sariel Har-Peled","submitted_at":"2014-01-27T22:47:15Z","abstract_excerpt":"We describe a $O(\\log n )$-approximation algorithm for computing the homotopic \\Frechet distance between two polygonal curves that lie on the boundary of a triangulated topological disk. Prior to this work, algorithms were known only for curves on the Euclidean plane with polygonal obstacles.\n  A key technical ingredient in our analysis is a $O(\\log n)$-approximation algorithm for computing the minimum height of a homotopy between two curves. No algorithms were previously known for approximating this parameter. Surprisingly, it is not even known if computing either the homotopic \\Frechet dista"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.7042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-27T22:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"a347e66bd8bdcd7dcdc45d95df60c16b0ffe8b4b87926dda60555cd49428e93b","abstract_canon_sha256":"52de20ca74783e3d0f58244fd846beadfc6a9f3c7dab5eb4e79ea552e9ec58de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:30.199718Z","signature_b64":"Jl+m+Kzk7usjCUayOlduFMqXAfmNMhURTWFBkGxS+lqV03DsXIrVIbNWDLiqowxK/cbynT0t5cCq47Dthg06Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc5eb110b9abd8cb128744ed12f8cb146b017dbb80919ec7ce515686e1b3dea","last_reissued_at":"2026-05-18T01:34:30.199221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:30.199221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Walk Your Dog in the Mountains with No Magic Leash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amir Nayyeri, Anastasios Sidiropoulos, Mohammad Salavatipour, Sariel Har-Peled","submitted_at":"2014-01-27T22:47:15Z","abstract_excerpt":"We describe a $O(\\log n )$-approximation algorithm for computing the homotopic \\Frechet distance between two polygonal curves that lie on the boundary of a triangulated topological disk. Prior to this work, algorithms were known only for curves on the Euclidean plane with polygonal obstacles.\n  A key technical ingredient in our analysis is a $O(\\log n)$-approximation algorithm for computing the minimum height of a homotopy between two curves. No algorithms were previously known for approximating this parameter. Surprisingly, it is not even known if computing either the homotopic \\Frechet dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7042","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.7042","created_at":"2026-05-18T01:34:30.199288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7042v2","created_at":"2026-05-18T01:34:30.199288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7042","created_at":"2026-05-18T01:34:30.199288+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPC6WEILTK6Y","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPC6WEILTK6YZMJI","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPC6WEIL","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF","json":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF.json","graph_json":"https://pith.science/api/pith-number/LPC6WEILTK6YZMJIORHNCL4MWF/graph.json","events_json":"https://pith.science/api/pith-number/LPC6WEILTK6YZMJIORHNCL4MWF/events.json","paper":"https://pith.science/paper/LPC6WEIL"},"agent_actions":{"view_html":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF","download_json":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF.json","view_paper":"https://pith.science/paper/LPC6WEIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7042&json=true","fetch_graph":"https://pith.science/api/pith-number/LPC6WEILTK6YZMJIORHNCL4MWF/graph.json","fetch_events":"https://pith.science/api/pith-number/LPC6WEILTK6YZMJIORHNCL4MWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF/action/storage_attestation","attest_author":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF/action/author_attestation","sign_citation":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF/action/citation_signature","submit_replication":"https://pith.science/pith/LPC6WEILTK6YZMJIORHNCL4MWF/action/replication_record"}},"created_at":"2026-05-18T01:34:30.199288+00:00","updated_at":"2026-05-18T01:34:30.199288+00:00"}