{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BORUDYU5OUXO4GHBNHA57RWHVV","short_pith_number":"pith:BORUDYU5","schema_version":"1.0","canonical_sha256":"0ba341e29d752eee18e169c1dfc6c7ad48bf72569a634268ef8789085e259bd8","source":{"kind":"arxiv","id":"1812.07689","version":1},"attestation_state":"computed","paper":{"title":"GenHap: A Novel Computational Method Based on Genetic Algorithms for Haplotype Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.GN","authors_text":"Andrea Tangherloni, Daniela Besozzi, Giancarlo Mauri, Ivan Merelli, Leonardo Rundo, Marco S. Nobile, Paolo Cazzaniga, Pietro Li\\`o, Simone Spolaor","submitted_at":"2018-12-18T23:19:03Z","abstract_excerpt":"The computational problem of inferring the full haplotype of a cell starting from read sequencing data is known as haplotype assembly, and consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. Indeed, the knowledge of complete haplotypes is generally more informative than analyzing single SNPs and plays a fundamental role in many medical applications. To reconstruct the two haplotypes, we addressed the weighted Minimum Error Correction (wMEC) problem, which is a successful approach for haplotype assembly. This NP-hard problem consi"},"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":"1812.07689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2018-12-18T23:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"e83c39ff87e8652ef431adbbcc4544102b4c949acd4ad3b490dbafb233881774","abstract_canon_sha256":"7f83fcf8b70d2abf4c9716d3af5baf61d842909ca8537f9101ffaf727ecc99e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.326039Z","signature_b64":"5kLvRSlHZKOmEi3ci9yBh27C9BDNtza259KUA+zGfw958XgW6/8GIDu/FU0UETT9U6JpA3kf/mu3OlXUqMsRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba341e29d752eee18e169c1dfc6c7ad48bf72569a634268ef8789085e259bd8","last_reissued_at":"2026-05-17T23:57:56.325299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.325299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GenHap: A Novel Computational Method Based on Genetic Algorithms for Haplotype Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.GN","authors_text":"Andrea Tangherloni, Daniela Besozzi, Giancarlo Mauri, Ivan Merelli, Leonardo Rundo, Marco S. Nobile, Paolo Cazzaniga, Pietro Li\\`o, Simone Spolaor","submitted_at":"2018-12-18T23:19:03Z","abstract_excerpt":"The computational problem of inferring the full haplotype of a cell starting from read sequencing data is known as haplotype assembly, and consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. Indeed, the knowledge of complete haplotypes is generally more informative than analyzing single SNPs and plays a fundamental role in many medical applications. To reconstruct the two haplotypes, we addressed the weighted Minimum Error Correction (wMEC) problem, which is a successful approach for haplotype assembly. This NP-hard problem consi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07689","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":"1812.07689","created_at":"2026-05-17T23:57:56.325419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.07689v1","created_at":"2026-05-17T23:57:56.325419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07689","created_at":"2026-05-17T23:57:56.325419+00:00"},{"alias_kind":"pith_short_12","alias_value":"BORUDYU5OUXO","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BORUDYU5OUXO4GHB","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BORUDYU5","created_at":"2026-05-18T12:32:16.446611+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/BORUDYU5OUXO4GHBNHA57RWHVV","json":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV.json","graph_json":"https://pith.science/api/pith-number/BORUDYU5OUXO4GHBNHA57RWHVV/graph.json","events_json":"https://pith.science/api/pith-number/BORUDYU5OUXO4GHBNHA57RWHVV/events.json","paper":"https://pith.science/paper/BORUDYU5"},"agent_actions":{"view_html":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV","download_json":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV.json","view_paper":"https://pith.science/paper/BORUDYU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.07689&json=true","fetch_graph":"https://pith.science/api/pith-number/BORUDYU5OUXO4GHBNHA57RWHVV/graph.json","fetch_events":"https://pith.science/api/pith-number/BORUDYU5OUXO4GHBNHA57RWHVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV/action/storage_attestation","attest_author":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV/action/author_attestation","sign_citation":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV/action/citation_signature","submit_replication":"https://pith.science/pith/BORUDYU5OUXO4GHBNHA57RWHVV/action/replication_record"}},"created_at":"2026-05-17T23:57:56.325419+00:00","updated_at":"2026-05-17T23:57:56.325419+00:00"}