{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:46BNACYNJK3U5GQMORTSFSRYRI","short_pith_number":"pith:46BNACYN","schema_version":"1.0","canonical_sha256":"e782d00b0d4ab74e9a0c746722ca388a22f697413d550454cdaf3caacf435bef","source":{"kind":"arxiv","id":"1106.1723","version":1},"attestation_state":"computed","paper":{"title":"'Bureaucratic' set systems, and their role in phylogenetics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"David Bryant, Mike Steel","submitted_at":"2011-06-09T07:37:27Z","abstract_excerpt":"We say that a collection $\\Cc$ of subsets of $X$ is {\\em bureaucratic} if every maximal hierarchy on $X$ contained in $\\Cc$ is also maximum. We characterise bureaucratic set systems and show how they arise in phylogenetics. This framework has several useful algorithmic consequences: we generalize some earlier results and derive a polynomial-time algorithm for a parsimony problem arising in phylogenetic networks."},"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":"1106.1723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-06-09T07:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"46fa819a2fc5ea020cf68ab62b39b2351619084a960bbe1ca6a1a797748fe29d","abstract_canon_sha256":"fd270ce6529bd8e5639668b04587a70727b061aee61c51790bf15feb9f76ae36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:15.254236Z","signature_b64":"vL8cPIFSoASyPFk918p+rFjGXK8SdctBxkMWa56nn/71W+v13errdjdeh8NtUyF+N6Q2qG4LCbTLvpQSKpw4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e782d00b0d4ab74e9a0c746722ca388a22f697413d550454cdaf3caacf435bef","last_reissued_at":"2026-05-18T04:20:15.253807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:15.253807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"'Bureaucratic' set systems, and their role in phylogenetics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"David Bryant, Mike Steel","submitted_at":"2011-06-09T07:37:27Z","abstract_excerpt":"We say that a collection $\\Cc$ of subsets of $X$ is {\\em bureaucratic} if every maximal hierarchy on $X$ contained in $\\Cc$ is also maximum. We characterise bureaucratic set systems and show how they arise in phylogenetics. This framework has several useful algorithmic consequences: we generalize some earlier results and derive a polynomial-time algorithm for a parsimony problem arising in phylogenetic networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1723","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":"1106.1723","created_at":"2026-05-18T04:20:15.253871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1723v1","created_at":"2026-05-18T04:20:15.253871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1723","created_at":"2026-05-18T04:20:15.253871+00:00"},{"alias_kind":"pith_short_12","alias_value":"46BNACYNJK3U","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"46BNACYNJK3U5GQM","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"46BNACYN","created_at":"2026-05-18T12:26:20.644004+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/46BNACYNJK3U5GQMORTSFSRYRI","json":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI.json","graph_json":"https://pith.science/api/pith-number/46BNACYNJK3U5GQMORTSFSRYRI/graph.json","events_json":"https://pith.science/api/pith-number/46BNACYNJK3U5GQMORTSFSRYRI/events.json","paper":"https://pith.science/paper/46BNACYN"},"agent_actions":{"view_html":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI","download_json":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI.json","view_paper":"https://pith.science/paper/46BNACYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1723&json=true","fetch_graph":"https://pith.science/api/pith-number/46BNACYNJK3U5GQMORTSFSRYRI/graph.json","fetch_events":"https://pith.science/api/pith-number/46BNACYNJK3U5GQMORTSFSRYRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI/action/storage_attestation","attest_author":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI/action/author_attestation","sign_citation":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI/action/citation_signature","submit_replication":"https://pith.science/pith/46BNACYNJK3U5GQMORTSFSRYRI/action/replication_record"}},"created_at":"2026-05-18T04:20:15.253871+00:00","updated_at":"2026-05-18T04:20:15.253871+00:00"}