{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XQ2NVTAN7X3UOVOUP6OVHG5RO3","short_pith_number":"pith:XQ2NVTAN","schema_version":"1.0","canonical_sha256":"bc34dacc0dfdf74755d47f9d539bb176c7202d239087bf9da9a561eac24cfe41","source":{"kind":"arxiv","id":"1805.05228","version":1},"attestation_state":"computed","paper":{"title":"Assembling Omnitigs using Hidden-Order de Bruijn Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diego D\\'iaz-Dom\\'inguez, Djamal Belazzougui, Gonzalo Navarro, Simon J. Puglisi, Travis Gagie, Veli M\\\"akinen","submitted_at":"2018-05-14T15:26:30Z","abstract_excerpt":"De novo DNA assembly is a fundamental task in Bioinformatics, and finding Eulerian paths on de Bruijn graphs is one of the dominant approaches to it. In most of the cases, there may be no one order for the de Bruijn graph that works well for assembling all of the reads. For this reason, some de Bruijn-based assemblers try assembling on several graphs of increasing order, in turn. Boucher et al. (2015) went further and gave a representation making it possible to navigate in the graph and change order on the fly, up to a maximum $K$, but they can use up to $\\lg K$ extra bits per edge because the"},"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":"1805.05228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T15:26:30Z","cross_cats_sorted":[],"title_canon_sha256":"199edb06de7786250a5a0d874acffea0274c129c1f596579b01e3f32a90bf6c9","abstract_canon_sha256":"771f00f075710af0ea09b52c00aca5b4785c7e272d1921e9acb10ca6e2fbf430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.649981Z","signature_b64":"lV1F+cofZFaJB9JvEqkzPF014t6w+aDU/yrCF0aT1fSvWNhvPzu13h6a/5thPC78kxTmLAJweEmQsQjQfSH7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc34dacc0dfdf74755d47f9d539bb176c7202d239087bf9da9a561eac24cfe41","last_reissued_at":"2026-05-18T00:16:03.649558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.649558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assembling Omnitigs using Hidden-Order de Bruijn Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diego D\\'iaz-Dom\\'inguez, Djamal Belazzougui, Gonzalo Navarro, Simon J. Puglisi, Travis Gagie, Veli M\\\"akinen","submitted_at":"2018-05-14T15:26:30Z","abstract_excerpt":"De novo DNA assembly is a fundamental task in Bioinformatics, and finding Eulerian paths on de Bruijn graphs is one of the dominant approaches to it. In most of the cases, there may be no one order for the de Bruijn graph that works well for assembling all of the reads. For this reason, some de Bruijn-based assemblers try assembling on several graphs of increasing order, in turn. Boucher et al. (2015) went further and gave a representation making it possible to navigate in the graph and change order on the fly, up to a maximum $K$, but they can use up to $\\lg K$ extra bits per edge because the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05228","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.05228","created_at":"2026-05-18T00:16:03.649639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05228v1","created_at":"2026-05-18T00:16:03.649639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05228","created_at":"2026-05-18T00:16:03.649639+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQ2NVTAN7X3U","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQ2NVTAN7X3UOVOU","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQ2NVTAN","created_at":"2026-05-18T12:33:01.666342+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/XQ2NVTAN7X3UOVOUP6OVHG5RO3","json":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3.json","graph_json":"https://pith.science/api/pith-number/XQ2NVTAN7X3UOVOUP6OVHG5RO3/graph.json","events_json":"https://pith.science/api/pith-number/XQ2NVTAN7X3UOVOUP6OVHG5RO3/events.json","paper":"https://pith.science/paper/XQ2NVTAN"},"agent_actions":{"view_html":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3","download_json":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3.json","view_paper":"https://pith.science/paper/XQ2NVTAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05228&json=true","fetch_graph":"https://pith.science/api/pith-number/XQ2NVTAN7X3UOVOUP6OVHG5RO3/graph.json","fetch_events":"https://pith.science/api/pith-number/XQ2NVTAN7X3UOVOUP6OVHG5RO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3/action/storage_attestation","attest_author":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3/action/author_attestation","sign_citation":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3/action/citation_signature","submit_replication":"https://pith.science/pith/XQ2NVTAN7X3UOVOUP6OVHG5RO3/action/replication_record"}},"created_at":"2026-05-18T00:16:03.649639+00:00","updated_at":"2026-05-18T00:16:03.649639+00:00"}