{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:V27QOQXO4R6FC5VBA4XWEFSYOR","short_pith_number":"pith:V27QOQXO","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"},"canonical_sha256":"aebf0742eee47c5176a1072f6216587476f4dba71ef6a253d6fb523cab4b6b4f","source":{"kind":"arxiv","id":"1112.0510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0510","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0510v1","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0510","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"V27QOQXO4R6F","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V27QOQXO4R6FC5VB","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V27QOQXO","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:V27QOQXO4R6FC5VBA4XWEFSYOR","target":"record","payload":{"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"},"canonical_sha256":"aebf0742eee47c5176a1072f6216587476f4dba71ef6a253d6fb523cab4b6b4f","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"},"source_kind":"arxiv","source_id":"1112.0510","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-18T04:07:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYBUfGIHzLJ/neGwdDUB2xwuSRJuz77yC3JCD945gQ/A0xklHrcwAotUgpghY5tAik1YlSF5Yy6Ncda6PKBYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:00:00.421285Z"},"content_sha256":"e8e735057d2b78a460b794f75985e414d3975932cbba02483dd818ebd7a2e384","schema_version":"1.0","event_id":"sha256:e8e735057d2b78a460b794f75985e414d3975932cbba02483dd818ebd7a2e384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:V27QOQXO4R6FC5VBA4XWEFSYOR","target":"graph","payload":{"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"},"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-18T04:07:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpNlUwo0qZTpC13EgsEusi/461hQMWfEdF0tKFLH1hMFVkCjEH1vonv3QSmpGu3Ix6+Ubaz3czApouJlWmAFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:00:00.421696Z"},"content_sha256":"ab2311edf6f64a0a9b8d7e425d660057657a53a234696ef3ff514a3462635829","schema_version":"1.0","event_id":"sha256:ab2311edf6f64a0a9b8d7e425d660057657a53a234696ef3ff514a3462635829"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/bundle.json","state_url":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/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-25T21:00:00Z","links":{"resolver":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR","bundle":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/bundle.json","state":"https://pith.science/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V27QOQXO4R6FC5VBA4XWEFSYOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:V27QOQXO4R6FC5VBA4XWEFSYOR","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":"d26631a129350d267e79e1242bdf6673c837d9937af46a264764092e65159ac7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-02T17:14:52Z","title_canon_sha256":"9a4cf75b1d4ca747845d851f18353706d9f09d29226f0d788ea007889d516ead"},"schema_version":"1.0","source":{"id":"1112.0510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0510","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0510v1","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0510","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"V27QOQXO4R6F","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V27QOQXO4R6FC5VB","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V27QOQXO","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:ab2311edf6f64a0a9b8d7e425d660057657a53a234696ef3ff514a3462635829","target":"graph","created_at":"2026-05-18T04:07:07Z","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":"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","authors_text":"Svante Janson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-02T17:14:52Z","title":"Simply generated trees, conditioned Galton--Watson trees, random allocations and condensation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0510","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:e8e735057d2b78a460b794f75985e414d3975932cbba02483dd818ebd7a2e384","target":"record","created_at":"2026-05-18T04:07:07Z","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":"d26631a129350d267e79e1242bdf6673c837d9937af46a264764092e65159ac7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-02T17:14:52Z","title_canon_sha256":"9a4cf75b1d4ca747845d851f18353706d9f09d29226f0d788ea007889d516ead"},"schema_version":"1.0","source":{"id":"1112.0510","kind":"arxiv","version":1}},"canonical_sha256":"aebf0742eee47c5176a1072f6216587476f4dba71ef6a253d6fb523cab4b6b4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aebf0742eee47c5176a1072f6216587476f4dba71ef6a253d6fb523cab4b6b4f","first_computed_at":"2026-05-18T04:07:07.114003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:07.114003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qAo2BDyZvfUo12IVEOn2nIbxX/rX6SkVzM8BkjYsKRboooyma7RoH332ZkzF44NhZgGW1OajzZTduijRFQNqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:07.114428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8e735057d2b78a460b794f75985e414d3975932cbba02483dd818ebd7a2e384","sha256:ab2311edf6f64a0a9b8d7e425d660057657a53a234696ef3ff514a3462635829"],"state_sha256":"3b617922d3713412f1138544ac88f537f8a3bb7a7dcd2bed94853278d7feff47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIhOEx+ZGQu7heiQWUGjQ3xBg1UyAEb8UaStjNbdmKU2SIA+3dbgeYOHVGLljBO1FlXCwxspC8eS8jnPyUSsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:00:00.424529Z","bundle_sha256":"ace6782a353e6cc77b03442b783099261b9b2ba1399aaadf5e1fed77dfef09b8"}}