{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GFOLCWASP6ZMURTYWLFHYE64PG","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":"8c2dda7d97db3b8b4cdbfa329a9f52ac76597f82f3d8c25b72857c90f71c915a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-24T19:15:31Z","title_canon_sha256":"d93ccccdb3c005e1bddb81194cfcbdaffe370daf4deed4a37dd4f8ac9d85f5b7"},"schema_version":"1.0","source":{"id":"1904.11026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11026","created_at":"2026-05-17T23:47:47Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11026v1","created_at":"2026-05-17T23:47:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11026","created_at":"2026-05-17T23:47:47Z"},{"alias_kind":"pith_short_12","alias_value":"GFOLCWASP6ZM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GFOLCWASP6ZMURTY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GFOLCWAS","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:5e0849b7cc5e6a54e508fadcbb65020d022b14351c802533cf91f646b5888fff","target":"graph","created_at":"2026-05-17T23:47:47Z","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":"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","authors_text":"Boris Aronov, Khadijeh Sheikhan, Matthew J. Katz, Michael Horton, Omrit Filtser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-24T19:15:31Z","title":"Efficient Nearest-Neighbor Query and Clustering of Planar Curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11026","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:57df7dfbbd6f47348cb50f12f62670234193528848c94d5ea6dcf3e8cc6cdf2a","target":"record","created_at":"2026-05-17T23:47:47Z","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":"8c2dda7d97db3b8b4cdbfa329a9f52ac76597f82f3d8c25b72857c90f71c915a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-24T19:15:31Z","title_canon_sha256":"d93ccccdb3c005e1bddb81194cfcbdaffe370daf4deed4a37dd4f8ac9d85f5b7"},"schema_version":"1.0","source":{"id":"1904.11026","kind":"arxiv","version":1}},"canonical_sha256":"315cb158127fb2ca4678b2ca7c13dc79a1d1061d0b6476544b3eb849539f84b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"315cb158127fb2ca4678b2ca7c13dc79a1d1061d0b6476544b3eb849539f84b0","first_computed_at":"2026-05-17T23:47:47.850691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:47.850691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Py4b2/xFpaKgluIN20aJHxjV7bkakR0fNWVHjsFZpz0o5R+Y0lnG/Wr/9BX1jid8qqSsA6mMMcFUCVjEu+kAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:47.851288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57df7dfbbd6f47348cb50f12f62670234193528848c94d5ea6dcf3e8cc6cdf2a","sha256:5e0849b7cc5e6a54e508fadcbb65020d022b14351c802533cf91f646b5888fff"],"state_sha256":"b9eae963d43c780110e7983793608eeba05879e97506b82c97be3f3fc1c3a5ee"}