{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HOSBRP73SCDTETQMNDZVD6M7G7","short_pith_number":"pith:HOSBRP73","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"},"canonical_sha256":"3ba418bffb9087324e0c68f351f99f37f51e606b20b2c85ca0de6ff74a088d27","source":{"kind":"arxiv","id":"1103.2865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2865","created_at":"2026-05-18T04:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2865v1","created_at":"2026-05-18T04:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2865","created_at":"2026-05-18T04:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"HOSBRP73SCDT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOSBRP73SCDTETQM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOSBRP73","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HOSBRP73SCDTETQMNDZVD6M7G7","target":"record","payload":{"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"},"canonical_sha256":"3ba418bffb9087324e0c68f351f99f37f51e606b20b2c85ca0de6ff74a088d27","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"},"source_kind":"arxiv","source_id":"1103.2865","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-18T04:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4sqHxAeVHqBwNWRrKVxEDYvXYrWJUyHzW8hJbmGRrxQGVuaGjKGUE3FszfW7RWxTfJeNbB4Z0wvDGn4e1ZH3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:34:57.816877Z"},"content_sha256":"518a6b6fa914d3b4607f9906f1c2b4ef38eb216b92d23d038181497a3581c7fe","schema_version":"1.0","event_id":"sha256:518a6b6fa914d3b4607f9906f1c2b4ef38eb216b92d23d038181497a3581c7fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HOSBRP73SCDTETQMNDZVD6M7G7","target":"graph","payload":{"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"},"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-18T04:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yvf8zsh/e57jLHpVMsohAfB7OnvUomBJzT/To837YbvVxQtvrQPLpqj7p1VrYKC4zgtW5jbOeyKm5gmXf3qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:34:57.817222Z"},"content_sha256":"c108290f930cabd491446cf11593e69c534c765e5382c1f9d421bca8de6be9d7","schema_version":"1.0","event_id":"sha256:c108290f930cabd491446cf11593e69c534c765e5382c1f9d421bca8de6be9d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/bundle.json","state_url":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOSBRP73SCDTETQMNDZVD6M7G7/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-02T03:34:57Z","links":{"resolver":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7","bundle":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/bundle.json","state":"https://pith.science/pith/HOSBRP73SCDTETQMNDZVD6M7G7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOSBRP73SCDTETQMNDZVD6M7G7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HOSBRP73SCDTETQMNDZVD6M7G7","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":"1df462e7d2104cbd58ae4b0e75b0dba33d9fe64c1cbeac4db3f54be915d3b155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-15T09:52:03Z","title_canon_sha256":"61bf17023b16371a17057e4ce77bcf8f98137fec6a203e73ba4864163b72633c"},"schema_version":"1.0","source":{"id":"1103.2865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2865","created_at":"2026-05-18T04:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2865v1","created_at":"2026-05-18T04:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2865","created_at":"2026-05-18T04:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"HOSBRP73SCDT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOSBRP73SCDTETQM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOSBRP73","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:c108290f930cabd491446cf11593e69c534c765e5382c1f9d421bca8de6be9d7","target":"graph","created_at":"2026-05-18T04:26:46Z","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":"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 ","authors_text":"Anne Driemel, Atlas F. Cook IV, Carola Wenk, Jessica Sherette, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-15T09:52:03Z","title":"Computing the Fr\\'{e}chet Distance Between Folded Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2865","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:518a6b6fa914d3b4607f9906f1c2b4ef38eb216b92d23d038181497a3581c7fe","target":"record","created_at":"2026-05-18T04:26:46Z","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":"1df462e7d2104cbd58ae4b0e75b0dba33d9fe64c1cbeac4db3f54be915d3b155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-15T09:52:03Z","title_canon_sha256":"61bf17023b16371a17057e4ce77bcf8f98137fec6a203e73ba4864163b72633c"},"schema_version":"1.0","source":{"id":"1103.2865","kind":"arxiv","version":1}},"canonical_sha256":"3ba418bffb9087324e0c68f351f99f37f51e606b20b2c85ca0de6ff74a088d27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba418bffb9087324e0c68f351f99f37f51e606b20b2c85ca0de6ff74a088d27","first_computed_at":"2026-05-18T04:26:46.367116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:46.367116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AVOU5c4gx9DsIIx0mUhNrQrvfiImc4uULOAhdhvhzg+JPH5mKUpw/BvTlE+tnN9pxSAcPVUC/pnn8evPt1PLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:46.367736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:518a6b6fa914d3b4607f9906f1c2b4ef38eb216b92d23d038181497a3581c7fe","sha256:c108290f930cabd491446cf11593e69c534c765e5382c1f9d421bca8de6be9d7"],"state_sha256":"47da5eddef9a00ffb9258d58fb051811383cef7a5e231cfe5e3f340639721a7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMOwR87q4ESSSRJq6mCeUa6PpWioNYJwTedTmvmXNPgWHaQlAl6PZaw1WYdqOQ6gzquNQSgTudxRq0pQcl/YBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:34:57.819272Z","bundle_sha256":"94fa8fed8066d88ec78d7b71aa6409e63d34539e6a25d32b3b921660130d2840"}}