{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M4Z6WX25ZNQSJOZ3QOPW2OBRAS","short_pith_number":"pith:M4Z6WX25","canonical_record":{"source":{"id":"1308.2853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-13T13:16:10Z","cross_cats_sorted":["cs.IR","math.NA","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"79e738620ee278378b4286b815760fe005bf0cb137bf619ffacba136ab9d0aa9","abstract_canon_sha256":"67bc168cba12be94fa07f8ef9cafa2536a6837a66b8d9282036edecfd7838c7a"},"schema_version":"1.0"},"canonical_sha256":"6733eb5f5dcb6124bb3b839f6d383104802561577c3cbd0d36460c8904701bb7","source":{"kind":"arxiv","id":"1308.2853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2853","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2853v1","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2853","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"M4Z6WX25ZNQS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M4Z6WX25ZNQSJOZ3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M4Z6WX25","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M4Z6WX25ZNQSJOZ3QOPW2OBRAS","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-13T13:16:10Z","cross_cats_sorted":["cs.IR","math.NA","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"79e738620ee278378b4286b815760fe005bf0cb137bf619ffacba136ab9d0aa9","abstract_canon_sha256":"67bc168cba12be94fa07f8ef9cafa2536a6837a66b8d9282036edecfd7838c7a"},"schema_version":"1.0"},"canonical_sha256":"6733eb5f5dcb6124bb3b839f6d383104802561577c3cbd0d36460c8904701bb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:58.341621Z","signature_b64":"ENkYF1bP1ENvrdeEdrDFDiVtE/LrUGc0eRHcJfRkn9Mqr9WP2mYJxz0nNuOwA865vcKQvViJA7Z0su/9X/CRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6733eb5f5dcb6124bb3b839f6d383104802561577c3cbd0d36460c8904701bb7","last_reissued_at":"2026-05-18T03:15:58.341049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:58.341049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2853","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-18T03:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxdBHFNv/i6klMlvpNdXnk/oDO3Eavj78eWpvmKYsRQFCp/sMWmntG7CKU7kPhTkSvE7c0yS5h0laLMS03HlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:03.531667Z"},"content_sha256":"6fd28346d3f24703e2eb2cf704a670ae6b91e20db7d2ab0a7f50d480b7cdcc31","schema_version":"1.0","event_id":"sha256:6fd28346d3f24703e2eb2cf704a670ae6b91e20db7d2ab0a7f50d480b7cdcc31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M4Z6WX25ZNQSJOZ3QOPW2OBRAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","math.NA","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Animashree Anandkumar, Daniel Hsu, Majid Janzamin, Sham Kakade","submitted_at":"2013-08-13T13:16:10Z","abstract_excerpt":"Overcomplete latent representations have been very popular for unsupervised feature learning in recent years. In this paper, we specify which overcomplete models can be identified given observable moments of a certain order. We consider probabilistic admixture or topic models in the overcomplete regime, where the number of latent topics can greatly exceed the size of the observed word vocabulary. While general overcomplete topic models are not identifiable, we establish generic identifiability under a constraint, referred to as topic persistence. Our sufficient conditions for identifiability i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2853","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-18T03:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+JBR2ObWZagcRXuAnNmBv/MlO/4JKHs7DM5tfm15imCAFkUuQdjZfIaYRW56bFgX+toyH37PvTpiY9rr6MMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:03.532378Z"},"content_sha256":"d2b26c009cfc5db92bf9fc63541bc1b8ac4382c2011380222fe2e16d8f613c32","schema_version":"1.0","event_id":"sha256:d2b26c009cfc5db92bf9fc63541bc1b8ac4382c2011380222fe2e16d8f613c32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS/bundle.json","state_url":"https://pith.science/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS/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-30T20:03:03Z","links":{"resolver":"https://pith.science/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS","bundle":"https://pith.science/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS/bundle.json","state":"https://pith.science/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4Z6WX25ZNQSJOZ3QOPW2OBRAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M4Z6WX25ZNQSJOZ3QOPW2OBRAS","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":"67bc168cba12be94fa07f8ef9cafa2536a6837a66b8d9282036edecfd7838c7a","cross_cats_sorted":["cs.IR","math.NA","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-13T13:16:10Z","title_canon_sha256":"79e738620ee278378b4286b815760fe005bf0cb137bf619ffacba136ab9d0aa9"},"schema_version":"1.0","source":{"id":"1308.2853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2853","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2853v1","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2853","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"M4Z6WX25ZNQS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M4Z6WX25ZNQSJOZ3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M4Z6WX25","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d2b26c009cfc5db92bf9fc63541bc1b8ac4382c2011380222fe2e16d8f613c32","target":"graph","created_at":"2026-05-18T03:15:58Z","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":"Overcomplete latent representations have been very popular for unsupervised feature learning in recent years. In this paper, we specify which overcomplete models can be identified given observable moments of a certain order. We consider probabilistic admixture or topic models in the overcomplete regime, where the number of latent topics can greatly exceed the size of the observed word vocabulary. While general overcomplete topic models are not identifiable, we establish generic identifiability under a constraint, referred to as topic persistence. Our sufficient conditions for identifiability i","authors_text":"Animashree Anandkumar, Daniel Hsu, Majid Janzamin, Sham Kakade","cross_cats":["cs.IR","math.NA","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-13T13:16:10Z","title":"When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2853","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:6fd28346d3f24703e2eb2cf704a670ae6b91e20db7d2ab0a7f50d480b7cdcc31","target":"record","created_at":"2026-05-18T03:15:58Z","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":"67bc168cba12be94fa07f8ef9cafa2536a6837a66b8d9282036edecfd7838c7a","cross_cats_sorted":["cs.IR","math.NA","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-13T13:16:10Z","title_canon_sha256":"79e738620ee278378b4286b815760fe005bf0cb137bf619ffacba136ab9d0aa9"},"schema_version":"1.0","source":{"id":"1308.2853","kind":"arxiv","version":1}},"canonical_sha256":"6733eb5f5dcb6124bb3b839f6d383104802561577c3cbd0d36460c8904701bb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6733eb5f5dcb6124bb3b839f6d383104802561577c3cbd0d36460c8904701bb7","first_computed_at":"2026-05-18T03:15:58.341049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:58.341049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENkYF1bP1ENvrdeEdrDFDiVtE/LrUGc0eRHcJfRkn9Mqr9WP2mYJxz0nNuOwA865vcKQvViJA7Z0su/9X/CRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:58.341621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fd28346d3f24703e2eb2cf704a670ae6b91e20db7d2ab0a7f50d480b7cdcc31","sha256:d2b26c009cfc5db92bf9fc63541bc1b8ac4382c2011380222fe2e16d8f613c32"],"state_sha256":"edca68edf30ef421729d21ad40cb3c0b9c96d54681d77566208d41684f056061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7o0oMQkKtv8FvSlY1QT0Eju5NfiUJHUnLpibOwauzt5w2y7RbpUeb9LK6raI2MIOK0EYirK70utdVVc9sJKdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:03.536482Z","bundle_sha256":"a4ac5c1a7980c4377c9e4924b83fa47fcc7507a40b2cf46b91a3bd4b3295b5f3"}}