{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HOSBRP73SCDTETQMNDZVD6M7G7","short_pith_number":"pith:HOSBRP73","schema_version":"1.0","canonical_sha256":"3ba418bffb9087324e0c68f351f99f37f51e606b20b2c85ca0de6ff74a088d27","source":{"kind":"arxiv","id":"1103.2865","version":1},"attestation_state":"computed","paper":{"title":"Computing the Fr\\'{e}chet Distance Between Folded Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Atlas F. Cook IV, Carola Wenk, Jessica Sherette, Sariel Har-Peled","submitted_at":"2011-03-15T09:52:03Z","abstract_excerpt":"Computing the Fr\\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\\'{e}chet distance for a class of non-flat surfaces which we call folded polygons. Unfortunately, the original algorithm cannot be extended directly. We present three different methods to adapt it. The first of which is a fixed-parameter tractable algorithm. The second is a polynomial-time approximation algorithm. Finally, we present a restricted class of folded polygons for which "},"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":"1103.2865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-15T09:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"61bf17023b16371a17057e4ce77bcf8f98137fec6a203e73ba4864163b72633c","abstract_canon_sha256":"1df462e7d2104cbd58ae4b0e75b0dba33d9fe64c1cbeac4db3f54be915d3b155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:46.367736Z","signature_b64":"AVOU5c4gx9DsIIx0mUhNrQrvfiImc4uULOAhdhvhzg+JPH5mKUpw/BvTlE+tnN9pxSAcPVUC/pnn8evPt1PLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba418bffb9087324e0c68f351f99f37f51e606b20b2c85ca0de6ff74a088d27","last_reissued_at":"2026-05-18T04:26:46.367116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:46.367116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Fr\\'{e}chet Distance Between Folded Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Atlas F. Cook IV, Carola Wenk, Jessica Sherette, Sariel Har-Peled","submitted_at":"2011-03-15T09:52:03Z","abstract_excerpt":"Computing the Fr\\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\\'{e}chet distance for a class of non-flat surfaces which we call folded polygons. Unfortunately, the original algorithm cannot be extended directly. We present three different methods to adapt it. The first of which is a fixed-parameter tractable algorithm. The second is a polynomial-time approximation algorithm. Finally, we present a restricted class of folded polygons for which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2865","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.2865","created_at":"2026-05-18T04:26:46.367234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2865v1","created_at":"2026-05-18T04:26:46.367234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2865","created_at":"2026-05-18T04:26:46.367234+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOSBRP73SCDT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOSBRP73SCDTETQM","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOSBRP73","created_at":"2026-05-18T12:26:30.835961+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/HOSBRP73SCDTETQMNDZVD6M7G7","json":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7.json","graph_json":"https://pith.science/api/pith-number/HOSBRP73SCDTETQMNDZVD6M7G7/graph.json","events_json":"https://pith.science/api/pith-number/HOSBRP73SCDTETQMNDZVD6M7G7/events.json","paper":"https://pith.science/paper/HOSBRP73"},"agent_actions":{"view_html":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7","download_json":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7.json","view_paper":"https://pith.science/paper/HOSBRP73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2865&json=true","fetch_graph":"https://pith.science/api/pith-number/HOSBRP73SCDTETQMNDZVD6M7G7/graph.json","fetch_events":"https://pith.science/api/pith-number/HOSBRP73SCDTETQMNDZVD6M7G7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/action/storage_attestation","attest_author":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/action/author_attestation","sign_citation":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/action/citation_signature","submit_replication":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/action/replication_record"}},"created_at":"2026-05-18T04:26:46.367234+00:00","updated_at":"2026-05-18T04:26:46.367234+00:00"}