{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2E2SRFCZAJ2NT5PIZZHLB6YOGI","short_pith_number":"pith:2E2SRFCZ","schema_version":"1.0","canonical_sha256":"d1352894590274d9f5e8ce4eb0fb0e32177c02aab293c948c2f1fb6c67ddf5c4","source":{"kind":"arxiv","id":"2512.07728","version":2},"attestation_state":"computed","paper":{"title":"On computing the (exact) Fr\\'echet distance with a frog","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Ivor van der Hoog, Jacobus Conradi","submitted_at":"2025-12-08T17:18:26Z","abstract_excerpt":"The continuous Frechet distance between two polygonal curves is classically computed by exploring their free space diagram. Recently, Har-Peled, Raichel, and Robson [SoCG'25] proposed a radically different approach: instead of directly traversing the continuous free space, they approximate the distance by computing paths in a discrete graph derived from the discrete free space, recursively bisecting edges until the discrete distance converges to the continuous Frechet distance. They implement this so-called frog-based technique and report substantial practical speedups over the state of the ar"},"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":"2512.07728","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-12-08T17:18:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cc2ed7bd9f4c4f17f77b9af3bbe892dc107f95aa6f14d707d09ff6f4f7a18443","abstract_canon_sha256":"440f6fefc5927d3e69063b1e8db7eb7b0671709319516b659fd76ba3f117a412"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:29.782618Z","signature_b64":"0iVRQMeitkCDIkCopBXkAIyS6O9nY1o1G6UL6ydd7LuE/zOh6EA3iKQDvCzXvIdsdPUQ4HSnZValgGRIT6vuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1352894590274d9f5e8ce4eb0fb0e32177c02aab293c948c2f1fb6c67ddf5c4","last_reissued_at":"2026-05-20T00:00:29.781917Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:29.781917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On computing the (exact) Fr\\'echet distance with a frog","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Ivor van der Hoog, Jacobus Conradi","submitted_at":"2025-12-08T17:18:26Z","abstract_excerpt":"The continuous Frechet distance between two polygonal curves is classically computed by exploring their free space diagram. Recently, Har-Peled, Raichel, and Robson [SoCG'25] proposed a radically different approach: instead of directly traversing the continuous free space, they approximate the distance by computing paths in a discrete graph derived from the discrete free space, recursively bisecting edges until the discrete distance converges to the continuous Frechet distance. They implement this so-called frog-based technique and report substantial practical speedups over the state of the ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.07728","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.07728/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2512.07728","created_at":"2026-05-20T00:00:29.782036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.07728v2","created_at":"2026-05-20T00:00:29.782036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.07728","created_at":"2026-05-20T00:00:29.782036+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E2SRFCZAJ2N","created_at":"2026-05-20T00:00:29.782036+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E2SRFCZAJ2NT5PI","created_at":"2026-05-20T00:00:29.782036+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E2SRFCZ","created_at":"2026-05-20T00:00:29.782036+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/2E2SRFCZAJ2NT5PIZZHLB6YOGI","json":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI.json","graph_json":"https://pith.science/api/pith-number/2E2SRFCZAJ2NT5PIZZHLB6YOGI/graph.json","events_json":"https://pith.science/api/pith-number/2E2SRFCZAJ2NT5PIZZHLB6YOGI/events.json","paper":"https://pith.science/paper/2E2SRFCZ"},"agent_actions":{"view_html":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI","download_json":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI.json","view_paper":"https://pith.science/paper/2E2SRFCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.07728&json=true","fetch_graph":"https://pith.science/api/pith-number/2E2SRFCZAJ2NT5PIZZHLB6YOGI/graph.json","fetch_events":"https://pith.science/api/pith-number/2E2SRFCZAJ2NT5PIZZHLB6YOGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI/action/storage_attestation","attest_author":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI/action/author_attestation","sign_citation":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI/action/citation_signature","submit_replication":"https://pith.science/pith/2E2SRFCZAJ2NT5PIZZHLB6YOGI/action/replication_record"}},"created_at":"2026-05-20T00:00:29.782036+00:00","updated_at":"2026-05-20T00:00:29.782036+00:00"}