{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CF6SZUW4UL3RRGS7N5HVC73R35","short_pith_number":"pith:CF6SZUW4","canonical_record":{"source":{"id":"1509.00669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T12:49:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"077c3d3f1de3b9070fa9df2d0f6f079a269b8c503821dcc85879e7cd40de4a1e","abstract_canon_sha256":"7e60f3e1343c941f698aa129e1387bf4e87a266cc0180f0f8900b206b297c301"},"schema_version":"1.0"},"canonical_sha256":"117d2cd2dca2f7189a5f6f4f517f71df54826a634252ccddbacfd89435a97583","source":{"kind":"arxiv","id":"1509.00669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00669","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00669v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00669","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"CF6SZUW4UL3R","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CF6SZUW4UL3RRGS7","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CF6SZUW4","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CF6SZUW4UL3RRGS7N5HVC73R35","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T12:49:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"077c3d3f1de3b9070fa9df2d0f6f079a269b8c503821dcc85879e7cd40de4a1e","abstract_canon_sha256":"7e60f3e1343c941f698aa129e1387bf4e87a266cc0180f0f8900b206b297c301"},"schema_version":"1.0"},"canonical_sha256":"117d2cd2dca2f7189a5f6f4f517f71df54826a634252ccddbacfd89435a97583","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:06.472196Z","signature_b64":"3Scx1lKaCxdmzJOHMJziOrK909UgbpJOaXicfozPxxoKZuIxkXXJ/eY8zfyUNaVRDB6Ifis0COU7dA45OprcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"117d2cd2dca2f7189a5f6f4f517f71df54826a634252ccddbacfd89435a97583","last_reissued_at":"2026-05-18T01:34:06.471635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:06.471635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00669","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-18T01:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/jBwoz649eOvntCJLccO9ZshNc0RSeqHP0kzlWwPGjm6ZjSpQA5QFaVpO5LjLQ2oHhzAi+toz08PQdy5ZRXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:12:11.511372Z"},"content_sha256":"257776f08c3c9775ba4de15cd1c130427637b6baeb458d3a7e0f7ac292d9c33c","schema_version":"1.0","event_id":"sha256:257776f08c3c9775ba4de15cd1c130427637b6baeb458d3a7e0f7ac292d9c33c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CF6SZUW4UL3RRGS7N5HVC73R35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal Distances for Subtree Transfer Operations in Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Ross Atkins","submitted_at":"2015-09-02T12:49:53Z","abstract_excerpt":"Three standard subtree transfer operations for binary trees, used in particular for phylogenetic trees, are: tree bisection and reconnection ($TBR$), subtree prune and regraft ($SPR$) and rooted subtree prune and regraft ($rSPR$). For a pair of leaf-labelled binary trees with $n$ leaves, the maximum number of such moves required to transform one into the other is $n-\\Theta(\\sqrt{n})$, extending a result of Ding, Grunewald and Humphries. We show that if the pair is chosen uniformly at random, then the expected number of moves required to transfer one into the other is $n-\\Theta(n^{2/3})$. These"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00669","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-18T01:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dQ2xeAo4FVjcMxinSNEIzyxD/v3nytjlM3k6FxIcc7l4zMxNljdZ01QKcs6lSUMZf05ZcKWRxVr3y6kg9dMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:12:11.511726Z"},"content_sha256":"c94143944585f388857e8d9d88591b3c41d488a38e3bdac831259a7ff60e2d1b","schema_version":"1.0","event_id":"sha256:c94143944585f388857e8d9d88591b3c41d488a38e3bdac831259a7ff60e2d1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CF6SZUW4UL3RRGS7N5HVC73R35/bundle.json","state_url":"https://pith.science/pith/CF6SZUW4UL3RRGS7N5HVC73R35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CF6SZUW4UL3RRGS7N5HVC73R35/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-27T19:12:11Z","links":{"resolver":"https://pith.science/pith/CF6SZUW4UL3RRGS7N5HVC73R35","bundle":"https://pith.science/pith/CF6SZUW4UL3RRGS7N5HVC73R35/bundle.json","state":"https://pith.science/pith/CF6SZUW4UL3RRGS7N5HVC73R35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CF6SZUW4UL3RRGS7N5HVC73R35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CF6SZUW4UL3RRGS7N5HVC73R35","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":"7e60f3e1343c941f698aa129e1387bf4e87a266cc0180f0f8900b206b297c301","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T12:49:53Z","title_canon_sha256":"077c3d3f1de3b9070fa9df2d0f6f079a269b8c503821dcc85879e7cd40de4a1e"},"schema_version":"1.0","source":{"id":"1509.00669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00669","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00669v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00669","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"CF6SZUW4UL3R","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CF6SZUW4UL3RRGS7","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CF6SZUW4","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:c94143944585f388857e8d9d88591b3c41d488a38e3bdac831259a7ff60e2d1b","target":"graph","created_at":"2026-05-18T01:34:06Z","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":"Three standard subtree transfer operations for binary trees, used in particular for phylogenetic trees, are: tree bisection and reconnection ($TBR$), subtree prune and regraft ($SPR$) and rooted subtree prune and regraft ($rSPR$). For a pair of leaf-labelled binary trees with $n$ leaves, the maximum number of such moves required to transform one into the other is $n-\\Theta(\\sqrt{n})$, extending a result of Ding, Grunewald and Humphries. We show that if the pair is chosen uniformly at random, then the expected number of moves required to transfer one into the other is $n-\\Theta(n^{2/3})$. These","authors_text":"Colin McDiarmid, Ross Atkins","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T12:49:53Z","title":"Extremal Distances for Subtree Transfer Operations in Binary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00669","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:257776f08c3c9775ba4de15cd1c130427637b6baeb458d3a7e0f7ac292d9c33c","target":"record","created_at":"2026-05-18T01:34:06Z","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":"7e60f3e1343c941f698aa129e1387bf4e87a266cc0180f0f8900b206b297c301","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T12:49:53Z","title_canon_sha256":"077c3d3f1de3b9070fa9df2d0f6f079a269b8c503821dcc85879e7cd40de4a1e"},"schema_version":"1.0","source":{"id":"1509.00669","kind":"arxiv","version":1}},"canonical_sha256":"117d2cd2dca2f7189a5f6f4f517f71df54826a634252ccddbacfd89435a97583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"117d2cd2dca2f7189a5f6f4f517f71df54826a634252ccddbacfd89435a97583","first_computed_at":"2026-05-18T01:34:06.471635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:06.471635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Scx1lKaCxdmzJOHMJziOrK909UgbpJOaXicfozPxxoKZuIxkXXJ/eY8zfyUNaVRDB6Ifis0COU7dA45OprcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:06.472196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:257776f08c3c9775ba4de15cd1c130427637b6baeb458d3a7e0f7ac292d9c33c","sha256:c94143944585f388857e8d9d88591b3c41d488a38e3bdac831259a7ff60e2d1b"],"state_sha256":"1248e14ba1fb5908705b76e1e99950b160dd06f9cd860ed8a5d66e93463bd448"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7wCB5sL4aWcYIbIRlFGHy6aKLJZWExzDN1e5l9fUrRCMoOXdrJFicnwAQSefI76mJFJKqTMQDobeS0YZECbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:12:11.513608Z","bundle_sha256":"48ff7363504c6f8444073c73f4dd5f5f89a435ef7f1e4de4e8b43eec0211a023"}}