{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4VVWCYRMTM2RJ3CNNFK3DZLG55","short_pith_number":"pith:4VVWCYRM","schema_version":"1.0","canonical_sha256":"e56b61622c9b3514ec4d6955b1e566ef42105adc87ad2721adb71d1a600727fb","source":{"kind":"arxiv","id":"1411.7338","version":2},"attestation_state":"computed","paper":{"title":"Bounds on the Expected Size of the Maximum Agreement Subtree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Colby Long, Daniel Irving Bernstein, Katherine St. John, Lam Si Tung Ho, Mike Steel, Seth Sullivant","submitted_at":"2014-11-26T19:20:08Z","abstract_excerpt":"We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem."},"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":"1411.7338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-11-26T19:20:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f3393dae81206f2940b1cfdab2136eab66fb6da9488bcbba8f21d87e063ab8a9","abstract_canon_sha256":"6454ae48332ba6bc845e456e27a7daf1cb26bec9ff0a804988fba2658c1064ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.376048Z","signature_b64":"FalbFJwdGmQ0NUFenGP5/1in7uUA7lH7Z7bUr5U7stiUFgfRxEpdlBDY1feEMrnkmQTl7sh/dg5Uy9NaTq1bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56b61622c9b3514ec4d6955b1e566ef42105adc87ad2721adb71d1a600727fb","last_reissued_at":"2026-05-18T01:34:35.375438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.375438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Expected Size of the Maximum Agreement Subtree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Colby Long, Daniel Irving Bernstein, Katherine St. John, Lam Si Tung Ho, Mike Steel, Seth Sullivant","submitted_at":"2014-11-26T19:20:08Z","abstract_excerpt":"We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7338","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":"1411.7338","created_at":"2026-05-18T01:34:35.375534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7338v2","created_at":"2026-05-18T01:34:35.375534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7338","created_at":"2026-05-18T01:34:35.375534+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VVWCYRMTM2R","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VVWCYRMTM2RJ3CN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VVWCYRM","created_at":"2026-05-18T12:28:14.216126+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/4VVWCYRMTM2RJ3CNNFK3DZLG55","json":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55.json","graph_json":"https://pith.science/api/pith-number/4VVWCYRMTM2RJ3CNNFK3DZLG55/graph.json","events_json":"https://pith.science/api/pith-number/4VVWCYRMTM2RJ3CNNFK3DZLG55/events.json","paper":"https://pith.science/paper/4VVWCYRM"},"agent_actions":{"view_html":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55","download_json":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55.json","view_paper":"https://pith.science/paper/4VVWCYRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7338&json=true","fetch_graph":"https://pith.science/api/pith-number/4VVWCYRMTM2RJ3CNNFK3DZLG55/graph.json","fetch_events":"https://pith.science/api/pith-number/4VVWCYRMTM2RJ3CNNFK3DZLG55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55/action/storage_attestation","attest_author":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55/action/author_attestation","sign_citation":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55/action/citation_signature","submit_replication":"https://pith.science/pith/4VVWCYRMTM2RJ3CNNFK3DZLG55/action/replication_record"}},"created_at":"2026-05-18T01:34:35.375534+00:00","updated_at":"2026-05-18T01:34:35.375534+00:00"}