{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3QSO3IXNK3UNBNK4NI5KQI4VI6","short_pith_number":"pith:3QSO3IXN","schema_version":"1.0","canonical_sha256":"dc24eda2ed56e8d0b55c6a3aa823954783cbe8ebe7fc69507be03bb0c46df3c0","source":{"kind":"arxiv","id":"2504.19944","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic and Causal Satisfiability: Constraining the Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CC","authors_text":"Benito van der Zander, Julian D\\\"orfler, Maciej Li\\'skiewicz, Markus Bl\\\"aser","submitted_at":"2025-04-28T16:14:06Z","abstract_excerpt":"We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i = x_i$, such as $P(X_1 = x_1)$ or $P(X_1 = x_1 \\vee X_2 = x_2)$. The basic terms can be combined using addition (yielding linear terms) or multiplication (polynomial terms). The probabilistic satisfiability problem asks whether a joint probability distribution satisfies a Boolean combination of (in)equalities over such terms. Fagin et al. (1990) showed that for "},"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":"2504.19944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-04-28T16:14:06Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"b011871ffcbe0d18f8668d9d160b803eabf165c3e4c85625311b6e54970ac3da","abstract_canon_sha256":"0c97f8ded942bf2259275bd3092a519c51b78e6019e24a1be86905b828434683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:06.729807Z","signature_b64":"zJA2WmcxBtUU8wKxiMhyjSlitc9PxfR9xC3FAxJ1h6Q2BgDph1f/mqNGZiS3tbP55NbnUgQeblNBBsQSgf3UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc24eda2ed56e8d0b55c6a3aa823954783cbe8ebe7fc69507be03bb0c46df3c0","last_reissued_at":"2026-07-05T10:55:06.729399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:06.729399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic and Causal Satisfiability: Constraining the Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CC","authors_text":"Benito van der Zander, Julian D\\\"orfler, Maciej Li\\'skiewicz, Markus Bl\\\"aser","submitted_at":"2025-04-28T16:14:06Z","abstract_excerpt":"We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i = x_i$, such as $P(X_1 = x_1)$ or $P(X_1 = x_1 \\vee X_2 = x_2)$. The basic terms can be combined using addition (yielding linear terms) or multiplication (polynomial terms). The probabilistic satisfiability problem asks whether a joint probability distribution satisfies a Boolean combination of (in)equalities over such terms. Fagin et al. (1990) showed that for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19944","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.19944/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.19944","created_at":"2026-07-05T10:55:06.729452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19944v1","created_at":"2026-07-05T10:55:06.729452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19944","created_at":"2026-07-05T10:55:06.729452+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QSO3IXNK3UN","created_at":"2026-07-05T10:55:06.729452+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QSO3IXNK3UNBNK4","created_at":"2026-07-05T10:55:06.729452+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QSO3IXN","created_at":"2026-07-05T10:55:06.729452+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/3QSO3IXNK3UNBNK4NI5KQI4VI6","json":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6.json","graph_json":"https://pith.science/api/pith-number/3QSO3IXNK3UNBNK4NI5KQI4VI6/graph.json","events_json":"https://pith.science/api/pith-number/3QSO3IXNK3UNBNK4NI5KQI4VI6/events.json","paper":"https://pith.science/paper/3QSO3IXN"},"agent_actions":{"view_html":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6","download_json":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6.json","view_paper":"https://pith.science/paper/3QSO3IXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19944&json=true","fetch_graph":"https://pith.science/api/pith-number/3QSO3IXNK3UNBNK4NI5KQI4VI6/graph.json","fetch_events":"https://pith.science/api/pith-number/3QSO3IXNK3UNBNK4NI5KQI4VI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6/action/storage_attestation","attest_author":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6/action/author_attestation","sign_citation":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6/action/citation_signature","submit_replication":"https://pith.science/pith/3QSO3IXNK3UNBNK4NI5KQI4VI6/action/replication_record"}},"created_at":"2026-07-05T10:55:06.729452+00:00","updated_at":"2026-07-05T10:55:06.729452+00:00"}