{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JHI3O36YYLLMNGRIY2IIJFYPRM","short_pith_number":"pith:JHI3O36Y","canonical_record":{"source":{"id":"1407.1507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T15:39:05Z","cross_cats_sorted":["cs.CE","q-bio.GN"],"title_canon_sha256":"7a56dee843f1d95cc13321d2d2cef0ad465833e9774bca031802b21bc0a91106","abstract_canon_sha256":"3299f039e43452e29435cc0816e066aa6778483389868e0e7410fbef7bd8f905"},"schema_version":"1.0"},"canonical_sha256":"49d1b76fd8c2d6c69a28c69084970f8b36be6ab6580676fc187b88854d5a1ec7","source":{"kind":"arxiv","id":"1407.1507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1507","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1507v1","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1507","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"pith_short_12","alias_value":"JHI3O36YYLLM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JHI3O36YYLLMNGRI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JHI3O36Y","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JHI3O36YYLLMNGRIY2IIJFYPRM","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T15:39:05Z","cross_cats_sorted":["cs.CE","q-bio.GN"],"title_canon_sha256":"7a56dee843f1d95cc13321d2d2cef0ad465833e9774bca031802b21bc0a91106","abstract_canon_sha256":"3299f039e43452e29435cc0816e066aa6778483389868e0e7410fbef7bd8f905"},"schema_version":"1.0"},"canonical_sha256":"49d1b76fd8c2d6c69a28c69084970f8b36be6ab6580676fc187b88854d5a1ec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:42.832939Z","signature_b64":"6lO8I734RjVfc+Cn0OcSLbkj+FzUDIA1ewpEohutU7mqyITf4iENoEzXhVfxqOHcbPEmN0/wVtYTzOSKFjGYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d1b76fd8c2d6c69a28c69084970f8b36be6ab6580676fc187b88854d5a1ec7","last_reissued_at":"2026-05-18T00:49:42.832353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:42.832353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1507","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-05-18T00:49:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K93R97YlAL9R0GDgM24Litp+0sFGjp2rJbbzaXApKfV1+mwcWM2S5nv+iCUdwYOpqmwUfgVcpQrmKFo6TpBPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:38:46.938130Z"},"content_sha256":"77c641ed19af3d385c3c75f7bc7ec7306ae8d3b699da8e4c564c7ca1f1985339","schema_version":"1.0","event_id":"sha256:77c641ed19af3d385c3c75f7bc7ec7306ae8d3b699da8e4c564c7ca1f1985339"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JHI3O36YYLLMNGRIY2IIJFYPRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KMC 2: Fast and resource-frugal $k$-mer counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Agnieszka Debudaj-Grabysz, Marek Kokot, Sebastian Deorowicz, Szymon Grabowski","submitted_at":"2014-07-06T15:39:05Z","abstract_excerpt":"Motivation: Building the histogram of occurrences of every $k$-symbol long substring of nucleotide data is a standard step in many bioinformatics applications, known under the name of $k$-mer counting. Its applications include developing de Bruijn graph genome assemblers, fast multiple sequence alignment and repeat detection. The tremendous amounts of NGS data require fast algorithms for $k$-mer counting, preferably using moderate amounts of memory.\n  Results: We present a novel method for $k$-mer counting, on large datasets at least twice faster than the strongest competitors (Jellyfish~2, KM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1507","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":""},"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-05-18T00:49:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwxDaLeAUIEAdc65rm2dIkO6Lq+vIwYEGIZMw+FYrFIAWhgJaIk1K1iU2Gbp9/xs9nkpkA8mey2/SgveoJKvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:38:46.938862Z"},"content_sha256":"81b9e0e22a6e3a1c6387d8d6a46ce0f748957ee10e6ef01068c3098e7adcde46","schema_version":"1.0","event_id":"sha256:81b9e0e22a6e3a1c6387d8d6a46ce0f748957ee10e6ef01068c3098e7adcde46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHI3O36YYLLMNGRIY2IIJFYPRM/bundle.json","state_url":"https://pith.science/pith/JHI3O36YYLLMNGRIY2IIJFYPRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHI3O36YYLLMNGRIY2IIJFYPRM/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-09T05:38:46Z","links":{"resolver":"https://pith.science/pith/JHI3O36YYLLMNGRIY2IIJFYPRM","bundle":"https://pith.science/pith/JHI3O36YYLLMNGRIY2IIJFYPRM/bundle.json","state":"https://pith.science/pith/JHI3O36YYLLMNGRIY2IIJFYPRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHI3O36YYLLMNGRIY2IIJFYPRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JHI3O36YYLLMNGRIY2IIJFYPRM","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":"3299f039e43452e29435cc0816e066aa6778483389868e0e7410fbef7bd8f905","cross_cats_sorted":["cs.CE","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T15:39:05Z","title_canon_sha256":"7a56dee843f1d95cc13321d2d2cef0ad465833e9774bca031802b21bc0a91106"},"schema_version":"1.0","source":{"id":"1407.1507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1507","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1507v1","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1507","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"pith_short_12","alias_value":"JHI3O36YYLLM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JHI3O36YYLLMNGRI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JHI3O36Y","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:81b9e0e22a6e3a1c6387d8d6a46ce0f748957ee10e6ef01068c3098e7adcde46","target":"graph","created_at":"2026-05-18T00:49:42Z","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"},"paper":{"abstract_excerpt":"Motivation: Building the histogram of occurrences of every $k$-symbol long substring of nucleotide data is a standard step in many bioinformatics applications, known under the name of $k$-mer counting. Its applications include developing de Bruijn graph genome assemblers, fast multiple sequence alignment and repeat detection. The tremendous amounts of NGS data require fast algorithms for $k$-mer counting, preferably using moderate amounts of memory.\n  Results: We present a novel method for $k$-mer counting, on large datasets at least twice faster than the strongest competitors (Jellyfish~2, KM","authors_text":"Agnieszka Debudaj-Grabysz, Marek Kokot, Sebastian Deorowicz, Szymon Grabowski","cross_cats":["cs.CE","q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T15:39:05Z","title":"KMC 2: Fast and resource-frugal $k$-mer counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1507","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:77c641ed19af3d385c3c75f7bc7ec7306ae8d3b699da8e4c564c7ca1f1985339","target":"record","created_at":"2026-05-18T00:49:42Z","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":"3299f039e43452e29435cc0816e066aa6778483389868e0e7410fbef7bd8f905","cross_cats_sorted":["cs.CE","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T15:39:05Z","title_canon_sha256":"7a56dee843f1d95cc13321d2d2cef0ad465833e9774bca031802b21bc0a91106"},"schema_version":"1.0","source":{"id":"1407.1507","kind":"arxiv","version":1}},"canonical_sha256":"49d1b76fd8c2d6c69a28c69084970f8b36be6ab6580676fc187b88854d5a1ec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49d1b76fd8c2d6c69a28c69084970f8b36be6ab6580676fc187b88854d5a1ec7","first_computed_at":"2026-05-18T00:49:42.832353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:42.832353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6lO8I734RjVfc+Cn0OcSLbkj+FzUDIA1ewpEohutU7mqyITf4iENoEzXhVfxqOHcbPEmN0/wVtYTzOSKFjGYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:42.832939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77c641ed19af3d385c3c75f7bc7ec7306ae8d3b699da8e4c564c7ca1f1985339","sha256:81b9e0e22a6e3a1c6387d8d6a46ce0f748957ee10e6ef01068c3098e7adcde46"],"state_sha256":"de0d92d562c4586317e85ce5f79d135294426b8d8a400abbf4062c8e34c2404c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wjusRMtvFKD6OWWQEVcxnnv5kXe5zMLwQb/6bESYFaGDx00NPFzqx97hwmuGnfRXwKsqiBt2G4I0aJJt+h/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:38:46.942930Z","bundle_sha256":"1bc239f75389513da9e228e6300a2f3fa340b366efc071e2df37c7a8f2ffcf08"}}