{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P6LA73OBE7G5M2IMCSGPGSB5IX","short_pith_number":"pith:P6LA73OB","canonical_record":{"source":{"id":"1809.04488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T14:36:30Z","cross_cats_sorted":["math.PR","q-bio.PE"],"title_canon_sha256":"fec006b3fe4c4a13021f97efcb9ad0b9f281d127190cda289ed1dbb5ec4cb5c0","abstract_canon_sha256":"e299118b6295c3c5fa9cfb668bdb2136e96f1f4bbb16d4b006e9bad1f8b13efc"},"schema_version":"1.0"},"canonical_sha256":"7f960fedc127cdd6690c148cf3483d45c8435ae219a525182468774cbb8af5cf","source":{"kind":"arxiv","id":"1809.04488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04488","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04488v1","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04488","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"pith_short_12","alias_value":"P6LA73OBE7G5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6LA73OBE7G5M2IM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6LA73OB","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P6LA73OBE7G5M2IMCSGPGSB5IX","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T14:36:30Z","cross_cats_sorted":["math.PR","q-bio.PE"],"title_canon_sha256":"fec006b3fe4c4a13021f97efcb9ad0b9f281d127190cda289ed1dbb5ec4cb5c0","abstract_canon_sha256":"e299118b6295c3c5fa9cfb668bdb2136e96f1f4bbb16d4b006e9bad1f8b13efc"},"schema_version":"1.0"},"canonical_sha256":"7f960fedc127cdd6690c148cf3483d45c8435ae219a525182468774cbb8af5cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:52.168524Z","signature_b64":"Q1Dctzy4TRRkJ6jH0/J4QtY4td6A3z1BzZyj73P1jETgkh63Sc8sO5pNRiRHZh5ZTg7JSNfboJHS/RhU4YIuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f960fedc127cdd6690c148cf3483d45c8435ae219a525182468774cbb8af5cf","last_reissued_at":"2026-05-18T00:05:52.167782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:52.167782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04488","source_version":1,"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-18T00:05:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmWwKqU1eGEWNRcfX3uDADuenHJqGXnCugXwmW5nsAadMa/O2xYPFD2AUjA0+LQYJrKNAb17ZjSVnsj9VFHqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:43:24.800039Z"},"content_sha256":"f62c0311099140178ad5e6ed118ace73d476354405e83b1d3bf8960ea4313ba0","schema_version":"1.0","event_id":"sha256:f62c0311099140178ad5e6ed118ace73d476354405e83b1d3bf8960ea4313ba0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P6LA73OBE7G5M2IMCSGPGSB5IX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the expected size of the maximum agreement subtree for a given tree shape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"math.CO","authors_text":"Pratik Misra, Seth Sullivant","submitted_at":"2018-09-12T14:36:30Z","abstract_excerpt":"We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\\Theta(\\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition of rooted binary trees into subgroups of leaves called blobs. To obtain the upper bound, we generalize a first moment argument for random tree distributions that are exchangeable and not necessarily sampling consistent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04488","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"},"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-18T00:05:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wMtVcpJa0+4oP8cq3ky+rWzfmf3BsjEStnEeDTfExT8/I2jlMlIXxpgTiQqWFXUsa7qL+JnPbDJimMB6jARDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:43:24.800485Z"},"content_sha256":"35e7d4da988f02bbc0037d305098f15bad80be26ee00b34109f0d2a807476ff1","schema_version":"1.0","event_id":"sha256:35e7d4da988f02bbc0037d305098f15bad80be26ee00b34109f0d2a807476ff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6LA73OBE7G5M2IMCSGPGSB5IX/bundle.json","state_url":"https://pith.science/pith/P6LA73OBE7G5M2IMCSGPGSB5IX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6LA73OBE7G5M2IMCSGPGSB5IX/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-08-24T03:43:24Z","links":{"resolver":"https://pith.science/pith/P6LA73OBE7G5M2IMCSGPGSB5IX","bundle":"https://pith.science/pith/P6LA73OBE7G5M2IMCSGPGSB5IX/bundle.json","state":"https://pith.science/pith/P6LA73OBE7G5M2IMCSGPGSB5IX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6LA73OBE7G5M2IMCSGPGSB5IX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P6LA73OBE7G5M2IMCSGPGSB5IX","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":"e299118b6295c3c5fa9cfb668bdb2136e96f1f4bbb16d4b006e9bad1f8b13efc","cross_cats_sorted":["math.PR","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T14:36:30Z","title_canon_sha256":"fec006b3fe4c4a13021f97efcb9ad0b9f281d127190cda289ed1dbb5ec4cb5c0"},"schema_version":"1.0","source":{"id":"1809.04488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04488","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04488v1","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04488","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"pith_short_12","alias_value":"P6LA73OBE7G5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6LA73OBE7G5M2IM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6LA73OB","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:35e7d4da988f02bbc0037d305098f15bad80be26ee00b34109f0d2a807476ff1","target":"graph","created_at":"2026-05-18T00:05:52Z","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":"We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\\Theta(\\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition of rooted binary trees into subgroups of leaves called blobs. To obtain the upper bound, we generalize a first moment argument for random tree distributions that are exchangeable and not necessarily sampling consistent.","authors_text":"Pratik Misra, Seth Sullivant","cross_cats":["math.PR","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T14:36:30Z","title":"Bounds on the expected size of the maximum agreement subtree for a given tree shape"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04488","kind":"arxiv","version":1},"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:f62c0311099140178ad5e6ed118ace73d476354405e83b1d3bf8960ea4313ba0","target":"record","created_at":"2026-05-18T00:05:52Z","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":"e299118b6295c3c5fa9cfb668bdb2136e96f1f4bbb16d4b006e9bad1f8b13efc","cross_cats_sorted":["math.PR","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T14:36:30Z","title_canon_sha256":"fec006b3fe4c4a13021f97efcb9ad0b9f281d127190cda289ed1dbb5ec4cb5c0"},"schema_version":"1.0","source":{"id":"1809.04488","kind":"arxiv","version":1}},"canonical_sha256":"7f960fedc127cdd6690c148cf3483d45c8435ae219a525182468774cbb8af5cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f960fedc127cdd6690c148cf3483d45c8435ae219a525182468774cbb8af5cf","first_computed_at":"2026-05-18T00:05:52.167782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:52.167782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q1Dctzy4TRRkJ6jH0/J4QtY4td6A3z1BzZyj73P1jETgkh63Sc8sO5pNRiRHZh5ZTg7JSNfboJHS/RhU4YIuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:52.168524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f62c0311099140178ad5e6ed118ace73d476354405e83b1d3bf8960ea4313ba0","sha256:35e7d4da988f02bbc0037d305098f15bad80be26ee00b34109f0d2a807476ff1"],"state_sha256":"3e1457b33b0d2885973f5490162c9c5f54dd0d54c068e24caa627bd8170d39c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhaoUCE1WWnt5GamDjQJvIsx1kAGw5z8L8y9E47969QU6aKaAOQ3kZQLhmzurm++CMnDa7X+cSki3976TSq/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:43:24.804401Z","bundle_sha256":"d70b2750bccb51819c7064f28ed097319e464860f00f0c3adef2e13ed03ffbcf"}}