{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CR26C6QBKPQCBKQ5E3R4CY5NAV","short_pith_number":"pith:CR26C6QB","schema_version":"1.0","canonical_sha256":"1475e17a0153e020aa1d26e3c163ad057c8c217898d74448bb023ef3c5b1cdcd","source":{"kind":"arxiv","id":"1104.5617","version":3},"attestation_state":"computed","paper":{"title":"Learning high-dimensional directed acyclic graphs with latent and selection variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Diego Colombo, Markus Kalisch, Marloes H. Maathuis, Thomas S. Richardson","submitted_at":"2011-04-29T12:57:10Z","abstract_excerpt":"We consider the problem of learning causal information between random variables in directed acyclic graphs (DAGs) when allowing arbitrarily many latent and selection variables. The FCI (Fast Causal Inference) algorithm has been explicitly designed to infer conditional independence and causal information in such settings. However, FCI is computationally infeasible for large graphs. We therefore propose the new RFCI algorithm, which is much faster than FCI. In some situations the output of RFCI is slightly less informative, in particular with respect to conditional independence information. Howe"},"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":"1104.5617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-04-29T12:57:10Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"f616551e615f172dd5c0b9f6d1bf5e65a08a29ece291cb60e59fb7e3c2b57f11","abstract_canon_sha256":"186bbc03fd1f86e622f657e7a8ab6685419f62f5d141425230f7296ea1eaf04d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:47.971510Z","signature_b64":"OeG5cNZkQqCDL7XgbkrQgmnykE6RwPH2PFe3KawMhIvmSFi72EmMfsD/Rgs6dHMZU2GW1FwAvAd6AwEoE4NmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1475e17a0153e020aa1d26e3c163ad057c8c217898d74448bb023ef3c5b1cdcd","last_reissued_at":"2026-05-18T03:54:47.970963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:47.970963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning high-dimensional directed acyclic graphs with latent and selection variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Diego Colombo, Markus Kalisch, Marloes H. Maathuis, Thomas S. Richardson","submitted_at":"2011-04-29T12:57:10Z","abstract_excerpt":"We consider the problem of learning causal information between random variables in directed acyclic graphs (DAGs) when allowing arbitrarily many latent and selection variables. The FCI (Fast Causal Inference) algorithm has been explicitly designed to infer conditional independence and causal information in such settings. However, FCI is computationally infeasible for large graphs. We therefore propose the new RFCI algorithm, which is much faster than FCI. In some situations the output of RFCI is slightly less informative, in particular with respect to conditional independence information. Howe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5617","kind":"arxiv","version":3},"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":"1104.5617","created_at":"2026-05-18T03:54:47.971069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5617v3","created_at":"2026-05-18T03:54:47.971069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5617","created_at":"2026-05-18T03:54:47.971069+00:00"},{"alias_kind":"pith_short_12","alias_value":"CR26C6QBKPQC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CR26C6QBKPQCBKQ5","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CR26C6QB","created_at":"2026-05-18T12:26:26.731475+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/CR26C6QBKPQCBKQ5E3R4CY5NAV","json":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV.json","graph_json":"https://pith.science/api/pith-number/CR26C6QBKPQCBKQ5E3R4CY5NAV/graph.json","events_json":"https://pith.science/api/pith-number/CR26C6QBKPQCBKQ5E3R4CY5NAV/events.json","paper":"https://pith.science/paper/CR26C6QB"},"agent_actions":{"view_html":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV","download_json":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV.json","view_paper":"https://pith.science/paper/CR26C6QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5617&json=true","fetch_graph":"https://pith.science/api/pith-number/CR26C6QBKPQCBKQ5E3R4CY5NAV/graph.json","fetch_events":"https://pith.science/api/pith-number/CR26C6QBKPQCBKQ5E3R4CY5NAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV/action/storage_attestation","attest_author":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV/action/author_attestation","sign_citation":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV/action/citation_signature","submit_replication":"https://pith.science/pith/CR26C6QBKPQCBKQ5E3R4CY5NAV/action/replication_record"}},"created_at":"2026-05-18T03:54:47.971069+00:00","updated_at":"2026-05-18T03:54:47.971069+00:00"}