{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VIUPIHKN6J2GDUYMKIXJLTSFXH","short_pith_number":"pith:VIUPIHKN","schema_version":"1.0","canonical_sha256":"aa28f41d4df27461d30c522e95ce45b9dc7189125901032c8948da86843ee401","source":{"kind":"arxiv","id":"1604.03587","version":2},"attestation_state":"computed","paper":{"title":"FSG: Fast String Graph Construction for De Novo Assembly of Reads Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Gianluca Della Vedova, Marco Previtali, Paola Bonizzoni, Raffaella Rizzi, Yuri Pirola","submitted_at":"2016-04-12T21:08:48Z","abstract_excerpt":"The string graph for a collection of next-generation reads is a lossless data representation that is fundamental for de novo assemblers based on the overlap-layout-consensus paradigm. In this paper, we explore a novel approach to compute the string graph, based on the FM-index and Burrows-Wheeler Transform. We describe a simple algorithm that uses only the FM-index representation of the collection of reads to construct the string graph, without accessing the input reads. Our algorithm has been integrated into the SGA assembler as a standalone module to construct the string graph.\n  The new int"},"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":"1604.03587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-12T21:08:48Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"e6a66b30df47ff62706ae272bf8886e8307324ca39a663b357f1e6b50b1dba74","abstract_canon_sha256":"25362b40e42759b51ebc7f899c0d5d4f7bb55c60e9a2369dc0c83cbe29458886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.850401Z","signature_b64":"qc+rRhKvMa4rj8p/8S7e4V7xAFJcukRw6KOogedxDarNE9vMLugl+BIZQbFDFVamWvlIe7HEMhALLJvF79Y2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa28f41d4df27461d30c522e95ce45b9dc7189125901032c8948da86843ee401","last_reissued_at":"2026-05-18T00:43:35.850010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.850010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FSG: Fast String Graph Construction for De Novo Assembly of Reads Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Gianluca Della Vedova, Marco Previtali, Paola Bonizzoni, Raffaella Rizzi, Yuri Pirola","submitted_at":"2016-04-12T21:08:48Z","abstract_excerpt":"The string graph for a collection of next-generation reads is a lossless data representation that is fundamental for de novo assemblers based on the overlap-layout-consensus paradigm. In this paper, we explore a novel approach to compute the string graph, based on the FM-index and Burrows-Wheeler Transform. We describe a simple algorithm that uses only the FM-index representation of the collection of reads to construct the string graph, without accessing the input reads. Our algorithm has been integrated into the SGA assembler as a standalone module to construct the string graph.\n  The new int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03587","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":""},"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":"1604.03587","created_at":"2026-05-18T00:43:35.850069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03587v2","created_at":"2026-05-18T00:43:35.850069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03587","created_at":"2026-05-18T00:43:35.850069+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIUPIHKN6J2G","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIUPIHKN6J2GDUYM","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIUPIHKN","created_at":"2026-05-18T12:30:48.956258+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/VIUPIHKN6J2GDUYMKIXJLTSFXH","json":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH.json","graph_json":"https://pith.science/api/pith-number/VIUPIHKN6J2GDUYMKIXJLTSFXH/graph.json","events_json":"https://pith.science/api/pith-number/VIUPIHKN6J2GDUYMKIXJLTSFXH/events.json","paper":"https://pith.science/paper/VIUPIHKN"},"agent_actions":{"view_html":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH","download_json":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH.json","view_paper":"https://pith.science/paper/VIUPIHKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03587&json=true","fetch_graph":"https://pith.science/api/pith-number/VIUPIHKN6J2GDUYMKIXJLTSFXH/graph.json","fetch_events":"https://pith.science/api/pith-number/VIUPIHKN6J2GDUYMKIXJLTSFXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH/action/storage_attestation","attest_author":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH/action/author_attestation","sign_citation":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH/action/citation_signature","submit_replication":"https://pith.science/pith/VIUPIHKN6J2GDUYMKIXJLTSFXH/action/replication_record"}},"created_at":"2026-05-18T00:43:35.850069+00:00","updated_at":"2026-05-18T00:43:35.850069+00:00"}