{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HE3PZKOJCPGAGJ2FXJ4ZZPKVTS","short_pith_number":"pith:HE3PZKOJ","canonical_record":{"source":{"id":"2506.05277","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T17:33:00Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"a8dac56691563d8fcfc1736763e2bb568bd9ac9b3a3604fe16b133610f4e62cb","abstract_canon_sha256":"11e239841a92bc4fd14c585bfe6cca02f721dc3d7ce5aa89fab1a65f8eecbeb2"},"schema_version":"1.0"},"canonical_sha256":"3936fca9c913cc032745ba799cbd559cbc51e8cf63009c26c957811d670fcc18","source":{"kind":"arxiv","id":"2506.05277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05277","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05277v1","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05277","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"HE3PZKOJCPGA","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"pith_short_16","alias_value":"HE3PZKOJCPGAGJ2F","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"pith_short_8","alias_value":"HE3PZKOJ","created_at":"2026-07-05T11:16:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HE3PZKOJCPGAGJ2FXJ4ZZPKVTS","target":"record","payload":{"canonical_record":{"source":{"id":"2506.05277","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T17:33:00Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"a8dac56691563d8fcfc1736763e2bb568bd9ac9b3a3604fe16b133610f4e62cb","abstract_canon_sha256":"11e239841a92bc4fd14c585bfe6cca02f721dc3d7ce5aa89fab1a65f8eecbeb2"},"schema_version":"1.0"},"canonical_sha256":"3936fca9c913cc032745ba799cbd559cbc51e8cf63009c26c957811d670fcc18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:45.099056Z","signature_b64":"SoKRblMQi0+wDR02NXYY3ZKrxqZ1v7fCm6EqUVJ3T7oyEMxpq6ultOt8JvnkAdiBLRoA8T1US7bGH9FspnSNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3936fca9c913cc032745ba799cbd559cbc51e8cf63009c26c957811d670fcc18","last_reissued_at":"2026-07-05T11:16:45.098424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:45.098424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.05277","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-07-05T11:16:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqjC30hzVGi4Jadjl6CF26BPO9U4/urkvK/Me8csE9UaLNWAZDGiJubTzDvTRYhKEBDN8NVBBpMyFhxwkiI3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:08:27.657897Z"},"content_sha256":"d7c9ca5e9d2d4e53c3fe020e97b8b1ff0b63993848406f9fca7ec6adbd11e683","schema_version":"1.0","event_id":"sha256:d7c9ca5e9d2d4e53c3fe020e97b8b1ff0b63993848406f9fca7ec6adbd11e683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HE3PZKOJCPGAGJ2FXJ4ZZPKVTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimizers of Minimum Density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Arseny Shur","submitted_at":"2025-06-05T17:33:00Z","abstract_excerpt":"Minimizers are sampling schemes with numerous applications in computational biology. Assuming a fixed alphabet of size $\\sigma$, a minimizer is defined by two integers $k,w\\ge2$ and a linear order $\\rho$ on strings of length $k$ (also called $k$-mers). A string is processed by a sliding window algorithm that chooses, in each window of length $w+k-1$, its minimal $k$-mer with respect to $\\rho$. A key characteristic of the minimizer is its density, which is the expected frequency of chosen $k$-mers among all $k$-mers in a random infinite $\\sigma$-ary string. Minimizers of smaller density are pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05277","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/2506.05277/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-05T11:16:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oW5qJRU7q0ZOua58iDmikpQTYOUEgJRLMoYBzL4dOcMJbBBOyV8tsbl5cHIfAvsUrRZ3nN/nMWHiQa2sB1KYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:08:27.658945Z"},"content_sha256":"73176d692466edaf9fb91663f320c7220517b3decb655dd577078244f5b85a56","schema_version":"1.0","event_id":"sha256:73176d692466edaf9fb91663f320c7220517b3decb655dd577078244f5b85a56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS/bundle.json","state_url":"https://pith.science/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS/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-12T13:08:27Z","links":{"resolver":"https://pith.science/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS","bundle":"https://pith.science/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS/bundle.json","state":"https://pith.science/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HE3PZKOJCPGAGJ2FXJ4ZZPKVTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HE3PZKOJCPGAGJ2FXJ4ZZPKVTS","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":"11e239841a92bc4fd14c585bfe6cca02f721dc3d7ce5aa89fab1a65f8eecbeb2","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T17:33:00Z","title_canon_sha256":"a8dac56691563d8fcfc1736763e2bb568bd9ac9b3a3604fe16b133610f4e62cb"},"schema_version":"1.0","source":{"id":"2506.05277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05277","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05277v1","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05277","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"HE3PZKOJCPGA","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"pith_short_16","alias_value":"HE3PZKOJCPGAGJ2F","created_at":"2026-07-05T11:16:45Z"},{"alias_kind":"pith_short_8","alias_value":"HE3PZKOJ","created_at":"2026-07-05T11:16:45Z"}],"graph_snapshots":[{"event_id":"sha256:73176d692466edaf9fb91663f320c7220517b3decb655dd577078244f5b85a56","target":"graph","created_at":"2026-07-05T11:16:45Z","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/2506.05277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimizers are sampling schemes with numerous applications in computational biology. Assuming a fixed alphabet of size $\\sigma$, a minimizer is defined by two integers $k,w\\ge2$ and a linear order $\\rho$ on strings of length $k$ (also called $k$-mers). A string is processed by a sliding window algorithm that chooses, in each window of length $w+k-1$, its minimal $k$-mer with respect to $\\rho$. A key characteristic of the minimizer is its density, which is the expected frequency of chosen $k$-mers among all $k$-mers in a random infinite $\\sigma$-ary string. Minimizers of smaller density are pre","authors_text":"Arseny Shur","cross_cats":["cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T17:33:00Z","title":"On Minimizers of Minimum Density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05277","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:d7c9ca5e9d2d4e53c3fe020e97b8b1ff0b63993848406f9fca7ec6adbd11e683","target":"record","created_at":"2026-07-05T11:16:45Z","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":"11e239841a92bc4fd14c585bfe6cca02f721dc3d7ce5aa89fab1a65f8eecbeb2","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T17:33:00Z","title_canon_sha256":"a8dac56691563d8fcfc1736763e2bb568bd9ac9b3a3604fe16b133610f4e62cb"},"schema_version":"1.0","source":{"id":"2506.05277","kind":"arxiv","version":1}},"canonical_sha256":"3936fca9c913cc032745ba799cbd559cbc51e8cf63009c26c957811d670fcc18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3936fca9c913cc032745ba799cbd559cbc51e8cf63009c26c957811d670fcc18","first_computed_at":"2026-07-05T11:16:45.098424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:45.098424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SoKRblMQi0+wDR02NXYY3ZKrxqZ1v7fCm6EqUVJ3T7oyEMxpq6ultOt8JvnkAdiBLRoA8T1US7bGH9FspnSNBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:45.099056Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7c9ca5e9d2d4e53c3fe020e97b8b1ff0b63993848406f9fca7ec6adbd11e683","sha256:73176d692466edaf9fb91663f320c7220517b3decb655dd577078244f5b85a56"],"state_sha256":"ff8ffc33778c3e7092596e65a472eac798f2467eab6fb94602d922cf9ad4de6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jz5UDGQUWEEwn+MaRp2RnToIcuX1Rb5xmFkMfrO2aO3rs23MRzRJjDMZA+rV7jBMNngMX2/auKtvPrwhh7Z4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:08:27.678954Z","bundle_sha256":"a5bef37b63ca07eca1cae95fe953b5735c0d5f67bbede121122b0e117e2c7072"}}