{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KSNVDLZY5QVK3LCEOW57PPNEOV","short_pith_number":"pith:KSNVDLZY","schema_version":"1.0","canonical_sha256":"549b51af38ec2aadac4475bbf7bda4756bd313f51019c7d383366633724f4833","source":{"kind":"arxiv","id":"1610.07254","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.07254","created_at":"2026-05-18T00:51:43.033795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07254v2","created_at":"2026-05-18T00:51:43.033795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07254","created_at":"2026-05-18T00:51:43.033795+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSNVDLZY5QVK","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSNVDLZY5QVK3LCE","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSNVDLZY","created_at":"2026-05-18T12:30:29.479603+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/KSNVDLZY5QVK3LCEOW57PPNEOV","json":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV.json","graph_json":"https://pith.science/api/pith-number/KSNVDLZY5QVK3LCEOW57PPNEOV/graph.json","events_json":"https://pith.science/api/pith-number/KSNVDLZY5QVK3LCEOW57PPNEOV/events.json","paper":"https://pith.science/paper/KSNVDLZY"},"agent_actions":{"view_html":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV","download_json":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV.json","view_paper":"https://pith.science/paper/KSNVDLZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07254&json=true","fetch_graph":"https://pith.science/api/pith-number/KSNVDLZY5QVK3LCEOW57PPNEOV/graph.json","fetch_events":"https://pith.science/api/pith-number/KSNVDLZY5QVK3LCEOW57PPNEOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/action/storage_attestation","attest_author":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/action/author_attestation","sign_citation":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/action/citation_signature","submit_replication":"https://pith.science/pith/KSNVDLZY5QVK3LCEOW57PPNEOV/action/replication_record"}},"created_at":"2026-05-18T00:51:43.033795+00:00","updated_at":"2026-05-18T00:51:43.033795+00:00"}