{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:DESQKKHIVI7CICDJVSS7TFWNFD","short_pith_number":"pith:DESQKKHI","canonical_record":{"source":{"id":"math/0601009","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-12-31T06:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"d369f5876d293bc0ac5c112cb34410eaed546d98751dda4ba3e6920907774747","abstract_canon_sha256":"e7d644a7e4e732bff4e8b0558d982612612a1c4656439ca368f15a2cf4ab7ae5"},"schema_version":"1.0"},"canonical_sha256":"19250528e8aa3e240869aca5f996cd28f41b122eda456484e8b703a5ca47cf9f","source":{"kind":"arxiv","id":"math/0601009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601009","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601009v1","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601009","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"DESQKKHIVI7C","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"pith_short_16","alias_value":"DESQKKHIVI7CICDJ","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"pith_short_8","alias_value":"DESQKKHI","created_at":"2026-07-05T04:07:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:DESQKKHIVI7CICDJVSS7TFWNFD","target":"record","payload":{"canonical_record":{"source":{"id":"math/0601009","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-12-31T06:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"d369f5876d293bc0ac5c112cb34410eaed546d98751dda4ba3e6920907774747","abstract_canon_sha256":"e7d644a7e4e732bff4e8b0558d982612612a1c4656439ca368f15a2cf4ab7ae5"},"schema_version":"1.0"},"canonical_sha256":"19250528e8aa3e240869aca5f996cd28f41b122eda456484e8b703a5ca47cf9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:01.544258Z","signature_b64":"dq0BHmAKFhSS31nGVhu+Eyl+1zPjAe4ozyY1raszyuijiBnO6RHVRiXKp++crYord458GR1mWcPvzJOHVENQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19250528e8aa3e240869aca5f996cd28f41b122eda456484e8b703a5ca47cf9f","last_reissued_at":"2026-07-05T04:07:01.543913Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:01.543913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0601009","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-07-05T04:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCJ2KS4DxCGqbbLRofJf6b3BZnEKKNzuB/SNexV9BLBlczF75Eyq11zI1x6OMMkrRrFb4KaaASiC+f4KSafFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:54:52.552870Z"},"content_sha256":"f29a52d60dc999f8a31cbf142699ec0daf30360955881db8ed4b1518b0429b3d","schema_version":"1.0","event_id":"sha256:f29a52d60dc999f8a31cbf142699ec0daf30360955881db8ed4b1518b0429b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:DESQKKHIVI7CICDJVSS7TFWNFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized Enumeration of Labeled Trees and Reverse Pr\\\"ufer Algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heesung Shin, Seunghyun Seo","submitted_at":"2005-12-31T06:14:56Z","abstract_excerpt":"A {\\em leader} of a tree $T$ on $[n]$ is a vertex which has no smaller descendants in $T$. Gessel and Seo showed $$\\sum_{T \\in \\mathcal{T}_n}u^\\text{(# of leaders in $T$)} c^\\text{(degree of 1 in $T$)}=u P_{n-1}(1,u,cu),$$ which is a generalization of Cayley formula, where $\\mathcal{T}_n$ is the set of trees on $[n]$ and $$P_n(a,b,c)=c\\prod_{i=1}^{n-1}(ia+(n-i)b+c).$$ Using a variation of Pr\\\"ufer code which is called a {\\em RP-code}, we give a simple bijective proof of Gessel and Seo's formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601009","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0601009/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wI32c626IhfF5I5yszqOSdx54mVXvHbRGEneZabKdnJID5VhQSO7DzRMFzGcvkivtjsyLZMNICG/sMirqBaABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:54:52.553802Z"},"content_sha256":"6f007834b6432a176d45e95c400c955b53c438b03bbcc68c50217284c7c97664","schema_version":"1.0","event_id":"sha256:6f007834b6432a176d45e95c400c955b53c438b03bbcc68c50217284c7c97664"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DESQKKHIVI7CICDJVSS7TFWNFD/bundle.json","state_url":"https://pith.science/pith/DESQKKHIVI7CICDJVSS7TFWNFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DESQKKHIVI7CICDJVSS7TFWNFD/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-08-03T15:54:52Z","links":{"resolver":"https://pith.science/pith/DESQKKHIVI7CICDJVSS7TFWNFD","bundle":"https://pith.science/pith/DESQKKHIVI7CICDJVSS7TFWNFD/bundle.json","state":"https://pith.science/pith/DESQKKHIVI7CICDJVSS7TFWNFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DESQKKHIVI7CICDJVSS7TFWNFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:DESQKKHIVI7CICDJVSS7TFWNFD","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":"e7d644a7e4e732bff4e8b0558d982612612a1c4656439ca368f15a2cf4ab7ae5","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-12-31T06:14:56Z","title_canon_sha256":"d369f5876d293bc0ac5c112cb34410eaed546d98751dda4ba3e6920907774747"},"schema_version":"1.0","source":{"id":"math/0601009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601009","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601009v1","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601009","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"DESQKKHIVI7C","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"pith_short_16","alias_value":"DESQKKHIVI7CICDJ","created_at":"2026-07-05T04:07:01Z"},{"alias_kind":"pith_short_8","alias_value":"DESQKKHI","created_at":"2026-07-05T04:07:01Z"}],"graph_snapshots":[{"event_id":"sha256:6f007834b6432a176d45e95c400c955b53c438b03bbcc68c50217284c7c97664","target":"graph","created_at":"2026-07-05T04:07:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0601009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A {\\em leader} of a tree $T$ on $[n]$ is a vertex which has no smaller descendants in $T$. Gessel and Seo showed $$\\sum_{T \\in \\mathcal{T}_n}u^\\text{(# of leaders in $T$)} c^\\text{(degree of 1 in $T$)}=u P_{n-1}(1,u,cu),$$ which is a generalization of Cayley formula, where $\\mathcal{T}_n$ is the set of trees on $[n]$ and $$P_n(a,b,c)=c\\prod_{i=1}^{n-1}(ia+(n-i)b+c).$$ Using a variation of Pr\\\"ufer code which is called a {\\em RP-code}, we give a simple bijective proof of Gessel and Seo's formula.","authors_text":"Heesung Shin, Seunghyun Seo","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2005-12-31T06:14:56Z","title":"A Generalized Enumeration of Labeled Trees and Reverse Pr\\\"ufer Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601009","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:f29a52d60dc999f8a31cbf142699ec0daf30360955881db8ed4b1518b0429b3d","target":"record","created_at":"2026-07-05T04:07:01Z","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":"e7d644a7e4e732bff4e8b0558d982612612a1c4656439ca368f15a2cf4ab7ae5","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-12-31T06:14:56Z","title_canon_sha256":"d369f5876d293bc0ac5c112cb34410eaed546d98751dda4ba3e6920907774747"},"schema_version":"1.0","source":{"id":"math/0601009","kind":"arxiv","version":1}},"canonical_sha256":"19250528e8aa3e240869aca5f996cd28f41b122eda456484e8b703a5ca47cf9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19250528e8aa3e240869aca5f996cd28f41b122eda456484e8b703a5ca47cf9f","first_computed_at":"2026-07-05T04:07:01.543913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:07:01.543913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dq0BHmAKFhSS31nGVhu+Eyl+1zPjAe4ozyY1raszyuijiBnO6RHVRiXKp++crYord458GR1mWcPvzJOHVENQDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:07:01.544258Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0601009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29a52d60dc999f8a31cbf142699ec0daf30360955881db8ed4b1518b0429b3d","sha256:6f007834b6432a176d45e95c400c955b53c438b03bbcc68c50217284c7c97664"],"state_sha256":"adb713fe7540680205de19e011993e6a737ea643e085363e2a1059c2b0e78a1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYsHTwHFiTY5PKf1+C7REscrvMmg1NCU9dLB9UClWSON4A7c5kD88Fyt992ZfL8yfACsBZOFKsBBncGpIOZ0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:54:52.631510Z","bundle_sha256":"69d688f0317df17e2cc01a2a1b3862187a1cb5d3cce8bfa780e4fdc21d4e6110"}}