{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2NAJG3A5KWG6URWA5KY7XSCGUI","short_pith_number":"pith:2NAJG3A5","schema_version":"1.0","canonical_sha256":"d340936c1d558dea46c0eab1fbc846a217912a507ac42d94832f5f7519945b1c","source":{"kind":"arxiv","id":"1807.00767","version":2},"attestation_state":"computed","paper":{"title":"Moments of general time dependent branching processes with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"S\\'andor Rokob, Tam\\'as F. M\\'ori","submitted_at":"2018-07-02T16:05:50Z","abstract_excerpt":"In this paper, we give sufficient conditions for a Crump-Mode-Jagers process to be bounded in $L_k$ for a given $k>1$. This result is then applied to a recent random graph process motivated by pairwise collaborations and driven by time-dependent branching dynamics. We show that the maximal degree has the same rate of increase as the degree process of a fixed vertex."},"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":"1807.00767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-02T16:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"592912482fc657048feeb63b28c4692cf3228b4026e14180f4c2d14da571ebd4","abstract_canon_sha256":"4d983114a5de34c659e6cddd3c24fa21eafc87d9769498e59c980e82bfaf8d6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:46.291139Z","signature_b64":"YTzWFDrPnsa9cUhCdJKLrIj+vduRktWsxXaqpQ6npQQoUpoIDARJpr34cqSv28dVZ3Aw8B1VDTDqgNXhTVK/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d340936c1d558dea46c0eab1fbc846a217912a507ac42d94832f5f7519945b1c","last_reissued_at":"2026-05-17T23:46:46.290561Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:46.290561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moments of general time dependent branching processes with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"S\\'andor Rokob, Tam\\'as F. M\\'ori","submitted_at":"2018-07-02T16:05:50Z","abstract_excerpt":"In this paper, we give sufficient conditions for a Crump-Mode-Jagers process to be bounded in $L_k$ for a given $k>1$. This result is then applied to a recent random graph process motivated by pairwise collaborations and driven by time-dependent branching dynamics. We show that the maximal degree has the same rate of increase as the degree process of a fixed vertex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00767","kind":"arxiv","version":2},"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":"1807.00767","created_at":"2026-05-17T23:46:46.290638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00767v2","created_at":"2026-05-17T23:46:46.290638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00767","created_at":"2026-05-17T23:46:46.290638+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NAJG3A5KWG6","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NAJG3A5KWG6URWA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NAJG3A5","created_at":"2026-05-18T12:32:02.567920+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/2NAJG3A5KWG6URWA5KY7XSCGUI","json":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI.json","graph_json":"https://pith.science/api/pith-number/2NAJG3A5KWG6URWA5KY7XSCGUI/graph.json","events_json":"https://pith.science/api/pith-number/2NAJG3A5KWG6URWA5KY7XSCGUI/events.json","paper":"https://pith.science/paper/2NAJG3A5"},"agent_actions":{"view_html":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI","download_json":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI.json","view_paper":"https://pith.science/paper/2NAJG3A5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00767&json=true","fetch_graph":"https://pith.science/api/pith-number/2NAJG3A5KWG6URWA5KY7XSCGUI/graph.json","fetch_events":"https://pith.science/api/pith-number/2NAJG3A5KWG6URWA5KY7XSCGUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI/action/storage_attestation","attest_author":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI/action/author_attestation","sign_citation":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI/action/citation_signature","submit_replication":"https://pith.science/pith/2NAJG3A5KWG6URWA5KY7XSCGUI/action/replication_record"}},"created_at":"2026-05-17T23:46:46.290638+00:00","updated_at":"2026-05-17T23:46:46.290638+00:00"}