{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:V27QOQXO4R6FC5VBA4XWEFSYOR","short_pith_number":"pith:V27QOQXO","schema_version":"1.0","canonical_sha256":"aebf0742eee47c5176a1072f6216587476f4dba71ef6a253d6fb523cab4b6b4f","source":{"kind":"arxiv","id":"1112.0510","version":1},"attestation_state":"computed","paper":{"title":"Simply generated trees, conditioned Galton--Watson trees, random allocations and condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Svante Janson","submitted_at":"2011-12-02T17:14:52Z","abstract_excerpt":"We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in the other cases (i.e., when no equivalent critical Galton--Watson tree exists). There is a well-defined limit in the form of an infinite random tree in all cases; for critical Galton--Watson trees this tree is locally finite but for the other cases the random limit has exactly one node of infinite degree.\n  The proofs use a well-known connection to a random"},"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":"1112.0510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-02T17:14:52Z","cross_cats_sorted":[],"title_canon_sha256":"9a4cf75b1d4ca747845d851f18353706d9f09d29226f0d788ea007889d516ead","abstract_canon_sha256":"d26631a129350d267e79e1242bdf6673c837d9937af46a264764092e65159ac7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:07.114428Z","signature_b64":"qAo2BDyZvfUo12IVEOn2nIbxX/rX6SkVzM8BkjYsKRboooyma7RoH332ZkzF44NhZgGW1OajzZTduijRFQNqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aebf0742eee47c5176a1072f6216587476f4dba71ef6a253d6fb523cab4b6b4f","last_reissued_at":"2026-05-18T04:07:07.114003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:07.114003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simply generated trees, conditioned Galton--Watson trees, random allocations and condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Svante Janson","submitted_at":"2011-12-02T17:14:52Z","abstract_excerpt":"We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in the other cases (i.e., when no equivalent critical Galton--Watson tree exists). There is a well-defined limit in the form of an infinite random tree in all cases; for critical Galton--Watson trees this tree is locally finite but for the other cases the random limit has exactly one node of infinite degree.\n  The proofs use a well-known connection to a random"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0510","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":"1112.0510","created_at":"2026-05-18T04:07:07.114068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0510v1","created_at":"2026-05-18T04:07:07.114068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0510","created_at":"2026-05-18T04:07:07.114068+00:00"},{"alias_kind":"pith_short_12","alias_value":"V27QOQXO4R6F","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V27QOQXO4R6FC5VB","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V27QOQXO","created_at":"2026-05-18T12:26:42.757692+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/V27QOQXO4R6FC5VBA4XWEFSYOR","json":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR.json","graph_json":"https://pith.science/api/pith-number/V27QOQXO4R6FC5VBA4XWEFSYOR/graph.json","events_json":"https://pith.science/api/pith-number/V27QOQXO4R6FC5VBA4XWEFSYOR/events.json","paper":"https://pith.science/paper/V27QOQXO"},"agent_actions":{"view_html":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR","download_json":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR.json","view_paper":"https://pith.science/paper/V27QOQXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0510&json=true","fetch_graph":"https://pith.science/api/pith-number/V27QOQXO4R6FC5VBA4XWEFSYOR/graph.json","fetch_events":"https://pith.science/api/pith-number/V27QOQXO4R6FC5VBA4XWEFSYOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/action/storage_attestation","attest_author":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/action/author_attestation","sign_citation":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/action/citation_signature","submit_replication":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/action/replication_record"}},"created_at":"2026-05-18T04:07:07.114068+00:00","updated_at":"2026-05-18T04:07:07.114068+00:00"}