{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KEH7BE3QJTDNUZWD46FG46WFNJ","short_pith_number":"pith:KEH7BE3Q","canonical_record":{"source":{"id":"1707.01874","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T17:21:40Z","cross_cats_sorted":[],"title_canon_sha256":"7a953c528bd30e8f0dc8f1788ab3d24613c9f125cd789c6aa84a797de865e9c4","abstract_canon_sha256":"d3d9a642b6cd1867d65ef5d987c1a22a0c38a393c8d191f125f1caf1647ab157"},"schema_version":"1.0"},"canonical_sha256":"510ff093704cc6da66c3e78a6e7ac56a58e9dac7ddc428fc03afe2de877b13a1","source":{"kind":"arxiv","id":"1707.01874","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01874","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01874v3","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01874","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"KEH7BE3QJTDN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KEH7BE3QJTDNUZWD","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KEH7BE3Q","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KEH7BE3QJTDNUZWD46FG46WFNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01874","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T17:21:40Z","cross_cats_sorted":[],"title_canon_sha256":"7a953c528bd30e8f0dc8f1788ab3d24613c9f125cd789c6aa84a797de865e9c4","abstract_canon_sha256":"d3d9a642b6cd1867d65ef5d987c1a22a0c38a393c8d191f125f1caf1647ab157"},"schema_version":"1.0"},"canonical_sha256":"510ff093704cc6da66c3e78a6e7ac56a58e9dac7ddc428fc03afe2de877b13a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:41.490199Z","signature_b64":"NCOW5eiyQwboh1ggvODk9VHu0mz7jEQTukmvJki+btwstHAtt6s+VjooOlO8JBRbv20Ozhx0IHZaww47PVQpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510ff093704cc6da66c3e78a6e7ac56a58e9dac7ddc428fc03afe2de877b13a1","last_reissued_at":"2026-05-18T00:00:41.489786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:41.489786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01874","source_version":3,"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:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBdwE1owwTha/z0+rb9K0/pXbwCYf5AzEV0zzaMhnH0LBR+O+VsrGKegNEMIsCFDr/dfCVtPofDrhK4ijdMpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:50:18.731815Z"},"content_sha256":"99cb1809236a0607331874966a734677dc49af46365b2126c54db2c255229829","schema_version":"1.0","event_id":"sha256:99cb1809236a0607331874966a734677dc49af46365b2126c54db2c255229829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KEH7BE3QJTDNUZWD46FG46WFNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the mean subtree order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Mol, Ortrud R. Oellermann","submitted_at":"2017-07-06T17:21:40Z","abstract_excerpt":"This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in $\\mathcal{T}_n$ and $\\mathcal{C}_n$, the families of all trees and caterpillars, respectively, of order $n$. We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if $T$ is an optimal tree in $\\mathcal{T}_n$ or $\\mathcal{C}_n$ for $n\\geq 4$, then every leaf of $T$ is adjacent to a vertex o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01874","kind":"arxiv","version":3},"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:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBoJEpz+RpJrbgSEZkj5b93qfF/g5Jozir9fCG/glOaMkflLI71FJ6euNhZMs9CtqAIryImX8nPEFUhA0KFCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:50:18.732153Z"},"content_sha256":"a132110e14a3b9e0b1aa85c5ff7fdfa16db768597b9451c7833e86932cae6588","schema_version":"1.0","event_id":"sha256:a132110e14a3b9e0b1aa85c5ff7fdfa16db768597b9451c7833e86932cae6588"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/bundle.json","state_url":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/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-03T07:50:18Z","links":{"resolver":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ","bundle":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/bundle.json","state":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KEH7BE3QJTDNUZWD46FG46WFNJ","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":"d3d9a642b6cd1867d65ef5d987c1a22a0c38a393c8d191f125f1caf1647ab157","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T17:21:40Z","title_canon_sha256":"7a953c528bd30e8f0dc8f1788ab3d24613c9f125cd789c6aa84a797de865e9c4"},"schema_version":"1.0","source":{"id":"1707.01874","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01874","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01874v3","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01874","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"KEH7BE3QJTDN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KEH7BE3QJTDNUZWD","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KEH7BE3Q","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:a132110e14a3b9e0b1aa85c5ff7fdfa16db768597b9451c7833e86932cae6588","target":"graph","created_at":"2026-05-18T00:00:41Z","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":"This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in $\\mathcal{T}_n$ and $\\mathcal{C}_n$, the families of all trees and caterpillars, respectively, of order $n$. We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if $T$ is an optimal tree in $\\mathcal{T}_n$ or $\\mathcal{C}_n$ for $n\\geq 4$, then every leaf of $T$ is adjacent to a vertex o","authors_text":"Lucas Mol, Ortrud R. Oellermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T17:21:40Z","title":"Maximizing the mean subtree order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01874","kind":"arxiv","version":3},"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:99cb1809236a0607331874966a734677dc49af46365b2126c54db2c255229829","target":"record","created_at":"2026-05-18T00:00:41Z","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":"d3d9a642b6cd1867d65ef5d987c1a22a0c38a393c8d191f125f1caf1647ab157","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T17:21:40Z","title_canon_sha256":"7a953c528bd30e8f0dc8f1788ab3d24613c9f125cd789c6aa84a797de865e9c4"},"schema_version":"1.0","source":{"id":"1707.01874","kind":"arxiv","version":3}},"canonical_sha256":"510ff093704cc6da66c3e78a6e7ac56a58e9dac7ddc428fc03afe2de877b13a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"510ff093704cc6da66c3e78a6e7ac56a58e9dac7ddc428fc03afe2de877b13a1","first_computed_at":"2026-05-18T00:00:41.489786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:41.489786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NCOW5eiyQwboh1ggvODk9VHu0mz7jEQTukmvJki+btwstHAtt6s+VjooOlO8JBRbv20Ozhx0IHZaww47PVQpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:41.490199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01874","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99cb1809236a0607331874966a734677dc49af46365b2126c54db2c255229829","sha256:a132110e14a3b9e0b1aa85c5ff7fdfa16db768597b9451c7833e86932cae6588"],"state_sha256":"91a33f0a3221c1315e7b653f7015971f9bdd09a3430891ded208efd667d8ec66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkO+oroHXkRqnivUAZ9W8sT5UA2fOBUTVIWwE1vG/SPNbVH12+MFYMroQFoyx0R5RU5b1pgela8q2dF19n7YDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:50:18.734554Z","bundle_sha256":"afed29b9537dfdcf87778141c975330eb960bf2f61d8218592d7c9f976b3070e"}}