{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HW3CJRCVBSUOOFO5ZEKDQ5Y6P3","short_pith_number":"pith:HW3CJRCV","canonical_record":{"source":{"id":"1301.6696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:58:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e226157f1567229ec472d085c4466fa72bf24f75ae6c8b62aab33ed530980a9d","abstract_canon_sha256":"9b3ffe9cc7e1939094b4fe017ebe93b446cc51011821e88573f2406b85afe0da"},"schema_version":"1.0"},"canonical_sha256":"3db624c4550ca8e715ddc91438771e7ee0d267666a4c295da495349da2e38fb7","source":{"kind":"arxiv","id":"1301.6696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6696","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6696v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6696","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"HW3CJRCVBSUO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HW3CJRCVBSUOOFO5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HW3CJRCV","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HW3CJRCVBSUOOFO5ZEKDQ5Y6P3","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:58:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e226157f1567229ec472d085c4466fa72bf24f75ae6c8b62aab33ed530980a9d","abstract_canon_sha256":"9b3ffe9cc7e1939094b4fe017ebe93b446cc51011821e88573f2406b85afe0da"},"schema_version":"1.0"},"canonical_sha256":"3db624c4550ca8e715ddc91438771e7ee0d267666a4c295da495349da2e38fb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.934015Z","signature_b64":"lPmdaPCOvreoCTtq1S3rICNPqJ6o8AqIC9QoiS9OWufHpiULzKvgqb83HFx/R1WEVIcVVa/4KFJG0y32I3dLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db624c4550ca8e715ddc91438771e7ee0d267666a4c295da495349da2e38fb7","last_reissued_at":"2026-05-18T03:35:12.933302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.933302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6696","source_version":1,"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-18T03:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCtCHJKh5FTp0V1hMuyhKR2qjx7H7yC2H3V8KRyhQT7V8G2giDEO60HutTBTJrkDks4OKQmpveo8qpn7Wa73Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:01:02.851992Z"},"content_sha256":"59cf4f9b4286fa3a8da8eb7cdf2444a8d7bf1ae2ca16a6125bd45bfc5c5a8710","schema_version":"1.0","event_id":"sha256:59cf4f9b4286fa3a8da8eb7cdf2444a8d7bf1ae2ca16a6125bd45bfc5c5a8710"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HW3CJRCVBSUOOFO5ZEKDQ5Y6P3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Bayesian Network Structure from Massive Datasets: The \"Sparse Candidate\" Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dana Pe'er, Iftach Nachman, Nir Friedman","submitted_at":"2013-01-23T15:58:05Z","abstract_excerpt":"Learning Bayesian networks is often cast as an optimization problem, where the computational task is to find a structure that maximizes a statistically motivated score.  By and large, existing learning tools address this optimization problem using standard heuristic search techniques.  Since the search space is extremely large, such search procedures can spend most of the time examining candidates that are extremely unreasonable. This problem becomes critical when we deal with data sets that are large either in the number of instances, or the number of attributes.   In this paper, we introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6696","kind":"arxiv","version":1},"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-18T03:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtKTpg2CzLWmCqm2wUbqHKSsjDy9WCCLFooO2E28V9xmzqVvPskS5KbRZv6YtenfUmJGonXw6tcTSaihs0XgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:01:02.852388Z"},"content_sha256":"40726dabf4fd4f081118dfadafdcee3985c4113c6c82c7e49192d0604f1755e6","schema_version":"1.0","event_id":"sha256:40726dabf4fd4f081118dfadafdcee3985c4113c6c82c7e49192d0604f1755e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3/bundle.json","state_url":"https://pith.science/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3/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-29T17:01:02Z","links":{"resolver":"https://pith.science/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3","bundle":"https://pith.science/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3/bundle.json","state":"https://pith.science/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HW3CJRCVBSUOOFO5ZEKDQ5Y6P3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HW3CJRCVBSUOOFO5ZEKDQ5Y6P3","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":"9b3ffe9cc7e1939094b4fe017ebe93b446cc51011821e88573f2406b85afe0da","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:58:05Z","title_canon_sha256":"e226157f1567229ec472d085c4466fa72bf24f75ae6c8b62aab33ed530980a9d"},"schema_version":"1.0","source":{"id":"1301.6696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6696","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6696v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6696","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"HW3CJRCVBSUO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HW3CJRCVBSUOOFO5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HW3CJRCV","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:40726dabf4fd4f081118dfadafdcee3985c4113c6c82c7e49192d0604f1755e6","target":"graph","created_at":"2026-05-18T03:35:12Z","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":"Learning Bayesian networks is often cast as an optimization problem, where the computational task is to find a structure that maximizes a statistically motivated score.  By and large, existing learning tools address this optimization problem using standard heuristic search techniques.  Since the search space is extremely large, such search procedures can spend most of the time examining candidates that are extremely unreasonable. This problem becomes critical when we deal with data sets that are large either in the number of instances, or the number of attributes.   In this paper, we introduce","authors_text":"Dana Pe'er, Iftach Nachman, Nir Friedman","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:58:05Z","title":"Learning Bayesian Network Structure from Massive Datasets: The \"Sparse Candidate\" Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6696","kind":"arxiv","version":1},"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:59cf4f9b4286fa3a8da8eb7cdf2444a8d7bf1ae2ca16a6125bd45bfc5c5a8710","target":"record","created_at":"2026-05-18T03:35:12Z","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":"9b3ffe9cc7e1939094b4fe017ebe93b446cc51011821e88573f2406b85afe0da","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:58:05Z","title_canon_sha256":"e226157f1567229ec472d085c4466fa72bf24f75ae6c8b62aab33ed530980a9d"},"schema_version":"1.0","source":{"id":"1301.6696","kind":"arxiv","version":1}},"canonical_sha256":"3db624c4550ca8e715ddc91438771e7ee0d267666a4c295da495349da2e38fb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3db624c4550ca8e715ddc91438771e7ee0d267666a4c295da495349da2e38fb7","first_computed_at":"2026-05-18T03:35:12.933302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.933302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lPmdaPCOvreoCTtq1S3rICNPqJ6o8AqIC9QoiS9OWufHpiULzKvgqb83HFx/R1WEVIcVVa/4KFJG0y32I3dLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.934015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59cf4f9b4286fa3a8da8eb7cdf2444a8d7bf1ae2ca16a6125bd45bfc5c5a8710","sha256:40726dabf4fd4f081118dfadafdcee3985c4113c6c82c7e49192d0604f1755e6"],"state_sha256":"ab37ad74350f0f65970bcd7b8276dd51060c3e0b554934bb483e20714a742179"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+hcsD/RAf7HQnyCHv3IPpahGdtUSKz7WMuCVUzkCLi1lPHan34o1z9jMkvYrRqUoJ8052CxdV3BEqH+3KrFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:01:02.855051Z","bundle_sha256":"809d51bc38285036c4a03a4665a1ba683fb70c86f076898428e2a0ba43bf9af1"}}