{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YXVSSSIPNTINJ74R2ZC5M3BHJZ","short_pith_number":"pith:YXVSSSIP","schema_version":"1.0","canonical_sha256":"c5eb29490f6cd0d4ff91d645d66c274e6c23af54b9b0c5aaacce22d09f73681a","source":{"kind":"arxiv","id":"2606.01190","version":1},"attestation_state":"computed","paper":{"title":"The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Groot Koerkamp, Ragnar","submitted_at":"2026-05-31T12:11:49Z","abstract_excerpt":"In recent years, there has been a renewed interest in the search for low density minimizer schemes. These schemes take a window of $w$ consecutive $k$-mers, and sample one of them: the smallest under some specific order. Schemes such as the mod-minimizer provide a low density (fraction of sampled $k$-mers) when $k \\gg w$, while schemes such as the greedy minimizer work well for explicit small parameters roughly in the regime $k \\leq 2w$, for $k$ and $w$ up to $15$ or so.\n  When $k < \\log_\\sigma w$ is very small, minimizer schemes cannot do well, and more general sampling schemes are needed tha"},"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.01190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-31T12:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"ba9372f555562f9eb3e7b9db157a848b7bee3e35d7271c6c8b9cf1d4c3129358","abstract_canon_sha256":"be2432903e4458d4bfce9337cd177314a8e03bf9d5f6ef7ff748478d72816f16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:26.247140Z","signature_b64":"S8EyGNpZEsIkBprQrWyM9b7pwHaR4s1FamP6BL7UpC04uhVVHSX7DRZt1Jfw2b6A7YZKf5aK6u2Sh7zk4IRKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5eb29490f6cd0d4ff91d645d66c274e6c23af54b9b0c5aaacce22d09f73681a","last_reissued_at":"2026-06-02T02:04:26.246724Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:26.246724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Groot Koerkamp, Ragnar","submitted_at":"2026-05-31T12:11:49Z","abstract_excerpt":"In recent years, there has been a renewed interest in the search for low density minimizer schemes. These schemes take a window of $w$ consecutive $k$-mers, and sample one of them: the smallest under some specific order. Schemes such as the mod-minimizer provide a low density (fraction of sampled $k$-mers) when $k \\gg w$, while schemes such as the greedy minimizer work well for explicit small parameters roughly in the regime $k \\leq 2w$, for $k$ and $w$ up to $15$ or so.\n  When $k < \\log_\\sigma w$ is very small, minimizer schemes cannot do well, and more general sampling schemes are needed tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01190","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.01190/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.01190","created_at":"2026-06-02T02:04:26.246786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01190v1","created_at":"2026-06-02T02:04:26.246786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01190","created_at":"2026-06-02T02:04:26.246786+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXVSSSIPNTIN","created_at":"2026-06-02T02:04:26.246786+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXVSSSIPNTINJ74R","created_at":"2026-06-02T02:04:26.246786+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXVSSSIP","created_at":"2026-06-02T02:04:26.246786+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/YXVSSSIPNTINJ74R2ZC5M3BHJZ","json":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ.json","graph_json":"https://pith.science/api/pith-number/YXVSSSIPNTINJ74R2ZC5M3BHJZ/graph.json","events_json":"https://pith.science/api/pith-number/YXVSSSIPNTINJ74R2ZC5M3BHJZ/events.json","paper":"https://pith.science/paper/YXVSSSIP"},"agent_actions":{"view_html":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ","download_json":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ.json","view_paper":"https://pith.science/paper/YXVSSSIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01190&json=true","fetch_graph":"https://pith.science/api/pith-number/YXVSSSIPNTINJ74R2ZC5M3BHJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YXVSSSIPNTINJ74R2ZC5M3BHJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ/action/storage_attestation","attest_author":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ/action/author_attestation","sign_citation":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ/action/citation_signature","submit_replication":"https://pith.science/pith/YXVSSSIPNTINJ74R2ZC5M3BHJZ/action/replication_record"}},"created_at":"2026-06-02T02:04:26.246786+00:00","updated_at":"2026-06-02T02:04:26.246786+00:00"}