{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YMRVU4BJC6INVWI6GHDDZ3G4QT","short_pith_number":"pith:YMRVU4BJ","canonical_record":{"source":{"id":"1407.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-20T12:59:36Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"199a665d60e31029b337e8301954b8a9a49aa6455eaa71b369399fc1e77a1db4","abstract_canon_sha256":"331d879c305362b7a141676c57fd6128bcf67d073be4d7d844427ab6873d5a6f"},"schema_version":"1.0"},"canonical_sha256":"c3235a70291790dad91e31c63cecdc84f82f41fec96544862fa9c5499849edb1","source":{"kind":"arxiv","id":"1407.5284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5284","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5284v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5284","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"YMRVU4BJC6IN","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YMRVU4BJC6INVWI6","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YMRVU4BJ","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YMRVU4BJC6INVWI6GHDDZ3G4QT","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-20T12:59:36Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"199a665d60e31029b337e8301954b8a9a49aa6455eaa71b369399fc1e77a1db4","abstract_canon_sha256":"331d879c305362b7a141676c57fd6128bcf67d073be4d7d844427ab6873d5a6f"},"schema_version":"1.0"},"canonical_sha256":"c3235a70291790dad91e31c63cecdc84f82f41fec96544862fa9c5499849edb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:14.427233Z","signature_b64":"r43zwX7QqbL9TC7SEfN5rMv6jdmzI7SeRG8Za9EQjHNEeCLUi4NnbWy45Yp01Ya1yuohKvdysZt+SQ8Xznb0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3235a70291790dad91e31c63cecdc84f82f41fec96544862fa9c5499849edb1","last_reissued_at":"2026-05-18T02:47:14.426630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:14.426630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5284","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-18T02:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRi+5nQKKe/86Uu0sxTOzVCxJKUkaVRur4i8Hu5M6h17wE7o8HxqCtxMSKbh7obXdvuiYDFc32mEWFmU30GzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:42:27.833686Z"},"content_sha256":"4bbb05b7cefb2055d65ed9e2a757f11398a31a0b88960943bd20db0627052e1c","schema_version":"1.0","event_id":"sha256:4bbb05b7cefb2055d65ed9e2a757f11398a31a0b88960943bd20db0627052e1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YMRVU4BJC6INVWI6GHDDZ3G4QT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivalence classes of nodes in trees and rational generating functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Amritanshu Prasad","submitted_at":"2014-07-20T12:59:36Z","abstract_excerpt":"Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\\{c_n\\}$ is described. This criterion is applied to counting the number of conjugacy classes of commuting tuples in finite groups and the number of isomorphism classes of representations of polynomial algebras over finite fields. The method for computing the rational generating functions, when applied to the study of point configurations in finite sets, gives rise to some classical combinatorial results on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5284","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-18T02:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gf1lk2XA0dCA7raxaMQmBS6W6T1UsvcgAVFTWV359A2WStXpEsysF6ovgRMYg8wZAoln19oYzD1y2hFhBOHODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:42:27.834087Z"},"content_sha256":"7ea014748787175ec3490bb73535023527fab466909788dea6124de4af8f9581","schema_version":"1.0","event_id":"sha256:7ea014748787175ec3490bb73535023527fab466909788dea6124de4af8f9581"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT/bundle.json","state_url":"https://pith.science/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT/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-05-28T16:42:27Z","links":{"resolver":"https://pith.science/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT","bundle":"https://pith.science/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT/bundle.json","state":"https://pith.science/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMRVU4BJC6INVWI6GHDDZ3G4QT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YMRVU4BJC6INVWI6GHDDZ3G4QT","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":"331d879c305362b7a141676c57fd6128bcf67d073be4d7d844427ab6873d5a6f","cross_cats_sorted":["math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-20T12:59:36Z","title_canon_sha256":"199a665d60e31029b337e8301954b8a9a49aa6455eaa71b369399fc1e77a1db4"},"schema_version":"1.0","source":{"id":"1407.5284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5284","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5284v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5284","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"YMRVU4BJC6IN","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YMRVU4BJC6INVWI6","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YMRVU4BJ","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:7ea014748787175ec3490bb73535023527fab466909788dea6124de4af8f9581","target":"graph","created_at":"2026-05-18T02:47:14Z","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 $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\\{c_n\\}$ is described. This criterion is applied to counting the number of conjugacy classes of commuting tuples in finite groups and the number of isomorphism classes of representations of polynomial algebras over finite fields. The method for computing the rational generating functions, when applied to the study of point configurations in finite sets, gives rise to some classical combinatorial results on","authors_text":"Amritanshu Prasad","cross_cats":["math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-20T12:59:36Z","title":"Equivalence classes of nodes in trees and rational generating functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5284","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:4bbb05b7cefb2055d65ed9e2a757f11398a31a0b88960943bd20db0627052e1c","target":"record","created_at":"2026-05-18T02:47:14Z","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":"331d879c305362b7a141676c57fd6128bcf67d073be4d7d844427ab6873d5a6f","cross_cats_sorted":["math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-20T12:59:36Z","title_canon_sha256":"199a665d60e31029b337e8301954b8a9a49aa6455eaa71b369399fc1e77a1db4"},"schema_version":"1.0","source":{"id":"1407.5284","kind":"arxiv","version":1}},"canonical_sha256":"c3235a70291790dad91e31c63cecdc84f82f41fec96544862fa9c5499849edb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3235a70291790dad91e31c63cecdc84f82f41fec96544862fa9c5499849edb1","first_computed_at":"2026-05-18T02:47:14.426630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:14.426630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r43zwX7QqbL9TC7SEfN5rMv6jdmzI7SeRG8Za9EQjHNEeCLUi4NnbWy45Yp01Ya1yuohKvdysZt+SQ8Xznb0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:14.427233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bbb05b7cefb2055d65ed9e2a757f11398a31a0b88960943bd20db0627052e1c","sha256:7ea014748787175ec3490bb73535023527fab466909788dea6124de4af8f9581"],"state_sha256":"a3b61ef37fc99aec7ec1c889cfc40a60432a504824586acb7e80889b0fc6d9d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOyw6EAcX/lXE0VBfGFfDjQOPbb7LHvhSSeSzxMrzMFR2xErAVxMVhnGas3hgD4zhps/ww4Uje8habceFLomCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:42:27.838576Z","bundle_sha256":"5f52a09b1ad9224477d97176ad1ef57f4224e313dd6610fed67aa53721c554f1"}}