{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZTRZJZDETUWZ4RCG3RW5BLRNFL","short_pith_number":"pith:ZTRZJZDE","schema_version":"1.0","canonical_sha256":"cce394e4649d2d9e4446dc6dd0ae2d2acc31f94c589e9f8926eb0917ab6b7aa9","source":{"kind":"arxiv","id":"1510.06691","version":2},"attestation_state":"computed","paper":{"title":"And/or trees: A local limit point of view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C\\'ecile Mailler, Nicolas Broutin","submitted_at":"2015-10-22T17:11:38Z","abstract_excerpt":"We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression represented in (one of) its tree shapes. Fix an integer $k$, take a sequence of random (rooted) trees of increasing size, say $(t_n)_{n\\ge 1}$, and label each of these random trees uniformly at random in order to get a random Boolean expression on $k$ variables.\n  We prove that, under rather weak local conditions on the sequence of random trees $(t_n)_{n\\ge 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":"1510.06691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-22T17:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"cae2613b163eda099eee74312de1202eb70bf5cc50f2b0e015d271b3a598ba67","abstract_canon_sha256":"7b996259dee599cc51a1e7c4b77d03c4fc46ba77f4da4661110a816c4574c5eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:49.067422Z","signature_b64":"mj7SI+gRbl6zNlnqqVjOUx3bFqMLOTBsjzmU53PLNLAkh0qX1z83SGWrKpga+pTCjaC9tDPUJVQhx1zmFANBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce394e4649d2d9e4446dc6dd0ae2d2acc31f94c589e9f8926eb0917ab6b7aa9","last_reissued_at":"2026-05-18T00:42:49.066699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:49.066699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"And/or trees: A local limit point of view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C\\'ecile Mailler, Nicolas Broutin","submitted_at":"2015-10-22T17:11:38Z","abstract_excerpt":"We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression represented in (one of) its tree shapes. Fix an integer $k$, take a sequence of random (rooted) trees of increasing size, say $(t_n)_{n\\ge 1}$, and label each of these random trees uniformly at random in order to get a random Boolean expression on $k$ variables.\n  We prove that, under rather weak local conditions on the sequence of random trees $(t_n)_{n\\ge 1}$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06691","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":"1510.06691","created_at":"2026-05-18T00:42:49.066832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06691v2","created_at":"2026-05-18T00:42:49.066832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06691","created_at":"2026-05-18T00:42:49.066832+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTRZJZDETUWZ","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTRZJZDETUWZ4RCG","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTRZJZDE","created_at":"2026-05-18T12:29:52.810259+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/ZTRZJZDETUWZ4RCG3RW5BLRNFL","json":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL.json","graph_json":"https://pith.science/api/pith-number/ZTRZJZDETUWZ4RCG3RW5BLRNFL/graph.json","events_json":"https://pith.science/api/pith-number/ZTRZJZDETUWZ4RCG3RW5BLRNFL/events.json","paper":"https://pith.science/paper/ZTRZJZDE"},"agent_actions":{"view_html":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL","download_json":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL.json","view_paper":"https://pith.science/paper/ZTRZJZDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06691&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTRZJZDETUWZ4RCG3RW5BLRNFL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTRZJZDETUWZ4RCG3RW5BLRNFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/action/storage_attestation","attest_author":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/action/author_attestation","sign_citation":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/action/citation_signature","submit_replication":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/action/replication_record"}},"created_at":"2026-05-18T00:42:49.066832+00:00","updated_at":"2026-05-18T00:42:49.066832+00:00"}