{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KEH7BE3QJTDNUZWD46FG46WFNJ","short_pith_number":"pith:KEH7BE3Q","schema_version":"1.0","canonical_sha256":"510ff093704cc6da66c3e78a6e7ac56a58e9dac7ddc428fc03afe2de877b13a1","source":{"kind":"arxiv","id":"1707.01874","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.01874","created_at":"2026-05-18T00:00:41.489842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01874v3","created_at":"2026-05-18T00:00:41.489842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01874","created_at":"2026-05-18T00:00:41.489842+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEH7BE3QJTDN","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEH7BE3QJTDNUZWD","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEH7BE3Q","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ","json":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ.json","graph_json":"https://pith.science/api/pith-number/KEH7BE3QJTDNUZWD46FG46WFNJ/graph.json","events_json":"https://pith.science/api/pith-number/KEH7BE3QJTDNUZWD46FG46WFNJ/events.json","paper":"https://pith.science/paper/KEH7BE3Q"},"agent_actions":{"view_html":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ","download_json":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ.json","view_paper":"https://pith.science/paper/KEH7BE3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01874&json=true","fetch_graph":"https://pith.science/api/pith-number/KEH7BE3QJTDNUZWD46FG46WFNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KEH7BE3QJTDNUZWD46FG46WFNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/action/storage_attestation","attest_author":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/action/author_attestation","sign_citation":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/action/citation_signature","submit_replication":"https://pith.science/pith/KEH7BE3QJTDNUZWD46FG46WFNJ/action/replication_record"}},"created_at":"2026-05-18T00:00:41.489842+00:00","updated_at":"2026-05-18T00:00:41.489842+00:00"}