{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KLZVLP2SE2BMS6DJYKXQAPQF2F","short_pith_number":"pith:KLZVLP2S","canonical_record":{"source":{"id":"1605.08491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T02:18:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a3c98e239352ab04a72ea382ea8e80481a91c683b623e603f77ac06ebd7b0b73","abstract_canon_sha256":"93acec48c9b606f3c28edc02d1f724bd6660e6246fd5f2f39063aaf34808d914"},"schema_version":"1.0"},"canonical_sha256":"52f355bf522682c97869c2af003e05d178939b9aee52a4b9f2233bba158afee5","source":{"kind":"arxiv","id":"1605.08491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08491","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08491v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08491","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"KLZVLP2SE2BM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KLZVLP2SE2BMS6DJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KLZVLP2S","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KLZVLP2SE2BMS6DJYKXQAPQF2F","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T02:18:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a3c98e239352ab04a72ea382ea8e80481a91c683b623e603f77ac06ebd7b0b73","abstract_canon_sha256":"93acec48c9b606f3c28edc02d1f724bd6660e6246fd5f2f39063aaf34808d914"},"schema_version":"1.0"},"canonical_sha256":"52f355bf522682c97869c2af003e05d178939b9aee52a4b9f2233bba158afee5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.780493Z","signature_b64":"CMtVusgP7amRMXNV/mX+GRS82zx3gjgIyiUiCYE4PkV/UPlodVpeV23/0radyMjL90rpo3+yGI/2j5cyQ6/dAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f355bf522682c97869c2af003e05d178939b9aee52a4b9f2233bba158afee5","last_reissued_at":"2026-05-18T01:13:29.779875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.779875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08491","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8IcRuVNbJ8pO8YRHe8Bct5LHg3w6jUzgx3aU6HMNhoKbBJHITemWh3vyrOaTtTV+m20O+gLb3LBSLOG0hOKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:23:41.298758Z"},"content_sha256":"cca56af1a757219bb0e38129f125eb6c54d772af95223df3eea98590fd82a056","schema_version":"1.0","event_id":"sha256:cca56af1a757219bb0e38129f125eb6c54d772af95223df3eea98590fd82a056"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KLZVLP2SE2BMS6DJYKXQAPQF2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Algorithms for Inference in Topic Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur Moitra, Frederic Koehler, Rong Ge, Sanjeev Arora, Tengyu Ma","submitted_at":"2016-05-27T02:18:43Z","abstract_excerpt":"Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference has proven to be more challenging. Here we take a first step towards provable inference in topic models. We leverage a property of topic models that enables us to construct simple linear estimators for the unknown topic proportions that have small variance, and consequently can work with short documents. Our estimators also correspond to finding an estimate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08491","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWeic4EaA1ypv6aCPFAshODoFggwdf1+SLhhvdZjoIdfRP8wCch/WZRynfzMeHJpuBISXH9gkCriVx6o7+T2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:23:41.299108Z"},"content_sha256":"74252576b6d435cdf52f4701a9d0f4fe7b58de8a27c0802a709a3e82629b7ff4","schema_version":"1.0","event_id":"sha256:74252576b6d435cdf52f4701a9d0f4fe7b58de8a27c0802a709a3e82629b7ff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F/bundle.json","state_url":"https://pith.science/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F/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-28T10:23:41Z","links":{"resolver":"https://pith.science/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F","bundle":"https://pith.science/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F/bundle.json","state":"https://pith.science/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLZVLP2SE2BMS6DJYKXQAPQF2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KLZVLP2SE2BMS6DJYKXQAPQF2F","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":"93acec48c9b606f3c28edc02d1f724bd6660e6246fd5f2f39063aaf34808d914","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T02:18:43Z","title_canon_sha256":"a3c98e239352ab04a72ea382ea8e80481a91c683b623e603f77ac06ebd7b0b73"},"schema_version":"1.0","source":{"id":"1605.08491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08491","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08491v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08491","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"KLZVLP2SE2BM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KLZVLP2SE2BMS6DJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KLZVLP2S","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:74252576b6d435cdf52f4701a9d0f4fe7b58de8a27c0802a709a3e82629b7ff4","target":"graph","created_at":"2026-05-18T01:13:29Z","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":"Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference has proven to be more challenging. Here we take a first step towards provable inference in topic models. We leverage a property of topic models that enables us to construct simple linear estimators for the unknown topic proportions that have small variance, and consequently can work with short documents. Our estimators also correspond to finding an estimate","authors_text":"Ankur Moitra, Frederic Koehler, Rong Ge, Sanjeev Arora, Tengyu Ma","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T02:18:43Z","title":"Provable Algorithms for Inference in Topic Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08491","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:cca56af1a757219bb0e38129f125eb6c54d772af95223df3eea98590fd82a056","target":"record","created_at":"2026-05-18T01:13:29Z","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":"93acec48c9b606f3c28edc02d1f724bd6660e6246fd5f2f39063aaf34808d914","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T02:18:43Z","title_canon_sha256":"a3c98e239352ab04a72ea382ea8e80481a91c683b623e603f77ac06ebd7b0b73"},"schema_version":"1.0","source":{"id":"1605.08491","kind":"arxiv","version":1}},"canonical_sha256":"52f355bf522682c97869c2af003e05d178939b9aee52a4b9f2233bba158afee5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f355bf522682c97869c2af003e05d178939b9aee52a4b9f2233bba158afee5","first_computed_at":"2026-05-18T01:13:29.779875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.779875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMtVusgP7amRMXNV/mX+GRS82zx3gjgIyiUiCYE4PkV/UPlodVpeV23/0radyMjL90rpo3+yGI/2j5cyQ6/dAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.780493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cca56af1a757219bb0e38129f125eb6c54d772af95223df3eea98590fd82a056","sha256:74252576b6d435cdf52f4701a9d0f4fe7b58de8a27c0802a709a3e82629b7ff4"],"state_sha256":"4d63d5b2b5cbdba639b078dcb69b357d2d29d762d8caf867a69fe59716c0407f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjIrPM6Q0lelQEF9oM0RWIsvJjTl6LI+VV33k3paiMKW49vN79AvwQ1Rid43DuYgnvISpOxWiTtMgBSaxbKlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:23:41.301122Z","bundle_sha256":"e48419429b7de693cd132b4bdbcb1f931380c559c8be36b1478248561ffe0f49"}}