{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PIIX72OZXRG7SXU3ADUTPSJNHC","short_pith_number":"pith:PIIX72OZ","canonical_record":{"source":{"id":"1904.12150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-27T11:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"2dc0b10996124d2e15898d59362ed56eabf4215ba3e2c9af9d70b375be78e383","abstract_canon_sha256":"b7d195c1ad07835103f723b5f466eb05bcf825ab556ef1d82ba19031bdb9c4f4"},"schema_version":"1.0"},"canonical_sha256":"7a117fe9d9bc4df95e9b00e937c92d38be09e968da187d29695d92ed24143dc8","source":{"kind":"arxiv","id":"1904.12150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12150","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12150v1","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12150","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"PIIX72OZXRG7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PIIX72OZXRG7SXU3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PIIX72OZ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PIIX72OZXRG7SXU3ADUTPSJNHC","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-27T11:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"2dc0b10996124d2e15898d59362ed56eabf4215ba3e2c9af9d70b375be78e383","abstract_canon_sha256":"b7d195c1ad07835103f723b5f466eb05bcf825ab556ef1d82ba19031bdb9c4f4"},"schema_version":"1.0"},"canonical_sha256":"7a117fe9d9bc4df95e9b00e937c92d38be09e968da187d29695d92ed24143dc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:38.844069Z","signature_b64":"N4Z/wUdZndZ8EiF0C65yqExMoOPFXPRXkueht6mBOnwQzx4xitKt5YoT7uWL87bj6dOgM8BXwal76NfnGUrmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a117fe9d9bc4df95e9b00e937c92d38be09e968da187d29695d92ed24143dc8","last_reissued_at":"2026-05-17T23:47:38.843698Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:38.843698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12150","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-17T23:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpYMWX1+Ad/DDm9vx5pV48t81rOlPow73TYqhqJY9Jg/27AFUC+8zy2muRl96vT7wjCAN/+OCpVGrNBBKqfCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:23:57.923749Z"},"content_sha256":"dd7b74a1722719b34dc23ce3af34e8d0315f1a09929b12ec7f53ff4b1247777f","schema_version":"1.0","event_id":"sha256:dd7b74a1722719b34dc23ce3af34e8d0315f1a09929b12ec7f53ff4b1247777f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PIIX72OZXRG7SXU3ADUTPSJNHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relation between the number of leaves of a tree and its diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2019-04-27T11:52:14Z","abstract_excerpt":"Let $L(n,d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d.$ In 1975 Lesniak gave the lower bound\n  $B(n,d)=\\lceil 2(n-1)/d\\rceil$ for $L(n,d).$ When $d$ is even, $B(n,d)=L(n,d).$ But when $d$ is odd, $B(n,d)$ is smaller than $L(n,d)$ in general.\n  For example, $B(21,3)=14$ while $L(21,3)=19.$ We prove that for $d\\ge 2,$\n  $ L(n,d)=\\left\\lceil \\frac{2(n-1)}{d}\\right\\rceil$ if $d$ is even and $L(n,d)=\\left\\lceil \\frac{2(n-2)}{d-1}\\right\\rceil$ if $d$ is odd.\n  The converse problem is also considered. Let $D(n,f)$ be the minimum possible diameter of a tree o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12150","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-17T23:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygGHZ2NoFfxk2PLvtILf3DWc3h0dZYnbhcs3jV46pBCtEwOM1Ys5jyCT1/M4BaIAljE1Cecq24AsPthezQkRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:23:57.924094Z"},"content_sha256":"2c2800ba20f7058ef53eea6c718a572acb3d853e214c5d9fd21310235a7d2e86","schema_version":"1.0","event_id":"sha256:2c2800ba20f7058ef53eea6c718a572acb3d853e214c5d9fd21310235a7d2e86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIIX72OZXRG7SXU3ADUTPSJNHC/bundle.json","state_url":"https://pith.science/pith/PIIX72OZXRG7SXU3ADUTPSJNHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIIX72OZXRG7SXU3ADUTPSJNHC/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-25T22:23:57Z","links":{"resolver":"https://pith.science/pith/PIIX72OZXRG7SXU3ADUTPSJNHC","bundle":"https://pith.science/pith/PIIX72OZXRG7SXU3ADUTPSJNHC/bundle.json","state":"https://pith.science/pith/PIIX72OZXRG7SXU3ADUTPSJNHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIIX72OZXRG7SXU3ADUTPSJNHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PIIX72OZXRG7SXU3ADUTPSJNHC","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":"b7d195c1ad07835103f723b5f466eb05bcf825ab556ef1d82ba19031bdb9c4f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-27T11:52:14Z","title_canon_sha256":"2dc0b10996124d2e15898d59362ed56eabf4215ba3e2c9af9d70b375be78e383"},"schema_version":"1.0","source":{"id":"1904.12150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12150","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12150v1","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12150","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"PIIX72OZXRG7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PIIX72OZXRG7SXU3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PIIX72OZ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2c2800ba20f7058ef53eea6c718a572acb3d853e214c5d9fd21310235a7d2e86","target":"graph","created_at":"2026-05-17T23:47:38Z","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":"Let $L(n,d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d.$ In 1975 Lesniak gave the lower bound\n  $B(n,d)=\\lceil 2(n-1)/d\\rceil$ for $L(n,d).$ When $d$ is even, $B(n,d)=L(n,d).$ But when $d$ is odd, $B(n,d)$ is smaller than $L(n,d)$ in general.\n  For example, $B(21,3)=14$ while $L(21,3)=19.$ We prove that for $d\\ge 2,$\n  $ L(n,d)=\\left\\lceil \\frac{2(n-1)}{d}\\right\\rceil$ if $d$ is even and $L(n,d)=\\left\\lceil \\frac{2(n-2)}{d-1}\\right\\rceil$ if $d$ is odd.\n  The converse problem is also considered. Let $D(n,f)$ be the minimum possible diameter of a tree o","authors_text":"Pu Qiao, Xingzhi Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-27T11:52:14Z","title":"Relation between the number of leaves of a tree and its diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12150","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:dd7b74a1722719b34dc23ce3af34e8d0315f1a09929b12ec7f53ff4b1247777f","target":"record","created_at":"2026-05-17T23:47:38Z","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":"b7d195c1ad07835103f723b5f466eb05bcf825ab556ef1d82ba19031bdb9c4f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-27T11:52:14Z","title_canon_sha256":"2dc0b10996124d2e15898d59362ed56eabf4215ba3e2c9af9d70b375be78e383"},"schema_version":"1.0","source":{"id":"1904.12150","kind":"arxiv","version":1}},"canonical_sha256":"7a117fe9d9bc4df95e9b00e937c92d38be09e968da187d29695d92ed24143dc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a117fe9d9bc4df95e9b00e937c92d38be09e968da187d29695d92ed24143dc8","first_computed_at":"2026-05-17T23:47:38.843698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:38.843698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N4Z/wUdZndZ8EiF0C65yqExMoOPFXPRXkueht6mBOnwQzx4xitKt5YoT7uWL87bj6dOgM8BXwal76NfnGUrmAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:38.844069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd7b74a1722719b34dc23ce3af34e8d0315f1a09929b12ec7f53ff4b1247777f","sha256:2c2800ba20f7058ef53eea6c718a572acb3d853e214c5d9fd21310235a7d2e86"],"state_sha256":"32d95f69d39728505798d3ce2e5bc4e82adcdf3f2c0a79a5f8ffcea537ae1e66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nS/6sUiVofQOP6WeMs/r9f4EGyggY/z5yeb/b9b+4EOcsZ4lcC/ojnW2G55wo6TVEr+6EdjEkkV8X2Wr0MlpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:23:57.926028Z","bundle_sha256":"7b3a2c88e754329518aee3a79e2ff1853e59f3116b79210aa87d806189b5fee6"}}