{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RCYSSNRBPS5MLIWXXPERGWO56D","short_pith_number":"pith:RCYSSNRB","schema_version":"1.0","canonical_sha256":"88b12936217cbac5a2d7bbc91359ddf0cae07c16083c0a137c836baa2b731d4d","source":{"kind":"arxiv","id":"1611.05010","version":1},"attestation_state":"computed","paper":{"title":"Anchor-Free Correlated Topic Modeling: Identifiability and Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.IR","cs.SI"],"primary_cat":"stat.ML","authors_text":"Kejun Huang, Nicholas D. Sidiropoulos, Xiao Fu","submitted_at":"2016-11-15T20:06:40Z","abstract_excerpt":"In topic modeling, many algorithms that guarantee identifiability of the topics have been developed under the premise that there exist anchor words -- i.e., words that only appear (with positive probability) in one topic. Follow-up work has resorted to three or higher-order statistics of the data corpus to relax the anchor word assumption. Reliable estimates of higher-order statistics are hard to obtain, however, and the identification of topics under those models hinges on uncorrelatedness of the topics, which can be unrealistic. This paper revisits topic modeling based on second-order moment"},"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":"1611.05010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-15T20:06:40Z","cross_cats_sorted":["cs.CL","cs.IR","cs.SI"],"title_canon_sha256":"50f3850ef3d0bcc5dbc64c44bc7b4b65209a6407446c22faa21efe96453f3a8e","abstract_canon_sha256":"d70b4dec0ed9ebfd76d7d252a144ad8283c2dad50225b5c702f851190f592d58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:49.279429Z","signature_b64":"yDu4+x31O9a+1xvjKsAI5QTVminmVY7agx21l8cKBxrEqAGzQ37gDscKCIQZCGzkH/isRrXdelljD5YFxqQhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b12936217cbac5a2d7bbc91359ddf0cae07c16083c0a137c836baa2b731d4d","last_reissued_at":"2026-05-18T00:58:49.278723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:49.278723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anchor-Free Correlated Topic Modeling: Identifiability and Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.IR","cs.SI"],"primary_cat":"stat.ML","authors_text":"Kejun Huang, Nicholas D. Sidiropoulos, Xiao Fu","submitted_at":"2016-11-15T20:06:40Z","abstract_excerpt":"In topic modeling, many algorithms that guarantee identifiability of the topics have been developed under the premise that there exist anchor words -- i.e., words that only appear (with positive probability) in one topic. Follow-up work has resorted to three or higher-order statistics of the data corpus to relax the anchor word assumption. Reliable estimates of higher-order statistics are hard to obtain, however, and the identification of topics under those models hinges on uncorrelatedness of the topics, which can be unrealistic. This paper revisits topic modeling based on second-order moment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05010","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":"1611.05010","created_at":"2026-05-18T00:58:49.278829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05010v1","created_at":"2026-05-18T00:58:49.278829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05010","created_at":"2026-05-18T00:58:49.278829+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCYSSNRBPS5M","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCYSSNRBPS5MLIWX","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCYSSNRB","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D","json":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D.json","graph_json":"https://pith.science/api/pith-number/RCYSSNRBPS5MLIWXXPERGWO56D/graph.json","events_json":"https://pith.science/api/pith-number/RCYSSNRBPS5MLIWXXPERGWO56D/events.json","paper":"https://pith.science/paper/RCYSSNRB"},"agent_actions":{"view_html":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D","download_json":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D.json","view_paper":"https://pith.science/paper/RCYSSNRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05010&json=true","fetch_graph":"https://pith.science/api/pith-number/RCYSSNRBPS5MLIWXXPERGWO56D/graph.json","fetch_events":"https://pith.science/api/pith-number/RCYSSNRBPS5MLIWXXPERGWO56D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D/action/storage_attestation","attest_author":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D/action/author_attestation","sign_citation":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D/action/citation_signature","submit_replication":"https://pith.science/pith/RCYSSNRBPS5MLIWXXPERGWO56D/action/replication_record"}},"created_at":"2026-05-18T00:58:49.278829+00:00","updated_at":"2026-05-18T00:58:49.278829+00:00"}