{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O4FDEF2JC42NULRDB5E7DN77RM","short_pith_number":"pith:O4FDEF2J","canonical_record":{"source":{"id":"1610.03443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2016-10-11T17:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6767ebcf2ada4a12b2e7ac26a0dc173b6b6b9b2cdddb55ccc4a9d6f28c16404","abstract_canon_sha256":"a38d82b075a963a297c5728bfbcff1a43c8adf81b21d7cb942b4c3f585e57de5"},"schema_version":"1.0"},"canonical_sha256":"770a3217491734da2e230f49f1b7ff8b0c093a94f96813339f2d74b0bba0f56f","source":{"kind":"arxiv","id":"1610.03443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03443","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03443v1","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03443","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"O4FDEF2JC42N","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O4FDEF2JC42NULRD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O4FDEF2J","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O4FDEF2JC42NULRDB5E7DN77RM","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2016-10-11T17:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6767ebcf2ada4a12b2e7ac26a0dc173b6b6b9b2cdddb55ccc4a9d6f28c16404","abstract_canon_sha256":"a38d82b075a963a297c5728bfbcff1a43c8adf81b21d7cb942b4c3f585e57de5"},"schema_version":"1.0"},"canonical_sha256":"770a3217491734da2e230f49f1b7ff8b0c093a94f96813339f2d74b0bba0f56f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:31.460245Z","signature_b64":"fdLNbwxSSMR+qP9U3X0nyqOHmvtx9yAORDK3R13Da8qr5coUo2+nPmvHi7FNwdgTqOjSu3J/RbUgAB3U/0WVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770a3217491734da2e230f49f1b7ff8b0c093a94f96813339f2d74b0bba0f56f","last_reissued_at":"2026-05-18T01:02:31.459789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:31.459789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03443","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-18T01:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xI91PX1QDqiIm1qPtzHPM1qZz0Kwqru1n8MTzayED01RQkiGl2/mBHNhbaeKkXlkQatJUWB7lOcXjf5VbHCSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:55:49.654203Z"},"content_sha256":"5d9384109e226dd032bca375d740e23e0d98fbe3d5d21f48c96061f6c7cdc31d","schema_version":"1.0","event_id":"sha256:5d9384109e226dd032bca375d740e23e0d98fbe3d5d21f48c96061f6c7cdc31d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O4FDEF2JC42NULRDB5E7DN77RM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Filtering Algorithm for Big Read Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.GN","authors_text":"Anand Srivastav, Axel Wedemeyer, Christian Schielke, Lasse Kliemann, Philip Rosenstiel, Thorsten B. Reusch","submitted_at":"2016-10-11T17:49:26Z","abstract_excerpt":"For single-cell or metagenomic sequencing projects, it is necessary to sequence with a very high mean coverage in order to make sure that all parts of the sample DNA get covered by the reads produced. This leads to huge datasets with lots of redundant data. A filtering of this data prior to assembly is advisable. Titus Brown et al. (2012) presented the algorithm Diginorm for this purpose, which filters reads based on the abundance of their $k$-mers. We present Bignorm, a faster and quality-conscious read filtering algorithm. An important new feature is the use of phred quality scores together "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03443","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-18T01:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKYNxrK8rm4wfYELvGclWA2lxW21pH8urTe2AhcxtT59u5z966iPGzPBUEdE67KS7paaDhVSfwYApIuJf+eIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:55:49.654494Z"},"content_sha256":"23b27226e0882d79f162d850e3ea07a622e13b3035ced3c8d619e4fdc068ac9a","schema_version":"1.0","event_id":"sha256:23b27226e0882d79f162d850e3ea07a622e13b3035ced3c8d619e4fdc068ac9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4FDEF2JC42NULRDB5E7DN77RM/bundle.json","state_url":"https://pith.science/pith/O4FDEF2JC42NULRDB5E7DN77RM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4FDEF2JC42NULRDB5E7DN77RM/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-21T23:55:49Z","links":{"resolver":"https://pith.science/pith/O4FDEF2JC42NULRDB5E7DN77RM","bundle":"https://pith.science/pith/O4FDEF2JC42NULRDB5E7DN77RM/bundle.json","state":"https://pith.science/pith/O4FDEF2JC42NULRDB5E7DN77RM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4FDEF2JC42NULRDB5E7DN77RM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O4FDEF2JC42NULRDB5E7DN77RM","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":"a38d82b075a963a297c5728bfbcff1a43c8adf81b21d7cb942b4c3f585e57de5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2016-10-11T17:49:26Z","title_canon_sha256":"f6767ebcf2ada4a12b2e7ac26a0dc173b6b6b9b2cdddb55ccc4a9d6f28c16404"},"schema_version":"1.0","source":{"id":"1610.03443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03443","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03443v1","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03443","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"O4FDEF2JC42N","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O4FDEF2JC42NULRD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O4FDEF2J","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:23b27226e0882d79f162d850e3ea07a622e13b3035ced3c8d619e4fdc068ac9a","target":"graph","created_at":"2026-05-18T01:02:31Z","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":"For single-cell or metagenomic sequencing projects, it is necessary to sequence with a very high mean coverage in order to make sure that all parts of the sample DNA get covered by the reads produced. This leads to huge datasets with lots of redundant data. A filtering of this data prior to assembly is advisable. Titus Brown et al. (2012) presented the algorithm Diginorm for this purpose, which filters reads based on the abundance of their $k$-mers. We present Bignorm, a faster and quality-conscious read filtering algorithm. An important new feature is the use of phred quality scores together ","authors_text":"Anand Srivastav, Axel Wedemeyer, Christian Schielke, Lasse Kliemann, Philip Rosenstiel, Thorsten B. Reusch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2016-10-11T17:49:26Z","title":"An Improved Filtering Algorithm for Big Read Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03443","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:5d9384109e226dd032bca375d740e23e0d98fbe3d5d21f48c96061f6c7cdc31d","target":"record","created_at":"2026-05-18T01:02:31Z","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":"a38d82b075a963a297c5728bfbcff1a43c8adf81b21d7cb942b4c3f585e57de5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2016-10-11T17:49:26Z","title_canon_sha256":"f6767ebcf2ada4a12b2e7ac26a0dc173b6b6b9b2cdddb55ccc4a9d6f28c16404"},"schema_version":"1.0","source":{"id":"1610.03443","kind":"arxiv","version":1}},"canonical_sha256":"770a3217491734da2e230f49f1b7ff8b0c093a94f96813339f2d74b0bba0f56f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"770a3217491734da2e230f49f1b7ff8b0c093a94f96813339f2d74b0bba0f56f","first_computed_at":"2026-05-18T01:02:31.459789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:31.459789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdLNbwxSSMR+qP9U3X0nyqOHmvtx9yAORDK3R13Da8qr5coUo2+nPmvHi7FNwdgTqOjSu3J/RbUgAB3U/0WVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:31.460245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d9384109e226dd032bca375d740e23e0d98fbe3d5d21f48c96061f6c7cdc31d","sha256:23b27226e0882d79f162d850e3ea07a622e13b3035ced3c8d619e4fdc068ac9a"],"state_sha256":"d19b36a6c30c32c162ee4c3b603b8746dc4b5eaff6ade9852545c80300cfbfc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54Is8r6Y8PvircAS65q5Tq3POhuhYTSpqZjnZ98KOsVgjjrN8OPSEMEi7HuhK8B7ooz390Bg3bnatPBOtdMtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:55:49.657830Z","bundle_sha256":"ad7df9ec2ea7a17df23e4acaea4d7af0ba7efa4bdd80c80640c761ba538f7a96"}}