{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SDTT7F6OZSKGILEV6EQTVCVUVS","short_pith_number":"pith:SDTT7F6O","schema_version":"1.0","canonical_sha256":"90e73f97cecc94642c95f1213a8ab4ac927d8378ce92ee5e418d4112c39ae716","source":{"kind":"arxiv","id":"1505.04093","version":1},"attestation_state":"computed","paper":{"title":"Frechet similarity of closed polygonal curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"E. Vodolazskiy, M. Schlesinger, V. Yakovenko","submitted_at":"2015-05-15T15:21:52Z","abstract_excerpt":"The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time."},"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":"1505.04093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-15T15:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"f15f008deb22bfec1a6bc750676b8d5214b0bd80877cf802d8f74e5676ecfd76","abstract_canon_sha256":"5021f9f9d4c48d4ae3c59364e5d413531631cb66a6716f5b2786925ad66d0b8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:40.163575Z","signature_b64":"3C91N2SpJSmcbLfJ0WKUwyTFj9/VfPToa3P3BUDiX8r/F2a0qD8xw8d+yUif2CIM/bJgNWRAtlDrRy1JJd3MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90e73f97cecc94642c95f1213a8ab4ac927d8378ce92ee5e418d4112c39ae716","last_reissued_at":"2026-05-18T02:09:40.162793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:40.162793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frechet similarity of closed polygonal curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"E. Vodolazskiy, M. Schlesinger, V. Yakovenko","submitted_at":"2015-05-15T15:21:52Z","abstract_excerpt":"The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04093","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":"1505.04093","created_at":"2026-05-18T02:09:40.162910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04093v1","created_at":"2026-05-18T02:09:40.162910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04093","created_at":"2026-05-18T02:09:40.162910+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDTT7F6OZSKG","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDTT7F6OZSKGILEV","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDTT7F6O","created_at":"2026-05-18T12:29:39.896362+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/SDTT7F6OZSKGILEV6EQTVCVUVS","json":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS.json","graph_json":"https://pith.science/api/pith-number/SDTT7F6OZSKGILEV6EQTVCVUVS/graph.json","events_json":"https://pith.science/api/pith-number/SDTT7F6OZSKGILEV6EQTVCVUVS/events.json","paper":"https://pith.science/paper/SDTT7F6O"},"agent_actions":{"view_html":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS","download_json":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS.json","view_paper":"https://pith.science/paper/SDTT7F6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04093&json=true","fetch_graph":"https://pith.science/api/pith-number/SDTT7F6OZSKGILEV6EQTVCVUVS/graph.json","fetch_events":"https://pith.science/api/pith-number/SDTT7F6OZSKGILEV6EQTVCVUVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS/action/storage_attestation","attest_author":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS/action/author_attestation","sign_citation":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS/action/citation_signature","submit_replication":"https://pith.science/pith/SDTT7F6OZSKGILEV6EQTVCVUVS/action/replication_record"}},"created_at":"2026-05-18T02:09:40.162910+00:00","updated_at":"2026-05-18T02:09:40.162910+00:00"}