{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DOU3R64CN4RFHISOEA2MBSDCJI","short_pith_number":"pith:DOU3R64C","canonical_record":{"source":{"id":"1711.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T19:00:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f741a0395c87ef7990fc1b30c4f124a347a3fceeb2c9c6758231ab7c51f98fd","abstract_canon_sha256":"4fb7cc8f05413bf69398645223a20343906846466768dd2f45dcf8d80b06cb62"},"schema_version":"1.0"},"canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","source":{"kind":"arxiv","id":"1711.02679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02679","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02679v2","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02679","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"DOU3R64CN4RF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOU3R64CN4RFHISO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOU3R64C","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DOU3R64CN4RFHISOEA2MBSDCJI","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T19:00:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f741a0395c87ef7990fc1b30c4f124a347a3fceeb2c9c6758231ab7c51f98fd","abstract_canon_sha256":"4fb7cc8f05413bf69398645223a20343906846466768dd2f45dcf8d80b06cb62"},"schema_version":"1.0"},"canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.733613Z","signature_b64":"Emhm/H68lAtftj8vZyTWtkSKT/jf/fQx2LmA7HfTZa0k0SatagS9h63aO9U54sR83MdJGyeqxEKEviXUqUiKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","last_reissued_at":"2026-05-18T00:30:21.733071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.733071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02679","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-18T00:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MY4+bCCj2VQft2o7R6FTbpYBAOqHBmiwCue13KYmJCO/lh02qa3yx0oLG5kiqCc22Trixqz4x9LugtC4GV7oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:55:54.432476Z"},"content_sha256":"3f38352a6e703f479ae2a74230bca4a0348a00f84a60e4eae18eeb293d698abe","schema_version":"1.0","event_id":"sha256:3f38352a6e703f479ae2a74230bca4a0348a00f84a60e4eae18eeb293d698abe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DOU3R64CN4RFHISOEA2MBSDCJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Variational Inference and Learning in Undirected Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Stefano Ermon, Volodymyr Kuleshov","submitted_at":"2017-11-07T19:00:20Z","abstract_excerpt":"Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the log-partition function parametrized by a function q that we express as a flexible neural network. Our bound makes it possible to track the partition function during learning, to speed-up sampling, and to train a broad class of hybrid directed/undirected models via a unified variation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02679","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-18T00:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUzzRuF2FMQJPk6WIt948tMppuC8Gnj6hNxoD9hvzDuRPJEQR+qyAGymM3OUJo5DbsJMuoSD5QKqCH4Fd/EjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:55:54.432827Z"},"content_sha256":"03cb3a03c311c1361b53e08bf07ca27c5e876d5fde5089d27f18a60e81580fe0","schema_version":"1.0","event_id":"sha256:03cb3a03c311c1361b53e08bf07ca27c5e876d5fde5089d27f18a60e81580fe0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/bundle.json","state_url":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOU3R64CN4RFHISOEA2MBSDCJI/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-03T03:55:54Z","links":{"resolver":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI","bundle":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/bundle.json","state":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOU3R64CN4RFHISOEA2MBSDCJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DOU3R64CN4RFHISOEA2MBSDCJI","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":"4fb7cc8f05413bf69398645223a20343906846466768dd2f45dcf8d80b06cb62","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T19:00:20Z","title_canon_sha256":"5f741a0395c87ef7990fc1b30c4f124a347a3fceeb2c9c6758231ab7c51f98fd"},"schema_version":"1.0","source":{"id":"1711.02679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02679","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02679v2","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02679","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"DOU3R64CN4RF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOU3R64CN4RFHISO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOU3R64C","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:03cb3a03c311c1361b53e08bf07ca27c5e876d5fde5089d27f18a60e81580fe0","target":"graph","created_at":"2026-05-18T00:30:21Z","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 problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the log-partition function parametrized by a function q that we express as a flexible neural network. Our bound makes it possible to track the partition function during learning, to speed-up sampling, and to train a broad class of hybrid directed/undirected models via a unified variation","authors_text":"Stefano Ermon, Volodymyr Kuleshov","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T19:00:20Z","title":"Neural Variational Inference and Learning in Undirected Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02679","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:3f38352a6e703f479ae2a74230bca4a0348a00f84a60e4eae18eeb293d698abe","target":"record","created_at":"2026-05-18T00:30:21Z","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":"4fb7cc8f05413bf69398645223a20343906846466768dd2f45dcf8d80b06cb62","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T19:00:20Z","title_canon_sha256":"5f741a0395c87ef7990fc1b30c4f124a347a3fceeb2c9c6758231ab7c51f98fd"},"schema_version":"1.0","source":{"id":"1711.02679","kind":"arxiv","version":2}},"canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","first_computed_at":"2026-05-18T00:30:21.733071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:21.733071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Emhm/H68lAtftj8vZyTWtkSKT/jf/fQx2LmA7HfTZa0k0SatagS9h63aO9U54sR83MdJGyeqxEKEviXUqUiKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:21.733613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f38352a6e703f479ae2a74230bca4a0348a00f84a60e4eae18eeb293d698abe","sha256:03cb3a03c311c1361b53e08bf07ca27c5e876d5fde5089d27f18a60e81580fe0"],"state_sha256":"e3b7f15f5fc7b9bc294d38586d23a4eae1ac812406de3bf1fcdfa24bde97e780"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDylPxR8S/leaA4GRFVsB2hfzSoRXzLSj7KWChk3Aq5AafODmiym9LTRajWq8rC585vWmO48MLVBkY6JppwBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:55:54.434831Z","bundle_sha256":"1134747e9744a3ba61a9b725ca341658845e1c70cc09da3e7aeffbfa096a8d83"}}