{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LIXSNUANSSPHUBJMH3NIFSNBOH","short_pith_number":"pith:LIXSNUAN","canonical_record":{"source":{"id":"1503.01228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-04T05:41:29Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"bd209b7a493c23bd009629cd374c082cefa827ef4294bb9ac31eb13db278dd47","abstract_canon_sha256":"2eda3057196abd042a5e394e16abeb2b8816848645124a54819d54b10eb6084f"},"schema_version":"1.0"},"canonical_sha256":"5a2f26d00d949e7a052c3eda82c9a171dcd889cb39046554d2e0a0805a024ac5","source":{"kind":"arxiv","id":"1503.01228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01228","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01228v1","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01228","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"LIXSNUANSSPH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LIXSNUANSSPHUBJM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LIXSNUAN","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LIXSNUANSSPHUBJMH3NIFSNBOH","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-04T05:41:29Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"bd209b7a493c23bd009629cd374c082cefa827ef4294bb9ac31eb13db278dd47","abstract_canon_sha256":"2eda3057196abd042a5e394e16abeb2b8816848645124a54819d54b10eb6084f"},"schema_version":"1.0"},"canonical_sha256":"5a2f26d00d949e7a052c3eda82c9a171dcd889cb39046554d2e0a0805a024ac5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:39.616573Z","signature_b64":"kzU2q4ekBeYiRmm3lp+VreOp7lHvDjNQ16upbml5crQKgE0RgoFUP8LWgkYWjMjvfvUjO5wUjuru4HE8YjfXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a2f26d00d949e7a052c3eda82c9a171dcd889cb39046554d2e0a0805a024ac5","last_reissued_at":"2026-05-18T02:25:39.616121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:39.616121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01228","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:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/oYbRBKgNkJJZ6FAgqMRCck5t49Gr0fXFV1iQHoyfVC7Q8x8OKSZw9i8ozoXZ8LrCm7iGR/MaEdYLR/GMS6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:21:15.069247Z"},"content_sha256":"04a395e6e24449f73ea274931e87976be0977dc119ce573f97e2f13ca39c8f45","schema_version":"1.0","event_id":"sha256:04a395e6e24449f73ea274931e87976be0977dc119ce573f97e2f13ca39c8f45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LIXSNUANSSPHUBJMH3NIFSNBOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bethe Learning of Conditional Random Fields via MAP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Belanger, Kui Tang, Nicholas Ruozzi, Tony Jebara","submitted_at":"2015-03-04T05:41:29Z","abstract_excerpt":"Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured perceptron, discriminative functions are learned by iteratively applying efficient maximum a posteriori (MAP) decoding. However, maximum likelihood estimation (MLE) of probabilistic models over these same structured spaces requires computing partition functions, which is generally intractable. This paper presents a method for learning discrete exponential family models using the Bethe approximation to the MLE. Remar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01228","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:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExFbeYGq7zrFcg0gWQ756KiaY1gRI2BBZgLyvpAV4tuQtwfqeh4zC5NDupTPL9n8mhyDSC6TDq6g7SfYM5TJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:21:15.069619Z"},"content_sha256":"cd1d23be1abb0cb7a549221d7c49495a682af85c6f2b36af58dbcbe5121192d7","schema_version":"1.0","event_id":"sha256:cd1d23be1abb0cb7a549221d7c49495a682af85c6f2b36af58dbcbe5121192d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIXSNUANSSPHUBJMH3NIFSNBOH/bundle.json","state_url":"https://pith.science/pith/LIXSNUANSSPHUBJMH3NIFSNBOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIXSNUANSSPHUBJMH3NIFSNBOH/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-03T07:21:15Z","links":{"resolver":"https://pith.science/pith/LIXSNUANSSPHUBJMH3NIFSNBOH","bundle":"https://pith.science/pith/LIXSNUANSSPHUBJMH3NIFSNBOH/bundle.json","state":"https://pith.science/pith/LIXSNUANSSPHUBJMH3NIFSNBOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIXSNUANSSPHUBJMH3NIFSNBOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LIXSNUANSSPHUBJMH3NIFSNBOH","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":"2eda3057196abd042a5e394e16abeb2b8816848645124a54819d54b10eb6084f","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-04T05:41:29Z","title_canon_sha256":"bd209b7a493c23bd009629cd374c082cefa827ef4294bb9ac31eb13db278dd47"},"schema_version":"1.0","source":{"id":"1503.01228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01228","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01228v1","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01228","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"LIXSNUANSSPH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LIXSNUANSSPHUBJM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LIXSNUAN","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:cd1d23be1abb0cb7a549221d7c49495a682af85c6f2b36af58dbcbe5121192d7","target":"graph","created_at":"2026-05-18T02:25: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":"Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured perceptron, discriminative functions are learned by iteratively applying efficient maximum a posteriori (MAP) decoding. However, maximum likelihood estimation (MLE) of probabilistic models over these same structured spaces requires computing partition functions, which is generally intractable. This paper presents a method for learning discrete exponential family models using the Bethe approximation to the MLE. Remar","authors_text":"David Belanger, Kui Tang, Nicholas Ruozzi, Tony Jebara","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-04T05:41:29Z","title":"Bethe Learning of Conditional Random Fields via MAP Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01228","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:04a395e6e24449f73ea274931e87976be0977dc119ce573f97e2f13ca39c8f45","target":"record","created_at":"2026-05-18T02:25: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":"2eda3057196abd042a5e394e16abeb2b8816848645124a54819d54b10eb6084f","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-04T05:41:29Z","title_canon_sha256":"bd209b7a493c23bd009629cd374c082cefa827ef4294bb9ac31eb13db278dd47"},"schema_version":"1.0","source":{"id":"1503.01228","kind":"arxiv","version":1}},"canonical_sha256":"5a2f26d00d949e7a052c3eda82c9a171dcd889cb39046554d2e0a0805a024ac5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a2f26d00d949e7a052c3eda82c9a171dcd889cb39046554d2e0a0805a024ac5","first_computed_at":"2026-05-18T02:25:39.616121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:39.616121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kzU2q4ekBeYiRmm3lp+VreOp7lHvDjNQ16upbml5crQKgE0RgoFUP8LWgkYWjMjvfvUjO5wUjuru4HE8YjfXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:39.616573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04a395e6e24449f73ea274931e87976be0977dc119ce573f97e2f13ca39c8f45","sha256:cd1d23be1abb0cb7a549221d7c49495a682af85c6f2b36af58dbcbe5121192d7"],"state_sha256":"f679f3ead4fff8201bc2a855a042f33391804267e4cf2344220b84799bf6b85c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlJeBFW47eHORESbeMXebDcshjSP2A4O3T+UCV+soP/XM8rRjPbJErcwwpQYEBYLzWKME/i3x3OZFVHyRhsGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:21:15.071895Z","bundle_sha256":"3d5ec4f0d83393a11053420cc260a0ca4cd21563c5c1a6f451e3014d1fe286a0"}}