{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CSWZ75NAKFPGAJHM65DOSSDR4V","short_pith_number":"pith:CSWZ75NA","schema_version":"1.0","canonical_sha256":"14ad9ff5a0515e6024ecf746e94871e545d5e99008ed2eef2d3c754c2954822b","source":{"kind":"arxiv","id":"2403.00957","version":2},"attestation_state":"computed","paper":{"title":"Resolution of Simpson's paradox via the common cause principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.PR","physics.data-an","stat.AP"],"primary_cat":"stat.ME","authors_text":"A. E. Allahverdyan, A. Hovhannisyan","submitted_at":"2024-03-01T20:15:28Z","abstract_excerpt":"Simpson's paradox is an obstacle to establishing a probabilistic association between two events $a_1$ and $a_2$, given the third (lurking) random variable $B$. We focus on scenarios when the random variables $A$ (which combines $a_1$, $a_2$, and their complements) and $B$ have a common cause $C$ that need not be observed. Alternatively, we can assume that $C$ screens out $A$ from $B$. For such cases, the correct association between $a_1$ and $a_2$ is to be defined via conditioning over $C$. This setup generalizes the original Simpson's paradox: now its two contradicting options refer to two pa"},"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":"2403.00957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-03-01T20:15:28Z","cross_cats_sorted":["cs.AI","math.PR","physics.data-an","stat.AP"],"title_canon_sha256":"af70f7fcb8d10ec24494cb6c52472a7e1d717939975a728825e075c83830ab5d","abstract_canon_sha256":"f2cecd14921a73728b48caf3b9290c456bc9fa4f9a209d062784e7b4eb1af885"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:22.320933Z","signature_b64":"/qU8fe1diDiiohB0W6FIszYaZGY3P23AEjoGM4Uhb1qhba34C7sxsrUkTQIgLKlTgALs+FGVEOY45EKaAC3IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ad9ff5a0515e6024ecf746e94871e545d5e99008ed2eef2d3c754c2954822b","last_reissued_at":"2026-07-05T08:46:22.320434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:22.320434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolution of Simpson's paradox via the common cause principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.PR","physics.data-an","stat.AP"],"primary_cat":"stat.ME","authors_text":"A. E. Allahverdyan, A. Hovhannisyan","submitted_at":"2024-03-01T20:15:28Z","abstract_excerpt":"Simpson's paradox is an obstacle to establishing a probabilistic association between two events $a_1$ and $a_2$, given the third (lurking) random variable $B$. We focus on scenarios when the random variables $A$ (which combines $a_1$, $a_2$, and their complements) and $B$ have a common cause $C$ that need not be observed. Alternatively, we can assume that $C$ screens out $A$ from $B$. For such cases, the correct association between $a_1$ and $a_2$ is to be defined via conditioning over $C$. This setup generalizes the original Simpson's paradox: now its two contradicting options refer to two pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00957","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.00957/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":"2403.00957","created_at":"2026-07-05T08:46:22.320498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00957v2","created_at":"2026-07-05T08:46:22.320498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00957","created_at":"2026-07-05T08:46:22.320498+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSWZ75NAKFPG","created_at":"2026-07-05T08:46:22.320498+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSWZ75NAKFPGAJHM","created_at":"2026-07-05T08:46:22.320498+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSWZ75NA","created_at":"2026-07-05T08:46:22.320498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03652","citing_title":"Nonnegative matrix factorization and the principle of the common cause","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V","json":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V.json","graph_json":"https://pith.science/api/pith-number/CSWZ75NAKFPGAJHM65DOSSDR4V/graph.json","events_json":"https://pith.science/api/pith-number/CSWZ75NAKFPGAJHM65DOSSDR4V/events.json","paper":"https://pith.science/paper/CSWZ75NA"},"agent_actions":{"view_html":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V","download_json":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V.json","view_paper":"https://pith.science/paper/CSWZ75NA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00957&json=true","fetch_graph":"https://pith.science/api/pith-number/CSWZ75NAKFPGAJHM65DOSSDR4V/graph.json","fetch_events":"https://pith.science/api/pith-number/CSWZ75NAKFPGAJHM65DOSSDR4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V/action/storage_attestation","attest_author":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V/action/author_attestation","sign_citation":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V/action/citation_signature","submit_replication":"https://pith.science/pith/CSWZ75NAKFPGAJHM65DOSSDR4V/action/replication_record"}},"created_at":"2026-07-05T08:46:22.320498+00:00","updated_at":"2026-07-05T08:46:22.320498+00:00"}