{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EOTDAWDMDGPGG4FV4PFUCRBGPV","short_pith_number":"pith:EOTDAWDM","schema_version":"1.0","canonical_sha256":"23a630586c199e6370b5e3cb4144267d55004f44da57602b5a8a27f01269bc81","source":{"kind":"arxiv","id":"1202.3757","version":1},"attestation_state":"computed","paper":{"title":"Identifiability of Causal Graphs using Functional Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernhard Schoelkopf, Dominik Janzing, Jonas Peters, Joris Mooij","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"This work addresses the following question: Under what assumptions on the data generating process can one infer the causal graph from the joint distribution? The approach taken by conditional independence-based causal discovery methods is based on two assumptions: the Markov condition and faithfulness. It has been shown that under these assumptions the causal graph can be identified up to Markov equivalence (some arrows remain undirected) using methods like the PC algorithm. In this work we propose an alternative by defining Identifiable Functional Model Classes (IFMOCs). As our main theorem w"},"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":"1202.3757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3f018c1b770c629bfa87056e8a533306cc07f4dade39c263527e3a3481046933","abstract_canon_sha256":"336620677d86e0d2201bf22b257e58d7e45529bc813f76b71fb31814762bc490"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.030603Z","signature_b64":"l11hinEGWldDuHwfWXTERnj9XCGRhjU/LYuejmCDqX0/DUjwpheY+nuI3D+KoIHnBazMF9qsp2pAwyqfb5LgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23a630586c199e6370b5e3cb4144267d55004f44da57602b5a8a27f01269bc81","last_reissued_at":"2026-05-18T04:02:03.029909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.029909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifiability of Causal Graphs using Functional Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernhard Schoelkopf, Dominik Janzing, Jonas Peters, Joris Mooij","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"This work addresses the following question: Under what assumptions on the data generating process can one infer the causal graph from the joint distribution? The approach taken by conditional independence-based causal discovery methods is based on two assumptions: the Markov condition and faithfulness. It has been shown that under these assumptions the causal graph can be identified up to Markov equivalence (some arrows remain undirected) using methods like the PC algorithm. In this work we propose an alternative by defining Identifiable Functional Model Classes (IFMOCs). As our main theorem w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3757","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":"1202.3757","created_at":"2026-05-18T04:02:03.029983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3757v1","created_at":"2026-05-18T04:02:03.029983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3757","created_at":"2026-05-18T04:02:03.029983+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOTDAWDMDGPG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOTDAWDMDGPGG4FV","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOTDAWDM","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.21350","citing_title":"Factored Causal Representation Learning for Robust Reward Modeling in RLHF","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV","json":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV.json","graph_json":"https://pith.science/api/pith-number/EOTDAWDMDGPGG4FV4PFUCRBGPV/graph.json","events_json":"https://pith.science/api/pith-number/EOTDAWDMDGPGG4FV4PFUCRBGPV/events.json","paper":"https://pith.science/paper/EOTDAWDM"},"agent_actions":{"view_html":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV","download_json":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV.json","view_paper":"https://pith.science/paper/EOTDAWDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3757&json=true","fetch_graph":"https://pith.science/api/pith-number/EOTDAWDMDGPGG4FV4PFUCRBGPV/graph.json","fetch_events":"https://pith.science/api/pith-number/EOTDAWDMDGPGG4FV4PFUCRBGPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV/action/storage_attestation","attest_author":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV/action/author_attestation","sign_citation":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV/action/citation_signature","submit_replication":"https://pith.science/pith/EOTDAWDMDGPGG4FV4PFUCRBGPV/action/replication_record"}},"created_at":"2026-05-18T04:02:03.029983+00:00","updated_at":"2026-05-18T04:02:03.029983+00:00"}