{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D6AA6QMR64FWJWO3AW5RJQJYIS","short_pith_number":"pith:D6AA6QMR","canonical_record":{"source":{"id":"1805.10262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:32:19Z","cross_cats_sorted":["cs.DS","math.PR","stat.ML"],"title_canon_sha256":"543608a7f5d0461fda0ecf81b9080a951366f09b79012002157d117330b723c3","abstract_canon_sha256":"12cd12522b856c988e34bdc3a63788ad705856a36b8ad31d6fb6aa75c037a006"},"schema_version":"1.0"},"canonical_sha256":"1f800f4191f70b64d9db05bb14c1384481fd79849351fd53309ea7e25392efda","source":{"kind":"arxiv","id":"1805.10262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10262","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10262v2","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10262","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"D6AA6QMR64FW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6AA6QMR64FWJWO3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6AA6QMR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D6AA6QMR64FWJWO3AW5RJQJYIS","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:32:19Z","cross_cats_sorted":["cs.DS","math.PR","stat.ML"],"title_canon_sha256":"543608a7f5d0461fda0ecf81b9080a951366f09b79012002157d117330b723c3","abstract_canon_sha256":"12cd12522b856c988e34bdc3a63788ad705856a36b8ad31d6fb6aa75c037a006"},"schema_version":"1.0"},"canonical_sha256":"1f800f4191f70b64d9db05bb14c1384481fd79849351fd53309ea7e25392efda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:32.765568Z","signature_b64":"lu2IQf3gXmAXfobzWaeMkU0yI9oPgAzmHwJ9fqSwqpOvv7/ZSf4ccDWkyctK8hxHinnzMOuv9tUzoR+JHeAAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f800f4191f70b64d9db05bb14c1384481fd79849351fd53309ea7e25392efda","last_reissued_at":"2026-05-18T00:01:32.765018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:32.765018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10262","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:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnYst51ELMNPEoFRYfv/cRjZdGnJYKJ1CKRG0IBpfUybHWZIA/OiTn1DK3AN7IZKYfaac5PcjxZpNSe3tc+BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:47.824507Z"},"content_sha256":"0c698d8ee7f02db06966ca535225dd1a4720f8d724e40e97f16da46cf0bdf27d","schema_version":"1.0","event_id":"sha256:0c698d8ee7f02db06966ca535225dd1a4720f8d724e40e97f16da46cf0bdf27d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D6AA6QMR64FWJWO3AW5RJQJYIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Restricted Boltzmann Machines via Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur Moitra, Elchanan Mossel, Frederic Koehler, Guy Bresler","submitted_at":"2018-05-25T17:32:19Z","abstract_excerpt":"Graphical models are a rich language for describing high-dimensional distributions in terms of their dependence structure. While there are algorithms with provable guarantees for learning undirected graphical models in a variety of settings, there has been much less progress in the important scenario when there are latent variables. Here we study Restricted Boltzmann Machines (or RBMs), which are a popular model with wide-ranging applications in dimensionality reduction, collaborative filtering, topic modeling, feature extraction and deep learning.\n  The main message of our paper is a strong d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10262","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:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AHmjzravBhvOsgnacNl8B1BMwFq0XqrFh4k1DXbz+tn8csRG8sieBb66Ww9R4MC1XU/GN82SXmTH7hCt7tZEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:47.824867Z"},"content_sha256":"f3edcd79ef779bfc154e004c3817be3d94eff79e9740dd038c9ad398cdeb5be3","schema_version":"1.0","event_id":"sha256:f3edcd79ef779bfc154e004c3817be3d94eff79e9740dd038c9ad398cdeb5be3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6AA6QMR64FWJWO3AW5RJQJYIS/bundle.json","state_url":"https://pith.science/pith/D6AA6QMR64FWJWO3AW5RJQJYIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6AA6QMR64FWJWO3AW5RJQJYIS/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-28T06:24:47Z","links":{"resolver":"https://pith.science/pith/D6AA6QMR64FWJWO3AW5RJQJYIS","bundle":"https://pith.science/pith/D6AA6QMR64FWJWO3AW5RJQJYIS/bundle.json","state":"https://pith.science/pith/D6AA6QMR64FWJWO3AW5RJQJYIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6AA6QMR64FWJWO3AW5RJQJYIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D6AA6QMR64FWJWO3AW5RJQJYIS","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":"12cd12522b856c988e34bdc3a63788ad705856a36b8ad31d6fb6aa75c037a006","cross_cats_sorted":["cs.DS","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:32:19Z","title_canon_sha256":"543608a7f5d0461fda0ecf81b9080a951366f09b79012002157d117330b723c3"},"schema_version":"1.0","source":{"id":"1805.10262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10262","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10262v2","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10262","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"D6AA6QMR64FW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6AA6QMR64FWJWO3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6AA6QMR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:f3edcd79ef779bfc154e004c3817be3d94eff79e9740dd038c9ad398cdeb5be3","target":"graph","created_at":"2026-05-18T00:01:32Z","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":"Graphical models are a rich language for describing high-dimensional distributions in terms of their dependence structure. While there are algorithms with provable guarantees for learning undirected graphical models in a variety of settings, there has been much less progress in the important scenario when there are latent variables. Here we study Restricted Boltzmann Machines (or RBMs), which are a popular model with wide-ranging applications in dimensionality reduction, collaborative filtering, topic modeling, feature extraction and deep learning.\n  The main message of our paper is a strong d","authors_text":"Ankur Moitra, Elchanan Mossel, Frederic Koehler, Guy Bresler","cross_cats":["cs.DS","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:32:19Z","title":"Learning Restricted Boltzmann Machines via Influence Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10262","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:0c698d8ee7f02db06966ca535225dd1a4720f8d724e40e97f16da46cf0bdf27d","target":"record","created_at":"2026-05-18T00:01:32Z","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":"12cd12522b856c988e34bdc3a63788ad705856a36b8ad31d6fb6aa75c037a006","cross_cats_sorted":["cs.DS","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:32:19Z","title_canon_sha256":"543608a7f5d0461fda0ecf81b9080a951366f09b79012002157d117330b723c3"},"schema_version":"1.0","source":{"id":"1805.10262","kind":"arxiv","version":2}},"canonical_sha256":"1f800f4191f70b64d9db05bb14c1384481fd79849351fd53309ea7e25392efda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f800f4191f70b64d9db05bb14c1384481fd79849351fd53309ea7e25392efda","first_computed_at":"2026-05-18T00:01:32.765018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:32.765018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lu2IQf3gXmAXfobzWaeMkU0yI9oPgAzmHwJ9fqSwqpOvv7/ZSf4ccDWkyctK8hxHinnzMOuv9tUzoR+JHeAAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:32.765568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c698d8ee7f02db06966ca535225dd1a4720f8d724e40e97f16da46cf0bdf27d","sha256:f3edcd79ef779bfc154e004c3817be3d94eff79e9740dd038c9ad398cdeb5be3"],"state_sha256":"05e1e6b4fdf4de5a879c904aed698966306611a4a1b0d3c5c7b46c1662c947a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8j/cLHSCMGL8cYUjPWFLEN+ju55SULcT2oCxRCEMzcbeUJePKFTVk+GptFHPYZY9Nqb2mjaMyJCr84ENXuxSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:24:47.827410Z","bundle_sha256":"0aa1b2c7e688183341849741aa5fb512577f4d7519eda57864037d8e24d17346"}}