{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EGRG5VGESUYYAPNN3PRJYUHCOI","short_pith_number":"pith:EGRG5VGE","canonical_record":{"source":{"id":"1408.5592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-08-24T11:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"67a392a0e10cd6c99784418df61b1ba4a1c4e36952313cb93f501c0b8b27111e","abstract_canon_sha256":"550bf8ae4b448fb4d80941272ca71611c0f8d085cba2ed4c3043bc7303c668f6"},"schema_version":"1.0"},"canonical_sha256":"21a26ed4c49531803daddbe29c50e2722e1eba14687c3b92e4f2a966bd2f9e34","source":{"kind":"arxiv","id":"1408.5592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5592","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5592v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5592","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"EGRG5VGESUYY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EGRG5VGESUYYAPNN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EGRG5VGE","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EGRG5VGESUYYAPNN3PRJYUHCOI","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-08-24T11:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"67a392a0e10cd6c99784418df61b1ba4a1c4e36952313cb93f501c0b8b27111e","abstract_canon_sha256":"550bf8ae4b448fb4d80941272ca71611c0f8d085cba2ed4c3043bc7303c668f6"},"schema_version":"1.0"},"canonical_sha256":"21a26ed4c49531803daddbe29c50e2722e1eba14687c3b92e4f2a966bd2f9e34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.772684Z","signature_b64":"Hf3/y/3L8YirnWcJ0o/AyjZ/NZImtM7BnPH+YFZiakmL3f+OW+HvvcmdWF4G9a/lxCjf7GiBTe6Kpr9iGg80Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a26ed4c49531803daddbe29c50e2722e1eba14687c3b92e4f2a966bd2f9e34","last_reissued_at":"2026-05-18T02:44:24.772303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.772303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5592","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-18T02:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kc+fNlEcFKkK4GYanZBK5I8Amaji2Q8hyk5ih3wYTPJ6rglZcPdAdb0vxCMUCxDvnqcQm5yshrj3y8KV7MGpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:26:51.598226Z"},"content_sha256":"325de2170ce2bed9d313fdd6174932d7478ee94e49e6a3960254438481942e13","schema_version":"1.0","event_id":"sha256:325de2170ce2bed9d313fdd6174932d7478ee94e49e6a3960254438481942e13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EGRG5VGESUYYAPNN3PRJYUHCOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HyDA-Vista: Towards Optimal Guided Selection of k-mer Size for Sequence Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Christina Boucher, Hamidreza Chitsaz, Narjes Sadat Movahedi Tabrizi, Seyed Basir Shariat Razavi","submitted_at":"2014-08-24T11:26:37Z","abstract_excerpt":"Motivation: Intimately tied to assembly quality is the complexity of the de Bruijn graph built by the assembler. Thus, there have been many paradigms developed to decrease the complexity of the de Bruijn graph. One obvious combinatorial paradigm for this is to allow the value of $k$ to vary; having a larger value of $k$ where the graph is more complex and a smaller value of $k$ where the graph would likely contain fewer spurious edges and vertices. One open problem that affects the practicality of this method is how to predict the value of $k$ prior to building the de Bruijn graph. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5592","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-18T02:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wC3b99OMBZhyw71FLl9k5zJl9Dt92vH/o+rRXltD3wWU/YUb7GGkdPWkkwsG2y8SETfKyH0RBuCHH0rXtkJkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:26:51.598592Z"},"content_sha256":"297a03164d993aef67db4b88ac1b861ba80fbe70ef7da18d830d919ada502d05","schema_version":"1.0","event_id":"sha256:297a03164d993aef67db4b88ac1b861ba80fbe70ef7da18d830d919ada502d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGRG5VGESUYYAPNN3PRJYUHCOI/bundle.json","state_url":"https://pith.science/pith/EGRG5VGESUYYAPNN3PRJYUHCOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGRG5VGESUYYAPNN3PRJYUHCOI/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-01T01:26:51Z","links":{"resolver":"https://pith.science/pith/EGRG5VGESUYYAPNN3PRJYUHCOI","bundle":"https://pith.science/pith/EGRG5VGESUYYAPNN3PRJYUHCOI/bundle.json","state":"https://pith.science/pith/EGRG5VGESUYYAPNN3PRJYUHCOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGRG5VGESUYYAPNN3PRJYUHCOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EGRG5VGESUYYAPNN3PRJYUHCOI","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":"550bf8ae4b448fb4d80941272ca71611c0f8d085cba2ed4c3043bc7303c668f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-08-24T11:26:37Z","title_canon_sha256":"67a392a0e10cd6c99784418df61b1ba4a1c4e36952313cb93f501c0b8b27111e"},"schema_version":"1.0","source":{"id":"1408.5592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5592","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5592v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5592","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"EGRG5VGESUYY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EGRG5VGESUYYAPNN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EGRG5VGE","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:297a03164d993aef67db4b88ac1b861ba80fbe70ef7da18d830d919ada502d05","target":"graph","created_at":"2026-05-18T02:44:24Z","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: Intimately tied to assembly quality is the complexity of the de Bruijn graph built by the assembler. Thus, there have been many paradigms developed to decrease the complexity of the de Bruijn graph. One obvious combinatorial paradigm for this is to allow the value of $k$ to vary; having a larger value of $k$ where the graph is more complex and a smaller value of $k$ where the graph would likely contain fewer spurious edges and vertices. One open problem that affects the practicality of this method is how to predict the value of $k$ prior to building the de Bruijn graph. We show tha","authors_text":"Christina Boucher, Hamidreza Chitsaz, Narjes Sadat Movahedi Tabrizi, Seyed Basir Shariat Razavi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-08-24T11:26:37Z","title":"HyDA-Vista: Towards Optimal Guided Selection of k-mer Size for Sequence Assembly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5592","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:325de2170ce2bed9d313fdd6174932d7478ee94e49e6a3960254438481942e13","target":"record","created_at":"2026-05-18T02:44:24Z","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":"550bf8ae4b448fb4d80941272ca71611c0f8d085cba2ed4c3043bc7303c668f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-08-24T11:26:37Z","title_canon_sha256":"67a392a0e10cd6c99784418df61b1ba4a1c4e36952313cb93f501c0b8b27111e"},"schema_version":"1.0","source":{"id":"1408.5592","kind":"arxiv","version":1}},"canonical_sha256":"21a26ed4c49531803daddbe29c50e2722e1eba14687c3b92e4f2a966bd2f9e34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21a26ed4c49531803daddbe29c50e2722e1eba14687c3b92e4f2a966bd2f9e34","first_computed_at":"2026-05-18T02:44:24.772303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:24.772303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hf3/y/3L8YirnWcJ0o/AyjZ/NZImtM7BnPH+YFZiakmL3f+OW+HvvcmdWF4G9a/lxCjf7GiBTe6Kpr9iGg80Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:24.772684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:325de2170ce2bed9d313fdd6174932d7478ee94e49e6a3960254438481942e13","sha256:297a03164d993aef67db4b88ac1b861ba80fbe70ef7da18d830d919ada502d05"],"state_sha256":"40fddf2d59dc45c23efb044246808e317209c07b14ee928148d181cf32bea3c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNNOZxQd3V3n8GU2e2HGtQtFE1K8Rp3FIPM+8mhLdySRbtNnRkLnhhM8J1eOCwuuSF6LY8zziSy5IFBRo1amCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:26:51.600977Z","bundle_sha256":"308c7c6a95558fbcaf9c90b21c0f18c754e1c29e88a7084cdf27e528932fb7d5"}}