{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QEZBIIPQBVJVQQFCBNGL64XYHD","short_pith_number":"pith:QEZBIIPQ","canonical_record":{"source":{"id":"1206.3257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T15:31:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ba12715615af4bfc6f0d8b886a6975e7c2df8b9027c1fa66c2a26070931f66c","abstract_canon_sha256":"9c2b196b21fe19815c6453d036319599a0a49ee773b2eb7556729c913b717a25"},"schema_version":"1.0"},"canonical_sha256":"81321421f00d535840a20b4cbf72f838f39d56dd529d365f43b819c55f2f055f","source":{"kind":"arxiv","id":"1206.3257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3257","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3257v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3257","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"QEZBIIPQBVJV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QEZBIIPQBVJVQQFC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QEZBIIPQ","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QEZBIIPQBVJVQQFCBNGL64XYHD","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T15:31:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ba12715615af4bfc6f0d8b886a6975e7c2df8b9027c1fa66c2a26070931f66c","abstract_canon_sha256":"9c2b196b21fe19815c6453d036319599a0a49ee773b2eb7556729c913b717a25"},"schema_version":"1.0"},"canonical_sha256":"81321421f00d535840a20b4cbf72f838f39d56dd529d365f43b819c55f2f055f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.976652Z","signature_b64":"eAks6YzM6rdLCDmWAGESVDmAUylGsnTlHT7UnMGdOPVGTjmPmLj3mRTDviQiCdlkE5p0wNsMCz8mkohFB3vLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81321421f00d535840a20b4cbf72f838f39d56dd529d365f43b819c55f2f055f","last_reissued_at":"2026-05-18T03:53:30.976012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.976012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3257","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pFc9sqme3Nmpw8osdFTy3qNjnQFTPWBhEzmszXGgoUhB1IsfVlI3qNLfyQzcq1BJl+TFPKTQ97ReqpiRamsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:33:15.227187Z"},"content_sha256":"c9f63d83b7afea5b5ce9c3db18d4d8ce0fe3e3cc2cd455c63fe6de57174fbf7a","schema_version":"1.0","event_id":"sha256:c9f63d83b7afea5b5ce9c3db18d4d8ce0fe3e3cc2cd455c63fe6de57174fbf7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QEZBIIPQBVJVQQFCBNGL64XYHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Approximate Maximum Entropy Learning of Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daphne Koller, David Vickrey, John Duchi, Varun Ganapathi","submitted_at":"2012-06-13T15:31:57Z","abstract_excerpt":"Parameter estimation in Markov random fields (MRFs) is a difficult task, in which inference over the network is run in the inner loop of a gradient descent procedure. Replacing exact inference with approximate methods such as loopy belief propagation (LBP) can suffer from poor convergence. In this paper, we provide a different approach for combining MRF learning and Bethe approximation. We consider the dual of maximum likelihood Markov network learning - maximizing entropy with moment matching constraints - and then approximate both the objective and the constraints in the resulting optimizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3257","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3g5T1mIJHLcCxfHVFcL78etSuAL1vPY7RU0tjnJFZZUEz8OjV0FaHs4cc9vPVuTNYg6CG+Xeu817fZpKtZbsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:33:15.227567Z"},"content_sha256":"7bf99960c03e814c611c0ed6104b68fcd13a8ec340ad3af3691b74e132c702ce","schema_version":"1.0","event_id":"sha256:7bf99960c03e814c611c0ed6104b68fcd13a8ec340ad3af3691b74e132c702ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEZBIIPQBVJVQQFCBNGL64XYHD/bundle.json","state_url":"https://pith.science/pith/QEZBIIPQBVJVQQFCBNGL64XYHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEZBIIPQBVJVQQFCBNGL64XYHD/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-27T03:33:15Z","links":{"resolver":"https://pith.science/pith/QEZBIIPQBVJVQQFCBNGL64XYHD","bundle":"https://pith.science/pith/QEZBIIPQBVJVQQFCBNGL64XYHD/bundle.json","state":"https://pith.science/pith/QEZBIIPQBVJVQQFCBNGL64XYHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEZBIIPQBVJVQQFCBNGL64XYHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QEZBIIPQBVJVQQFCBNGL64XYHD","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":"9c2b196b21fe19815c6453d036319599a0a49ee773b2eb7556729c913b717a25","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T15:31:57Z","title_canon_sha256":"7ba12715615af4bfc6f0d8b886a6975e7c2df8b9027c1fa66c2a26070931f66c"},"schema_version":"1.0","source":{"id":"1206.3257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3257","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3257v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3257","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"QEZBIIPQBVJV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QEZBIIPQBVJVQQFC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QEZBIIPQ","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:7bf99960c03e814c611c0ed6104b68fcd13a8ec340ad3af3691b74e132c702ce","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"Parameter estimation in Markov random fields (MRFs) is a difficult task, in which inference over the network is run in the inner loop of a gradient descent procedure. Replacing exact inference with approximate methods such as loopy belief propagation (LBP) can suffer from poor convergence. In this paper, we provide a different approach for combining MRF learning and Bethe approximation. We consider the dual of maximum likelihood Markov network learning - maximizing entropy with moment matching constraints - and then approximate both the objective and the constraints in the resulting optimizati","authors_text":"Daphne Koller, David Vickrey, John Duchi, Varun Ganapathi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T15:31:57Z","title":"Constrained Approximate Maximum Entropy Learning of Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3257","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:c9f63d83b7afea5b5ce9c3db18d4d8ce0fe3e3cc2cd455c63fe6de57174fbf7a","target":"record","created_at":"2026-05-18T03:53:30Z","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":"9c2b196b21fe19815c6453d036319599a0a49ee773b2eb7556729c913b717a25","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T15:31:57Z","title_canon_sha256":"7ba12715615af4bfc6f0d8b886a6975e7c2df8b9027c1fa66c2a26070931f66c"},"schema_version":"1.0","source":{"id":"1206.3257","kind":"arxiv","version":1}},"canonical_sha256":"81321421f00d535840a20b4cbf72f838f39d56dd529d365f43b819c55f2f055f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81321421f00d535840a20b4cbf72f838f39d56dd529d365f43b819c55f2f055f","first_computed_at":"2026-05-18T03:53:30.976012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.976012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eAks6YzM6rdLCDmWAGESVDmAUylGsnTlHT7UnMGdOPVGTjmPmLj3mRTDviQiCdlkE5p0wNsMCz8mkohFB3vLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.976652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9f63d83b7afea5b5ce9c3db18d4d8ce0fe3e3cc2cd455c63fe6de57174fbf7a","sha256:7bf99960c03e814c611c0ed6104b68fcd13a8ec340ad3af3691b74e132c702ce"],"state_sha256":"306788b4036244f3e91599090c97ed83a2cbc6febfbd0a5d4c6789d0de00d092"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE/8/J5w3DXXuUU+cq3ReWtzsAXQ4fba8z3tZHUzzwS0vkTcOzRjT/uf8NUQfHvSntsYc9xOFTrkzkMayKfSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:33:15.230367Z","bundle_sha256":"86f00fd05aea2bacba1bb335a39173bcde32a0f794a13244794a741ad4120c69"}}