{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QIK3Z7Y3O6JQT6BX5EIXK2HQCA","short_pith_number":"pith:QIK3Z7Y3","schema_version":"1.0","canonical_sha256":"8215bcff1b779309f837e9117568f0101d4cf877c633cc3e886bbcecf4514614","source":{"kind":"arxiv","id":"1403.4834","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Ordering of Infinite Binomial Galton-Watson Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik I. Broman","submitted_at":"2014-03-19T15:01:24Z","abstract_excerpt":"We consider Galton-Watson trees with ${\\rm Bin}(d,p)$ offspring distribution. We let $T_{\\infty}(p)$ denote such a tree conditioned on being infinite. For $d=2,3$ and any $1/d\\leq p_1 <p_2 \\leq 1$, we show that there exists a coupling between $T_{\\infty}(p_1)$ and $T_{\\infty}(p_2)$ such that ${\\mathbb P}(T_{\\infty}(p_1) \\subseteq T_{\\infty}(p_2))=1.$"},"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":"1403.4834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-19T15:01:24Z","cross_cats_sorted":[],"title_canon_sha256":"ee4573bc37cf1025f154ab07e188249d16fb91f26d48cff7ef3e3f2ff428fe7f","abstract_canon_sha256":"6c2a00b874e5fad01ade6ced2b4124a9d60342f356439cd6002d6f52c43f4a08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.369601Z","signature_b64":"lvIrFSz2WmFt/ABHdPePJsmiTlxL8BbMW2gOezHkUDgcrNUq64UGAdzjkpz10xBy08gcRU1ih3rGeehoscSZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8215bcff1b779309f837e9117568f0101d4cf877c633cc3e886bbcecf4514614","last_reissued_at":"2026-05-18T02:56:04.368882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.368882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Ordering of Infinite Binomial Galton-Watson Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik I. Broman","submitted_at":"2014-03-19T15:01:24Z","abstract_excerpt":"We consider Galton-Watson trees with ${\\rm Bin}(d,p)$ offspring distribution. We let $T_{\\infty}(p)$ denote such a tree conditioned on being infinite. For $d=2,3$ and any $1/d\\leq p_1 <p_2 \\leq 1$, we show that there exists a coupling between $T_{\\infty}(p_1)$ and $T_{\\infty}(p_2)$ such that ${\\mathbb P}(T_{\\infty}(p_1) \\subseteq T_{\\infty}(p_2))=1.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4834","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":"1403.4834","created_at":"2026-05-18T02:56:04.368994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4834v1","created_at":"2026-05-18T02:56:04.368994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4834","created_at":"2026-05-18T02:56:04.368994+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIK3Z7Y3O6JQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIK3Z7Y3O6JQT6BX","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIK3Z7Y3","created_at":"2026-05-18T12:28:46.137349+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/QIK3Z7Y3O6JQT6BX5EIXK2HQCA","json":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA.json","graph_json":"https://pith.science/api/pith-number/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/graph.json","events_json":"https://pith.science/api/pith-number/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/events.json","paper":"https://pith.science/paper/QIK3Z7Y3"},"agent_actions":{"view_html":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA","download_json":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA.json","view_paper":"https://pith.science/paper/QIK3Z7Y3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4834&json=true","fetch_graph":"https://pith.science/api/pith-number/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/graph.json","fetch_events":"https://pith.science/api/pith-number/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/action/storage_attestation","attest_author":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/action/author_attestation","sign_citation":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/action/citation_signature","submit_replication":"https://pith.science/pith/QIK3Z7Y3O6JQT6BX5EIXK2HQCA/action/replication_record"}},"created_at":"2026-05-18T02:56:04.368994+00:00","updated_at":"2026-05-18T02:56:04.368994+00:00"}