{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KCV63NMAT6YWRUJYBJX7LNLKQ6","short_pith_number":"pith:KCV63NMA","canonical_record":{"source":{"id":"1101.3381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-01-18T04:10:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b76a30369b471be1446aef123a085946b5347c9b37038e1fc38e955816f79b1a","abstract_canon_sha256":"fbab5e19f491f477c75e1d23b3c1034a2fbbbbbe65584c58a4c58c665422a2cc"},"schema_version":"1.0"},"canonical_sha256":"50abedb5809fb168d1380a6ff5b56a878fdbd2ee98163e66cff8d98e31368bb5","source":{"kind":"arxiv","id":"1101.3381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3381","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3381v1","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3381","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"KCV63NMAT6YW","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KCV63NMAT6YWRUJY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KCV63NMA","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KCV63NMAT6YWRUJYBJX7LNLKQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-01-18T04:10:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b76a30369b471be1446aef123a085946b5347c9b37038e1fc38e955816f79b1a","abstract_canon_sha256":"fbab5e19f491f477c75e1d23b3c1034a2fbbbbbe65584c58a4c58c665422a2cc"},"schema_version":"1.0"},"canonical_sha256":"50abedb5809fb168d1380a6ff5b56a878fdbd2ee98163e66cff8d98e31368bb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:51.835929Z","signature_b64":"5vk6mF2QXGS/TyRVELhbCst3dWbXq6ZH+RzyHpXjMN/EICO7tb2/WSRKe3hFjAv6MpekILazyf2d7gnYKbivAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50abedb5809fb168d1380a6ff5b56a878fdbd2ee98163e66cff8d98e31368bb5","last_reissued_at":"2026-05-18T02:22:51.835494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:51.835494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3381","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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iT82qNsU6Z1rergekvLgXa6KT7nEgoR49a25A7d4pj1bSAgEJAuv+JNopHtbyS3ZKZmuwsnqWXJGR1IjDcXdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:28:09.328334Z"},"content_sha256":"5f22654305178e7ba9c60bf3b537f6134265dff8affa9babaf9f76cc750ee5e9","schema_version":"1.0","event_id":"sha256:5f22654305178e7ba9c60bf3b537f6134265dff8affa9babaf9f76cc750ee5e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KCV63NMAT6YWRUJYBJX7LNLKQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Independence-Based MAP Approach for Robust Markov Networks Structure Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.AI","authors_text":"Facundo Bromberg, Federico Schl\\\"uter","submitted_at":"2011-01-18T04:10:01Z","abstract_excerpt":"This work introduces the IB-score, a family of independence-based score functions for robust learning of Markov networks independence structures. Markov networks are a widely used graphical representation of probability distributions, with many applications in several fields of science. The main advantage of the IB-score is the possibility of computing it without the need of estimation of the numerical parameters, an NP-hard problem, usually solved through an approximate, data-intensive, iterative optimization. We derive a formal expression for the IB-score from first principles, mainly maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3381","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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ki2xQFCxEkt5dNhav2LOlUcF57cX7Rk+7iCCwf+83ZYrpsC7LdUqEGHwlpcEUJiZ0JkAjN/HCP+8QNludxsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:28:09.328691Z"},"content_sha256":"ae88da4e109de39997339ceab8fa08c8538e59de13049f5ec180a8d4158df9bc","schema_version":"1.0","event_id":"sha256:ae88da4e109de39997339ceab8fa08c8538e59de13049f5ec180a8d4158df9bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6/bundle.json","state_url":"https://pith.science/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6/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-03T14:28:09Z","links":{"resolver":"https://pith.science/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6","bundle":"https://pith.science/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6/bundle.json","state":"https://pith.science/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCV63NMAT6YWRUJYBJX7LNLKQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KCV63NMAT6YWRUJYBJX7LNLKQ6","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":"fbab5e19f491f477c75e1d23b3c1034a2fbbbbbe65584c58a4c58c665422a2cc","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-01-18T04:10:01Z","title_canon_sha256":"b76a30369b471be1446aef123a085946b5347c9b37038e1fc38e955816f79b1a"},"schema_version":"1.0","source":{"id":"1101.3381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3381","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3381v1","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3381","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"KCV63NMAT6YW","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KCV63NMAT6YWRUJY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KCV63NMA","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:ae88da4e109de39997339ceab8fa08c8538e59de13049f5ec180a8d4158df9bc","target":"graph","created_at":"2026-05-18T02:22:51Z","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":"This work introduces the IB-score, a family of independence-based score functions for robust learning of Markov networks independence structures. Markov networks are a widely used graphical representation of probability distributions, with many applications in several fields of science. The main advantage of the IB-score is the possibility of computing it without the need of estimation of the numerical parameters, an NP-hard problem, usually solved through an approximate, data-intensive, iterative optimization. We derive a formal expression for the IB-score from first principles, mainly maximu","authors_text":"Facundo Bromberg, Federico Schl\\\"uter","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-01-18T04:10:01Z","title":"Efficient Independence-Based MAP Approach for Robust Markov Networks Structure Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3381","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:5f22654305178e7ba9c60bf3b537f6134265dff8affa9babaf9f76cc750ee5e9","target":"record","created_at":"2026-05-18T02:22:51Z","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":"fbab5e19f491f477c75e1d23b3c1034a2fbbbbbe65584c58a4c58c665422a2cc","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-01-18T04:10:01Z","title_canon_sha256":"b76a30369b471be1446aef123a085946b5347c9b37038e1fc38e955816f79b1a"},"schema_version":"1.0","source":{"id":"1101.3381","kind":"arxiv","version":1}},"canonical_sha256":"50abedb5809fb168d1380a6ff5b56a878fdbd2ee98163e66cff8d98e31368bb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50abedb5809fb168d1380a6ff5b56a878fdbd2ee98163e66cff8d98e31368bb5","first_computed_at":"2026-05-18T02:22:51.835494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:51.835494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vk6mF2QXGS/TyRVELhbCst3dWbXq6ZH+RzyHpXjMN/EICO7tb2/WSRKe3hFjAv6MpekILazyf2d7gnYKbivAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:51.835929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f22654305178e7ba9c60bf3b537f6134265dff8affa9babaf9f76cc750ee5e9","sha256:ae88da4e109de39997339ceab8fa08c8538e59de13049f5ec180a8d4158df9bc"],"state_sha256":"2250a9f05203d85e8b652d03a214acf10ee94acd5ce6f0b695ea58425714b903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZO2eURxDrUMJBKHp4RN5ja4WoXvs4s8DpuIXsNBYgBb8a3+JuK02Iqy9HX/iBNSPjtqmyHNbwvjdHf8Dx7IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:28:09.330666Z","bundle_sha256":"f99af8fe6706b469e9ec8745578ca67a22d0b4b1f198d304cbb654a5ca87543a"}}