{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FOTNL7UVNAQI6LFEV47FE3LTUI","short_pith_number":"pith:FOTNL7UV","canonical_record":{"source":{"id":"1204.6152","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T09:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"318ba9dc8c09faafd8fcc752e311defccc2001e0da7e0195807bf1cd70ccd32f","abstract_canon_sha256":"4a5bddf5c48349d5ca82c34d0ff98e3d24a4b07d742159a9e29c7a66d6e95469"},"schema_version":"1.0"},"canonical_sha256":"2ba6d5fe9568208f2ca4af3e526d73a2076e458f3beffc2f1b21f231d17de01e","source":{"kind":"arxiv","id":"1204.6152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6152","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6152v1","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6152","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"FOTNL7UVNAQI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FOTNL7UVNAQI6LFE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FOTNL7UV","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FOTNL7UVNAQI6LFEV47FE3LTUI","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6152","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T09:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"318ba9dc8c09faafd8fcc752e311defccc2001e0da7e0195807bf1cd70ccd32f","abstract_canon_sha256":"4a5bddf5c48349d5ca82c34d0ff98e3d24a4b07d742159a9e29c7a66d6e95469"},"schema_version":"1.0"},"canonical_sha256":"2ba6d5fe9568208f2ca4af3e526d73a2076e458f3beffc2f1b21f231d17de01e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:46.876006Z","signature_b64":"CUgOmCP9HGrOPs/hrEx7AaOdoKTaED+GHQMS4uX0gAiYIWHXQ41P4kjoMKE4v5JBgkyuiq3YAUtCOXM+DRpsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba6d5fe9568208f2ca4af3e526d73a2076e458f3beffc2f1b21f231d17de01e","last_reissued_at":"2026-05-18T03:56:46.875289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:46.875289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6152","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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAxnAtxF4mHRRIw/RGZVDCKyxYcwN2MZY44wF3jXAxd7mDErBQNNcDvCeoNgdOk1Lm0PrZt4Pn7pltr7OPOLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:21:48.785102Z"},"content_sha256":"b6d275cfdfbf0ba432a06b1414e017e158a203ae1bb8a1cc785a04a29068a9c5","schema_version":"1.0","event_id":"sha256:b6d275cfdfbf0ba432a06b1414e017e158a203ae1bb8a1cc785a04a29068a9c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FOTNL7UVNAQI6LFEV47FE3LTUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further analysis on the total number of subtrees of trees","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Shujing Wang","submitted_at":"2012-04-27T09:15:17Z","abstract_excerpt":"We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total number of subtrees usually maximize (resp. minimize) the Wiener index, and vice versa. Here are some of our results: (1) Let $\\mathscr{T}_n^k$ be the set of all $n$-vertex trees with $k$ leaves, we determine the maximum (resp. minimum) value of the total number of subtrees of trees among $\\mathscr{T}_n^k$ and characterize the extremal graphs. (2) Let $\\mathscr{P}_n^{p,q}$ be the set of all $n$-vertex trees, each of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6152","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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhUpryQAJCvt/mZ5iVS/CSC2g8BW4c4jegZ63ZNGJ5Xh7k/xehJVVzBXmNoIsPLUaHGcFhCqJpdXlKvdgBArBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:21:48.785463Z"},"content_sha256":"076ba43c0f72ec5d4f04b603bc223a9e1d8d1a1d5356c3d52f264f353967edcd","schema_version":"1.0","event_id":"sha256:076ba43c0f72ec5d4f04b603bc223a9e1d8d1a1d5356c3d52f264f353967edcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOTNL7UVNAQI6LFEV47FE3LTUI/bundle.json","state_url":"https://pith.science/pith/FOTNL7UVNAQI6LFEV47FE3LTUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOTNL7UVNAQI6LFEV47FE3LTUI/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-08T11:21:48Z","links":{"resolver":"https://pith.science/pith/FOTNL7UVNAQI6LFEV47FE3LTUI","bundle":"https://pith.science/pith/FOTNL7UVNAQI6LFEV47FE3LTUI/bundle.json","state":"https://pith.science/pith/FOTNL7UVNAQI6LFEV47FE3LTUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOTNL7UVNAQI6LFEV47FE3LTUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FOTNL7UVNAQI6LFEV47FE3LTUI","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":"4a5bddf5c48349d5ca82c34d0ff98e3d24a4b07d742159a9e29c7a66d6e95469","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T09:15:17Z","title_canon_sha256":"318ba9dc8c09faafd8fcc752e311defccc2001e0da7e0195807bf1cd70ccd32f"},"schema_version":"1.0","source":{"id":"1204.6152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6152","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6152v1","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6152","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"FOTNL7UVNAQI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FOTNL7UVNAQI6LFE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FOTNL7UV","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:076ba43c0f72ec5d4f04b603bc223a9e1d8d1a1d5356c3d52f264f353967edcd","target":"graph","created_at":"2026-05-18T03:56:46Z","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 study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total number of subtrees usually maximize (resp. minimize) the Wiener index, and vice versa. Here are some of our results: (1) Let $\\mathscr{T}_n^k$ be the set of all $n$-vertex trees with $k$ leaves, we determine the maximum (resp. minimum) value of the total number of subtrees of trees among $\\mathscr{T}_n^k$ and characterize the extremal graphs. (2) Let $\\mathscr{P}_n^{p,q}$ be the set of all $n$-vertex trees, each of ","authors_text":"Shuchao Li, Shujing Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T09:15:17Z","title":"Further analysis on the total number of subtrees of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6152","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:b6d275cfdfbf0ba432a06b1414e017e158a203ae1bb8a1cc785a04a29068a9c5","target":"record","created_at":"2026-05-18T03:56:46Z","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":"4a5bddf5c48349d5ca82c34d0ff98e3d24a4b07d742159a9e29c7a66d6e95469","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T09:15:17Z","title_canon_sha256":"318ba9dc8c09faafd8fcc752e311defccc2001e0da7e0195807bf1cd70ccd32f"},"schema_version":"1.0","source":{"id":"1204.6152","kind":"arxiv","version":1}},"canonical_sha256":"2ba6d5fe9568208f2ca4af3e526d73a2076e458f3beffc2f1b21f231d17de01e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ba6d5fe9568208f2ca4af3e526d73a2076e458f3beffc2f1b21f231d17de01e","first_computed_at":"2026-05-18T03:56:46.875289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:46.875289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CUgOmCP9HGrOPs/hrEx7AaOdoKTaED+GHQMS4uX0gAiYIWHXQ41P4kjoMKE4v5JBgkyuiq3YAUtCOXM+DRpsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:46.876006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6d275cfdfbf0ba432a06b1414e017e158a203ae1bb8a1cc785a04a29068a9c5","sha256:076ba43c0f72ec5d4f04b603bc223a9e1d8d1a1d5356c3d52f264f353967edcd"],"state_sha256":"4f08a745392557129ea3076d65c7cb01556fa0c999b014548997793028c5b448"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFewI75NrMJCiUFYIZaFYOauIe3TVqbkUPxCGRD6c6t51e4gf/BI0k4jHPHz+LaMcW2Vkytu0nXJQRFKc29FBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:21:48.787296Z","bundle_sha256":"d3421c17d468320d1a6594af726fad4ff2d5a04cab257e71e7f8c577ee07ab97"}}