{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PT5QWLESLFDK6UYFG6JXS3WWIX","short_pith_number":"pith:PT5QWLES","schema_version":"1.0","canonical_sha256":"7cfb0b2c925946af53053793796ed645f9c61966bd4186df94eeb2eed6e5e13e","source":{"kind":"arxiv","id":"1209.2391","version":1},"attestation_state":"computed","paper":{"title":"Reconstructing fully-resolved trees from triplet cover distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.CO","authors_text":"Katharina T. Huber, Mike Steel","submitted_at":"2012-09-11T18:40:40Z","abstract_excerpt":"It is a classical result that any finite tree with positively weighted edges, and without vertices of degree 2, is uniquely determined by the weighted path distance between each pair of leaves. Moreover, it is possible for a (small) strict subset $\\cl$ of leaf pairs to suffice for reconstructing the tree and its edge weights, given just the distances between the leaf pairs in $\\cl$. It is known that any set $\\cl$ with this property for a tree in which all interior vertices have degree 3 must form a {\\em cover} for $T$ -- that is, for each interior vertex $v$ of $T$, $\\cl$ must contain a pair o"},"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":"1209.2391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-11T18:40:40Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"6a15178b2e94d11ab48030f21abeea20430f90fa8f09978d643623519f71da21","abstract_canon_sha256":"41dd1716742c50e4de7f698a40aae720e9e00e53c67486ca4227796e5a726379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:52.039981Z","signature_b64":"wZFjoG18OYL8eTpElFPRf0WfEprjMkfC9y+c0+QUUdv+TOy6J9eUbaajpD/A2hhgs7t1yhiyvetQvpPyMoTQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cfb0b2c925946af53053793796ed645f9c61966bd4186df94eeb2eed6e5e13e","last_reissued_at":"2026-05-18T03:45:52.039303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:52.039303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstructing fully-resolved trees from triplet cover distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.CO","authors_text":"Katharina T. Huber, Mike Steel","submitted_at":"2012-09-11T18:40:40Z","abstract_excerpt":"It is a classical result that any finite tree with positively weighted edges, and without vertices of degree 2, is uniquely determined by the weighted path distance between each pair of leaves. Moreover, it is possible for a (small) strict subset $\\cl$ of leaf pairs to suffice for reconstructing the tree and its edge weights, given just the distances between the leaf pairs in $\\cl$. It is known that any set $\\cl$ with this property for a tree in which all interior vertices have degree 3 must form a {\\em cover} for $T$ -- that is, for each interior vertex $v$ of $T$, $\\cl$ must contain a pair o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2391","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.2391","created_at":"2026-05-18T03:45:52.039445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2391v1","created_at":"2026-05-18T03:45:52.039445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2391","created_at":"2026-05-18T03:45:52.039445+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT5QWLESLFDK","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT5QWLESLFDK6UYF","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT5QWLES","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/PT5QWLESLFDK6UYFG6JXS3WWIX","json":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX.json","graph_json":"https://pith.science/api/pith-number/PT5QWLESLFDK6UYFG6JXS3WWIX/graph.json","events_json":"https://pith.science/api/pith-number/PT5QWLESLFDK6UYFG6JXS3WWIX/events.json","paper":"https://pith.science/paper/PT5QWLES"},"agent_actions":{"view_html":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX","download_json":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX.json","view_paper":"https://pith.science/paper/PT5QWLES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2391&json=true","fetch_graph":"https://pith.science/api/pith-number/PT5QWLESLFDK6UYFG6JXS3WWIX/graph.json","fetch_events":"https://pith.science/api/pith-number/PT5QWLESLFDK6UYFG6JXS3WWIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX/action/storage_attestation","attest_author":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX/action/author_attestation","sign_citation":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX/action/citation_signature","submit_replication":"https://pith.science/pith/PT5QWLESLFDK6UYFG6JXS3WWIX/action/replication_record"}},"created_at":"2026-05-18T03:45:52.039445+00:00","updated_at":"2026-05-18T03:45:52.039445+00:00"}