{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AQRDZ5SPWC5DOHMJBDS4RECNSF","short_pith_number":"pith:AQRDZ5SP","schema_version":"1.0","canonical_sha256":"04223cf64fb0ba371d8908e5c8904d916eb52a19fc20bd2eae92b443f0bb9f24","source":{"kind":"arxiv","id":"2608.01387","version":1},"attestation_state":"computed","paper":{"title":"MEM-finding with run-length compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Cozzi, Paola Bonizzoni, Ragnar Groot Koerkamp, Travis Gagie, Younan Gao","submitted_at":"2026-08-02T17:07:47Z","abstract_excerpt":"We show how to store a text $T [1..n]$ consisting of $\\rho_T$ runs in $O (\\rho_T + \\chi)$ space, where $\\chi$ is the size of the smallest suffixient set for $T$, such that when we are given a pattern $P [1..m]$ consisting of $\\rho_P$ runs we can find the maximal exact matches (MEMs) of $P$ with respect to $T$ in $O (\\rho_P \\log m)$ time plus constant time for each edge we would fully or partially descend in the suffix tree for $T$ while finding those MEMs. We then adapt and optimize our result to finding set-maximal exact matches (SMEMs) of query haplotypes with respect to stored haplotype pan"},"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":"2608.01387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-02T17:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"72d16a961cab4adffcf111299587a78fa562bedf0e9c90799a429cc4ba73fc3f","abstract_canon_sha256":"3f0b619387ab2e7df76fd74c84024311e3a91a89fe7d24f830e08dff74af1761"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:04:55.734658Z","signature_b64":"x/qTyCOjV/57sGE2lmQMbRL07wXkjsId82NdmNRBE6N7e1B/eQ9wFJ5F4XpohWpCHE0/HxkpTAw2vNnYyrkbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04223cf64fb0ba371d8908e5c8904d916eb52a19fc20bd2eae92b443f0bb9f24","last_reissued_at":"2026-08-04T02:04:55.733049Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:04:55.733049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MEM-finding with run-length compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Cozzi, Paola Bonizzoni, Ragnar Groot Koerkamp, Travis Gagie, Younan Gao","submitted_at":"2026-08-02T17:07:47Z","abstract_excerpt":"We show how to store a text $T [1..n]$ consisting of $\\rho_T$ runs in $O (\\rho_T + \\chi)$ space, where $\\chi$ is the size of the smallest suffixient set for $T$, such that when we are given a pattern $P [1..m]$ consisting of $\\rho_P$ runs we can find the maximal exact matches (MEMs) of $P$ with respect to $T$ in $O (\\rho_P \\log m)$ time plus constant time for each edge we would fully or partially descend in the suffix tree for $T$ while finding those MEMs. We then adapt and optimize our result to finding set-maximal exact matches (SMEMs) of query haplotypes with respect to stored haplotype pan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01387","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/2608.01387/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":"2608.01387","created_at":"2026-08-04T02:04:55.734487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01387v1","created_at":"2026-08-04T02:04:55.734487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01387","created_at":"2026-08-04T02:04:55.734487+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQRDZ5SPWC5D","created_at":"2026-08-04T02:04:55.734487+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQRDZ5SPWC5DOHMJ","created_at":"2026-08-04T02:04:55.734487+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQRDZ5SP","created_at":"2026-08-04T02:04:55.734487+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/AQRDZ5SPWC5DOHMJBDS4RECNSF","json":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF.json","graph_json":"https://pith.science/api/pith-number/AQRDZ5SPWC5DOHMJBDS4RECNSF/graph.json","events_json":"https://pith.science/api/pith-number/AQRDZ5SPWC5DOHMJBDS4RECNSF/events.json","paper":"https://pith.science/paper/AQRDZ5SP"},"agent_actions":{"view_html":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF","download_json":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF.json","view_paper":"https://pith.science/paper/AQRDZ5SP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01387&json=true","fetch_graph":"https://pith.science/api/pith-number/AQRDZ5SPWC5DOHMJBDS4RECNSF/graph.json","fetch_events":"https://pith.science/api/pith-number/AQRDZ5SPWC5DOHMJBDS4RECNSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF/action/storage_attestation","attest_author":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF/action/author_attestation","sign_citation":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF/action/citation_signature","submit_replication":"https://pith.science/pith/AQRDZ5SPWC5DOHMJBDS4RECNSF/action/replication_record"}},"created_at":"2026-08-04T02:04:55.734487+00:00","updated_at":"2026-08-04T02:04:55.734487+00:00"}