{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GEUFLFO42C5WOWRQES2CLLDKDE","short_pith_number":"pith:GEUFLFO4","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"},"canonical_sha256":"31285595dcd0bb675a3024b425ac6a191519e2442d845a1d6e7abc26f47fca1b","source":{"kind":"arxiv","id":"2606.03929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03929","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03929v1","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03929","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"GEUFLFO42C5W","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_16","alias_value":"GEUFLFO42C5WOWRQ","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_8","alias_value":"GEUFLFO4","created_at":"2026-06-03T02:06:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GEUFLFO42C5WOWRQES2CLLDKDE","target":"record","payload":{"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"},"canonical_sha256":"31285595dcd0bb675a3024b425ac6a191519e2442d845a1d6e7abc26f47fca1b","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"},"source_kind":"arxiv","source_id":"2606.03929","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-06-03T02:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADKTuyZpd9aY7Iz4T/wqU4iQsZnv3iJ1Y8I2Ozx1PbS0rWw7sxZ+pQDbNeKeVB8vqK20MC3FLlQMxIbBz3qlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:50:01.869650Z"},"content_sha256":"993d2970760a583dfef45f6f6ec1caa471072d7d1786a947beef5cd6d6d4b8c7","schema_version":"1.0","event_id":"sha256:993d2970760a583dfef45f6f6ec1caa471072d7d1786a947beef5cd6d6d4b8c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GEUFLFO42C5WOWRQES2CLLDKDE","target":"graph","payload":{"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"},"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-06-03T02:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57sV5K6nu0Oni0gb1DEbqJQql+0/hSF29jaJNI7p+eOjx7ZaQ8fv2uYORGuITKTwkORK6y86VjUMgYNWw/oQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:50:01.870036Z"},"content_sha256":"6d091b381ae43fecc3b50cd838ab033b368fbba21a4e4cfb77c13e7a7b6cbb32","schema_version":"1.0","event_id":"sha256:6d091b381ae43fecc3b50cd838ab033b368fbba21a4e4cfb77c13e7a7b6cbb32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/bundle.json","state_url":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEUFLFO42C5WOWRQES2CLLDKDE/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-06-10T21:50:01Z","links":{"resolver":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE","bundle":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/bundle.json","state":"https://pith.science/pith/GEUFLFO42C5WOWRQES2CLLDKDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEUFLFO42C5WOWRQES2CLLDKDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GEUFLFO42C5WOWRQES2CLLDKDE","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":"282860056a681abed10b18f6048f0dba9d9c7971d1f68be512982a8985cc3733","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T17:18:53Z","title_canon_sha256":"d328776ea9b1c8629733126ecae03001c30ac8d1de5c0384793cc18f65233c3e"},"schema_version":"1.0","source":{"id":"2606.03929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03929","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03929v1","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03929","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"GEUFLFO42C5W","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_16","alias_value":"GEUFLFO42C5WOWRQ","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_8","alias_value":"GEUFLFO4","created_at":"2026-06-03T02:06:07Z"}],"graph_snapshots":[{"event_id":"sha256:6d091b381ae43fecc3b50cd838ab033b368fbba21a4e4cfb77c13e7a7b6cbb32","target":"graph","created_at":"2026-06-03T02:06:07Z","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/2606.03929/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Nicola Rizzo, Ragnar Groot Koerkamp","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T17:18:53Z","title":"Revisiting $O(n \\log \\log n)$ chaining for anchored edit distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03929","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:993d2970760a583dfef45f6f6ec1caa471072d7d1786a947beef5cd6d6d4b8c7","target":"record","created_at":"2026-06-03T02:06:07Z","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":"282860056a681abed10b18f6048f0dba9d9c7971d1f68be512982a8985cc3733","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T17:18:53Z","title_canon_sha256":"d328776ea9b1c8629733126ecae03001c30ac8d1de5c0384793cc18f65233c3e"},"schema_version":"1.0","source":{"id":"2606.03929","kind":"arxiv","version":1}},"canonical_sha256":"31285595dcd0bb675a3024b425ac6a191519e2442d845a1d6e7abc26f47fca1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31285595dcd0bb675a3024b425ac6a191519e2442d845a1d6e7abc26f47fca1b","first_computed_at":"2026-06-03T02:06:07.204660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T02:06:07.204660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6WYt9C6LfDpM4Du9/aaRcE3Wr60W+m/jIiw+qAFRM6HwMFClJwh3UY2o03ED2ks8Vg/86U0KR7wFAXa60LUzAw==","signature_status":"signed_v1","signed_at":"2026-06-03T02:06:07.205040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:993d2970760a583dfef45f6f6ec1caa471072d7d1786a947beef5cd6d6d4b8c7","sha256:6d091b381ae43fecc3b50cd838ab033b368fbba21a4e4cfb77c13e7a7b6cbb32"],"state_sha256":"118544093a3d035a85cf42d90de194e7f2888779c6d8450528f52b1358472a8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2x/l8nfMmXlJOfZJWVbw2lXqrAvvrpfSu2+sEgXjnCvnd8oWen2eI4zGqnkRFUvv/3QCd8porWbmiQXH9ldDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:50:01.872190Z","bundle_sha256":"8f41fb331f79666051a19e592d61d6fee34ae9eea85f3b95a8852383fe19c4fb"}}