{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T4OLZD4XIPYFYKQIWMGYDR33FS","short_pith_number":"pith:T4OLZD4X","canonical_record":{"source":{"id":"1508.05565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-23T03:44:26Z","cross_cats_sorted":["cs.CL","cs.IR","stat.ML"],"title_canon_sha256":"96c8cd09b5368a07dae58f709af711b57e484776228a2828248603810168bd8e","abstract_canon_sha256":"fa1a998cae5261ec734e514274f90690150f40b631e916cf6329e0f1eebc507b"},"schema_version":"1.0"},"canonical_sha256":"9f1cbc8f9743f05c2a08b30d81c77b2c8de5c6cd27266dd65d0e3ad92923a00a","source":{"kind":"arxiv","id":"1508.05565","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05565","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05565v2","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05565","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"pith_short_12","alias_value":"T4OLZD4XIPYF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4OLZD4XIPYFYKQI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4OLZD4X","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T4OLZD4XIPYFYKQIWMGYDR33FS","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-23T03:44:26Z","cross_cats_sorted":["cs.CL","cs.IR","stat.ML"],"title_canon_sha256":"96c8cd09b5368a07dae58f709af711b57e484776228a2828248603810168bd8e","abstract_canon_sha256":"fa1a998cae5261ec734e514274f90690150f40b631e916cf6329e0f1eebc507b"},"schema_version":"1.0"},"canonical_sha256":"9f1cbc8f9743f05c2a08b30d81c77b2c8de5c6cd27266dd65d0e3ad92923a00a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:17.876968Z","signature_b64":"WYN/oHUe63sFGDf9L0MSVzW2GSAV0oNYkOEKYZ8iQkdHgsF9BPs6WI/bsjwBUpcU1TlQAtoQGeQdbXfvTwccBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f1cbc8f9743f05c2a08b30d81c77b2c8de5c6cd27266dd65d0e3ad92923a00a","last_reissued_at":"2026-05-18T01:25:17.876250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:17.876250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05565","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-18T01:25:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbZCtQ3NN47zMxIS/TAYYZl2JG6yfJAnJvsVXGMnYKejHW0+LhWQkkbHi9QbXo1dYwPtln+4qNx7metzQ4AgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:01:56.042414Z"},"content_sha256":"75a56a9fd5ca13ccebac2b16b412e041074ec269c1a99467acbb7b5ebd9bd937","schema_version":"1.0","event_id":"sha256:75a56a9fd5ca13ccebac2b16b412e041074ec269c1a99467acbb7b5ebd9bd937"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T4OLZD4XIPYFYKQIWMGYDR33FS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Necessary and Sufficient Conditions and a Provably Efficient Algorithm for Separable Topic Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Prakash Ishwar, Venkatesh Saligrama, Weicong Ding","submitted_at":"2015-08-23T03:44:26Z","abstract_excerpt":"We develop necessary and sufficient conditions and a novel provably consistent and efficient algorithm for discovering topics (latent factors) from observations (documents) that are realized from a probabilistic mixture of shared latent factors that have certain properties. Our focus is on the class of topic models in which each shared latent factor contains a novel word that is unique to that factor, a property that has come to be known as separability. Our algorithm is based on the key insight that the novel words correspond to the extreme points of the convex hull formed by the row-vectors "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05565","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-18T01:25:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouBp2A5sxRaNJ+VYm7wQyabMPVNeVm1uY2dTaCUgE2i43YMsyC6LEyevaUdk2PgTMT5VqviY8/QYCDu8MqlNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:01:56.042764Z"},"content_sha256":"5f466361dafa639ece50fd82aea3c7a4b29656cbbbd2e17a5647e2cc54055646","schema_version":"1.0","event_id":"sha256:5f466361dafa639ece50fd82aea3c7a4b29656cbbbd2e17a5647e2cc54055646"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4OLZD4XIPYFYKQIWMGYDR33FS/bundle.json","state_url":"https://pith.science/pith/T4OLZD4XIPYFYKQIWMGYDR33FS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4OLZD4XIPYFYKQIWMGYDR33FS/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-06-03T14:01:56Z","links":{"resolver":"https://pith.science/pith/T4OLZD4XIPYFYKQIWMGYDR33FS","bundle":"https://pith.science/pith/T4OLZD4XIPYFYKQIWMGYDR33FS/bundle.json","state":"https://pith.science/pith/T4OLZD4XIPYFYKQIWMGYDR33FS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4OLZD4XIPYFYKQIWMGYDR33FS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T4OLZD4XIPYFYKQIWMGYDR33FS","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":"fa1a998cae5261ec734e514274f90690150f40b631e916cf6329e0f1eebc507b","cross_cats_sorted":["cs.CL","cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-23T03:44:26Z","title_canon_sha256":"96c8cd09b5368a07dae58f709af711b57e484776228a2828248603810168bd8e"},"schema_version":"1.0","source":{"id":"1508.05565","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05565","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05565v2","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05565","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"pith_short_12","alias_value":"T4OLZD4XIPYF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4OLZD4XIPYFYKQI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4OLZD4X","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:5f466361dafa639ece50fd82aea3c7a4b29656cbbbd2e17a5647e2cc54055646","target":"graph","created_at":"2026-05-18T01:25:17Z","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":"We develop necessary and sufficient conditions and a novel provably consistent and efficient algorithm for discovering topics (latent factors) from observations (documents) that are realized from a probabilistic mixture of shared latent factors that have certain properties. Our focus is on the class of topic models in which each shared latent factor contains a novel word that is unique to that factor, a property that has come to be known as separability. Our algorithm is based on the key insight that the novel words correspond to the extreme points of the convex hull formed by the row-vectors ","authors_text":"Prakash Ishwar, Venkatesh Saligrama, Weicong Ding","cross_cats":["cs.CL","cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-23T03:44:26Z","title":"Necessary and Sufficient Conditions and a Provably Efficient Algorithm for Separable Topic Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05565","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:75a56a9fd5ca13ccebac2b16b412e041074ec269c1a99467acbb7b5ebd9bd937","target":"record","created_at":"2026-05-18T01:25:17Z","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":"fa1a998cae5261ec734e514274f90690150f40b631e916cf6329e0f1eebc507b","cross_cats_sorted":["cs.CL","cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-23T03:44:26Z","title_canon_sha256":"96c8cd09b5368a07dae58f709af711b57e484776228a2828248603810168bd8e"},"schema_version":"1.0","source":{"id":"1508.05565","kind":"arxiv","version":2}},"canonical_sha256":"9f1cbc8f9743f05c2a08b30d81c77b2c8de5c6cd27266dd65d0e3ad92923a00a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f1cbc8f9743f05c2a08b30d81c77b2c8de5c6cd27266dd65d0e3ad92923a00a","first_computed_at":"2026-05-18T01:25:17.876250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:17.876250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WYN/oHUe63sFGDf9L0MSVzW2GSAV0oNYkOEKYZ8iQkdHgsF9BPs6WI/bsjwBUpcU1TlQAtoQGeQdbXfvTwccBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:17.876968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05565","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75a56a9fd5ca13ccebac2b16b412e041074ec269c1a99467acbb7b5ebd9bd937","sha256:5f466361dafa639ece50fd82aea3c7a4b29656cbbbd2e17a5647e2cc54055646"],"state_sha256":"0f97d38a6ba9df2a7db34de4cc4ffe13719bcd86d71c0ff307f6470f7041231a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIClMhNMwAuWnHCh7DoNQgD5kjNiNYDRZ6AV/fBd2nRJHF2GSY0zlHXtRS7DU1kSkdAUc2330WM3Zi5X8uIUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:01:56.044687Z","bundle_sha256":"1b137fd070ef8c69564cd92e2bb6258ee5a65cf22a2c0ddc8a2a987f474e9c0e"}}