{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K7ZE3SPFCCKTDLPZZDGCIDSUXH","short_pith_number":"pith:K7ZE3SPF","canonical_record":{"source":{"id":"1201.5168","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T00:59:43Z","cross_cats_sorted":[],"title_canon_sha256":"7e5d4491895300b8311344a0e30ae950ae512d593ea83776931f96b923e6747a","abstract_canon_sha256":"7b286cf0a5712158b8ee2a96119197fef09fa8959499f4f95c79d90b70ae2234"},"schema_version":"1.0"},"canonical_sha256":"57f24dc9e5109531adf9c8cc240e54b9e9fe3d960425b94acd0d5c5424388f38","source":{"kind":"arxiv","id":"1201.5168","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5168","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5168v5","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5168","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"pith_short_12","alias_value":"K7ZE3SPFCCKT","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K7ZE3SPFCCKTDLPZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K7ZE3SPF","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K7ZE3SPFCCKTDLPZZDGCIDSUXH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5168","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T00:59:43Z","cross_cats_sorted":[],"title_canon_sha256":"7e5d4491895300b8311344a0e30ae950ae512d593ea83776931f96b923e6747a","abstract_canon_sha256":"7b286cf0a5712158b8ee2a96119197fef09fa8959499f4f95c79d90b70ae2234"},"schema_version":"1.0"},"canonical_sha256":"57f24dc9e5109531adf9c8cc240e54b9e9fe3d960425b94acd0d5c5424388f38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:11.916512Z","signature_b64":"IcCSrspn/DlpsOEUGAUmaiTyowD5LDPM+DhBAUrdRyi4naXJML0sAKhu+JVkk31wjjVJytp/rHG1ypgS4/H/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57f24dc9e5109531adf9c8cc240e54b9e9fe3d960425b94acd0d5c5424388f38","last_reissued_at":"2026-05-18T03:33:11.915784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:11.915784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5168","source_version":5,"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-18T03:33:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpxRmpfPxMDR6J2z/7uOsYR0o3zEjj/jPD/RdksFh92oJwm/xnDtWIzvVa5MMcqIvK3q3SvpqPWqB/mAXzIbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:13:16.548373Z"},"content_sha256":"e1a731a74633f0f5a3fce58deea26680b04c4a4adaca3e8f42143d7ced4feb24","schema_version":"1.0","event_id":"sha256:e1a731a74633f0f5a3fce58deea26680b04c4a4adaca3e8f42143d7ced4feb24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K7ZE3SPFCCKTDLPZZDGCIDSUXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum agreement subtree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bhalchandra D. Thatte, Daniel M. Martin","submitted_at":"2012-01-25T00:59:43Z","abstract_excerpt":"In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \\subseteq {1,2,...,n}$ of leaves in a common subtree of $T_1$ and $T_2$. We show that any two binary phylogenetic trees have a common subtree on $\\Omega(\\sqrt{\\log{n}})$ leaves, thus improving on the previously known bound of $\\Omega(\\log\\log n)$ due to M. Steel and L. Szekely. To achieve this improved bound, we first consider two special cases of the problem: when one of the trees is balanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5168","kind":"arxiv","version":5},"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-18T03:33:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0Su0fl+LlzNv9c9kOON15Q5/dxGOHZPmgsLmJlVF+Y/el0lWKkOktDAuBz/1RDEvxbC6uQzHw+c6el3ZWuVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:13:16.548718Z"},"content_sha256":"bdd24409b889b83cd7fe66bf658f03d22b590ffb01c286316088765168cc08d3","schema_version":"1.0","event_id":"sha256:bdd24409b889b83cd7fe66bf658f03d22b590ffb01c286316088765168cc08d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH/bundle.json","state_url":"https://pith.science/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH/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-06-07T11:13:16Z","links":{"resolver":"https://pith.science/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH","bundle":"https://pith.science/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH/bundle.json","state":"https://pith.science/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7ZE3SPFCCKTDLPZZDGCIDSUXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K7ZE3SPFCCKTDLPZZDGCIDSUXH","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":"7b286cf0a5712158b8ee2a96119197fef09fa8959499f4f95c79d90b70ae2234","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T00:59:43Z","title_canon_sha256":"7e5d4491895300b8311344a0e30ae950ae512d593ea83776931f96b923e6747a"},"schema_version":"1.0","source":{"id":"1201.5168","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5168","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5168v5","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5168","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"pith_short_12","alias_value":"K7ZE3SPFCCKT","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K7ZE3SPFCCKTDLPZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K7ZE3SPF","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:bdd24409b889b83cd7fe66bf658f03d22b590ffb01c286316088765168cc08d3","target":"graph","created_at":"2026-05-18T03:33:11Z","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":"In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \\subseteq {1,2,...,n}$ of leaves in a common subtree of $T_1$ and $T_2$. We show that any two binary phylogenetic trees have a common subtree on $\\Omega(\\sqrt{\\log{n}})$ leaves, thus improving on the previously known bound of $\\Omega(\\log\\log n)$ due to M. Steel and L. Szekely. To achieve this improved bound, we first consider two special cases of the problem: when one of the trees is balanc","authors_text":"Bhalchandra D. Thatte, Daniel M. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T00:59:43Z","title":"The maximum agreement subtree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5168","kind":"arxiv","version":5},"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:e1a731a74633f0f5a3fce58deea26680b04c4a4adaca3e8f42143d7ced4feb24","target":"record","created_at":"2026-05-18T03:33:11Z","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":"7b286cf0a5712158b8ee2a96119197fef09fa8959499f4f95c79d90b70ae2234","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T00:59:43Z","title_canon_sha256":"7e5d4491895300b8311344a0e30ae950ae512d593ea83776931f96b923e6747a"},"schema_version":"1.0","source":{"id":"1201.5168","kind":"arxiv","version":5}},"canonical_sha256":"57f24dc9e5109531adf9c8cc240e54b9e9fe3d960425b94acd0d5c5424388f38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57f24dc9e5109531adf9c8cc240e54b9e9fe3d960425b94acd0d5c5424388f38","first_computed_at":"2026-05-18T03:33:11.915784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:11.915784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IcCSrspn/DlpsOEUGAUmaiTyowD5LDPM+DhBAUrdRyi4naXJML0sAKhu+JVkk31wjjVJytp/rHG1ypgS4/H/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:11.916512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5168","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1a731a74633f0f5a3fce58deea26680b04c4a4adaca3e8f42143d7ced4feb24","sha256:bdd24409b889b83cd7fe66bf658f03d22b590ffb01c286316088765168cc08d3"],"state_sha256":"1d4390e75c0e96d3c3921ee563c7d6e6d814a44b58739774ff7fb0d621efb3b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89nRwyJrdd2DJ3SAs4BqOx3p97tbmnDAIABb2ULgR476XpVKVcuFbD94+76EeNy1hGf0hHCpgQ7MuxHuKDRuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:13:16.550789Z","bundle_sha256":"fcc68285653a0a52bc19c6b5432a8ce7987e79c28c83f3c46b8e29b96f75e883"}}