{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FZUYETU3UJDZBEF2WJMZ3FGYKL","short_pith_number":"pith:FZUYETU3","schema_version":"1.0","canonical_sha256":"2e69824e9ba2479090bab2599d94d852fc837fdbf47d45581e676bf824eee8cf","source":{"kind":"arxiv","id":"2010.00684","version":2},"attestation_state":"computed","paper":{"title":"Towards Scalable Bayesian Learning of Causal DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Antti Hyttinen, Johan Pensar, Jussi Viinikka, Mikko Koivisto","submitted_at":"2020-09-30T08:46:46Z","abstract_excerpt":"We give methods for Bayesian inference of directed acyclic graphs, DAGs, and the induced causal effects from passively observed complete data. Our methods build on a recent Markov chain Monte Carlo scheme for learning Bayesian networks, which enables efficient approximate sampling from the graph posterior, provided that each node is assigned a small number $K$ of candidate parents. We present algorithmic techniques to significantly reduce the space and time requirements, which make the use of substantially larger values of $K$ feasible. Furthermore, we investigate the problem of selecting the "},"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":"2010.00684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-30T08:46:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"96630a686f3e0cc1e77f6656e6267ec23b93d655f9b3b6ffc0924852cd2899f6","abstract_canon_sha256":"8fc117ffadfeb2b74e80fb065b9b368d6ad79d891b90679502cf72f65492013e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:36.949884Z","signature_b64":"fa9VOZ3tXZY3wdPKb62kAR6ry1hH+1v/qGgKVwLsKngvS4k27Z/K0cVvV6IeZ5Updktq1r24qGK+wjh48scODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e69824e9ba2479090bab2599d94d852fc837fdbf47d45581e676bf824eee8cf","last_reissued_at":"2026-07-05T01:52:36.949542Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:36.949542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Scalable Bayesian Learning of Causal DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Antti Hyttinen, Johan Pensar, Jussi Viinikka, Mikko Koivisto","submitted_at":"2020-09-30T08:46:46Z","abstract_excerpt":"We give methods for Bayesian inference of directed acyclic graphs, DAGs, and the induced causal effects from passively observed complete data. Our methods build on a recent Markov chain Monte Carlo scheme for learning Bayesian networks, which enables efficient approximate sampling from the graph posterior, provided that each node is assigned a small number $K$ of candidate parents. We present algorithmic techniques to significantly reduce the space and time requirements, which make the use of substantially larger values of $K$ feasible. Furthermore, we investigate the problem of selecting the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00684","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/2010.00684/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":"2010.00684","created_at":"2026-07-05T01:52:36.949596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00684v2","created_at":"2026-07-05T01:52:36.949596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00684","created_at":"2026-07-05T01:52:36.949596+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZUYETU3UJDZ","created_at":"2026-07-05T01:52:36.949596+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZUYETU3UJDZBEF2","created_at":"2026-07-05T01:52:36.949596+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZUYETU3","created_at":"2026-07-05T01:52:36.949596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16529","citing_title":"Bayesian causal discovery: Posterior concentration and optimal detection","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL","json":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL.json","graph_json":"https://pith.science/api/pith-number/FZUYETU3UJDZBEF2WJMZ3FGYKL/graph.json","events_json":"https://pith.science/api/pith-number/FZUYETU3UJDZBEF2WJMZ3FGYKL/events.json","paper":"https://pith.science/paper/FZUYETU3"},"agent_actions":{"view_html":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL","download_json":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL.json","view_paper":"https://pith.science/paper/FZUYETU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00684&json=true","fetch_graph":"https://pith.science/api/pith-number/FZUYETU3UJDZBEF2WJMZ3FGYKL/graph.json","fetch_events":"https://pith.science/api/pith-number/FZUYETU3UJDZBEF2WJMZ3FGYKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/action/storage_attestation","attest_author":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/action/author_attestation","sign_citation":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/action/citation_signature","submit_replication":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/action/replication_record"}},"created_at":"2026-07-05T01:52:36.949596+00:00","updated_at":"2026-07-05T01:52:36.949596+00:00"}