{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LOVKKOHKA7ZLRSI4RRKG5SDNHK","short_pith_number":"pith:LOVKKOHK","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"},"canonical_sha256":"5baaa538ea07f2b8c91c8c546ec86d3a816467ebd58b56a6398595ead33195ec","source":{"kind":"arxiv","id":"1103.2266","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LOVKKOHKA7ZLRSI4RRKG5SDNHK","target":"record","payload":{"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"},"canonical_sha256":"5baaa538ea07f2b8c91c8c546ec86d3a816467ebd58b56a6398595ead33195ec","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"},"source_kind":"arxiv","source_id":"1103.2266","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uITp7FNmTQpw9xOYVklATiCTrN9wjewv0hbGt470ZpYal22iGz9fqddnj2Y3VXHrYgXgUR73ccM2zJg4JfF3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:34:51.259542Z"},"content_sha256":"fa158c6e4321bf53157a16a5cb622cdd4781b10fdc9b6c76940ddc29e732bf09","schema_version":"1.0","event_id":"sha256:fa158c6e4321bf53157a16a5cb622cdd4781b10fdc9b6c76940ddc29e732bf09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LOVKKOHKA7ZLRSI4RRKG5SDNHK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxdhBIRvj+z0ndfutNZyBgHBoLHce5F19mkq5OYoztVvLHiiSIpHGRnUz0q8NbJaACFIA323GLyfj3y9R2/UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:34:51.260852Z"},"content_sha256":"d417eea1c4ce36433a1b5ba970b5e7259b4d00ce25ea135e2c3c03c97bac0743","schema_version":"1.0","event_id":"sha256:d417eea1c4ce36433a1b5ba970b5e7259b4d00ce25ea135e2c3c03c97bac0743"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/bundle.json","state_url":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T22:34:51Z","links":{"resolver":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK","bundle":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/bundle.json","state":"https://pith.science/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOVKKOHKA7ZLRSI4RRKG5SDNHK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYSdfGPvII7L7eMttn2CJj1d3QlPXXZn8BvmEB4dViv07WskwFbTFxjfAGqcd2Nka+qT1LvzCGVNyHvmzYcSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:34:51.264299Z","bundle_sha256":"b271fe86e5699a36d38b59020ff86fde5a6ab2417a973c53627a4fbcf87cf061"}}