{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XDPVQHXZNDLHU3J5OVFRA7UUVY","short_pith_number":"pith:XDPVQHXZ","canonical_record":{"source":{"id":"1803.05866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2018-03-15T17:00:24Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"5f4c26a7d53acfd7c25d107e0296d11f942028af65f19665bdcf8490bbfd159f","abstract_canon_sha256":"f16867056d8572c3387c9af2b6333d80117723b555f85e649fb450d35973d06c"},"schema_version":"1.0"},"canonical_sha256":"b8df581ef968d67a6d3d754b107e94ae198d1ed22f159e6092cbb857090e6f39","source":{"kind":"arxiv","id":"1803.05866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05866","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05866v1","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05866","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"XDPVQHXZNDLH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XDPVQHXZNDLHU3J5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XDPVQHXZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XDPVQHXZNDLHU3J5OVFRA7UUVY","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2018-03-15T17:00:24Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"5f4c26a7d53acfd7c25d107e0296d11f942028af65f19665bdcf8490bbfd159f","abstract_canon_sha256":"f16867056d8572c3387c9af2b6333d80117723b555f85e649fb450d35973d06c"},"schema_version":"1.0"},"canonical_sha256":"b8df581ef968d67a6d3d754b107e94ae198d1ed22f159e6092cbb857090e6f39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.489099Z","signature_b64":"2r3vtqTWarmTJjIqVNo+hDUbaDGEDk68+TJCeUNZXlVQGXWuzwpnDLQPToGgNtM/CPWwKLc11qCVITin69riBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8df581ef968d67a6d3d754b107e94ae198d1ed22f159e6092cbb857090e6f39","last_reissued_at":"2026-05-18T00:20:54.488655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.488655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05866","source_version":1,"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-18T00:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AX3JUfES4cHfFigKNiz6mbqnPy3ngs/qdhQCr0wPD+YvPN9x0v6akooLfbBZ6NegrqceDbVlJZK/iVz+6wIkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:43:06.452523Z"},"content_sha256":"0deb5294d0a961820f07504eb01be4528bfaa7ddf62e049997c60a29786fb799","schema_version":"1.0","event_id":"sha256:0deb5294d0a961820f07504eb01be4528bfaa7ddf62e049997c60a29786fb799"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XDPVQHXZNDLHU3J5OVFRA7UUVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Katharina T. Huber, Manuel Lafond, Nadia El-Mabrouk, Vincent Moulton","submitted_at":"2018-03-15T17:00:24Z","abstract_excerpt":"A multilabeled tree (or MUL-tree) is a rooted tree in which every leaf is labelled by an element from some set, but in which more than one leaf may be labelled by the same element of that set. In phylogenetics, such trees are used in biogeographical studies, to study the evolution of gene families, and also within approaches to construct phylogenetic networks. A multilabelled tree in which no leaf-labels are repeated is called a phylogenetic tree, and one in which every label is the same is also known as a tree-shape. In this paper, we consider the complexity of computing metrics on MUL-trees "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05866","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"},"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-18T00:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOFBE2syla2oi/MSznf6afJD4y5W6jAeCZao1TPILsQKLT09DnnTcYgF3XeSyaKVa9gWcQ2tW0hCwIsnI2pOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:43:06.453172Z"},"content_sha256":"b11331d78520502a965084f715229fc66d04a0296ee707e3929ab649d9d8da8b","schema_version":"1.0","event_id":"sha256:b11331d78520502a965084f715229fc66d04a0296ee707e3929ab649d9d8da8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY/bundle.json","state_url":"https://pith.science/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY/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-05-27T09:43:06Z","links":{"resolver":"https://pith.science/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY","bundle":"https://pith.science/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY/bundle.json","state":"https://pith.science/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDPVQHXZNDLHU3J5OVFRA7UUVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XDPVQHXZNDLHU3J5OVFRA7UUVY","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":"f16867056d8572c3387c9af2b6333d80117723b555f85e649fb450d35973d06c","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2018-03-15T17:00:24Z","title_canon_sha256":"5f4c26a7d53acfd7c25d107e0296d11f942028af65f19665bdcf8490bbfd159f"},"schema_version":"1.0","source":{"id":"1803.05866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05866","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05866v1","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05866","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"XDPVQHXZNDLH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XDPVQHXZNDLHU3J5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XDPVQHXZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:b11331d78520502a965084f715229fc66d04a0296ee707e3929ab649d9d8da8b","target":"graph","created_at":"2026-05-18T00:20:54Z","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 multilabeled tree (or MUL-tree) is a rooted tree in which every leaf is labelled by an element from some set, but in which more than one leaf may be labelled by the same element of that set. In phylogenetics, such trees are used in biogeographical studies, to study the evolution of gene families, and also within approaches to construct phylogenetic networks. A multilabelled tree in which no leaf-labels are repeated is called a phylogenetic tree, and one in which every label is the same is also known as a tree-shape. In this paper, we consider the complexity of computing metrics on MUL-trees ","authors_text":"Katharina T. Huber, Manuel Lafond, Nadia El-Mabrouk, Vincent Moulton","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2018-03-15T17:00:24Z","title":"The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05866","kind":"arxiv","version":1},"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:0deb5294d0a961820f07504eb01be4528bfaa7ddf62e049997c60a29786fb799","target":"record","created_at":"2026-05-18T00:20:54Z","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":"f16867056d8572c3387c9af2b6333d80117723b555f85e649fb450d35973d06c","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2018-03-15T17:00:24Z","title_canon_sha256":"5f4c26a7d53acfd7c25d107e0296d11f942028af65f19665bdcf8490bbfd159f"},"schema_version":"1.0","source":{"id":"1803.05866","kind":"arxiv","version":1}},"canonical_sha256":"b8df581ef968d67a6d3d754b107e94ae198d1ed22f159e6092cbb857090e6f39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8df581ef968d67a6d3d754b107e94ae198d1ed22f159e6092cbb857090e6f39","first_computed_at":"2026-05-18T00:20:54.488655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:54.488655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2r3vtqTWarmTJjIqVNo+hDUbaDGEDk68+TJCeUNZXlVQGXWuzwpnDLQPToGgNtM/CPWwKLc11qCVITin69riBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:54.489099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0deb5294d0a961820f07504eb01be4528bfaa7ddf62e049997c60a29786fb799","sha256:b11331d78520502a965084f715229fc66d04a0296ee707e3929ab649d9d8da8b"],"state_sha256":"9b0bfd763e439586128c2c128063a3aef69832419c1ad824bc4b79e9e043f0ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kelRfn8nm44iyYAzJi1EFy4rOk8YuGpV5Ow9PoOT7nCGG6zMvXovetnSvWgONG1AqrjCnqY2pdID4Zghsz/TDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:43:06.456995Z","bundle_sha256":"9255353cb829877bfe2ea0fd87934d02a71f8c62fccdaab5eb864c5d472b7469"}}