{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GFOLCWASP6ZMURTYWLFHYE64PG","short_pith_number":"pith:GFOLCWAS","schema_version":"1.0","canonical_sha256":"315cb158127fb2ca4678b2ca7c13dc79a1d1061d0b6476544b3eb849539f84b0","source":{"kind":"arxiv","id":"1904.11026","version":1},"attestation_state":"computed","paper":{"title":"Efficient Nearest-Neighbor Query and Clustering of Planar Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Khadijeh Sheikhan, Matthew J. Katz, Michael Horton, Omrit Filtser","submitted_at":"2019-04-24T19:15:31Z","abstract_excerpt":"We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal is to construct a compact data structure over $\\mathcal{C}$, such that, given a query curve $Q$, one can efficiently find the curve in $\\mathcal{C}$ closest to $Q$. In the center problem, the goal is to find a curve $Q$, such that the maximum distance between $Q$ and the curves in $\\mathcal{C}$ is minimized. We use the well-known discrete Frechet distance f"},"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":"1904.11026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-24T19:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"d93ccccdb3c005e1bddb81194cfcbdaffe370daf4deed4a37dd4f8ac9d85f5b7","abstract_canon_sha256":"8c2dda7d97db3b8b4cdbfa329a9f52ac76597f82f3d8c25b72857c90f71c915a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:47.851288Z","signature_b64":"0Py4b2/xFpaKgluIN20aJHxjV7bkakR0fNWVHjsFZpz0o5R+Y0lnG/Wr/9BX1jid8qqSsA6mMMcFUCVjEu+kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"315cb158127fb2ca4678b2ca7c13dc79a1d1061d0b6476544b3eb849539f84b0","last_reissued_at":"2026-05-17T23:47:47.850691Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:47.850691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Nearest-Neighbor Query and Clustering of Planar Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Khadijeh Sheikhan, Matthew J. Katz, Michael Horton, Omrit Filtser","submitted_at":"2019-04-24T19:15:31Z","abstract_excerpt":"We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal is to construct a compact data structure over $\\mathcal{C}$, such that, given a query curve $Q$, one can efficiently find the curve in $\\mathcal{C}$ closest to $Q$. In the center problem, the goal is to find a curve $Q$, such that the maximum distance between $Q$ and the curves in $\\mathcal{C}$ is minimized. We use the well-known discrete Frechet distance f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11026","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":"1904.11026","created_at":"2026-05-17T23:47:47.850783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11026v1","created_at":"2026-05-17T23:47:47.850783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11026","created_at":"2026-05-17T23:47:47.850783+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFOLCWASP6ZM","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFOLCWASP6ZMURTY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFOLCWAS","created_at":"2026-05-18T12:33:18.533446+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/GFOLCWASP6ZMURTYWLFHYE64PG","json":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG.json","graph_json":"https://pith.science/api/pith-number/GFOLCWASP6ZMURTYWLFHYE64PG/graph.json","events_json":"https://pith.science/api/pith-number/GFOLCWASP6ZMURTYWLFHYE64PG/events.json","paper":"https://pith.science/paper/GFOLCWAS"},"agent_actions":{"view_html":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG","download_json":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG.json","view_paper":"https://pith.science/paper/GFOLCWAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11026&json=true","fetch_graph":"https://pith.science/api/pith-number/GFOLCWASP6ZMURTYWLFHYE64PG/graph.json","fetch_events":"https://pith.science/api/pith-number/GFOLCWASP6ZMURTYWLFHYE64PG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG/action/storage_attestation","attest_author":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG/action/author_attestation","sign_citation":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG/action/citation_signature","submit_replication":"https://pith.science/pith/GFOLCWASP6ZMURTYWLFHYE64PG/action/replication_record"}},"created_at":"2026-05-17T23:47:47.850783+00:00","updated_at":"2026-05-17T23:47:47.850783+00:00"}