{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QP5IUWORN4XBY6Z7MG5CSHNIJ2","short_pith_number":"pith:QP5IUWOR","canonical_record":{"source":{"id":"1406.7648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-30T09:56:20Z","cross_cats_sorted":["cs.AI","cs.MS","stat.ME"],"title_canon_sha256":"6f1b1807a3f302b4d0c72b2be794ee3cecf07cd52f90e9755cc8b1380be43590","abstract_canon_sha256":"94458144e337143fe267bebe8266ea9abad24ac26cc7982dfdc627838df8e6da"},"schema_version":"1.0"},"canonical_sha256":"83fa8a59d16f2e1c7b3f61ba291da84eb7ea9e48a1693eab42535ef303e9f844","source":{"kind":"arxiv","id":"1406.7648","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7648","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7648v2","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7648","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"QP5IUWORN4XB","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QP5IUWORN4XBY6Z7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QP5IUWOR","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QP5IUWORN4XBY6Z7MG5CSHNIJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-30T09:56:20Z","cross_cats_sorted":["cs.AI","cs.MS","stat.ME"],"title_canon_sha256":"6f1b1807a3f302b4d0c72b2be794ee3cecf07cd52f90e9755cc8b1380be43590","abstract_canon_sha256":"94458144e337143fe267bebe8266ea9abad24ac26cc7982dfdc627838df8e6da"},"schema_version":"1.0"},"canonical_sha256":"83fa8a59d16f2e1c7b3f61ba291da84eb7ea9e48a1693eab42535ef303e9f844","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:26.600124Z","signature_b64":"NoLPCnVeXQC+YJwvA4pZPfARf1y7epQOpPmGd8yEjlvOj8lRZF6lYWX0xCL8P41izRvgCOwvdlGgxvoBAD90Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83fa8a59d16f2e1c7b3f61ba291da84eb7ea9e48a1693eab42535ef303e9f844","last_reissued_at":"2026-05-18T00:46:26.599671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:26.599671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7648","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-05-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DDRBaOZ6wfe/C2cewCCG/GtcM2cptKVO5cDTvJ2Tjd1uVnnVhr0qpoWMCjB9127evSAbCpAXGNSnJHPeg80BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:59:43.612753Z"},"content_sha256":"a39c38c9adfff7f084ef419ea059e89ac9c269a42a0a6d07e5a88a2d64e8d237","schema_version":"1.0","event_id":"sha256:a39c38c9adfff7f084ef419ea059e89ac9c269a42a0a6d07e5a88a2d64e8d237"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QP5IUWORN4XBY6Z7MG5CSHNIJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Network Constraint-Based Structure Learning Algorithms: Parallel and Optimised Implementations in the bnlearn R Package","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MS","stat.ME"],"primary_cat":"stat.CO","authors_text":"Marco Scutari","submitted_at":"2014-06-30T09:56:20Z","abstract_excerpt":"It is well known in the literature that the problem of learning the structure of Bayesian networks is very hard to tackle: its computational complexity is super-exponential in the number of nodes in the worst case and polynomial in most real-world scenarios.\n  Efficient implementations of score-based structure learning benefit from past and current research in optimisation theory, which can be adapted to the task by using the network score as the objective function to maximise. This is not true for approaches based on conditional independence tests, called constraint-based learning algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7648","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":""},"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-05-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvGgyClP2N0JlQyh1JdxRvIx/7Yr5EAbjka4mnr+vTZ+p8ml6c553rj8bgRK3pz9gHjebhXtVA0DAKfxSk2cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:59:43.613100Z"},"content_sha256":"2b598b6bd8886bdc6a0d92df3e7dfa6939e6c512c7f9f042483d9f6d6f42efa3","schema_version":"1.0","event_id":"sha256:2b598b6bd8886bdc6a0d92df3e7dfa6939e6c512c7f9f042483d9f6d6f42efa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2/bundle.json","state_url":"https://pith.science/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2/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-06-03T19:59:43Z","links":{"resolver":"https://pith.science/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2","bundle":"https://pith.science/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2/bundle.json","state":"https://pith.science/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP5IUWORN4XBY6Z7MG5CSHNIJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QP5IUWORN4XBY6Z7MG5CSHNIJ2","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":"94458144e337143fe267bebe8266ea9abad24ac26cc7982dfdc627838df8e6da","cross_cats_sorted":["cs.AI","cs.MS","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-30T09:56:20Z","title_canon_sha256":"6f1b1807a3f302b4d0c72b2be794ee3cecf07cd52f90e9755cc8b1380be43590"},"schema_version":"1.0","source":{"id":"1406.7648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7648","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7648v2","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7648","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"QP5IUWORN4XB","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QP5IUWORN4XBY6Z7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QP5IUWOR","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:2b598b6bd8886bdc6a0d92df3e7dfa6939e6c512c7f9f042483d9f6d6f42efa3","target":"graph","created_at":"2026-05-18T00:46:26Z","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"},"paper":{"abstract_excerpt":"It is well known in the literature that the problem of learning the structure of Bayesian networks is very hard to tackle: its computational complexity is super-exponential in the number of nodes in the worst case and polynomial in most real-world scenarios.\n  Efficient implementations of score-based structure learning benefit from past and current research in optimisation theory, which can be adapted to the task by using the network score as the objective function to maximise. This is not true for approaches based on conditional independence tests, called constraint-based learning algorithms.","authors_text":"Marco Scutari","cross_cats":["cs.AI","cs.MS","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-30T09:56:20Z","title":"Bayesian Network Constraint-Based Structure Learning Algorithms: Parallel and Optimised Implementations in the bnlearn R Package"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7648","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:a39c38c9adfff7f084ef419ea059e89ac9c269a42a0a6d07e5a88a2d64e8d237","target":"record","created_at":"2026-05-18T00:46:26Z","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":"94458144e337143fe267bebe8266ea9abad24ac26cc7982dfdc627838df8e6da","cross_cats_sorted":["cs.AI","cs.MS","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-30T09:56:20Z","title_canon_sha256":"6f1b1807a3f302b4d0c72b2be794ee3cecf07cd52f90e9755cc8b1380be43590"},"schema_version":"1.0","source":{"id":"1406.7648","kind":"arxiv","version":2}},"canonical_sha256":"83fa8a59d16f2e1c7b3f61ba291da84eb7ea9e48a1693eab42535ef303e9f844","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83fa8a59d16f2e1c7b3f61ba291da84eb7ea9e48a1693eab42535ef303e9f844","first_computed_at":"2026-05-18T00:46:26.599671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:26.599671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NoLPCnVeXQC+YJwvA4pZPfARf1y7epQOpPmGd8yEjlvOj8lRZF6lYWX0xCL8P41izRvgCOwvdlGgxvoBAD90Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:26.600124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a39c38c9adfff7f084ef419ea059e89ac9c269a42a0a6d07e5a88a2d64e8d237","sha256:2b598b6bd8886bdc6a0d92df3e7dfa6939e6c512c7f9f042483d9f6d6f42efa3"],"state_sha256":"0687258269a8fb9d1370ad22a12bde49584eb1693c146c37f0ded1888d452d2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yOFErvNUHyFsb0D1sc5on62RFo/Kou9q+nBV1h9fyr5Py3VcMazF71cHLmfF532EYSkKqj4uBRYHeZlJfE4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:59:43.615092Z","bundle_sha256":"8b000c22683c0dda4e122265e63a9c4aa6ef2070aa280f665a03fbf0b14b204d"}}