{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KDZBO3LEOU36IRQ5BA2LAAHBAW","short_pith_number":"pith:KDZBO3LE","schema_version":"1.0","canonical_sha256":"50f2176d647537e4461d0834b000e10592b536c3ae4aef6474480ae559ffd214","source":{"kind":"arxiv","id":"1507.08448","version":1},"attestation_state":"computed","paper":{"title":"Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Antoine Genitrini, C\\'ecile Mailler","submitted_at":"2015-07-30T10:52:14Z","abstract_excerpt":"This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable? asymptotically when n tends to infinity?\n  The model of random Boolean expressions developed in the present paper is the model of Boolean Catalan trees, already extensively studied in the literature for a constant sequence (k_n)_{n\\geq 1}. The fundamental breakthrough of this paper is to generalise the previous results to any (reasonable) sequence of integers ("},"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":"1507.08448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T10:52:14Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d18df0984dfa076aa1b3a8c77beaf0eb6e0e6cd4c746cc0b113579098a81b478","abstract_canon_sha256":"89e7a4de9b96aed38e07c1dbaf19f37da2ce704839fa427ba210b90e52cc02f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:06.422521Z","signature_b64":"zZCzxIWNQ4JE4rP1wBYK9G/yKJJ1hNRQpQ5If1wfG/TCEdDSx2xSoizIYp1EQ74k+hzBBu2F89LquIKOsugABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50f2176d647537e4461d0834b000e10592b536c3ae4aef6474480ae559ffd214","last_reissued_at":"2026-05-18T01:36:06.421930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:06.421930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Antoine Genitrini, C\\'ecile Mailler","submitted_at":"2015-07-30T10:52:14Z","abstract_excerpt":"This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable? asymptotically when n tends to infinity?\n  The model of random Boolean expressions developed in the present paper is the model of Boolean Catalan trees, already extensively studied in the literature for a constant sequence (k_n)_{n\\geq 1}. The fundamental breakthrough of this paper is to generalise the previous results to any (reasonable) sequence of integers ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08448","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":"1507.08448","created_at":"2026-05-18T01:36:06.422011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08448v1","created_at":"2026-05-18T01:36:06.422011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08448","created_at":"2026-05-18T01:36:06.422011+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDZBO3LEOU36","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDZBO3LEOU36IRQ5","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDZBO3LE","created_at":"2026-05-18T12:29:27.538025+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/KDZBO3LEOU36IRQ5BA2LAAHBAW","json":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW.json","graph_json":"https://pith.science/api/pith-number/KDZBO3LEOU36IRQ5BA2LAAHBAW/graph.json","events_json":"https://pith.science/api/pith-number/KDZBO3LEOU36IRQ5BA2LAAHBAW/events.json","paper":"https://pith.science/paper/KDZBO3LE"},"agent_actions":{"view_html":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW","download_json":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW.json","view_paper":"https://pith.science/paper/KDZBO3LE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08448&json=true","fetch_graph":"https://pith.science/api/pith-number/KDZBO3LEOU36IRQ5BA2LAAHBAW/graph.json","fetch_events":"https://pith.science/api/pith-number/KDZBO3LEOU36IRQ5BA2LAAHBAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW/action/storage_attestation","attest_author":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW/action/author_attestation","sign_citation":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW/action/citation_signature","submit_replication":"https://pith.science/pith/KDZBO3LEOU36IRQ5BA2LAAHBAW/action/replication_record"}},"created_at":"2026-05-18T01:36:06.422011+00:00","updated_at":"2026-05-18T01:36:06.422011+00:00"}