{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FZUYETU3UJDZBEF2WJMZ3FGYKL","short_pith_number":"pith:FZUYETU3","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"},"canonical_sha256":"2e69824e9ba2479090bab2599d94d852fc837fdbf47d45581e676bf824eee8cf","source":{"kind":"arxiv","id":"2010.00684","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00684","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00684v2","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00684","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"pith_short_12","alias_value":"FZUYETU3UJDZ","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"pith_short_16","alias_value":"FZUYETU3UJDZBEF2","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"pith_short_8","alias_value":"FZUYETU3","created_at":"2026-07-05T01:52:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FZUYETU3UJDZBEF2WJMZ3FGYKL","target":"record","payload":{"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"},"canonical_sha256":"2e69824e9ba2479090bab2599d94d852fc837fdbf47d45581e676bf824eee8cf","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"},"source_kind":"arxiv","source_id":"2010.00684","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:52:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UUdHXD6Q1qMPmdDdkf2BrfiRi7cEpelTuryLxRz/ORNQXR4rweYF5RZAaO7ShxTFjDDlpeEf9BalMlgbrBVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:42:43.613925Z"},"content_sha256":"58e05c87a4715f60fa9a0801c1337d8ddb4e303def78eb220a8080877a6ebda9","schema_version":"1.0","event_id":"sha256:58e05c87a4715f60fa9a0801c1337d8ddb4e303def78eb220a8080877a6ebda9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FZUYETU3UJDZBEF2WJMZ3FGYKL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:52:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBW8Ku9dL/jVntcjRy3V7JWM1hjdGZvxABkTw21yMuYaTPiS0sAYmJ58YKY//bmLsb/L0k5X9z0pi1x0vAenCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:42:43.614522Z"},"content_sha256":"6530c1cf41ff6579d7203114ab5812cc131cef140cb86730ae16938578240ebb","schema_version":"1.0","event_id":"sha256:6530c1cf41ff6579d7203114ab5812cc131cef140cb86730ae16938578240ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/bundle.json","state_url":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T03:42:43Z","links":{"resolver":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL","bundle":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/bundle.json","state":"https://pith.science/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZUYETU3UJDZBEF2WJMZ3FGYKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FZUYETU3UJDZBEF2WJMZ3FGYKL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8fc117ffadfeb2b74e80fb065b9b368d6ad79d891b90679502cf72f65492013e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-30T08:46:46Z","title_canon_sha256":"96630a686f3e0cc1e77f6656e6267ec23b93d655f9b3b6ffc0924852cd2899f6"},"schema_version":"1.0","source":{"id":"2010.00684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00684","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00684v2","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00684","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"pith_short_12","alias_value":"FZUYETU3UJDZ","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"pith_short_16","alias_value":"FZUYETU3UJDZBEF2","created_at":"2026-07-05T01:52:36Z"},{"alias_kind":"pith_short_8","alias_value":"FZUYETU3","created_at":"2026-07-05T01:52:36Z"}],"graph_snapshots":[{"event_id":"sha256:6530c1cf41ff6579d7203114ab5812cc131cef140cb86730ae16938578240ebb","target":"graph","created_at":"2026-07-05T01:52:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.00684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Antti Hyttinen, Johan Pensar, Jussi Viinikka, Mikko Koivisto","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-30T08:46:46Z","title":"Towards Scalable Bayesian Learning of Causal DAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00684","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:58e05c87a4715f60fa9a0801c1337d8ddb4e303def78eb220a8080877a6ebda9","target":"record","created_at":"2026-07-05T01:52:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8fc117ffadfeb2b74e80fb065b9b368d6ad79d891b90679502cf72f65492013e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-30T08:46:46Z","title_canon_sha256":"96630a686f3e0cc1e77f6656e6267ec23b93d655f9b3b6ffc0924852cd2899f6"},"schema_version":"1.0","source":{"id":"2010.00684","kind":"arxiv","version":2}},"canonical_sha256":"2e69824e9ba2479090bab2599d94d852fc837fdbf47d45581e676bf824eee8cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e69824e9ba2479090bab2599d94d852fc837fdbf47d45581e676bf824eee8cf","first_computed_at":"2026-07-05T01:52:36.949542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:36.949542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fa9VOZ3tXZY3wdPKb62kAR6ry1hH+1v/qGgKVwLsKngvS4k27Z/K0cVvV6IeZ5Updktq1r24qGK+wjh48scODw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:36.949884Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.00684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58e05c87a4715f60fa9a0801c1337d8ddb4e303def78eb220a8080877a6ebda9","sha256:6530c1cf41ff6579d7203114ab5812cc131cef140cb86730ae16938578240ebb"],"state_sha256":"a6d2b356f2d00222294897c7b56b3356e1e14a151d52a20631a2b8ba13a26228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYp3D/dMkPD1j3UH9cfrzkuqP4Fx4cvC/V77hhen6J16P+Z6sR/GOHM5gTzQntABaSUn5fquBbA8B46Xl9UFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T03:42:43.619883Z","bundle_sha256":"667fed9e3650bd8e33e91e37b28795532e86b358f8eea5608c738bfb880423f3"}}