{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QLVPHM5HJORCYJI6K6EU6JYRBK","short_pith_number":"pith:QLVPHM5H","schema_version":"1.0","canonical_sha256":"82eaf3b3a74ba22c251e57894f27110aa362df201c49a2f61f1c04b389518466","source":{"kind":"arxiv","id":"1205.6359","version":2},"attestation_state":"computed","paper":{"title":"Extracting Conflict-free Information from Multi-labeled Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Akshay Deepak, David Fern\\'andez-Baca, Michelle M. McMahon","submitted_at":"2012-05-29T13:35:56Z","abstract_excerpt":"A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious. We define the information content of a MUL-tree T as the set of all conflict-free quartet topologies implied by T, and define the maximal reduced form of T as the smallest tree that can be obtained from T by pruning leaves and contracting edges while retaining the same information content. We "},"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":"1205.6359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-29T13:35:56Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"66238c1cf16fc2c1a531363aa3e76106f23033e0a9d4217824d6019679f5bb5f","abstract_canon_sha256":"e47d4084b2a1435a12c2ade7281d3a1cac15d51aea152cf5e84935bb570ca3e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:25.844485Z","signature_b64":"QUVgdh4oWDlXnTB4SlGlRMRvwJvgAlxOAllMFA2O5iqsIj0X9/SXY+cBjGGxONOqUTjPf4z2Pp3PAXZI1wkwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82eaf3b3a74ba22c251e57894f27110aa362df201c49a2f61f1c04b389518466","last_reissued_at":"2026-05-18T03:52:25.843873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:25.843873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extracting Conflict-free Information from Multi-labeled Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Akshay Deepak, David Fern\\'andez-Baca, Michelle M. McMahon","submitted_at":"2012-05-29T13:35:56Z","abstract_excerpt":"A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious. We define the information content of a MUL-tree T as the set of all conflict-free quartet topologies implied by T, and define the maximal reduced form of T as the smallest tree that can be obtained from T by pruning leaves and contracting edges while retaining the same information content. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6359","kind":"arxiv","version":2},"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":"1205.6359","created_at":"2026-05-18T03:52:25.843969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6359v2","created_at":"2026-05-18T03:52:25.843969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6359","created_at":"2026-05-18T03:52:25.843969+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLVPHM5HJORC","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLVPHM5HJORCYJI6","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLVPHM5H","created_at":"2026-05-18T12:27:18.751474+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/QLVPHM5HJORCYJI6K6EU6JYRBK","json":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK.json","graph_json":"https://pith.science/api/pith-number/QLVPHM5HJORCYJI6K6EU6JYRBK/graph.json","events_json":"https://pith.science/api/pith-number/QLVPHM5HJORCYJI6K6EU6JYRBK/events.json","paper":"https://pith.science/paper/QLVPHM5H"},"agent_actions":{"view_html":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK","download_json":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK.json","view_paper":"https://pith.science/paper/QLVPHM5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6359&json=true","fetch_graph":"https://pith.science/api/pith-number/QLVPHM5HJORCYJI6K6EU6JYRBK/graph.json","fetch_events":"https://pith.science/api/pith-number/QLVPHM5HJORCYJI6K6EU6JYRBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/action/storage_attestation","attest_author":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/action/author_attestation","sign_citation":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/action/citation_signature","submit_replication":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/action/replication_record"}},"created_at":"2026-05-18T03:52:25.843969+00:00","updated_at":"2026-05-18T03:52:25.843969+00:00"}