{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZTRZJZDETUWZ4RCG3RW5BLRNFL","short_pith_number":"pith:ZTRZJZDE","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"},"canonical_sha256":"cce394e4649d2d9e4446dc6dd0ae2d2acc31f94c589e9f8926eb0917ab6b7aa9","source":{"kind":"arxiv","id":"1510.06691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06691","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06691v2","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06691","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZTRZJZDETUWZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTRZJZDETUWZ4RCG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTRZJZDE","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZTRZJZDETUWZ4RCG3RW5BLRNFL","target":"record","payload":{"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"},"canonical_sha256":"cce394e4649d2d9e4446dc6dd0ae2d2acc31f94c589e9f8926eb0917ab6b7aa9","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"},"source_kind":"arxiv","source_id":"1510.06691","source_version":2,"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-18T00:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lanNazXEKqj+pUfnWbXlzAhUnocMFP5DP/zThH05/PZVKRBbIhY4fOZoyJlNB6y/kxa377w51S6ysMat5cOwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:39:36.848355Z"},"content_sha256":"53d57f599b1d821b60b643083a17386b5427bac72a9a074609144dcc3aa3be7c","schema_version":"1.0","event_id":"sha256:53d57f599b1d821b60b643083a17386b5427bac72a9a074609144dcc3aa3be7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZTRZJZDETUWZ4RCG3RW5BLRNFL","target":"graph","payload":{"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"},"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-18T00:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObJsqe8snGaV6oXcf4JLzr57LVU2cfezgNP+94iECJo7E7Prv1JKuTHOWIzgJ9X8F0AR86G8wFlXp061g7lbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:39:36.849014Z"},"content_sha256":"8e2890c41272ad492445e57cd8b3eb28f082cb284f508427b16d602df7146d2b","schema_version":"1.0","event_id":"sha256:8e2890c41272ad492445e57cd8b3eb28f082cb284f508427b16d602df7146d2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/bundle.json","state_url":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/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-25T01:39:36Z","links":{"resolver":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL","bundle":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/bundle.json","state":"https://pith.science/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTRZJZDETUWZ4RCG3RW5BLRNFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZTRZJZDETUWZ4RCG3RW5BLRNFL","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":"7b996259dee599cc51a1e7c4b77d03c4fc46ba77f4da4661110a816c4574c5eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-22T17:11:38Z","title_canon_sha256":"cae2613b163eda099eee74312de1202eb70bf5cc50f2b0e015d271b3a598ba67"},"schema_version":"1.0","source":{"id":"1510.06691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06691","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06691v2","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06691","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZTRZJZDETUWZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTRZJZDETUWZ4RCG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTRZJZDE","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:8e2890c41272ad492445e57cd8b3eb28f082cb284f508427b16d602df7146d2b","target":"graph","created_at":"2026-05-18T00:42:49Z","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 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}$, ","authors_text":"C\\'ecile Mailler, Nicolas Broutin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-22T17:11:38Z","title":"And/or trees: A local limit point of view"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06691","kind":"arxiv","version":2},"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:53d57f599b1d821b60b643083a17386b5427bac72a9a074609144dcc3aa3be7c","target":"record","created_at":"2026-05-18T00:42:49Z","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":"7b996259dee599cc51a1e7c4b77d03c4fc46ba77f4da4661110a816c4574c5eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-22T17:11:38Z","title_canon_sha256":"cae2613b163eda099eee74312de1202eb70bf5cc50f2b0e015d271b3a598ba67"},"schema_version":"1.0","source":{"id":"1510.06691","kind":"arxiv","version":2}},"canonical_sha256":"cce394e4649d2d9e4446dc6dd0ae2d2acc31f94c589e9f8926eb0917ab6b7aa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cce394e4649d2d9e4446dc6dd0ae2d2acc31f94c589e9f8926eb0917ab6b7aa9","first_computed_at":"2026-05-18T00:42:49.066699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:49.066699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mj7SI+gRbl6zNlnqqVjOUx3bFqMLOTBsjzmU53PLNLAkh0qX1z83SGWrKpga+pTCjaC9tDPUJVQhx1zmFANBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:49.067422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d57f599b1d821b60b643083a17386b5427bac72a9a074609144dcc3aa3be7c","sha256:8e2890c41272ad492445e57cd8b3eb28f082cb284f508427b16d602df7146d2b"],"state_sha256":"0b274b4a941fcaf18db522255ee5ad72a811651ba40bc74c4a2d9b90e8ba89f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9dTZ0PHcHByqg8m9plr9dHtXM6EYlqYiqXoh43kdUGTZbQkXWT+nHJ4zr3XvEjvwFLaiSiQvWe51F84k5lwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:39:36.852231Z","bundle_sha256":"1f01fb03464ecd78cd4f365208c5c3967ed3ca4bed7800d173f04d477b92bff0"}}