{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4KPPNGKKZTF7FQD6RCEC4CCRYO","short_pith_number":"pith:4KPPNGKK","schema_version":"1.0","canonical_sha256":"e29ef6994acccbf2c07e88882e0851c38135794e00616b2bba84ef1b976cbb7b","source":{"kind":"arxiv","id":"1805.03574","version":2},"attestation_state":"computed","paper":{"title":"Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bastien Cazaux, Dmitry Kosolobov, Tuukka Norri, Veli M\\\"akinen","submitted_at":"2018-05-09T15:04:25Z","abstract_excerpt":"Given a threshold $L$ and a set $\\mathcal{R} = \\{R_1, \\ldots, R_m\\}$ of $m$ haplotype sequences, each having length $n$, the minimum segmentation problem for founder reconstruction is to partition the sequences into disjoint segments $\\mathcal{R}[i_1{+}1,i_2], \\mathcal{R}[i_2{+}1, i_3], \\ldots, \\mathcal{R}[i_{r-1}{+}1, i_r]$, where $0 = i_1 < \\cdots < i_r = n$ and $\\mathcal{R}[i_{j-1}{+}1, i_j]$ is the set $\\{R_1[i_{j-1}{+}1, i_j], \\ldots, R_m[i_{j-1}{+}1, i_j]\\}$, such that the length of each segment, $i_j - i_{j-1}$, is at least $L$ and $K = \\max_j\\{ |\\mathcal{R}[i_{j-1}{+}1, i_j]| \\}$ is mi"},"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.03574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-09T15:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"a3fc249832be9b0804fb15ce2d6012706b9a3884d9518dc68d6ac235fd251a88","abstract_canon_sha256":"e1dc0050876dd89389a5f46e6832b1567f07c648c4f3ea62bd22fd88cbc029e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:47.984106Z","signature_b64":"M7uNoeNfqh3EFsaHT6F8G+AcCSxYQV4KvkkLeFKCpx1jQyRXBqg/zRb3Otrbnk8K4Fmg7qn/RHeBEA+nmlQkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e29ef6994acccbf2c07e88882e0851c38135794e00616b2bba84ef1b976cbb7b","last_reissued_at":"2026-05-17T23:56:47.983718Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:47.983718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bastien Cazaux, Dmitry Kosolobov, Tuukka Norri, Veli M\\\"akinen","submitted_at":"2018-05-09T15:04:25Z","abstract_excerpt":"Given a threshold $L$ and a set $\\mathcal{R} = \\{R_1, \\ldots, R_m\\}$ of $m$ haplotype sequences, each having length $n$, the minimum segmentation problem for founder reconstruction is to partition the sequences into disjoint segments $\\mathcal{R}[i_1{+}1,i_2], \\mathcal{R}[i_2{+}1, i_3], \\ldots, \\mathcal{R}[i_{r-1}{+}1, i_r]$, where $0 = i_1 < \\cdots < i_r = n$ and $\\mathcal{R}[i_{j-1}{+}1, i_j]$ is the set $\\{R_1[i_{j-1}{+}1, i_j], \\ldots, R_m[i_{j-1}{+}1, i_j]\\}$, such that the length of each segment, $i_j - i_{j-1}$, is at least $L$ and $K = \\max_j\\{ |\\mathcal{R}[i_{j-1}{+}1, i_j]| \\}$ is mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03574","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":"1805.03574","created_at":"2026-05-17T23:56:47.983781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03574v2","created_at":"2026-05-17T23:56:47.983781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03574","created_at":"2026-05-17T23:56:47.983781+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KPPNGKKZTF7","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KPPNGKKZTF7FQD6","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KPPNGKK","created_at":"2026-05-18T12:32:05.422762+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/4KPPNGKKZTF7FQD6RCEC4CCRYO","json":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO.json","graph_json":"https://pith.science/api/pith-number/4KPPNGKKZTF7FQD6RCEC4CCRYO/graph.json","events_json":"https://pith.science/api/pith-number/4KPPNGKKZTF7FQD6RCEC4CCRYO/events.json","paper":"https://pith.science/paper/4KPPNGKK"},"agent_actions":{"view_html":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO","download_json":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO.json","view_paper":"https://pith.science/paper/4KPPNGKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03574&json=true","fetch_graph":"https://pith.science/api/pith-number/4KPPNGKKZTF7FQD6RCEC4CCRYO/graph.json","fetch_events":"https://pith.science/api/pith-number/4KPPNGKKZTF7FQD6RCEC4CCRYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO/action/storage_attestation","attest_author":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO/action/author_attestation","sign_citation":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO/action/citation_signature","submit_replication":"https://pith.science/pith/4KPPNGKKZTF7FQD6RCEC4CCRYO/action/replication_record"}},"created_at":"2026-05-17T23:56:47.983781+00:00","updated_at":"2026-05-17T23:56:47.983781+00:00"}