{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SD3SXTB6GEXE4KZLO44FSBCMGL","short_pith_number":"pith:SD3SXTB6","schema_version":"1.0","canonical_sha256":"90f72bcc3e312e4e2b2b773859044c32ff820061bc530dc70d3387d584fec252","source":{"kind":"arxiv","id":"1908.02211","version":2},"attestation_state":"computed","paper":{"title":"An Index for Sequencing Reads Based on The Colored de Bruijn Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diego Diaz-Dom\\'inguez","submitted_at":"2019-08-06T15:25:54Z","abstract_excerpt":"In this article, we show how to transform a colored de Bruijn graph (dBG) into a practical index for processing massive sets of sequencing reads. Similar to previous works, we encode an instance of a colored dBG of the set using BOSS and a color matrix C. To reduce the space requirements, we devise an algorithm that produces a smaller and more sparse version of C. The novelties in this algorithm are (i) an incomplete coloring of the graph and (ii) a greedy coloring approach that tries to reuse the same colors for different strings when possible. We also propose two algorithms that work on top "},"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":"1908.02211","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-06T15:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"63aad31253fe2c5f034c3a0e2a574dd72efb8e7ffc7b0cc932711e4f8a7552e4","abstract_canon_sha256":"beacbf82ab9bbba11a14dfe56ff0b2350a50f1dd98c97138636574ab4646e5a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:41.110998Z","signature_b64":"17j6T4a8KCSrtuq7qD1RytwiAjlYQfi6lOAz5Uvojzrbeve1jaYjXk09dVZ2JQpHRJo+muLuVxI/gco9wAewBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90f72bcc3e312e4e2b2b773859044c32ff820061bc530dc70d3387d584fec252","last_reissued_at":"2026-07-05T00:22:41.110479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:41.110479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Index for Sequencing Reads Based on The Colored de Bruijn Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diego Diaz-Dom\\'inguez","submitted_at":"2019-08-06T15:25:54Z","abstract_excerpt":"In this article, we show how to transform a colored de Bruijn graph (dBG) into a practical index for processing massive sets of sequencing reads. Similar to previous works, we encode an instance of a colored dBG of the set using BOSS and a color matrix C. To reduce the space requirements, we devise an algorithm that produces a smaller and more sparse version of C. The novelties in this algorithm are (i) an incomplete coloring of the graph and (ii) a greedy coloring approach that tries to reuse the same colors for different strings when possible. We also propose two algorithms that work on top "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02211","kind":"arxiv","version":2},"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/1908.02211/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":"1908.02211","created_at":"2026-07-05T00:22:41.110533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02211v2","created_at":"2026-07-05T00:22:41.110533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02211","created_at":"2026-07-05T00:22:41.110533+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD3SXTB6GEXE","created_at":"2026-07-05T00:22:41.110533+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD3SXTB6GEXE4KZL","created_at":"2026-07-05T00:22:41.110533+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD3SXTB6","created_at":"2026-07-05T00:22:41.110533+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/SD3SXTB6GEXE4KZLO44FSBCMGL","json":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL.json","graph_json":"https://pith.science/api/pith-number/SD3SXTB6GEXE4KZLO44FSBCMGL/graph.json","events_json":"https://pith.science/api/pith-number/SD3SXTB6GEXE4KZLO44FSBCMGL/events.json","paper":"https://pith.science/paper/SD3SXTB6"},"agent_actions":{"view_html":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL","download_json":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL.json","view_paper":"https://pith.science/paper/SD3SXTB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02211&json=true","fetch_graph":"https://pith.science/api/pith-number/SD3SXTB6GEXE4KZLO44FSBCMGL/graph.json","fetch_events":"https://pith.science/api/pith-number/SD3SXTB6GEXE4KZLO44FSBCMGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL/action/storage_attestation","attest_author":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL/action/author_attestation","sign_citation":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL/action/citation_signature","submit_replication":"https://pith.science/pith/SD3SXTB6GEXE4KZLO44FSBCMGL/action/replication_record"}},"created_at":"2026-07-05T00:22:41.110533+00:00","updated_at":"2026-07-05T00:22:41.110533+00:00"}