{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5YOMMSLNW5HKLPHSQROBNUHDJE","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":"6ea1157040fcdd010043d46b9ef335d6bfdbd398f1d24a7559856e917d0efa9d","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-28T03:35:59Z","title_canon_sha256":"e14483966bc604a8318989b070f9a9699aaf40f4ac43dcdefb3cabd8ead7aa4d"},"schema_version":"1.0","source":{"id":"1612.08795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08795","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08795v1","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08795","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"pith_short_12","alias_value":"5YOMMSLNW5HK","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5YOMMSLNW5HKLPHS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5YOMMSLN","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:49d594df34589bd76c05785b592e1d15f47178fff58d3aa51927c0238d6ce2c0","target":"graph","created_at":"2026-05-18T00:53:47Z","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 applications use latent variable models to explain structure in data, whereby visible variables (= coordinates of the given datapoint) are explained as a probabilistic function of some hidden variables. Finding parameters with the maximum likelihood is NP-hard even in very simple settings. In recent years, provably efficient algorithms were nevertheless developed for models with linear structures: topic models, mixture models, hidden markov models, etc. These algorithms use matrix or tensor decomposition, and make some reasonable assumptions about the parameters of the un","authors_text":"Andrej Risteski, Rong Ge, Sanjeev Arora, Tengyu Ma","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-28T03:35:59Z","title":"Provable learning of Noisy-or Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08795","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:6b0210c04f7786abad05959115bb8c5a0904acbe618ac6c36130e1be2f8c4449","target":"record","created_at":"2026-05-18T00:53:47Z","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":"6ea1157040fcdd010043d46b9ef335d6bfdbd398f1d24a7559856e917d0efa9d","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-28T03:35:59Z","title_canon_sha256":"e14483966bc604a8318989b070f9a9699aaf40f4ac43dcdefb3cabd8ead7aa4d"},"schema_version":"1.0","source":{"id":"1612.08795","kind":"arxiv","version":1}},"canonical_sha256":"ee1cc6496db74ea5bcf2845c16d0e3490df35341fab60f4d1f2e65c669512112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee1cc6496db74ea5bcf2845c16d0e3490df35341fab60f4d1f2e65c669512112","first_computed_at":"2026-05-18T00:53:47.143100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:47.143100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JdfrwSvdSan9BSTbxmVXuvFzV6y3DpZTg2/DHFXLtSIQyI2lPSbZ/h032JwJvNQ/C9OdcCR8QOfLf/4ow9KDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:47.143531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b0210c04f7786abad05959115bb8c5a0904acbe618ac6c36130e1be2f8c4449","sha256:49d594df34589bd76c05785b592e1d15f47178fff58d3aa51927c0238d6ce2c0"],"state_sha256":"0fe5c616c80c36afd5f81950379f3e90193846fac25516a3e3be476bf5723505"}