{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:32JJAAED6AMFPRKVH7XUWIFOJS","short_pith_number":"pith:32JJAAED","canonical_record":{"source":{"id":"1301.3720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:21:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"035c0a3ddd7cb25763b848558d403329fcbd9a59862073256635bf081f9e13d4","abstract_canon_sha256":"b8baca4215d5d6d9542141b09458f435ae84ff7b7a77bacb27b2906577aa9402"},"schema_version":"1.0"},"canonical_sha256":"de92900083f01857c5553fef4b20ae4cb057722f88b7f37a84e81c258498a32c","source":{"kind":"arxiv","id":"1301.3720","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3720","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3720v2","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3720","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"32JJAAED6AMF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"32JJAAED6AMFPRKV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"32JJAAED","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:32JJAAED6AMFPRKVH7XUWIFOJS","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:21:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"035c0a3ddd7cb25763b848558d403329fcbd9a59862073256635bf081f9e13d4","abstract_canon_sha256":"b8baca4215d5d6d9542141b09458f435ae84ff7b7a77bacb27b2906577aa9402"},"schema_version":"1.0"},"canonical_sha256":"de92900083f01857c5553fef4b20ae4cb057722f88b7f37a84e81c258498a32c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:39.922085Z","signature_b64":"Cg09AYlauv4F2gAsGrKxzzu+6FKEFyeTM7DZv1blKIfzpFUwP00FcIpk9MlUBN7PnYPwSECPzyL9yAiLE4jWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de92900083f01857c5553fef4b20ae4cb057722f88b7f37a84e81c258498a32c","last_reissued_at":"2026-05-18T02:45:39.921525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:39.921525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3720","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-18T02:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocg44rZZJybWF8su+d2VrYYAV/tm+uVTujWmNvC47lG6M0k58pQfHqAjztlmrlzj2wQWjsxc6R3Tc3o1Naq8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:30.926867Z"},"content_sha256":"01dbfb6cf19af3963f0941b43305b29bb9b581b91e47c61ed06f30e7653e1106","schema_version":"1.0","event_id":"sha256:01dbfb6cf19af3963f0941b43305b29bb9b581b91e47c61ed06f30e7653e1106"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:32JJAAED6AMFPRKVH7XUWIFOJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The IBMAP approach for Markov networks structure learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alejandro Edera, Facundo Bromberg, Federico Schl\\\"uter","submitted_at":"2013-01-16T15:21:19Z","abstract_excerpt":"In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for avoiding important limitations of existing independence-based algorithms. These algorithms proceed by performing statistical independence tests on data, trusting completely the outcome of each test. In practice tests may be incorrect, resulting in potential cascading errors and the consequent reduction in the quality of the structures learned. IBM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3720","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-18T02:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GV0qFGDXDSBEKt5mHDfAi9L7Es6TBqQJD1Biv5SPPcbwyDkyt1f0cckUhYO9/ci6De1Ms7ArYcrLKTDK2wp9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:30.927215Z"},"content_sha256":"48f5389fe5f2617963994fb82d66ea2862aeb8a48ccd63a51882013f9c20b8ac","schema_version":"1.0","event_id":"sha256:48f5389fe5f2617963994fb82d66ea2862aeb8a48ccd63a51882013f9c20b8ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32JJAAED6AMFPRKVH7XUWIFOJS/bundle.json","state_url":"https://pith.science/pith/32JJAAED6AMFPRKVH7XUWIFOJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32JJAAED6AMFPRKVH7XUWIFOJS/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-02T19:24:30Z","links":{"resolver":"https://pith.science/pith/32JJAAED6AMFPRKVH7XUWIFOJS","bundle":"https://pith.science/pith/32JJAAED6AMFPRKVH7XUWIFOJS/bundle.json","state":"https://pith.science/pith/32JJAAED6AMFPRKVH7XUWIFOJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32JJAAED6AMFPRKVH7XUWIFOJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:32JJAAED6AMFPRKVH7XUWIFOJS","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":"b8baca4215d5d6d9542141b09458f435ae84ff7b7a77bacb27b2906577aa9402","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:21:19Z","title_canon_sha256":"035c0a3ddd7cb25763b848558d403329fcbd9a59862073256635bf081f9e13d4"},"schema_version":"1.0","source":{"id":"1301.3720","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3720","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3720v2","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3720","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"32JJAAED6AMF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"32JJAAED6AMFPRKV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"32JJAAED","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:48f5389fe5f2617963994fb82d66ea2862aeb8a48ccd63a51882013f9c20b8ac","target":"graph","created_at":"2026-05-18T02:45:39Z","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":"In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for avoiding important limitations of existing independence-based algorithms. These algorithms proceed by performing statistical independence tests on data, trusting completely the outcome of each test. In practice tests may be incorrect, resulting in potential cascading errors and the consequent reduction in the quality of the structures learned. IBM","authors_text":"Alejandro Edera, Facundo Bromberg, Federico Schl\\\"uter","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:21:19Z","title":"The IBMAP approach for Markov networks structure learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3720","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:01dbfb6cf19af3963f0941b43305b29bb9b581b91e47c61ed06f30e7653e1106","target":"record","created_at":"2026-05-18T02:45:39Z","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":"b8baca4215d5d6d9542141b09458f435ae84ff7b7a77bacb27b2906577aa9402","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:21:19Z","title_canon_sha256":"035c0a3ddd7cb25763b848558d403329fcbd9a59862073256635bf081f9e13d4"},"schema_version":"1.0","source":{"id":"1301.3720","kind":"arxiv","version":2}},"canonical_sha256":"de92900083f01857c5553fef4b20ae4cb057722f88b7f37a84e81c258498a32c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de92900083f01857c5553fef4b20ae4cb057722f88b7f37a84e81c258498a32c","first_computed_at":"2026-05-18T02:45:39.921525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:39.921525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cg09AYlauv4F2gAsGrKxzzu+6FKEFyeTM7DZv1blKIfzpFUwP00FcIpk9MlUBN7PnYPwSECPzyL9yAiLE4jWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:39.922085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3720","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01dbfb6cf19af3963f0941b43305b29bb9b581b91e47c61ed06f30e7653e1106","sha256:48f5389fe5f2617963994fb82d66ea2862aeb8a48ccd63a51882013f9c20b8ac"],"state_sha256":"5b1a8ec7008cf27b857da0c88aad619ea18058280c6efe073e304cd817381280"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ssgi3ODkXyBRsmbRti9FbdpgFUSFoocNzkHjv5EZFWAApYr42ZhYy/KD4bwCGUuR+fcWM/fd4sVxxmRyx754DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:24:30.929536Z","bundle_sha256":"201f8ebc52a94fbee2133faa6c36edda34b27a40e28061393da925757b51b772"}}