{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WHSZW4TWIWBYVOWBCPJEK6IUM3","short_pith_number":"pith:WHSZW4TW","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"},"canonical_sha256":"b1e59b727645838abac113d245791466c43685f9c40f013ca64516af259ef438","source":{"kind":"arxiv","id":"1505.04344","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04344","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04344v2","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04344","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"WHSZW4TWIWBY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WHSZW4TWIWBYVOWB","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WHSZW4TW","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WHSZW4TWIWBYVOWBCPJEK6IUM3","target":"record","payload":{"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"},"canonical_sha256":"b1e59b727645838abac113d245791466c43685f9c40f013ca64516af259ef438","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"},"source_kind":"arxiv","source_id":"1505.04344","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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFM+N5NEQvyIBV+t2uRYaXBppnuLnVmDvxHuTxWx1VC2MoomFccZnBiz/GYXb9gRz+HXpLdDZOahFp5r7+X9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:58.166613Z"},"content_sha256":"fd120b56fd198b7f2dc503f3bafa62996919a3305abcb22957833b73d799b243","schema_version":"1.0","event_id":"sha256:fd120b56fd198b7f2dc503f3bafa62996919a3305abcb22957833b73d799b243"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WHSZW4TWIWBYVOWBCPJEK6IUM3","target":"graph","payload":{"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"},"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIRo/eWYq089G7/T2vmLFWu5OeEAQS2tsLo/Mn/XwjonLj5+bki8c8zyCyZVqHBJcqNHEF86bRYjNIH9wCANCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:58.167354Z"},"content_sha256":"f2d09b112d71b2a5c5747047366de587e54ecc38541696f808bd9403ea65faa1","schema_version":"1.0","event_id":"sha256:f2d09b112d71b2a5c5747047366de587e54ecc38541696f808bd9403ea65faa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/bundle.json","state_url":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/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-30T20:03:58Z","links":{"resolver":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3","bundle":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/bundle.json","state":"https://pith.science/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHSZW4TWIWBYVOWBCPJEK6IUM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WHSZW4TWIWBYVOWBCPJEK6IUM3","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":"b8fed04cdb14f3fe479cf73a30b9aa51986846d6dd5d9027ea2f4d9326b60ea0","cross_cats_sorted":["math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-17T02:05:38Z","title_canon_sha256":"dc58eb995508099f945b7c9b1e94d72f0d5b80299c4f75abdf24379b6b4b6e46"},"schema_version":"1.0","source":{"id":"1505.04344","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04344","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04344v2","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04344","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"WHSZW4TWIWBY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WHSZW4TWIWBYVOWB","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WHSZW4TW","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:f2d09b112d71b2a5c5747047366de587e54ecc38541696f808bd9403ea65faa1","target":"graph","created_at":"2026-05-18T01:21:23Z","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":"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}$.","authors_text":"Benny Sudakov, Humberto Naves, Noga Alon","cross_cats":["math.CO","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-17T02:05:38Z","title":"On the maximum quartet distance between phylogenetic trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04344","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:fd120b56fd198b7f2dc503f3bafa62996919a3305abcb22957833b73d799b243","target":"record","created_at":"2026-05-18T01:21:23Z","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":"b8fed04cdb14f3fe479cf73a30b9aa51986846d6dd5d9027ea2f4d9326b60ea0","cross_cats_sorted":["math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-17T02:05:38Z","title_canon_sha256":"dc58eb995508099f945b7c9b1e94d72f0d5b80299c4f75abdf24379b6b4b6e46"},"schema_version":"1.0","source":{"id":"1505.04344","kind":"arxiv","version":2}},"canonical_sha256":"b1e59b727645838abac113d245791466c43685f9c40f013ca64516af259ef438","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1e59b727645838abac113d245791466c43685f9c40f013ca64516af259ef438","first_computed_at":"2026-05-18T01:21:23.058861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:23.058861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ob5ToLth8Xi9JOVz+H1ZTk5v1Nqs70y4Dj3s5JB7m/p5jh8n+AVypuX0PU/TIV45BVVym9deyt2w16jfQLsRCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:23.059476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04344","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd120b56fd198b7f2dc503f3bafa62996919a3305abcb22957833b73d799b243","sha256:f2d09b112d71b2a5c5747047366de587e54ecc38541696f808bd9403ea65faa1"],"state_sha256":"dcc038a9e84e679988138f93bbe4550141e92e6760ca51dc95d27b9d222977ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XB6QB9880mr/kk8bn271jMbFMUJcoD83/XKNae3PnLo5nyCDRWk8ZmADCDgVOxRmFvecYjKfrqe0uXsa+4vZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:58.171245Z","bundle_sha256":"c086cafa71db5788e9a5b5e5f75a5022cd49fd5410884d528638c89146d8fa77"}}