{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LOVKKOHKA7ZLRSI4RRKG5SDNHK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"19a16fac1b9e69001d124c80bd1fa56af87dc0a7727bb0c0e2b4463099215550","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-03-11T13:46:50Z","title_canon_sha256":"3dbd5a1ba315bb47eab0657354dd0ee8f844350f2f12351d1098fbb0f1bf860d"},"schema_version":"1.0","source":{"id":"1103.2266","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2266","created_at":"2026-05-18T02:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2266v4","created_at":"2026-05-18T02:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2266","created_at":"2026-05-18T02:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"LOVKKOHKA7ZL","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LOVKKOHKA7ZLRSI4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LOVKKOHK","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:d417eea1c4ce36433a1b5ba970b5e7259b4d00ce25ea135e2c3c03c97bac0743","target":"graph","created_at":"2026-05-18T02:22:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Michel Habib, Thu-Hien To","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-03-11T13:46:50Z","title":"Constructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2266","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa158c6e4321bf53157a16a5cb622cdd4781b10fdc9b6c76940ddc29e732bf09","target":"record","created_at":"2026-05-18T02:22:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"19a16fac1b9e69001d124c80bd1fa56af87dc0a7727bb0c0e2b4463099215550","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-03-11T13:46:50Z","title_canon_sha256":"3dbd5a1ba315bb47eab0657354dd0ee8f844350f2f12351d1098fbb0f1bf860d"},"schema_version":"1.0","source":{"id":"1103.2266","kind":"arxiv","version":4}},"canonical_sha256":"5baaa538ea07f2b8c91c8c546ec86d3a816467ebd58b56a6398595ead33195ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5baaa538ea07f2b8c91c8c546ec86d3a816467ebd58b56a6398595ead33195ec","first_computed_at":"2026-05-18T02:22:20.017928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:20.017928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YIlrEKHRFRUXTzd/ychIhYlWnOeawDNk2lhGB55jj+vktxaAlLYyIcfOLzAyxxtSRpGAaW29/3Emy3b5UShoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:20.018694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2266","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa158c6e4321bf53157a16a5cb622cdd4781b10fdc9b6c76940ddc29e732bf09","sha256:d417eea1c4ce36433a1b5ba970b5e7259b4d00ce25ea135e2c3c03c97bac0743"],"state_sha256":"0d68f1d26a77c614db5fc423c037b2f5eaa2a1b1673b42c63b6944337435c15c"}