{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6WAX6RMDYJDOVNWOAQRGIRGEX7","short_pith_number":"pith:6WAX6RMD","schema_version":"1.0","canonical_sha256":"f5817f4583c246eab6ce04226444c4bff239c0885fb2faf773a9839c833dce67","source":{"kind":"arxiv","id":"1610.06145","version":2},"attestation_state":"computed","paper":{"title":"A global optimization algorithm for sparse mixed membership matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"stat.ME","authors_text":"Andrew Trapp, Chuangqi Wang, Fan Zhang, Patrick Flaherty","submitted_at":"2016-10-19T18:39:41Z","abstract_excerpt":"Mixed membership factorization is a popular approach for analyzing data sets that have within-sample heterogeneity. In recent years, several algorithms have been developed for mixed membership matrix factorization, but they only guarantee estimates from a local optimum. Here, we derive a global optimization (GOP) algorithm that provides a guaranteed $\\epsilon$-global optimum for a sparse mixed membership matrix factorization problem. We test the algorithm on simulated data and find the algorithm always bounds the global optimum across random initializations and explores multiple modes efficien"},"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":"1610.06145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-19T18:39:41Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"650604e3d4f8f546c697dc757574d2e5b7b3af7bda7858bdc636b646596abc70","abstract_canon_sha256":"ca40f449048a80bc03bfb54fff105b19df9492a951f1d69cad606114403aa24f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:21.743658Z","signature_b64":"E6CYehNoZL8yY7TX6Ra+8TIbrbGcOkpDS/3r6UKJupOYhs/uRkW+z2f56+DvuNFJSPlEBx+0PGe3u/eVgimcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5817f4583c246eab6ce04226444c4bff239c0885fb2faf773a9839c833dce67","last_reissued_at":"2026-05-18T01:01:21.743075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:21.743075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A global optimization algorithm for sparse mixed membership matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"stat.ME","authors_text":"Andrew Trapp, Chuangqi Wang, Fan Zhang, Patrick Flaherty","submitted_at":"2016-10-19T18:39:41Z","abstract_excerpt":"Mixed membership factorization is a popular approach for analyzing data sets that have within-sample heterogeneity. In recent years, several algorithms have been developed for mixed membership matrix factorization, but they only guarantee estimates from a local optimum. Here, we derive a global optimization (GOP) algorithm that provides a guaranteed $\\epsilon$-global optimum for a sparse mixed membership matrix factorization problem. We test the algorithm on simulated data and find the algorithm always bounds the global optimum across random initializations and explores multiple modes efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06145","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.06145","created_at":"2026-05-18T01:01:21.743157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06145v2","created_at":"2026-05-18T01:01:21.743157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06145","created_at":"2026-05-18T01:01:21.743157+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WAX6RMDYJDO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WAX6RMDYJDOVNWO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WAX6RMD","created_at":"2026-05-18T12:30:04.600751+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/6WAX6RMDYJDOVNWOAQRGIRGEX7","json":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7.json","graph_json":"https://pith.science/api/pith-number/6WAX6RMDYJDOVNWOAQRGIRGEX7/graph.json","events_json":"https://pith.science/api/pith-number/6WAX6RMDYJDOVNWOAQRGIRGEX7/events.json","paper":"https://pith.science/paper/6WAX6RMD"},"agent_actions":{"view_html":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7","download_json":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7.json","view_paper":"https://pith.science/paper/6WAX6RMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06145&json=true","fetch_graph":"https://pith.science/api/pith-number/6WAX6RMDYJDOVNWOAQRGIRGEX7/graph.json","fetch_events":"https://pith.science/api/pith-number/6WAX6RMDYJDOVNWOAQRGIRGEX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/action/storage_attestation","attest_author":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/action/author_attestation","sign_citation":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/action/citation_signature","submit_replication":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/action/replication_record"}},"created_at":"2026-05-18T01:01:21.743157+00:00","updated_at":"2026-05-18T01:01:21.743157+00:00"}