{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GG3RU7MPTWVEIY5HPSEA62TDCA","short_pith_number":"pith:GG3RU7MP","canonical_record":{"source":{"id":"1704.08676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-27T17:40:22Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"778573f60a03c08dc30d0404662dce8b81d8618014997bf9700e5b1c8b913681","abstract_canon_sha256":"a48593f06cbe3fa5eac73b9ecf7542f3e83ab8b6367be8032c890dd7dcdba778"},"schema_version":"1.0"},"canonical_sha256":"31b71a7d8f9daa4463a77c880f6a6310098996e0829e31a4c15141d47b17d53f","source":{"kind":"arxiv","id":"1704.08676","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08676","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08676v2","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08676","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"GG3RU7MPTWVE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GG3RU7MPTWVEIY5H","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GG3RU7MP","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GG3RU7MPTWVEIY5HPSEA62TDCA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-27T17:40:22Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"778573f60a03c08dc30d0404662dce8b81d8618014997bf9700e5b1c8b913681","abstract_canon_sha256":"a48593f06cbe3fa5eac73b9ecf7542f3e83ab8b6367be8032c890dd7dcdba778"},"schema_version":"1.0"},"canonical_sha256":"31b71a7d8f9daa4463a77c880f6a6310098996e0829e31a4c15141d47b17d53f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:55.378503Z","signature_b64":"4U/KIkC99y5YRSkW3YWScxGIAv5Wk9yngRlRp5c47CGGNVlJFZvgpYKb4O1lgjs5yCNzLibtWEjU9I5zmyqqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31b71a7d8f9daa4463a77c880f6a6310098996e0829e31a4c15141d47b17d53f","last_reissued_at":"2026-05-18T00:08:55.377798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:55.377798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08676","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:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTP8ui4viWUaOxTCBft4A3qaErVfq0GQfx45wuiwFHb2LnzQt6c2EpN4NJUs3vS2kbelMgwtDocY7GEqPDcSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:33:02.194285Z"},"content_sha256":"be4a5dad8607351170d400e5ee80b5f686174e0b61bcd150d1e1d3666d246002","schema_version":"1.0","event_id":"sha256:be4a5dad8607351170d400e5ee80b5f686174e0b61bcd150d1e1d3666d246002"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GG3RU7MPTWVEIY5HPSEA62TDCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning the structure of Bayesian Networks: A quantitative assessment of the effect of different algorithmic schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniele Ramazzotti, Ivo Goncalves, Mauro Castelli, Roberto Henriques, Stefano Beretta","submitted_at":"2017-04-27T17:40:22Z","abstract_excerpt":"One of the most challenging tasks when adopting Bayesian Networks (BNs) is the one of learning their structure from data. This task is complicated by the huge search space of possible solutions, and by the fact that the problem is NP-hard. Hence, full enumeration of all the possible solutions is not always feasible and approximations are often required. However, to the best of our knowledge, a quantitative analysis of the performance and characteristics of the different heuristics to solve this problem has never been done before.\n  For this reason, in this work, we provide a detailed compariso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08676","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:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HigoMIJMs8eGnRlUGckuPXCWUse0qar8zfn3Ov/bDR7p5zOHSKWPqoWUBrTzGQ8e5Ew9xZ+lsStXmSbq9IC0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:33:02.194650Z"},"content_sha256":"9ff9854ce333ec183d964fbe261f8e7a0e21468121540f1fc58ba963bb0d68cb","schema_version":"1.0","event_id":"sha256:9ff9854ce333ec183d964fbe261f8e7a0e21468121540f1fc58ba963bb0d68cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GG3RU7MPTWVEIY5HPSEA62TDCA/bundle.json","state_url":"https://pith.science/pith/GG3RU7MPTWVEIY5HPSEA62TDCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GG3RU7MPTWVEIY5HPSEA62TDCA/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-05-28T04:33:02Z","links":{"resolver":"https://pith.science/pith/GG3RU7MPTWVEIY5HPSEA62TDCA","bundle":"https://pith.science/pith/GG3RU7MPTWVEIY5HPSEA62TDCA/bundle.json","state":"https://pith.science/pith/GG3RU7MPTWVEIY5HPSEA62TDCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GG3RU7MPTWVEIY5HPSEA62TDCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GG3RU7MPTWVEIY5HPSEA62TDCA","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":"a48593f06cbe3fa5eac73b9ecf7542f3e83ab8b6367be8032c890dd7dcdba778","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-27T17:40:22Z","title_canon_sha256":"778573f60a03c08dc30d0404662dce8b81d8618014997bf9700e5b1c8b913681"},"schema_version":"1.0","source":{"id":"1704.08676","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08676","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08676v2","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08676","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"GG3RU7MPTWVE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GG3RU7MPTWVEIY5H","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GG3RU7MP","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:9ff9854ce333ec183d964fbe261f8e7a0e21468121540f1fc58ba963bb0d68cb","target":"graph","created_at":"2026-05-18T00:08:55Z","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":"One of the most challenging tasks when adopting Bayesian Networks (BNs) is the one of learning their structure from data. This task is complicated by the huge search space of possible solutions, and by the fact that the problem is NP-hard. Hence, full enumeration of all the possible solutions is not always feasible and approximations are often required. However, to the best of our knowledge, a quantitative analysis of the performance and characteristics of the different heuristics to solve this problem has never been done before.\n  For this reason, in this work, we provide a detailed compariso","authors_text":"Daniele Ramazzotti, Ivo Goncalves, Mauro Castelli, Roberto Henriques, Stefano Beretta","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-27T17:40:22Z","title":"Learning the structure of Bayesian Networks: A quantitative assessment of the effect of different algorithmic schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08676","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:be4a5dad8607351170d400e5ee80b5f686174e0b61bcd150d1e1d3666d246002","target":"record","created_at":"2026-05-18T00:08:55Z","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":"a48593f06cbe3fa5eac73b9ecf7542f3e83ab8b6367be8032c890dd7dcdba778","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-27T17:40:22Z","title_canon_sha256":"778573f60a03c08dc30d0404662dce8b81d8618014997bf9700e5b1c8b913681"},"schema_version":"1.0","source":{"id":"1704.08676","kind":"arxiv","version":2}},"canonical_sha256":"31b71a7d8f9daa4463a77c880f6a6310098996e0829e31a4c15141d47b17d53f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31b71a7d8f9daa4463a77c880f6a6310098996e0829e31a4c15141d47b17d53f","first_computed_at":"2026-05-18T00:08:55.377798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:55.377798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4U/KIkC99y5YRSkW3YWScxGIAv5Wk9yngRlRp5c47CGGNVlJFZvgpYKb4O1lgjs5yCNzLibtWEjU9I5zmyqqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:55.378503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08676","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4a5dad8607351170d400e5ee80b5f686174e0b61bcd150d1e1d3666d246002","sha256:9ff9854ce333ec183d964fbe261f8e7a0e21468121540f1fc58ba963bb0d68cb"],"state_sha256":"352ffa3e856d95e0a5509b84ce5e2bd98569e309b41d0f2959a143021004d48a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peHDVfanEE8YW0DLknxBfgP2axUID0W/ZBA4HQAuyzcd+eMg33LScxcKybaUCh9Qb9H4EeC6AiHECv9aOHWiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:33:02.196653Z","bundle_sha256":"8376a8864be7cd479b937468a362f82db7f44f22e3fd6b49a2fc170c49bd92f4"}}