{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LOVKKOHKA7ZLRSI4RRKG5SDNHK","short_pith_number":"pith:LOVKKOHK","schema_version":"1.0","canonical_sha256":"5baaa538ea07f2b8c91c8c546ec86d3a816467ebd58b56a6398595ead33195ec","source":{"kind":"arxiv","id":"1103.2266","version":4},"attestation_state":"computed","paper":{"title":"Constructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Michel Habib, Thu-Hien To","submitted_at":"2011-03-11T13:46:50Z","abstract_excerpt":"For a given set $\\mathcal{L}$ of species and a set $\\mathcal{T}$ of triplets on $\\mathcal{L}$, one wants to construct a phylogenetic network which is consistent with $\\mathcal{T}$, i.e which represents all triplets of $\\mathcal{T}$. The level of a network is defined as the maximum number of hybrid vertices in its biconnected components. When $\\mathcal{T}$ is dense, there exist polynomial time algorithms to construct level-$0,1,2$ networks (Aho et al. 81, Jansson et al. 04, Iersel et al. 08). For higher levels, partial answers were obtained by Iersel et al. 2008 with a polynomial time algorithm"},"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":"1103.2266","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-03-11T13:46:50Z","cross_cats_sorted":[],"title_canon_sha256":"3dbd5a1ba315bb47eab0657354dd0ee8f844350f2f12351d1098fbb0f1bf860d","abstract_canon_sha256":"19a16fac1b9e69001d124c80bd1fa56af87dc0a7727bb0c0e2b4463099215550"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:20.018694Z","signature_b64":"YIlrEKHRFRUXTzd/ychIhYlWnOeawDNk2lhGB55jj+vktxaAlLYyIcfOLzAyxxtSRpGAaW29/3Emy3b5UShoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5baaa538ea07f2b8c91c8c546ec86d3a816467ebd58b56a6398595ead33195ec","last_reissued_at":"2026-05-18T02:22:20.017928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:20.017928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Michel Habib, Thu-Hien To","submitted_at":"2011-03-11T13:46:50Z","abstract_excerpt":"For a given set $\\mathcal{L}$ of species and a set $\\mathcal{T}$ of triplets on $\\mathcal{L}$, one wants to construct a phylogenetic network which is consistent with $\\mathcal{T}$, i.e which represents all triplets of $\\mathcal{T}$. The level of a network is defined as the maximum number of hybrid vertices in its biconnected components. When $\\mathcal{T}$ is dense, there exist polynomial time algorithms to construct level-$0,1,2$ networks (Aho et al. 81, Jansson et al. 04, Iersel et al. 08). For higher levels, partial answers were obtained by Iersel et al. 2008 with a polynomial time algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2266","kind":"arxiv","version":4},"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":"1103.2266","created_at":"2026-05-18T02:22:20.018038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2266v4","created_at":"2026-05-18T02:22:20.018038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2266","created_at":"2026-05-18T02:22:20.018038+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOVKKOHKA7ZL","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOVKKOHKA7ZLRSI4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOVKKOHK","created_at":"2026-05-18T12:26:34.985390+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/LOVKKOHKA7ZLRSI4RRKG5SDNHK","json":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK.json","graph_json":"https://pith.science/api/pith-number/LOVKKOHKA7ZLRSI4RRKG5SDNHK/graph.json","events_json":"https://pith.science/api/pith-number/LOVKKOHKA7ZLRSI4RRKG5SDNHK/events.json","paper":"https://pith.science/paper/LOVKKOHK"},"agent_actions":{"view_html":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK","download_json":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK.json","view_paper":"https://pith.science/paper/LOVKKOHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2266&json=true","fetch_graph":"https://pith.science/api/pith-number/LOVKKOHKA7ZLRSI4RRKG5SDNHK/graph.json","fetch_events":"https://pith.science/api/pith-number/LOVKKOHKA7ZLRSI4RRKG5SDNHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/action/storage_attestation","attest_author":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/action/author_attestation","sign_citation":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/action/citation_signature","submit_replication":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/action/replication_record"}},"created_at":"2026-05-18T02:22:20.018038+00:00","updated_at":"2026-05-18T02:22:20.018038+00:00"}