{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C6CSMZHNG7UDQOKMBISXPNLTLL","short_pith_number":"pith:C6CSMZHN","canonical_record":{"source":{"id":"1501.03724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-15T16:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"aa3daf6f898ada215b43bbce7b456663369e8e51b19241c893784141c87e5fb6","abstract_canon_sha256":"b196783b501b7f96692a2a72283de7478f33edd77dea5c02868e93a7b77fb870"},"schema_version":"1.0"},"canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","source":{"kind":"arxiv","id":"1501.03724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03724","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03724v1","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03724","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"C6CSMZHNG7UD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C6CSMZHNG7UDQOKM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C6CSMZHN","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C6CSMZHNG7UDQOKMBISXPNLTLL","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-15T16:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"aa3daf6f898ada215b43bbce7b456663369e8e51b19241c893784141c87e5fb6","abstract_canon_sha256":"b196783b501b7f96692a2a72283de7478f33edd77dea5c02868e93a7b77fb870"},"schema_version":"1.0"},"canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:17.934114Z","signature_b64":"GtU3/EIVU/P0L74OLzF2Whd47oyWc40Kv4FVw9oPEyk/NaXZyA1P1BSWawfHHUEzh/8QdaRkBzOQxxYeo+ZsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","last_reissued_at":"2026-05-18T02:29:17.933674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:17.933674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03724","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTBQc4YCRYFCmUrPn7eIeYEcs4rD1b3EaCqDkw7ceNheS8i86/tgtUJeIk+eMykWUfn2KMqB7Tn087fGoUrhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:23.379947Z"},"content_sha256":"430865dd67fde84954ef5cf4d63c814d5d3740def2818edf8d837075bc0bab82","schema_version":"1.0","event_id":"sha256:430865dd67fde84954ef5cf4d63c814d5d3740def2818edf8d837075bc0bab82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C6CSMZHNG7UDQOKMBISXPNLTLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A faster algorithm for the discrete Fr\\'echet distance under translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Micha Sharir, Rinat Ben Avraham","submitted_at":"2015-01-15T16:00:50Z","abstract_excerpt":"The discrete Fr\\'echet distance is a useful similarity measure for comparing two sequences of points $P=(p_1,\\ldots, p_m)$ and $Q=(q_1,\\ldots,q_n)$. In many applications, the quality of the matching can be improved if we let $Q$ undergo some transformation relative to $P$. In this paper we consider the problem of finding a translation of $Q$ that brings the discrete Fr\\'echet distance between $P$ and $Q$ to a minimum. We devise an algorithm that computes the minimum discrete Fr\\'echet distance under translation in $\\mathbb{R}^2$, and runs in $O(m^3n^2(1+\\log(n/m))\\log(m+n))$ time, assuming $m\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03724","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmSGJH1ciWonqFEUxTn+96MEYmKzSEnup0QdNb6+pESw0hHC5MQbPdy/mNsmo962nzMrqknAEf85hRc2UGppBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:23.380598Z"},"content_sha256":"62c794791008bae2e45206d664e2f281b25ce9a3f3f81990b4c3f0b163eddb2b","schema_version":"1.0","event_id":"sha256:62c794791008bae2e45206d664e2f281b25ce9a3f3f81990b4c3f0b163eddb2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/bundle.json","state_url":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T11:53:23Z","links":{"resolver":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL","bundle":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/bundle.json","state":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C6CSMZHNG7UDQOKMBISXPNLTLL","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":"b196783b501b7f96692a2a72283de7478f33edd77dea5c02868e93a7b77fb870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-15T16:00:50Z","title_canon_sha256":"aa3daf6f898ada215b43bbce7b456663369e8e51b19241c893784141c87e5fb6"},"schema_version":"1.0","source":{"id":"1501.03724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03724","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03724v1","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03724","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"C6CSMZHNG7UD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C6CSMZHNG7UDQOKM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C6CSMZHN","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:62c794791008bae2e45206d664e2f281b25ce9a3f3f81990b4c3f0b163eddb2b","target":"graph","created_at":"2026-05-18T02:29:17Z","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":"The discrete Fr\\'echet distance is a useful similarity measure for comparing two sequences of points $P=(p_1,\\ldots, p_m)$ and $Q=(q_1,\\ldots,q_n)$. In many applications, the quality of the matching can be improved if we let $Q$ undergo some transformation relative to $P$. In this paper we consider the problem of finding a translation of $Q$ that brings the discrete Fr\\'echet distance between $P$ and $Q$ to a minimum. We devise an algorithm that computes the minimum discrete Fr\\'echet distance under translation in $\\mathbb{R}^2$, and runs in $O(m^3n^2(1+\\log(n/m))\\log(m+n))$ time, assuming $m\\","authors_text":"Haim Kaplan, Micha Sharir, Rinat Ben Avraham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-15T16:00:50Z","title":"A faster algorithm for the discrete Fr\\'echet distance under translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03724","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:430865dd67fde84954ef5cf4d63c814d5d3740def2818edf8d837075bc0bab82","target":"record","created_at":"2026-05-18T02:29:17Z","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":"b196783b501b7f96692a2a72283de7478f33edd77dea5c02868e93a7b77fb870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-15T16:00:50Z","title_canon_sha256":"aa3daf6f898ada215b43bbce7b456663369e8e51b19241c893784141c87e5fb6"},"schema_version":"1.0","source":{"id":"1501.03724","kind":"arxiv","version":1}},"canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","first_computed_at":"2026-05-18T02:29:17.933674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:17.933674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtU3/EIVU/P0L74OLzF2Whd47oyWc40Kv4FVw9oPEyk/NaXZyA1P1BSWawfHHUEzh/8QdaRkBzOQxxYeo+ZsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:17.934114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:430865dd67fde84954ef5cf4d63c814d5d3740def2818edf8d837075bc0bab82","sha256:62c794791008bae2e45206d664e2f281b25ce9a3f3f81990b4c3f0b163eddb2b"],"state_sha256":"8904fd1f2340fefc60a0bc9d6646d86e73998b60f53e32990a29186c53decc5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zF2becGGef8DFw6UpUDGwcx0kFTU1JD/1BnqG5wz+VgdhX96Fl3w8kj2mFVl0xOoTuVS4aSzDSFz/EDRj/GNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:53:23.384226Z","bundle_sha256":"93b77749be0aa0577d6cf47d8b6bc553a98fb494dede91bdfb7a34c21a0e043f"}}