{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:V3RQ3ZR5YGTY6RS5CU6TPAUY5T","short_pith_number":"pith:V3RQ3ZR5","schema_version":"1.0","canonical_sha256":"aee30de63dc1a78f465d153d378298eccf763f45ed1dd9e8c3bd2edffa8b61eb","source":{"kind":"arxiv","id":"1003.3632","version":3},"attestation_state":"computed","paper":{"title":"Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"B\\'en\\'edicte Haas, Gr\\'egory Miermont","submitted_at":"2010-03-18T16:56:50Z","abstract_excerpt":"We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers that determine how the size of a tree is distributed in its different subtrees. Under some natural assumption on these distributions, stipulating that \"macroscopic\" splitting events are rare, we show that Markov branching trees admit the"},"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":"1003.3632","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-18T16:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"008043bb2f7e5b8fc35a28a106679d634e582847873b290c82fc7954f2a5dc5f","abstract_canon_sha256":"ee4cabf96b44291bee273f3dc42d83abe089fd36d592f710f1e3b06e894fb607"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:32.525629Z","signature_b64":"zvArHFAirrIw/6wDJlgAq3zRULyVWuQyYmBqp0caE3SQf+GbOuifd5q9PBMvTBSvmrNXSHGvpebuZ4lTdcGMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aee30de63dc1a78f465d153d378298eccf763f45ed1dd9e8c3bd2edffa8b61eb","last_reissued_at":"2026-05-18T03:41:32.525069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:32.525069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"B\\'en\\'edicte Haas, Gr\\'egory Miermont","submitted_at":"2010-03-18T16:56:50Z","abstract_excerpt":"We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers that determine how the size of a tree is distributed in its different subtrees. Under some natural assumption on these distributions, stipulating that \"macroscopic\" splitting events are rare, we show that Markov branching trees admit the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3632","kind":"arxiv","version":3},"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":"1003.3632","created_at":"2026-05-18T03:41:32.525170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3632v3","created_at":"2026-05-18T03:41:32.525170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3632","created_at":"2026-05-18T03:41:32.525170+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3RQ3ZR5YGTY","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3RQ3ZR5YGTY6RS5","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3RQ3ZR5","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19123","citing_title":"The longest increasing subsequence of Brownian separable permutons","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T","json":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T.json","graph_json":"https://pith.science/api/pith-number/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/graph.json","events_json":"https://pith.science/api/pith-number/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/events.json","paper":"https://pith.science/paper/V3RQ3ZR5"},"agent_actions":{"view_html":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T","download_json":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T.json","view_paper":"https://pith.science/paper/V3RQ3ZR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3632&json=true","fetch_graph":"https://pith.science/api/pith-number/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/graph.json","fetch_events":"https://pith.science/api/pith-number/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/action/storage_attestation","attest_author":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/action/author_attestation","sign_citation":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/action/citation_signature","submit_replication":"https://pith.science/pith/V3RQ3ZR5YGTY6RS5CU6TPAUY5T/action/replication_record"}},"created_at":"2026-05-18T03:41:32.525170+00:00","updated_at":"2026-05-18T03:41:32.525170+00:00"}