{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GEUFLFO42C5WOWRQES2CLLDKDE","short_pith_number":"pith:GEUFLFO4","schema_version":"1.0","canonical_sha256":"31285595dcd0bb675a3024b425ac6a191519e2442d845a1d6e7abc26f47fca1b","source":{"kind":"arxiv","id":"2606.03929","version":1},"attestation_state":"computed","paper":{"title":"Revisiting $O(n \\log \\log n)$ chaining for anchored edit distance","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Rizzo, Ragnar Groot Koerkamp","submitted_at":"2026-06-02T17:18:53Z","abstract_excerpt":"Colinear chaining is a classical heuristic for sequence alignment: it enables scalable genome comparison and is a main component of many state-of-the-art read mappers based on seed-chain-extend. The earliest $O(n \\log \\log n)$ time algorithms by Eppstein et al. (J. ACM, 1992) chained $n$ fragments between two sequences $T$ and $Q$ while minimizing a gap cost based on the diagonal distance $\\Delta_{\\text{diag}}$ between consecutive fragments. They also forbid fragment overlaps, which are essential in current chaining formulations: in long-read mapping, overlaps improve sensitivity and avoid res"},"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":"2606.03929","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T17:18:53Z","cross_cats_sorted":[],"title_canon_sha256":"d328776ea9b1c8629733126ecae03001c30ac8d1de5c0384793cc18f65233c3e","abstract_canon_sha256":"282860056a681abed10b18f6048f0dba9d9c7971d1f68be512982a8985cc3733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:06:07.205040Z","signature_b64":"6WYt9C6LfDpM4Du9/aaRcE3Wr60W+m/jIiw+qAFRM6HwMFClJwh3UY2o03ED2ks8Vg/86U0KR7wFAXa60LUzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31285595dcd0bb675a3024b425ac6a191519e2442d845a1d6e7abc26f47fca1b","last_reissued_at":"2026-06-03T02:06:07.204660Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:06:07.204660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting $O(n \\log \\log n)$ chaining for anchored edit distance","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Rizzo, Ragnar Groot Koerkamp","submitted_at":"2026-06-02T17:18:53Z","abstract_excerpt":"Colinear chaining is a classical heuristic for sequence alignment: it enables scalable genome comparison and is a main component of many state-of-the-art read mappers based on seed-chain-extend. The earliest $O(n \\log \\log n)$ time algorithms by Eppstein et al. (J. ACM, 1992) chained $n$ fragments between two sequences $T$ and $Q$ while minimizing a gap cost based on the diagonal distance $\\Delta_{\\text{diag}}$ between consecutive fragments. They also forbid fragment overlaps, which are essential in current chaining formulations: in long-read mapping, overlaps improve sensitivity and avoid res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03929","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.03929/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":"2606.03929","created_at":"2026-06-03T02:06:07.204717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03929v1","created_at":"2026-06-03T02:06:07.204717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03929","created_at":"2026-06-03T02:06:07.204717+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEUFLFO42C5W","created_at":"2026-06-03T02:06:07.204717+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEUFLFO42C5WOWRQ","created_at":"2026-06-03T02:06:07.204717+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEUFLFO4","created_at":"2026-06-03T02:06:07.204717+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/GEUFLFO42C5WOWRQES2CLLDKDE","json":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE.json","graph_json":"https://pith.science/api/pith-number/GEUFLFO42C5WOWRQES2CLLDKDE/graph.json","events_json":"https://pith.science/api/pith-number/GEUFLFO42C5WOWRQES2CLLDKDE/events.json","paper":"https://pith.science/paper/GEUFLFO4"},"agent_actions":{"view_html":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE","download_json":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE.json","view_paper":"https://pith.science/paper/GEUFLFO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03929&json=true","fetch_graph":"https://pith.science/api/pith-number/GEUFLFO42C5WOWRQES2CLLDKDE/graph.json","fetch_events":"https://pith.science/api/pith-number/GEUFLFO42C5WOWRQES2CLLDKDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/action/storage_attestation","attest_author":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/action/author_attestation","sign_citation":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/action/citation_signature","submit_replication":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/action/replication_record"}},"created_at":"2026-06-03T02:06:07.204717+00:00","updated_at":"2026-06-03T02:06:07.204717+00:00"}