{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UDPTJWL5RKULJIWLT424LXQUCD","short_pith_number":"pith:UDPTJWL5","schema_version":"1.0","canonical_sha256":"a0df34d97d8aa8b4a2cb9f35c5de1410c8b2c4cc5aeccf24d6bd7d8419f6ce41","source":{"kind":"arxiv","id":"1304.5615","version":2},"attestation_state":"computed","paper":{"title":"Catalan satisfiability problem","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":"2013-04-20T09:19:36Z","abstract_excerpt":"An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first model of such Catalan trees, whose number of variables k_n is a function of n, the size of the expressions. We describe the whole range of the probability distributions depending on the function k_n, as soon as it tends jointly with n to infinity. As a by-product we obtain a study of the satisfiability problem in the context of Catalan trees.\n  Our study is "},"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":"1304.5615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-20T09:19:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"cecba70aff19eaf2c0c29e0f416f0471bd10a9c3e7801e5a26d85fa3a8e7719f","abstract_canon_sha256":"91239ceb07eeca855fd364949837f19b9ec0f385031c7813169a97b47c3b210b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:17.612841Z","signature_b64":"NWUqluS4B7hhyqUwEhUdi8VEgf6ss5rhzzC/FbI98dkDVSv6r6ycIVvMXasxk0uiLpCNGLK1lAgmmeb9K+uiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0df34d97d8aa8b4a2cb9f35c5de1410c8b2c4cc5aeccf24d6bd7d8419f6ce41","last_reissued_at":"2026-05-18T02:53:17.612330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:17.612330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Catalan satisfiability problem","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":"2013-04-20T09:19:36Z","abstract_excerpt":"An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first model of such Catalan trees, whose number of variables k_n is a function of n, the size of the expressions. We describe the whole range of the probability distributions depending on the function k_n, as soon as it tends jointly with n to infinity. As a by-product we obtain a study of the satisfiability problem in the context of Catalan trees.\n  Our study is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5615","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":"1304.5615","created_at":"2026-05-18T02:53:17.612404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5615v2","created_at":"2026-05-18T02:53:17.612404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5615","created_at":"2026-05-18T02:53:17.612404+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDPTJWL5RKUL","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDPTJWL5RKULJIWL","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDPTJWL5","created_at":"2026-05-18T12:28:02.375192+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/UDPTJWL5RKULJIWLT424LXQUCD","json":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD.json","graph_json":"https://pith.science/api/pith-number/UDPTJWL5RKULJIWLT424LXQUCD/graph.json","events_json":"https://pith.science/api/pith-number/UDPTJWL5RKULJIWLT424LXQUCD/events.json","paper":"https://pith.science/paper/UDPTJWL5"},"agent_actions":{"view_html":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD","download_json":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD.json","view_paper":"https://pith.science/paper/UDPTJWL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5615&json=true","fetch_graph":"https://pith.science/api/pith-number/UDPTJWL5RKULJIWLT424LXQUCD/graph.json","fetch_events":"https://pith.science/api/pith-number/UDPTJWL5RKULJIWLT424LXQUCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD/action/storage_attestation","attest_author":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD/action/author_attestation","sign_citation":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD/action/citation_signature","submit_replication":"https://pith.science/pith/UDPTJWL5RKULJIWLT424LXQUCD/action/replication_record"}},"created_at":"2026-05-18T02:53:17.612404+00:00","updated_at":"2026-05-18T02:53:17.612404+00:00"}