{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:P73UOPYTJFH3RPOBW5NSFGTNYF","short_pith_number":"pith:P73UOPYT","canonical_record":{"source":{"id":"1306.5527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-24T07:33:40Z","cross_cats_sorted":[],"title_canon_sha256":"bd9cdb89b6afeba9db3fd7d2bdd02eef520a6427386a939c72cd32b18b174937","abstract_canon_sha256":"ad1d2de87fd9db36dd9aca686f9b62c644379f6689bded98e048fc3d8d28cb36"},"schema_version":"1.0"},"canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","source":{"kind":"arxiv","id":"1306.5527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5527","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5527v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5527","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"P73UOPYTJFH3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P73UOPYTJFH3RPOB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P73UOPYT","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:P73UOPYTJFH3RPOBW5NSFGTNYF","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-24T07:33:40Z","cross_cats_sorted":[],"title_canon_sha256":"bd9cdb89b6afeba9db3fd7d2bdd02eef520a6427386a939c72cd32b18b174937","abstract_canon_sha256":"ad1d2de87fd9db36dd9aca686f9b62c644379f6689bded98e048fc3d8d28cb36"},"schema_version":"1.0"},"canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.620263Z","signature_b64":"lYph3vcNCoPdqrw7r+hwUeSgyxGBbSexVuL0wlr3rSCNVUuNyCXWEliROlI70kU4KVGlj8bpLjmKUEseipqrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","last_reissued_at":"2026-05-18T01:09:32.619815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.619815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5527","source_version":2,"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-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOuskNkh2Pz5hp0/IuR2xypCCUivIAzz2rkoRXvJ1hbI4F2MuhqELPyW2iFF1rDIa3An0US2aKxeVFvMmxijDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:46:23.990137Z"},"content_sha256":"7dfb19febdefd2f9f2cb7f30864263a565777d27ff5aa7d24e4edf5b4b63388b","schema_version":"1.0","event_id":"sha256:7dfb19febdefd2f9f2cb7f30864263a565777d27ff5aa7d24e4edf5b4b63388b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:P73UOPYTJFH3RPOBW5NSFGTNYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Fr\\'echet Distance with a Retractable Leash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kevin Buchin, Maike Buchin, Rolf van Leusden, Wolfgang Mulzer, Wouter Meulemans","submitted_at":"2013-06-24T07:33:40Z","abstract_excerpt":"All known algorithms for the Fr\\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fr\\'echet distance between polygonal curves in $R^d$ under polyhedral distance functions (e.g., $L_1$ and $L_\\infty$). We also get a $(1+\\varepsilon)$-approximation of the Fr\\'echet distance under the Euclidean metric, in qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5527","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"},"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-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/cD38R+DMop068YDp0KwSgsPL5hN4MIF0ANhgvg90jcCgdKCB+o02L3skg7xXWyPbuCN/3PN24nt2x1j39XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:46:23.990856Z"},"content_sha256":"d574f7397365ca6c1c9e14d053921ab06257fd603846e96ebcf8c13852049bb3","schema_version":"1.0","event_id":"sha256:d574f7397365ca6c1c9e14d053921ab06257fd603846e96ebcf8c13852049bb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/bundle.json","state_url":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/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-25T01:46:23Z","links":{"resolver":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF","bundle":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/bundle.json","state":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P73UOPYTJFH3RPOBW5NSFGTNYF","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":"ad1d2de87fd9db36dd9aca686f9b62c644379f6689bded98e048fc3d8d28cb36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-24T07:33:40Z","title_canon_sha256":"bd9cdb89b6afeba9db3fd7d2bdd02eef520a6427386a939c72cd32b18b174937"},"schema_version":"1.0","source":{"id":"1306.5527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5527","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5527v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5527","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"P73UOPYTJFH3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P73UOPYTJFH3RPOB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P73UOPYT","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:d574f7397365ca6c1c9e14d053921ab06257fd603846e96ebcf8c13852049bb3","target":"graph","created_at":"2026-05-18T01:09:32Z","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":"All known algorithms for the Fr\\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fr\\'echet distance between polygonal curves in $R^d$ under polyhedral distance functions (e.g., $L_1$ and $L_\\infty$). We also get a $(1+\\varepsilon)$-approximation of the Fr\\'echet distance under the Euclidean metric, in qua","authors_text":"Kevin Buchin, Maike Buchin, Rolf van Leusden, Wolfgang Mulzer, Wouter Meulemans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-24T07:33:40Z","title":"Computing the Fr\\'echet Distance with a Retractable Leash"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5527","kind":"arxiv","version":2},"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:7dfb19febdefd2f9f2cb7f30864263a565777d27ff5aa7d24e4edf5b4b63388b","target":"record","created_at":"2026-05-18T01:09:32Z","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":"ad1d2de87fd9db36dd9aca686f9b62c644379f6689bded98e048fc3d8d28cb36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-24T07:33:40Z","title_canon_sha256":"bd9cdb89b6afeba9db3fd7d2bdd02eef520a6427386a939c72cd32b18b174937"},"schema_version":"1.0","source":{"id":"1306.5527","kind":"arxiv","version":2}},"canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","first_computed_at":"2026-05-18T01:09:32.619815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:32.619815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lYph3vcNCoPdqrw7r+hwUeSgyxGBbSexVuL0wlr3rSCNVUuNyCXWEliROlI70kU4KVGlj8bpLjmKUEseipqrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:32.620263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dfb19febdefd2f9f2cb7f30864263a565777d27ff5aa7d24e4edf5b4b63388b","sha256:d574f7397365ca6c1c9e14d053921ab06257fd603846e96ebcf8c13852049bb3"],"state_sha256":"ec603efee59efce50401ebfb01e721592b3f3baa05fba9320dcad070fc0729a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4n21104uUAs9D1a1Za5VDoUkGbgsxlaWJ7M/qB/eQtfcd4LjzybjX9P/uHAmbn0GleaC5h9pG7Qzu9pM/gJvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:46:23.994362Z","bundle_sha256":"1bb45900830ee25ef6f4fdf10380dbd3a3f9b77a74001af89081eaa9a2ceda89"}}