{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5FSUMD37PCF6I4OGT3L3W5RYA7","short_pith_number":"pith:5FSUMD37","schema_version":"1.0","canonical_sha256":"e965460f7f788be471c69ed7bb763807faad293fa96f38aa8564696eed4e9f59","source":{"kind":"arxiv","id":"1907.04420","version":2},"attestation_state":"computed","paper":{"title":"Sublinear data structures for short Fr\\'echet queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Ioannis Psarros, Melanie Schmidt","submitted_at":"2019-07-09T21:30:21Z","abstract_excerpt":"We study metric data structures for curves in doubling spaces, such as trajectories of moving objects in Euclidean $\\mathbb{R}^d$, where the distance between two curves is measured using the discrete Fr\\'echet distance. We design data structures in an \\emph{asymmetric} setting where the input is a curve (or a set of $n$ curves) each of complexity $m$ and the queries are with curves of complexity $k\\ll m$. We show that there exist approximate data structures that are independent of the input size $N = d \\cdot n \\cdot m$ and we study how to maintain them dynamically if the input is given in the "},"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":"1907.04420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-09T21:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"a355809bc1fea036e71d2d5ee850a781843e65bab5665d9a93eb94f694a0cd40","abstract_canon_sha256":"064232b745070b6d77ea93929a4a296266653adf984a734e9147877c20787759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:48.540419Z","signature_b64":"aEF7t0RViVI1saUwZyOUzp9MV1n7UtmJT4gfrRPFvddHgbDQOoIgaohIAkMguJamUaC8WgYv4ZD3X2kb5G1YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e965460f7f788be471c69ed7bb763807faad293fa96f38aa8564696eed4e9f59","last_reissued_at":"2026-05-17T23:40:48.539730Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:48.539730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear data structures for short Fr\\'echet queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Ioannis Psarros, Melanie Schmidt","submitted_at":"2019-07-09T21:30:21Z","abstract_excerpt":"We study metric data structures for curves in doubling spaces, such as trajectories of moving objects in Euclidean $\\mathbb{R}^d$, where the distance between two curves is measured using the discrete Fr\\'echet distance. We design data structures in an \\emph{asymmetric} setting where the input is a curve (or a set of $n$ curves) each of complexity $m$ and the queries are with curves of complexity $k\\ll m$. We show that there exist approximate data structures that are independent of the input size $N = d \\cdot n \\cdot m$ and we study how to maintain them dynamically if the input is given in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04420","kind":"arxiv","version":2},"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":"1907.04420","created_at":"2026-05-17T23:40:48.539835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04420v2","created_at":"2026-05-17T23:40:48.539835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04420","created_at":"2026-05-17T23:40:48.539835+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FSUMD37PCF6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FSUMD37PCF6I4OG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FSUMD37","created_at":"2026-05-18T12:33:10.108867+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/5FSUMD37PCF6I4OGT3L3W5RYA7","json":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7.json","graph_json":"https://pith.science/api/pith-number/5FSUMD37PCF6I4OGT3L3W5RYA7/graph.json","events_json":"https://pith.science/api/pith-number/5FSUMD37PCF6I4OGT3L3W5RYA7/events.json","paper":"https://pith.science/paper/5FSUMD37"},"agent_actions":{"view_html":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7","download_json":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7.json","view_paper":"https://pith.science/paper/5FSUMD37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04420&json=true","fetch_graph":"https://pith.science/api/pith-number/5FSUMD37PCF6I4OGT3L3W5RYA7/graph.json","fetch_events":"https://pith.science/api/pith-number/5FSUMD37PCF6I4OGT3L3W5RYA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7/action/storage_attestation","attest_author":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7/action/author_attestation","sign_citation":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7/action/citation_signature","submit_replication":"https://pith.science/pith/5FSUMD37PCF6I4OGT3L3W5RYA7/action/replication_record"}},"created_at":"2026-05-17T23:40:48.539835+00:00","updated_at":"2026-05-17T23:40:48.539835+00:00"}