{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5YOMMSLNW5HKLPHSQROBNUHDJE","short_pith_number":"pith:5YOMMSLN","schema_version":"1.0","canonical_sha256":"ee1cc6496db74ea5bcf2845c16d0e3490df35341fab60f4d1f2e65c669512112","source":{"kind":"arxiv","id":"1612.08795","version":1},"attestation_state":"computed","paper":{"title":"Provable learning of Noisy-or Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Rong Ge, Sanjeev Arora, Tengyu Ma","submitted_at":"2016-12-28T03:35:59Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1612.08795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-28T03:35:59Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"e14483966bc604a8318989b070f9a9699aaf40f4ac43dcdefb3cabd8ead7aa4d","abstract_canon_sha256":"6ea1157040fcdd010043d46b9ef335d6bfdbd398f1d24a7559856e917d0efa9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:47.143531Z","signature_b64":"0JdfrwSvdSan9BSTbxmVXuvFzV6y3DpZTg2/DHFXLtSIQyI2lPSbZ/h032JwJvNQ/C9OdcCR8QOfLf/4ow9KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee1cc6496db74ea5bcf2845c16d0e3490df35341fab60f4d1f2e65c669512112","last_reissued_at":"2026-05-18T00:53:47.143100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:47.143100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable learning of Noisy-or Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Rong Ge, Sanjeev Arora, Tengyu Ma","submitted_at":"2016-12-28T03:35:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08795","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.08795","created_at":"2026-05-18T00:53:47.143168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08795v1","created_at":"2026-05-18T00:53:47.143168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08795","created_at":"2026-05-18T00:53:47.143168+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YOMMSLNW5HK","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YOMMSLNW5HKLPHS","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YOMMSLN","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2401.01335","citing_title":"Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE","json":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE.json","graph_json":"https://pith.science/api/pith-number/5YOMMSLNW5HKLPHSQROBNUHDJE/graph.json","events_json":"https://pith.science/api/pith-number/5YOMMSLNW5HKLPHSQROBNUHDJE/events.json","paper":"https://pith.science/paper/5YOMMSLN"},"agent_actions":{"view_html":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE","download_json":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE.json","view_paper":"https://pith.science/paper/5YOMMSLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08795&json=true","fetch_graph":"https://pith.science/api/pith-number/5YOMMSLNW5HKLPHSQROBNUHDJE/graph.json","fetch_events":"https://pith.science/api/pith-number/5YOMMSLNW5HKLPHSQROBNUHDJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE/action/storage_attestation","attest_author":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE/action/author_attestation","sign_citation":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE/action/citation_signature","submit_replication":"https://pith.science/pith/5YOMMSLNW5HKLPHSQROBNUHDJE/action/replication_record"}},"created_at":"2026-05-18T00:53:47.143168+00:00","updated_at":"2026-05-18T00:53:47.143168+00:00"}