{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WHSZW4TWIWBYVOWBCPJEK6IUM3","short_pith_number":"pith:WHSZW4TW","schema_version":"1.0","canonical_sha256":"b1e59b727645838abac113d245791466c43685f9c40f013ca64516af259ef438","source":{"kind":"arxiv","id":"1505.04344","version":2},"attestation_state":"computed","paper":{"title":"On the maximum quartet distance between phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","q-bio.PE"],"primary_cat":"cs.DM","authors_text":"Benny Sudakov, Humberto Naves, Noga Alon","submitted_at":"2015-05-17T02:05:38Z","abstract_excerpt":"A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on $n$ leaves is at most $(\\frac 23 +o(1))\\binom{n}{4}$. Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most $(0.69 +o(1))\\binom{n}{4}$. We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most $(\\frac 23 +o(1))\\binom{n}{4}$."},"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":"1505.04344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-17T02:05:38Z","cross_cats_sorted":["math.CO","q-bio.PE"],"title_canon_sha256":"dc58eb995508099f945b7c9b1e94d72f0d5b80299c4f75abdf24379b6b4b6e46","abstract_canon_sha256":"b8fed04cdb14f3fe479cf73a30b9aa51986846d6dd5d9027ea2f4d9326b60ea0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:23.059476Z","signature_b64":"ob5ToLth8Xi9JOVz+H1ZTk5v1Nqs70y4Dj3s5JB7m/p5jh8n+AVypuX0PU/TIV45BVVym9deyt2w16jfQLsRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1e59b727645838abac113d245791466c43685f9c40f013ca64516af259ef438","last_reissued_at":"2026-05-18T01:21:23.058861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:23.058861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum quartet distance between phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","q-bio.PE"],"primary_cat":"cs.DM","authors_text":"Benny Sudakov, Humberto Naves, Noga Alon","submitted_at":"2015-05-17T02:05:38Z","abstract_excerpt":"A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on $n$ leaves is at most $(\\frac 23 +o(1))\\binom{n}{4}$. Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most $(0.69 +o(1))\\binom{n}{4}$. We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most $(\\frac 23 +o(1))\\binom{n}{4}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04344","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":"1505.04344","created_at":"2026-05-18T01:21:23.058980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04344v2","created_at":"2026-05-18T01:21:23.058980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04344","created_at":"2026-05-18T01:21:23.058980+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHSZW4TWIWBY","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHSZW4TWIWBYVOWB","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHSZW4TW","created_at":"2026-05-18T12:29:47.479230+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/WHSZW4TWIWBYVOWBCPJEK6IUM3","json":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3.json","graph_json":"https://pith.science/api/pith-number/WHSZW4TWIWBYVOWBCPJEK6IUM3/graph.json","events_json":"https://pith.science/api/pith-number/WHSZW4TWIWBYVOWBCPJEK6IUM3/events.json","paper":"https://pith.science/paper/WHSZW4TW"},"agent_actions":{"view_html":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3","download_json":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3.json","view_paper":"https://pith.science/paper/WHSZW4TW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04344&json=true","fetch_graph":"https://pith.science/api/pith-number/WHSZW4TWIWBYVOWBCPJEK6IUM3/graph.json","fetch_events":"https://pith.science/api/pith-number/WHSZW4TWIWBYVOWBCPJEK6IUM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/action/storage_attestation","attest_author":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/action/author_attestation","sign_citation":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/action/citation_signature","submit_replication":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/action/replication_record"}},"created_at":"2026-05-18T01:21:23.058980+00:00","updated_at":"2026-05-18T01:21:23.058980+00:00"}