{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QLVPHM5HJORCYJI6K6EU6JYRBK","short_pith_number":"pith:QLVPHM5H","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"},"canonical_sha256":"82eaf3b3a74ba22c251e57894f27110aa362df201c49a2f61f1c04b389518466","source":{"kind":"arxiv","id":"1205.6359","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6359","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6359v2","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6359","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"QLVPHM5HJORC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QLVPHM5HJORCYJI6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QLVPHM5H","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QLVPHM5HJORCYJI6K6EU6JYRBK","target":"record","payload":{"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"},"canonical_sha256":"82eaf3b3a74ba22c251e57894f27110aa362df201c49a2f61f1c04b389518466","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"},"source_kind":"arxiv","source_id":"1205.6359","source_version":2,"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-18T03:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsgXzKtgbClgqikXy6c5AkaoCBpVM/G5ggHdQboYUxPkAh7Mt23+VFqYkLRk5WVvnT7+uuGIHYMKaO9y8q+VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:15:32.056507Z"},"content_sha256":"340a08aaae9dc5baf7521327d5d89ea2b66eadade897e15d9da4c2227e5955b9","schema_version":"1.0","event_id":"sha256:340a08aaae9dc5baf7521327d5d89ea2b66eadade897e15d9da4c2227e5955b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QLVPHM5HJORCYJI6K6EU6JYRBK","target":"graph","payload":{"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"},"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-18T03:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUWJ3WXzh1ZYgxjK4TRT3/HlvfPrGEXAaVeCIn0TUtJY1k5KQljx0jPz8px1D6VRDXcA6k7mCGJFsF3rwfn+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:15:32.056852Z"},"content_sha256":"125c89d8113314d9da047e800f20a0682b63ded1b91a86fde1ff45e89afb2c46","schema_version":"1.0","event_id":"sha256:125c89d8113314d9da047e800f20a0682b63ded1b91a86fde1ff45e89afb2c46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/bundle.json","state_url":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/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-06-26T00:15:32Z","links":{"resolver":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK","bundle":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/bundle.json","state":"https://pith.science/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLVPHM5HJORCYJI6K6EU6JYRBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QLVPHM5HJORCYJI6K6EU6JYRBK","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":"e47d4084b2a1435a12c2ade7281d3a1cac15d51aea152cf5e84935bb570ca3e3","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-29T13:35:56Z","title_canon_sha256":"66238c1cf16fc2c1a531363aa3e76106f23033e0a9d4217824d6019679f5bb5f"},"schema_version":"1.0","source":{"id":"1205.6359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6359","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6359v2","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6359","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"QLVPHM5HJORC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QLVPHM5HJORCYJI6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QLVPHM5H","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:125c89d8113314d9da047e800f20a0682b63ded1b91a86fde1ff45e89afb2c46","target":"graph","created_at":"2026-05-18T03:52:25Z","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":"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 ","authors_text":"Akshay Deepak, David Fern\\'andez-Baca, Michelle M. McMahon","cross_cats":["q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-29T13:35:56Z","title":"Extracting Conflict-free Information from Multi-labeled Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6359","kind":"arxiv","version":2},"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:340a08aaae9dc5baf7521327d5d89ea2b66eadade897e15d9da4c2227e5955b9","target":"record","created_at":"2026-05-18T03:52:25Z","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":"e47d4084b2a1435a12c2ade7281d3a1cac15d51aea152cf5e84935bb570ca3e3","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-29T13:35:56Z","title_canon_sha256":"66238c1cf16fc2c1a531363aa3e76106f23033e0a9d4217824d6019679f5bb5f"},"schema_version":"1.0","source":{"id":"1205.6359","kind":"arxiv","version":2}},"canonical_sha256":"82eaf3b3a74ba22c251e57894f27110aa362df201c49a2f61f1c04b389518466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82eaf3b3a74ba22c251e57894f27110aa362df201c49a2f61f1c04b389518466","first_computed_at":"2026-05-18T03:52:25.843873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:25.843873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUVgdh4oWDlXnTB4SlGlRMRvwJvgAlxOAllMFA2O5iqsIj0X9/SXY+cBjGGxONOqUTjPf4z2Pp3PAXZI1wkwBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:25.844485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:340a08aaae9dc5baf7521327d5d89ea2b66eadade897e15d9da4c2227e5955b9","sha256:125c89d8113314d9da047e800f20a0682b63ded1b91a86fde1ff45e89afb2c46"],"state_sha256":"d405e5333f89802c35d187fafe10d2193b72ac30b15cb35448e567eaa79b4b5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LDBMEs44NCExhy/ai6XyzzqbZBTgTl1lbKo7Pfs5nDfZeA9kiEgRdqVWRc7oD8HAxOSW5ej6wBI6Sh+96zfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:15:32.059129Z","bundle_sha256":"4cbad543b9891b7ee56a45ef43aa1bb64f88f7a1df50344051c51aa8aeec5b1e"}}