{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5FFOBT6PV2WC6K6HV7HXFCUNQE","short_pith_number":"pith:5FFOBT6P","canonical_record":{"source":{"id":"1212.2517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:08:06Z","cross_cats_sorted":["cs.CE","stat.ML"],"title_canon_sha256":"42aa60e2b8e2d1fb891172e95e2ae12a78980fedf825d50eaf6da774c1adc503","abstract_canon_sha256":"9e9b08c3036020b451463469c1fee39506d2f1e1996f3906a912bf42cb886201"},"schema_version":"1.0"},"canonical_sha256":"e94ae0cfcfaeac2f2bc7afcf728a8d810a202064805d77eca69beb9d2d22e13e","source":{"kind":"arxiv","id":"1212.2517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2517","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2517v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2517","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"5FFOBT6PV2WC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5FFOBT6PV2WC6K6H","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5FFOBT6P","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5FFOBT6PV2WC6K6HV7HXFCUNQE","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:08:06Z","cross_cats_sorted":["cs.CE","stat.ML"],"title_canon_sha256":"42aa60e2b8e2d1fb891172e95e2ae12a78980fedf825d50eaf6da774c1adc503","abstract_canon_sha256":"9e9b08c3036020b451463469c1fee39506d2f1e1996f3906a912bf42cb886201"},"schema_version":"1.0"},"canonical_sha256":"e94ae0cfcfaeac2f2bc7afcf728a8d810a202064805d77eca69beb9d2d22e13e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.374008Z","signature_b64":"JxkfW6mb9vXlfRTTskF7asIdiEyF6byO0z4AarjCRKrTUs89ttSyKorKhOO4zWeFluIO9eUW3NVdpCYaRbC2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e94ae0cfcfaeac2f2bc7afcf728a8d810a202064805d77eca69beb9d2d22e13e","last_reissued_at":"2026-05-18T03:38:44.373513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.373513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2517","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeBSwcawVczdS6Tqk57b4nRHW2hI/SjwmIrYh0hPOKI2eCH1OLz46v8C9re0EplnoZ130wi7DsiunqsTWjYVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:33:03.364737Z"},"content_sha256":"d7ceba795aa5927bdd5921febc5e260298a18f9148f5a576024596b498340071","schema_version":"1.0","event_id":"sha256:d7ceba795aa5927bdd5921febc5e260298a18f9148f5a576024596b498340071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5FFOBT6PV2WC6K6HV7HXFCUNQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Module Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aviv Regev, Dana Pe'er, Daphne Koller, Eran Segal, Nir Friedman","submitted_at":"2012-10-19T15:08:06Z","abstract_excerpt":"Methods for learning Bayesian network structure can discover dependency     structure between observed variables, and have been shown to be useful in many     applications. However, in domains that involve a large number of variables, the     space of possible network structures is enormous, making it difficult, for both     computational and statistical reasons, to identify a good model. In this paper,     we consider a solution to this problem, suitable for domains where many     variables have similar behavior. Our method is based on a new class of models,     which we call module networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2517","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qZTX+TdPnqHdVZDxGLuM7VQR04BfXM0wzLizQ79+OQ3ZWWVmhqpWyGarTOsSbGt3c5qubhri23T1RUyqHAoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:33:03.365100Z"},"content_sha256":"8e851cbf60fd44e93f6f9098811d56f0dfc850f1f39ec0ad0ea7483bd3334124","schema_version":"1.0","event_id":"sha256:8e851cbf60fd44e93f6f9098811d56f0dfc850f1f39ec0ad0ea7483bd3334124"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE/bundle.json","state_url":"https://pith.science/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE/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-01T17:33:03Z","links":{"resolver":"https://pith.science/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE","bundle":"https://pith.science/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE/bundle.json","state":"https://pith.science/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FFOBT6PV2WC6K6HV7HXFCUNQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5FFOBT6PV2WC6K6HV7HXFCUNQE","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":"9e9b08c3036020b451463469c1fee39506d2f1e1996f3906a912bf42cb886201","cross_cats_sorted":["cs.CE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:08:06Z","title_canon_sha256":"42aa60e2b8e2d1fb891172e95e2ae12a78980fedf825d50eaf6da774c1adc503"},"schema_version":"1.0","source":{"id":"1212.2517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2517","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2517v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2517","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"5FFOBT6PV2WC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5FFOBT6PV2WC6K6H","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5FFOBT6P","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:8e851cbf60fd44e93f6f9098811d56f0dfc850f1f39ec0ad0ea7483bd3334124","target":"graph","created_at":"2026-05-18T03:38:44Z","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":"Methods for learning Bayesian network structure can discover dependency     structure between observed variables, and have been shown to be useful in many     applications. However, in domains that involve a large number of variables, the     space of possible network structures is enormous, making it difficult, for both     computational and statistical reasons, to identify a good model. In this paper,     we consider a solution to this problem, suitable for domains where many     variables have similar behavior. Our method is based on a new class of models,     which we call module networks.","authors_text":"Aviv Regev, Dana Pe'er, Daphne Koller, Eran Segal, Nir Friedman","cross_cats":["cs.CE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:08:06Z","title":"Learning Module Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2517","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:d7ceba795aa5927bdd5921febc5e260298a18f9148f5a576024596b498340071","target":"record","created_at":"2026-05-18T03:38:44Z","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":"9e9b08c3036020b451463469c1fee39506d2f1e1996f3906a912bf42cb886201","cross_cats_sorted":["cs.CE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:08:06Z","title_canon_sha256":"42aa60e2b8e2d1fb891172e95e2ae12a78980fedf825d50eaf6da774c1adc503"},"schema_version":"1.0","source":{"id":"1212.2517","kind":"arxiv","version":1}},"canonical_sha256":"e94ae0cfcfaeac2f2bc7afcf728a8d810a202064805d77eca69beb9d2d22e13e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e94ae0cfcfaeac2f2bc7afcf728a8d810a202064805d77eca69beb9d2d22e13e","first_computed_at":"2026-05-18T03:38:44.373513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:44.373513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxkfW6mb9vXlfRTTskF7asIdiEyF6byO0z4AarjCRKrTUs89ttSyKorKhOO4zWeFluIO9eUW3NVdpCYaRbC2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:44.374008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7ceba795aa5927bdd5921febc5e260298a18f9148f5a576024596b498340071","sha256:8e851cbf60fd44e93f6f9098811d56f0dfc850f1f39ec0ad0ea7483bd3334124"],"state_sha256":"eb6be62116def9d36a8da3235fa12353c978eed2c837f76ce02cfc8d0a517e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LV4sdX10OBGG8czA6OiR2K8tHVv7YlTVs0atIVaikSifjqcvpFkZ9Bcp6Y+uxKn/+k/f4QOuO/vwi1pnolp3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:33:03.367096Z","bundle_sha256":"d6e5c15ce9b6e773082ef828e621c7a9eacd4f4a8b1d51f7e020579ba9169a11"}}