{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IUK5P35KI3SAH737Q5WRVWDHSK","short_pith_number":"pith:IUK5P35K","schema_version":"1.0","canonical_sha256":"4515d7efaa46e403ff7f876d1ad8679289b0f2420679ce4f2dc1a3f36dc5b7c8","source":{"kind":"arxiv","id":"1103.1834","version":1},"attestation_state":"computed","paper":{"title":"On the elusiveness of clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Leo van Iersel, Steven Kelk","submitted_at":"2011-03-09T17:09:56Z","abstract_excerpt":"Rooted phylogenetic networks are often used to represent conflicting phylogenetic signals. Given a set of clusters, a network is said to represent these clusters in the \"softwired\" sense if, for each cluster in the input set, at least one tree embedded in the network contains that cluster. Motivated by parsimony we might wish to construct such a network using as few reticulations as possible, or minimizing the \"level\" of the network, i.e. the maximum number of reticulations used in any \"tangled\" region of the network. Although these are NP-hard problems, here we prove that, for every fixed k >"},"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.1834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-03-09T17:09:56Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"d006d34ef9d096fdc580d6a4e95219b7a1ca982ee278b43f8ed517b05f2f98ce","abstract_canon_sha256":"3e051df942abd9e67257290ef34b98f9d8014cf476ea22a8602306809012127c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:05.656955Z","signature_b64":"4ncEswFVNbgeokwNdXauFoRBtUoRm0KeRP18bfxwa36WPZMtAR+tS4nFxXafOh5DLvkNUKnRQs0QKwsUjY3KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4515d7efaa46e403ff7f876d1ad8679289b0f2420679ce4f2dc1a3f36dc5b7c8","last_reissued_at":"2026-05-18T04:27:05.656235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:05.656235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the elusiveness of clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Leo van Iersel, Steven Kelk","submitted_at":"2011-03-09T17:09:56Z","abstract_excerpt":"Rooted phylogenetic networks are often used to represent conflicting phylogenetic signals. Given a set of clusters, a network is said to represent these clusters in the \"softwired\" sense if, for each cluster in the input set, at least one tree embedded in the network contains that cluster. Motivated by parsimony we might wish to construct such a network using as few reticulations as possible, or minimizing the \"level\" of the network, i.e. the maximum number of reticulations used in any \"tangled\" region of the network. Although these are NP-hard problems, here we prove that, for every fixed k >"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1834","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":"1103.1834","created_at":"2026-05-18T04:27:05.656338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1834v1","created_at":"2026-05-18T04:27:05.656338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1834","created_at":"2026-05-18T04:27:05.656338+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUK5P35KI3SA","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUK5P35KI3SAH737","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUK5P35K","created_at":"2026-05-18T12:26:32.869790+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/IUK5P35KI3SAH737Q5WRVWDHSK","json":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK.json","graph_json":"https://pith.science/api/pith-number/IUK5P35KI3SAH737Q5WRVWDHSK/graph.json","events_json":"https://pith.science/api/pith-number/IUK5P35KI3SAH737Q5WRVWDHSK/events.json","paper":"https://pith.science/paper/IUK5P35K"},"agent_actions":{"view_html":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK","download_json":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK.json","view_paper":"https://pith.science/paper/IUK5P35K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1834&json=true","fetch_graph":"https://pith.science/api/pith-number/IUK5P35KI3SAH737Q5WRVWDHSK/graph.json","fetch_events":"https://pith.science/api/pith-number/IUK5P35KI3SAH737Q5WRVWDHSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK/action/storage_attestation","attest_author":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK/action/author_attestation","sign_citation":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK/action/citation_signature","submit_replication":"https://pith.science/pith/IUK5P35KI3SAH737Q5WRVWDHSK/action/replication_record"}},"created_at":"2026-05-18T04:27:05.656338+00:00","updated_at":"2026-05-18T04:27:05.656338+00:00"}