{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DHRIEG5L6XKACCWOBPVZF6EDWC","short_pith_number":"pith:DHRIEG5L","canonical_record":{"source":{"id":"2404.18738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-04-29T14:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"9e99638d773879b5980cba0448668706fbf5cbe7be406742a05bc8a1eb393d2f","abstract_canon_sha256":"926a5297df82b90a43bf53692a7af72eb81c4e57b15a4bec1b6cd12d3507c5b1"},"schema_version":"1.0"},"canonical_sha256":"19e2821babf5d4010ace0beb92f883b085478f4b527101dc6541242ac1587166","source":{"kind":"arxiv","id":"2404.18738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.18738","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"2404.18738v2","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18738","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"DHRIEG5L6XKA","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"pith_short_16","alias_value":"DHRIEG5L6XKACCWO","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"pith_short_8","alias_value":"DHRIEG5L","created_at":"2026-07-05T08:51:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DHRIEG5L6XKACCWOBPVZF6EDWC","target":"record","payload":{"canonical_record":{"source":{"id":"2404.18738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-04-29T14:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"9e99638d773879b5980cba0448668706fbf5cbe7be406742a05bc8a1eb393d2f","abstract_canon_sha256":"926a5297df82b90a43bf53692a7af72eb81c4e57b15a4bec1b6cd12d3507c5b1"},"schema_version":"1.0"},"canonical_sha256":"19e2821babf5d4010ace0beb92f883b085478f4b527101dc6541242ac1587166","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:16.822217Z","signature_b64":"7OCOlpbvE4iM4TXb6vaXjnKO/QgJAX1o5w0beJXf7uU4RnWqBKqnIeA7qh6fwnxjHlNxb3gGqVa2YiA3u1LkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19e2821babf5d4010ace0beb92f883b085478f4b527101dc6541242ac1587166","last_reissued_at":"2026-07-05T08:51:16.821784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:16.821784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.18738","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-07-05T08:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/UPQ8yz+6OsNIfYYuegdE5oz7dg2AYBHz1ytQ5YcnfAVBRBBtfuM7KbiNiXfLtvSO8apsz+KMqwkH4k7zjZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:29:35.003399Z"},"content_sha256":"863cf231b83097c96cfccfe27ec984adaf460075be3d6b6504f51999dc3b91bd","schema_version":"1.0","event_id":"sha256:863cf231b83097c96cfccfe27ec984adaf460075be3d6b6504f51999dc3b91bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DHRIEG5L6XKACCWOBPVZF6EDWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A faster algorithm for the Fr\\'echet distance in 1D for the imbalanced case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Lotte Blank","submitted_at":"2024-04-29T14:37:56Z","abstract_excerpt":"The fine-grained complexity of computing the Fr\\'echet distance has been a topic of much recent work, starting with the quadratic SETH-based conditional lower bound by Bringmann from 2014. Subsequent work established largely the same complexity lower bounds for the Fr\\'echet distance in 1D. However, the imbalanced case, which was shown by Bringmann to be tight in dimensions $d\\geq 2$, was still left open. Filling in this gap, we show that a faster algorithm for the Fr\\'echet distance in the imbalanced case is possible: Given two 1-dimensional curves of complexity $n$ and $n^{\\alpha}$ for some "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18738","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/2404.18738/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"},"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-07-05T08:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBZqSG7VFVeV4nmmuai8PkwMPCmDnxAEGqJ7T7MeW8j/m6ev4eH/PgUgKqT3InMDiQ2lJT0np4H7etPv0pFfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:29:35.003891Z"},"content_sha256":"45a79f4c0c4befee026ea4588ab696ee1d2b275d970b3f54563fb17256c95979","schema_version":"1.0","event_id":"sha256:45a79f4c0c4befee026ea4588ab696ee1d2b275d970b3f54563fb17256c95979"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHRIEG5L6XKACCWOBPVZF6EDWC/bundle.json","state_url":"https://pith.science/pith/DHRIEG5L6XKACCWOBPVZF6EDWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHRIEG5L6XKACCWOBPVZF6EDWC/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-08-21T03:29:35Z","links":{"resolver":"https://pith.science/pith/DHRIEG5L6XKACCWOBPVZF6EDWC","bundle":"https://pith.science/pith/DHRIEG5L6XKACCWOBPVZF6EDWC/bundle.json","state":"https://pith.science/pith/DHRIEG5L6XKACCWOBPVZF6EDWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHRIEG5L6XKACCWOBPVZF6EDWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DHRIEG5L6XKACCWOBPVZF6EDWC","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":"926a5297df82b90a43bf53692a7af72eb81c4e57b15a4bec1b6cd12d3507c5b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-04-29T14:37:56Z","title_canon_sha256":"9e99638d773879b5980cba0448668706fbf5cbe7be406742a05bc8a1eb393d2f"},"schema_version":"1.0","source":{"id":"2404.18738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.18738","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"2404.18738v2","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18738","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"DHRIEG5L6XKA","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"pith_short_16","alias_value":"DHRIEG5L6XKACCWO","created_at":"2026-07-05T08:51:16Z"},{"alias_kind":"pith_short_8","alias_value":"DHRIEG5L","created_at":"2026-07-05T08:51:16Z"}],"graph_snapshots":[{"event_id":"sha256:45a79f4c0c4befee026ea4588ab696ee1d2b275d970b3f54563fb17256c95979","target":"graph","created_at":"2026-07-05T08:51:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.18738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The fine-grained complexity of computing the Fr\\'echet distance has been a topic of much recent work, starting with the quadratic SETH-based conditional lower bound by Bringmann from 2014. Subsequent work established largely the same complexity lower bounds for the Fr\\'echet distance in 1D. However, the imbalanced case, which was shown by Bringmann to be tight in dimensions $d\\geq 2$, was still left open. Filling in this gap, we show that a faster algorithm for the Fr\\'echet distance in the imbalanced case is possible: Given two 1-dimensional curves of complexity $n$ and $n^{\\alpha}$ for some ","authors_text":"Anne Driemel, Lotte Blank","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-04-29T14:37:56Z","title":"A faster algorithm for the Fr\\'echet distance in 1D for the imbalanced case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18738","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:863cf231b83097c96cfccfe27ec984adaf460075be3d6b6504f51999dc3b91bd","target":"record","created_at":"2026-07-05T08:51:16Z","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":"926a5297df82b90a43bf53692a7af72eb81c4e57b15a4bec1b6cd12d3507c5b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-04-29T14:37:56Z","title_canon_sha256":"9e99638d773879b5980cba0448668706fbf5cbe7be406742a05bc8a1eb393d2f"},"schema_version":"1.0","source":{"id":"2404.18738","kind":"arxiv","version":2}},"canonical_sha256":"19e2821babf5d4010ace0beb92f883b085478f4b527101dc6541242ac1587166","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19e2821babf5d4010ace0beb92f883b085478f4b527101dc6541242ac1587166","first_computed_at":"2026-07-05T08:51:16.821784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:51:16.821784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OCOlpbvE4iM4TXb6vaXjnKO/QgJAX1o5w0beJXf7uU4RnWqBKqnIeA7qh6fwnxjHlNxb3gGqVa2YiA3u1LkBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:51:16.822217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.18738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:863cf231b83097c96cfccfe27ec984adaf460075be3d6b6504f51999dc3b91bd","sha256:45a79f4c0c4befee026ea4588ab696ee1d2b275d970b3f54563fb17256c95979"],"state_sha256":"b25c86842e6e873647dfc2bb93a41f000da4cf900bdc8ddd3d74dbf11c095514"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VL9vFmc3WrJMvW6Vrz6DOJe0aQA66cdVxu3PJQvD0ik4huJePbjwfwtH9/YpV//Zr9UlXE3GCsyjmsd3PLMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T03:29:35.008704Z","bundle_sha256":"a202a1eca1849abdd31de0c5772abdcded922f25784de8cfd5103fd5b8b5a657"}}