{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:H2OS6GO54J2HHGTV7JIPXSAH6X","short_pith_number":"pith:H2OS6GO5","schema_version":"1.0","canonical_sha256":"3e9d2f19dde274739a75fa50fbc807f5e737685c0529a7597e417fba0b326462","source":{"kind":"arxiv","id":"1108.3653","version":1},"attestation_state":"computed","paper":{"title":"Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.CC","authors_text":"Celine Scornavacca, Steven Kelk","submitted_at":"2011-08-18T06:09:20Z","abstract_excerpt":"Here we show that, given a set of clusters C on a set of taxa X, where |X|=n, it is possible to determine in time f(k).poly(n) whether there exists a level-<= k network (i.e. a network where each biconnected component has reticulation number at most k) that represents all the clusters in C in the softwired sense, and if so to construct such a network. This extends a polynomial time result from \"On the elusiveness of clusters\" by Kelk, Scornavacca and Van Iersel(2011). By generalizing the concept of \"level-k generator\" to general networks, we then extend this fixed parameter tractability result"},"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":"1108.3653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-18T06:09:20Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"29c1fb45822b37fb285cf94bc1cca30936fb5a7a7694e698a728661e0b85a1cd","abstract_canon_sha256":"cba51b46ade0ef9085842c2343b9a2c3b50b96f1839867b818c228ac1eae73fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:15.467152Z","signature_b64":"MnKsdXD+zhO5mjFHRUV3sEaI2jqUXln3Jwj3AmUBV7/eK/wIUNk5FDcrEw98WBxTVnEqL6uX24GT6iFpMZXlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e9d2f19dde274739a75fa50fbc807f5e737685c0529a7597e417fba0b326462","last_reissued_at":"2026-05-18T04:15:15.466390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:15.466390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.CC","authors_text":"Celine Scornavacca, Steven Kelk","submitted_at":"2011-08-18T06:09:20Z","abstract_excerpt":"Here we show that, given a set of clusters C on a set of taxa X, where |X|=n, it is possible to determine in time f(k).poly(n) whether there exists a level-<= k network (i.e. a network where each biconnected component has reticulation number at most k) that represents all the clusters in C in the softwired sense, and if so to construct such a network. This extends a polynomial time result from \"On the elusiveness of clusters\" by Kelk, Scornavacca and Van Iersel(2011). By generalizing the concept of \"level-k generator\" to general networks, we then extend this fixed parameter tractability result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3653","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":"1108.3653","created_at":"2026-05-18T04:15:15.466527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3653v1","created_at":"2026-05-18T04:15:15.466527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3653","created_at":"2026-05-18T04:15:15.466527+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2OS6GO54J2H","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2OS6GO54J2HHGTV","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2OS6GO5","created_at":"2026-05-18T12:26:30.835961+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/H2OS6GO54J2HHGTV7JIPXSAH6X","json":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X.json","graph_json":"https://pith.science/api/pith-number/H2OS6GO54J2HHGTV7JIPXSAH6X/graph.json","events_json":"https://pith.science/api/pith-number/H2OS6GO54J2HHGTV7JIPXSAH6X/events.json","paper":"https://pith.science/paper/H2OS6GO5"},"agent_actions":{"view_html":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X","download_json":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X.json","view_paper":"https://pith.science/paper/H2OS6GO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3653&json=true","fetch_graph":"https://pith.science/api/pith-number/H2OS6GO54J2HHGTV7JIPXSAH6X/graph.json","fetch_events":"https://pith.science/api/pith-number/H2OS6GO54J2HHGTV7JIPXSAH6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X/action/storage_attestation","attest_author":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X/action/author_attestation","sign_citation":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X/action/citation_signature","submit_replication":"https://pith.science/pith/H2OS6GO54J2HHGTV7JIPXSAH6X/action/replication_record"}},"created_at":"2026-05-18T04:15:15.466527+00:00","updated_at":"2026-05-18T04:15:15.466527+00:00"}