{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PJC4EIMSZQGFPFKTRZ7VAD2KH3","short_pith_number":"pith:PJC4EIMS","canonical_record":{"source":{"id":"1312.4710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T10:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"57b5691b93986e246b8c09abcebd8c0a36305f06274f216ecff25dd5054b98a5","abstract_canon_sha256":"ee83b91513df1d84b44148a868bf231ea20f88f1f79f892718acac18ab124f35"},"schema_version":"1.0"},"canonical_sha256":"7a45c22192cc0c5795538e7f500f4a3efb643f9ae1454f318271a41761ca3630","source":{"kind":"arxiv","id":"1312.4710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4710","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4710v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4710","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"PJC4EIMSZQGF","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PJC4EIMSZQGFPFKT","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PJC4EIMS","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PJC4EIMSZQGFPFKTRZ7VAD2KH3","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T10:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"57b5691b93986e246b8c09abcebd8c0a36305f06274f216ecff25dd5054b98a5","abstract_canon_sha256":"ee83b91513df1d84b44148a868bf231ea20f88f1f79f892718acac18ab124f35"},"schema_version":"1.0"},"canonical_sha256":"7a45c22192cc0c5795538e7f500f4a3efb643f9ae1454f318271a41761ca3630","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.298642Z","signature_b64":"xzzBipob8lRcKCOn4XuDs/fo6ZiEFePQ8BVRLk+vniwwrL4NdqCfjf4Ino8UeMWpITdGIJVAEopAaj98+X65Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a45c22192cc0c5795538e7f500f4a3efb643f9ae1454f318271a41761ca3630","last_reissued_at":"2026-05-18T03:04:23.298277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.298277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4710","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpTCk+ZK5MYuF4J+Z8XOu0+PxWgkAi6WRRzMqQbHayiCyWl+P6Jm1mFgxXWQFRoXYXPdWka9G0gCQpfeuFLqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:29:22.393402Z"},"content_sha256":"c7b519a5c5797c6b4c33a68695c639d973160f01a433f832017d3e41b3a4b59d","schema_version":"1.0","event_id":"sha256:c7b519a5c5797c6b4c33a68695c639d973160f01a433f832017d3e41b3a4b59d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PJC4EIMSZQGFPFKTRZ7VAD2KH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Network Structure Learning via Ensemble-of-Forests Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Eirini Arvaniti, Manfred Claassen","submitted_at":"2013-12-17T10:26:02Z","abstract_excerpt":"Real world systems typically feature a variety of different dependency types and topologies that complicate model selection for probabilistic graphical models. We introduce the ensemble-of-forests model, a generalization of the ensemble-of-trees model. Our model enables structure learning of Markov random fields (MRF) with multiple connected components and arbitrary potentials. We present two approximate inference techniques for this model and demonstrate their performance on synthetic data. Our results suggest that the ensemble-of-forests approach can accurately recover sparse, possibly disco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4710","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1tuykZ6blizeqDhliDrpNrc1giwT95dCoy6dx7RPtYitKfHkbeLqYAxvfXyBKLvIuHo6Og16ykqmMjIp7vKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:29:22.393747Z"},"content_sha256":"b64db92dcf6e3d357098b7e350de1ca2a62d4a6fb58b3a6e43603b893bef5e33","schema_version":"1.0","event_id":"sha256:b64db92dcf6e3d357098b7e350de1ca2a62d4a6fb58b3a6e43603b893bef5e33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3/bundle.json","state_url":"https://pith.science/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3/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-26T12:29:22Z","links":{"resolver":"https://pith.science/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3","bundle":"https://pith.science/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3/bundle.json","state":"https://pith.science/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJC4EIMSZQGFPFKTRZ7VAD2KH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PJC4EIMSZQGFPFKTRZ7VAD2KH3","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":"ee83b91513df1d84b44148a868bf231ea20f88f1f79f892718acac18ab124f35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T10:26:02Z","title_canon_sha256":"57b5691b93986e246b8c09abcebd8c0a36305f06274f216ecff25dd5054b98a5"},"schema_version":"1.0","source":{"id":"1312.4710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4710","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4710v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4710","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"PJC4EIMSZQGF","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PJC4EIMSZQGFPFKT","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PJC4EIMS","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b64db92dcf6e3d357098b7e350de1ca2a62d4a6fb58b3a6e43603b893bef5e33","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"Real world systems typically feature a variety of different dependency types and topologies that complicate model selection for probabilistic graphical models. We introduce the ensemble-of-forests model, a generalization of the ensemble-of-trees model. Our model enables structure learning of Markov random fields (MRF) with multiple connected components and arbitrary potentials. We present two approximate inference techniques for this model and demonstrate their performance on synthetic data. Our results suggest that the ensemble-of-forests approach can accurately recover sparse, possibly disco","authors_text":"Eirini Arvaniti, Manfred Claassen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T10:26:02Z","title":"Markov Network Structure Learning via Ensemble-of-Forests Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4710","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:c7b519a5c5797c6b4c33a68695c639d973160f01a433f832017d3e41b3a4b59d","target":"record","created_at":"2026-05-18T03:04:23Z","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":"ee83b91513df1d84b44148a868bf231ea20f88f1f79f892718acac18ab124f35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T10:26:02Z","title_canon_sha256":"57b5691b93986e246b8c09abcebd8c0a36305f06274f216ecff25dd5054b98a5"},"schema_version":"1.0","source":{"id":"1312.4710","kind":"arxiv","version":1}},"canonical_sha256":"7a45c22192cc0c5795538e7f500f4a3efb643f9ae1454f318271a41761ca3630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a45c22192cc0c5795538e7f500f4a3efb643f9ae1454f318271a41761ca3630","first_computed_at":"2026-05-18T03:04:23.298277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.298277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xzzBipob8lRcKCOn4XuDs/fo6ZiEFePQ8BVRLk+vniwwrL4NdqCfjf4Ino8UeMWpITdGIJVAEopAaj98+X65Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.298642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7b519a5c5797c6b4c33a68695c639d973160f01a433f832017d3e41b3a4b59d","sha256:b64db92dcf6e3d357098b7e350de1ca2a62d4a6fb58b3a6e43603b893bef5e33"],"state_sha256":"5826b4e986e7e2365eecd2a33d4f4f4d697434f59f48b656bb1a5099f86a8190"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WQBZFyLMSI8TrnDrM9fqS/Ntmfnl2iKmtCE8oYX9fGCPqYC3nNCxe/0NmLLDzJQCHQn+aNTRwxNCNfGssbPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:29:22.395640Z","bundle_sha256":"4cdb61f257c707dd0220f134ea6e2ac645c534f911fd04fd5b4669df29ee1fa2"}}