{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KSNVDLZY5QVK3LCEOW57PPNEOV","short_pith_number":"pith:KSNVDLZY","canonical_record":{"source":{"id":"1610.07254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T00:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"06af7caea3781c0ffed9d42db92f36f69fde67a69f1e8637839b7abfef72af50","abstract_canon_sha256":"d57dd99e9bac694eaa53902a7a5b273ac0f1c850ef69d320a02562d94947946f"},"schema_version":"1.0"},"canonical_sha256":"549b51af38ec2aadac4475bbf7bda4756bd313f51019c7d383366633724f4833","source":{"kind":"arxiv","id":"1610.07254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07254","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07254v2","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07254","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"KSNVDLZY5QVK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KSNVDLZY5QVK3LCE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KSNVDLZY","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KSNVDLZY5QVK3LCEOW57PPNEOV","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T00:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"06af7caea3781c0ffed9d42db92f36f69fde67a69f1e8637839b7abfef72af50","abstract_canon_sha256":"d57dd99e9bac694eaa53902a7a5b273ac0f1c850ef69d320a02562d94947946f"},"schema_version":"1.0"},"canonical_sha256":"549b51af38ec2aadac4475bbf7bda4756bd313f51019c7d383366633724f4833","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:43.034382Z","signature_b64":"5tZwaYi0UGiXIrngvMSRPqZbwVTdIv/Fp4v/BCFSXFG3MobH+nAUa8xZwz7fJUvt6PU6iRu31d8may8N8HjiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"549b51af38ec2aadac4475bbf7bda4756bd313f51019c7d383366633724f4833","last_reissued_at":"2026-05-18T00:51:43.033673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:43.033673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07254","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-18T00:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LD/JDzRFOcsz1lu2AkoBWHtKA3AC83CYn9/sCPE71tdp7HmTbXwRUwblApioyycYkMlsPk1cryCgb04eYWSFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:59:17.294280Z"},"content_sha256":"1276e5c4e36242dfca85a55cc6839c768eaef99b34a0c4866779b52af8345660","schema_version":"1.0","event_id":"sha256:1276e5c4e36242dfca85a55cc6839c768eaef99b34a0c4866779b52af8345660"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KSNVDLZY5QVK3LCEOW57PPNEOV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum triplet covers of binary phylogenetic $X$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katharina T. Huber, Mike Steel, Vincent Moulton","submitted_at":"2016-10-24T00:52:56Z","abstract_excerpt":"Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed from the distances between the leaves (when the edges are given any strictly positive lengths). Moreover, a linear number of these pairwise distance values suffices to determine both the tree and its edge lengths. A natural set of pairs of leaves is provided by any `triplet cover' of the tree (based on the fact that each non-leaf vertex is the median vertex of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07254","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-18T00:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2iCaP7FGfsIVs2JuRjDHU5S4GsDXaC/2pK9xP8/sFW606j6Yvtbj6MmHYOqs8IzpC1WMannj/I21tAtsjZjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:59:17.294960Z"},"content_sha256":"c5648f0f064617949bd4e125462b597dc81e5f437744910d64c34093ee40e3b8","schema_version":"1.0","event_id":"sha256:c5648f0f064617949bd4e125462b597dc81e5f437744910d64c34093ee40e3b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/bundle.json","state_url":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/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-31T09:59:17Z","links":{"resolver":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV","bundle":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/bundle.json","state":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KSNVDLZY5QVK3LCEOW57PPNEOV","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":"d57dd99e9bac694eaa53902a7a5b273ac0f1c850ef69d320a02562d94947946f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T00:52:56Z","title_canon_sha256":"06af7caea3781c0ffed9d42db92f36f69fde67a69f1e8637839b7abfef72af50"},"schema_version":"1.0","source":{"id":"1610.07254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07254","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07254v2","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07254","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"KSNVDLZY5QVK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KSNVDLZY5QVK3LCE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KSNVDLZY","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:c5648f0f064617949bd4e125462b597dc81e5f437744910d64c34093ee40e3b8","target":"graph","created_at":"2026-05-18T00:51:43Z","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":"Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed from the distances between the leaves (when the edges are given any strictly positive lengths). Moreover, a linear number of these pairwise distance values suffices to determine both the tree and its edge lengths. A natural set of pairs of leaves is provided by any `triplet cover' of the tree (based on the fact that each non-leaf vertex is the median vertex of","authors_text":"Katharina T. Huber, Mike Steel, Vincent Moulton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T00:52:56Z","title":"Minimum triplet covers of binary phylogenetic $X$-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07254","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:1276e5c4e36242dfca85a55cc6839c768eaef99b34a0c4866779b52af8345660","target":"record","created_at":"2026-05-18T00:51:43Z","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":"d57dd99e9bac694eaa53902a7a5b273ac0f1c850ef69d320a02562d94947946f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T00:52:56Z","title_canon_sha256":"06af7caea3781c0ffed9d42db92f36f69fde67a69f1e8637839b7abfef72af50"},"schema_version":"1.0","source":{"id":"1610.07254","kind":"arxiv","version":2}},"canonical_sha256":"549b51af38ec2aadac4475bbf7bda4756bd313f51019c7d383366633724f4833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"549b51af38ec2aadac4475bbf7bda4756bd313f51019c7d383366633724f4833","first_computed_at":"2026-05-18T00:51:43.033673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:43.033673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tZwaYi0UGiXIrngvMSRPqZbwVTdIv/Fp4v/BCFSXFG3MobH+nAUa8xZwz7fJUvt6PU6iRu31d8may8N8HjiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:43.034382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1276e5c4e36242dfca85a55cc6839c768eaef99b34a0c4866779b52af8345660","sha256:c5648f0f064617949bd4e125462b597dc81e5f437744910d64c34093ee40e3b8"],"state_sha256":"f60543bae21068f2b33b8b9e01f493750a45861d33f8c180ded8d39120238dbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBrrD9kbatynalDe0/NQDAfuJm2Jtj+ZfwMIS8zFhFv+RTlnkYVIpg0MO1ZzhxHmvfUXrKQjJEtM8tBgqz56BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:59:17.298524Z","bundle_sha256":"4b753b1959a9e44fb1779ccc3f6dc9ad0fea441e44f9bef9a4ee344bf620ef7c"}}