{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XMEIJAIY2C22OWKYZXF5E4EMTJ","short_pith_number":"pith:XMEIJAIY","canonical_record":{"source":{"id":"1209.0275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-03T08:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"d37219db5d8ccb8aa01b856de7686a9ad2e0aa60cf69af0f4b357b5862344060","abstract_canon_sha256":"68c301cdbddd0151cafeab48770ac7405a06b65d23f548d587e6315776e7a0b4"},"schema_version":"1.0"},"canonical_sha256":"bb08848118d0b5a75958cdcbd2708c9a4906eade776cbeb49dacac9e3bceb6c9","source":{"kind":"arxiv","id":"1209.0275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0275","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0275v1","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0275","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"XMEIJAIY2C22","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XMEIJAIY2C22OWKY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XMEIJAIY","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XMEIJAIY2C22OWKYZXF5E4EMTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-03T08:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"d37219db5d8ccb8aa01b856de7686a9ad2e0aa60cf69af0f4b357b5862344060","abstract_canon_sha256":"68c301cdbddd0151cafeab48770ac7405a06b65d23f548d587e6315776e7a0b4"},"schema_version":"1.0"},"canonical_sha256":"bb08848118d0b5a75958cdcbd2708c9a4906eade776cbeb49dacac9e3bceb6c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:29.529719Z","signature_b64":"yHaCcf13wJRa7/3yVndZH2earB2ABaQ3dL07e2fQI1odZtIX+YwauwL6onmhsl2mC+8P+7Ou7912GvH6beEFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb08848118d0b5a75958cdcbd2708c9a4906eade776cbeb49dacac9e3bceb6c9","last_reissued_at":"2026-05-18T03:46:29.528834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:29.528834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0275","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:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RRHuJffNLmDy73hu0CMdVvTK9cO9y2tpvetHwEG0URqLK6JyEZXu7psg/gVXJ1MAR6e6UbW/4I82yhxT6ShQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:14:46.876263Z"},"content_sha256":"51af7bcdebf44585f0010e7634674cc71a7b8f45f20f87da70398083a676e889","schema_version":"1.0","event_id":"sha256:51af7bcdebf44585f0010e7634674cc71a7b8f45f20f87da70398083a676e889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XMEIJAIY2C22OWKYZXF5E4EMTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Number of Subtrees of Trees with Given Degree Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Gray, Hua Wang, Xiao-Dong Zhang, Xiu-Mei Zhang","submitted_at":"2012-09-03T08:58:38Z","abstract_excerpt":"This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes the recent results of Kirk and Wang. These trees coincide with those which were proven by Wang and independently Zhang et al. to minimize the Wiener index. We also provide a partial ordering of the extremal trees with different degree sequences, some extremal results follow as corollaries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0275","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:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EPZhL1K7bS6ChZDaX3zFXWjjqOhBN6xKHOITsZXFEQXTNuGz50ZwUzJq2fuAVgwX4kq5VtIF9dnazDKCGo2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:14:46.876901Z"},"content_sha256":"8712b5738e68a70b9c942e09542800c42292fc351d3bf63b89e6621e5d2e9ad7","schema_version":"1.0","event_id":"sha256:8712b5738e68a70b9c942e09542800c42292fc351d3bf63b89e6621e5d2e9ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ/bundle.json","state_url":"https://pith.science/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ/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-05T00:14:46Z","links":{"resolver":"https://pith.science/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ","bundle":"https://pith.science/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ/bundle.json","state":"https://pith.science/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMEIJAIY2C22OWKYZXF5E4EMTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XMEIJAIY2C22OWKYZXF5E4EMTJ","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":"68c301cdbddd0151cafeab48770ac7405a06b65d23f548d587e6315776e7a0b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-03T08:58:38Z","title_canon_sha256":"d37219db5d8ccb8aa01b856de7686a9ad2e0aa60cf69af0f4b357b5862344060"},"schema_version":"1.0","source":{"id":"1209.0275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0275","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0275v1","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0275","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"XMEIJAIY2C22","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XMEIJAIY2C22OWKY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XMEIJAIY","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:8712b5738e68a70b9c942e09542800c42292fc351d3bf63b89e6621e5d2e9ad7","target":"graph","created_at":"2026-05-18T03:46:29Z","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 paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes the recent results of Kirk and Wang. These trees coincide with those which were proven by Wang and independently Zhang et al. to minimize the Wiener index. We also provide a partial ordering of the extremal trees with different degree sequences, some extremal results follow as corollaries.","authors_text":"Daniel Gray, Hua Wang, Xiao-Dong Zhang, Xiu-Mei Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-03T08:58:38Z","title":"The Number of Subtrees of Trees with Given Degree Sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0275","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:51af7bcdebf44585f0010e7634674cc71a7b8f45f20f87da70398083a676e889","target":"record","created_at":"2026-05-18T03:46:29Z","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":"68c301cdbddd0151cafeab48770ac7405a06b65d23f548d587e6315776e7a0b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-03T08:58:38Z","title_canon_sha256":"d37219db5d8ccb8aa01b856de7686a9ad2e0aa60cf69af0f4b357b5862344060"},"schema_version":"1.0","source":{"id":"1209.0275","kind":"arxiv","version":1}},"canonical_sha256":"bb08848118d0b5a75958cdcbd2708c9a4906eade776cbeb49dacac9e3bceb6c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb08848118d0b5a75958cdcbd2708c9a4906eade776cbeb49dacac9e3bceb6c9","first_computed_at":"2026-05-18T03:46:29.528834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:29.528834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHaCcf13wJRa7/3yVndZH2earB2ABaQ3dL07e2fQI1odZtIX+YwauwL6onmhsl2mC+8P+7Ou7912GvH6beEFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:29.529719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51af7bcdebf44585f0010e7634674cc71a7b8f45f20f87da70398083a676e889","sha256:8712b5738e68a70b9c942e09542800c42292fc351d3bf63b89e6621e5d2e9ad7"],"state_sha256":"eeec61900fcb36553c87481a0c1b7ee63824d6b957f40a03ba6f3093b0563457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2Cx75jSuwmUT+AePiGyVoDP6QSscopxHsNEUf56aFwmkje9D7LQLTLnyoPrZz46oXVVB7GzcxLB+gcl9U8MDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:14:46.880149Z","bundle_sha256":"619b6c80f85eedeff87157f838ecde8d5d4529cf00cf96aae0da0c75dceaf192"}}