{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RJDNGSNC2NZD2RIFJFZ2L5QD2I","short_pith_number":"pith:RJDNGSNC","schema_version":"1.0","canonical_sha256":"8a46d349a2d3723d45054973a5f603d237e9d270903950a4a8be4236774d665d","source":{"kind":"arxiv","id":"1506.08382","version":1},"attestation_state":"computed","paper":{"title":"A combinatorial identity on Galton-Watson process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur L.B. Yang, Linyuan Lu","submitted_at":"2015-06-28T11:10:49Z","abstract_excerpt":"Let $f(m,c)=\\sum_{k=0}^{\\infty} (km+1)^{k-1} c^k e^{-c(km+1)/m} / (m^kk!)$. For any positive integer $m$ and positive real $c$, the identity $f(m,c)=f(1,c)^{1/m}$ arises in the random graph theory. In this paper, we present two elementary proofs of this identity: a pure combinatorial proof and a power-serial proof. We also proved that this identity holds for any positive reals $m$ and $c$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1506.08382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-28T11:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"4d722d774b74c8129580415edd0bef07450a48f3e521f89de68adde9a5d7f5a5","abstract_canon_sha256":"62cef36b2d51b789c8ce25af510421c512f8fbf3c625285d34b3b55f86a59578"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:45.427059Z","signature_b64":"Z3u+8u14FfgXFKLqlVQWdFEzlHCH93walJ9tNu17wQveNFpEVUuy2NbpVZRVU6d78rnspmm2xZqEif9yT2qBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a46d349a2d3723d45054973a5f603d237e9d270903950a4a8be4236774d665d","last_reissued_at":"2026-05-18T01:37:45.426618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:45.426618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial identity on Galton-Watson process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur L.B. Yang, Linyuan Lu","submitted_at":"2015-06-28T11:10:49Z","abstract_excerpt":"Let $f(m,c)=\\sum_{k=0}^{\\infty} (km+1)^{k-1} c^k e^{-c(km+1)/m} / (m^kk!)$. For any positive integer $m$ and positive real $c$, the identity $f(m,c)=f(1,c)^{1/m}$ arises in the random graph theory. In this paper, we present two elementary proofs of this identity: a pure combinatorial proof and a power-serial proof. We also proved that this identity holds for any positive reals $m$ and $c$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08382","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.08382","created_at":"2026-05-18T01:37:45.426681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08382v1","created_at":"2026-05-18T01:37:45.426681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08382","created_at":"2026-05-18T01:37:45.426681+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJDNGSNC2NZD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJDNGSNC2NZD2RIF","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJDNGSNC","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I","json":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I.json","graph_json":"https://pith.science/api/pith-number/RJDNGSNC2NZD2RIFJFZ2L5QD2I/graph.json","events_json":"https://pith.science/api/pith-number/RJDNGSNC2NZD2RIFJFZ2L5QD2I/events.json","paper":"https://pith.science/paper/RJDNGSNC"},"agent_actions":{"view_html":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I","download_json":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I.json","view_paper":"https://pith.science/paper/RJDNGSNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08382&json=true","fetch_graph":"https://pith.science/api/pith-number/RJDNGSNC2NZD2RIFJFZ2L5QD2I/graph.json","fetch_events":"https://pith.science/api/pith-number/RJDNGSNC2NZD2RIFJFZ2L5QD2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I/action/storage_attestation","attest_author":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I/action/author_attestation","sign_citation":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I/action/citation_signature","submit_replication":"https://pith.science/pith/RJDNGSNC2NZD2RIFJFZ2L5QD2I/action/replication_record"}},"created_at":"2026-05-18T01:37:45.426681+00:00","updated_at":"2026-05-18T01:37:45.426681+00:00"}