{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CIQ2N2RGFWWA76V4NK62IWI7PE","short_pith_number":"pith:CIQ2N2RG","schema_version":"1.0","canonical_sha256":"1221a6ea262dac0ffabc6abda4591f79003e35fe6f1230002491de6232ce1cad","source":{"kind":"arxiv","id":"1408.1340","version":1},"attestation_state":"computed","paper":{"title":"Improved approximation for Fr\\'echet distance on c-packed curves matching conditional lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2014-08-06T16:15:54Z","abstract_excerpt":"The Fr\\'echet distance is a well-studied and very popular measure of similarity of two curves. The best known algorithms have quadratic time complexity, which has recently been shown to be optimal assuming the Strong Exponential Time Hypothesis (SETH) [Bringmann FOCS'14].\n  To overcome the worst-case quadratic time barrier, restricted classes of curves have been studied that attempt to capture realistic input curves. The most popular such class are c-packed curves, for which the Fr\\'echet distance has a $(1+\\epsilon)$-approximation in time $\\tilde{O}(c n /\\epsilon)$ [Driemel et al. DCG'12]. In"},"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":"1408.1340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-06T16:15:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"75f1bd4c0db1cde50e34946697b93bd38bc47f2d57e7a3fb402936211c0d4848","abstract_canon_sha256":"7c91591b567306d7335f07de08caa6b229ab944762c3a6d0f9808bc480cb63c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:41.519244Z","signature_b64":"9NBYgKq0DquyhNHeRIzwQ2B1fQajjksHTpw9Hbj97z1Igzycya4lU5N5kfxCILO62w3nEkMXu4Pce/VYj884CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1221a6ea262dac0ffabc6abda4591f79003e35fe6f1230002491de6232ce1cad","last_reissued_at":"2026-05-18T02:45:41.518808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:41.518808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation for Fr\\'echet distance on c-packed curves matching conditional lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2014-08-06T16:15:54Z","abstract_excerpt":"The Fr\\'echet distance is a well-studied and very popular measure of similarity of two curves. The best known algorithms have quadratic time complexity, which has recently been shown to be optimal assuming the Strong Exponential Time Hypothesis (SETH) [Bringmann FOCS'14].\n  To overcome the worst-case quadratic time barrier, restricted classes of curves have been studied that attempt to capture realistic input curves. The most popular such class are c-packed curves, for which the Fr\\'echet distance has a $(1+\\epsilon)$-approximation in time $\\tilde{O}(c n /\\epsilon)$ [Driemel et al. DCG'12]. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1340","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":"1408.1340","created_at":"2026-05-18T02:45:41.518873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1340v1","created_at":"2026-05-18T02:45:41.518873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1340","created_at":"2026-05-18T02:45:41.518873+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIQ2N2RGFWWA","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIQ2N2RGFWWA76V4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIQ2N2RG","created_at":"2026-05-18T12:28:22.404517+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/CIQ2N2RGFWWA76V4NK62IWI7PE","json":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE.json","graph_json":"https://pith.science/api/pith-number/CIQ2N2RGFWWA76V4NK62IWI7PE/graph.json","events_json":"https://pith.science/api/pith-number/CIQ2N2RGFWWA76V4NK62IWI7PE/events.json","paper":"https://pith.science/paper/CIQ2N2RG"},"agent_actions":{"view_html":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE","download_json":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE.json","view_paper":"https://pith.science/paper/CIQ2N2RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1340&json=true","fetch_graph":"https://pith.science/api/pith-number/CIQ2N2RGFWWA76V4NK62IWI7PE/graph.json","fetch_events":"https://pith.science/api/pith-number/CIQ2N2RGFWWA76V4NK62IWI7PE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE/action/storage_attestation","attest_author":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE/action/author_attestation","sign_citation":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE/action/citation_signature","submit_replication":"https://pith.science/pith/CIQ2N2RGFWWA76V4NK62IWI7PE/action/replication_record"}},"created_at":"2026-05-18T02:45:41.518873+00:00","updated_at":"2026-05-18T02:45:41.518873+00:00"}