{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6WAX6RMDYJDOVNWOAQRGIRGEX7","short_pith_number":"pith:6WAX6RMD","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"},"canonical_sha256":"f5817f4583c246eab6ce04226444c4bff239c0885fb2faf773a9839c833dce67","source":{"kind":"arxiv","id":"1610.06145","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06145","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06145v2","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06145","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"6WAX6RMDYJDO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6WAX6RMDYJDOVNWO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6WAX6RMD","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6WAX6RMDYJDOVNWOAQRGIRGEX7","target":"record","payload":{"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"},"canonical_sha256":"f5817f4583c246eab6ce04226444c4bff239c0885fb2faf773a9839c833dce67","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"},"source_kind":"arxiv","source_id":"1610.06145","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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWw09ARbXTF+JdVQrSkZ3+gCc87IBU2A/Jc3UqSTOM3ZfL2mBT+jmM9AvYuKFz6V9sevD80v+flIkz5amEvgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:00:20.759738Z"},"content_sha256":"ac66ab2790a7247d9ed05873a86106e58d9874459b1445cd419a4aeb8316b938","schema_version":"1.0","event_id":"sha256:ac66ab2790a7247d9ed05873a86106e58d9874459b1445cd419a4aeb8316b938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6WAX6RMDYJDOVNWOAQRGIRGEX7","target":"graph","payload":{"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"},"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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihjRSgIuXYmbtxGCDMBehCWFV6Fe1SkPOEOINpPSQTy28PgUH30x2QiXzeW/Dgzc6P9EZdnDbp4R0XW7IQF4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:00:20.760072Z"},"content_sha256":"1869f49830d603f8011ffa5169e04e67f1d2e36cc6edcaaced80ae106bad3393","schema_version":"1.0","event_id":"sha256:1869f49830d603f8011ffa5169e04e67f1d2e36cc6edcaaced80ae106bad3393"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/bundle.json","state_url":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/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-20T04:00:20Z","links":{"resolver":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7","bundle":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/bundle.json","state":"https://pith.science/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WAX6RMDYJDOVNWOAQRGIRGEX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6WAX6RMDYJDOVNWOAQRGIRGEX7","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":"ca40f449048a80bc03bfb54fff105b19df9492a951f1d69cad606114403aa24f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-19T18:39:41Z","title_canon_sha256":"650604e3d4f8f546c697dc757574d2e5b7b3af7bda7858bdc636b646596abc70"},"schema_version":"1.0","source":{"id":"1610.06145","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06145","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06145v2","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06145","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"6WAX6RMDYJDO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6WAX6RMDYJDOVNWO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6WAX6RMD","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:1869f49830d603f8011ffa5169e04e67f1d2e36cc6edcaaced80ae106bad3393","target":"graph","created_at":"2026-05-18T01:01:21Z","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":"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","authors_text":"Andrew Trapp, Chuangqi Wang, Fan Zhang, Patrick Flaherty","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-19T18:39:41Z","title":"A global optimization algorithm for sparse mixed membership matrix factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06145","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:ac66ab2790a7247d9ed05873a86106e58d9874459b1445cd419a4aeb8316b938","target":"record","created_at":"2026-05-18T01:01:21Z","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":"ca40f449048a80bc03bfb54fff105b19df9492a951f1d69cad606114403aa24f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-19T18:39:41Z","title_canon_sha256":"650604e3d4f8f546c697dc757574d2e5b7b3af7bda7858bdc636b646596abc70"},"schema_version":"1.0","source":{"id":"1610.06145","kind":"arxiv","version":2}},"canonical_sha256":"f5817f4583c246eab6ce04226444c4bff239c0885fb2faf773a9839c833dce67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5817f4583c246eab6ce04226444c4bff239c0885fb2faf773a9839c833dce67","first_computed_at":"2026-05-18T01:01:21.743075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:21.743075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6CYehNoZL8yY7TX6Ra+8TIbrbGcOkpDS/3r6UKJupOYhs/uRkW+z2f56+DvuNFJSPlEBx+0PGe3u/eVgimcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:21.743658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06145","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac66ab2790a7247d9ed05873a86106e58d9874459b1445cd419a4aeb8316b938","sha256:1869f49830d603f8011ffa5169e04e67f1d2e36cc6edcaaced80ae106bad3393"],"state_sha256":"d209b9d534913bde1b27ef201159fd1bbbc1d237aa84f20c80b8d3cd91ba93ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Kk3osB1gGx59AIbYujU/tLLVpP17BuiaBiQ1e8G9H+UHB7i8lnnK+grCyvrIatspSQe7mqAL/lZkMurBzfbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:00:20.761907Z","bundle_sha256":"69d7c7eeca3ddb44e3142ced16aabf4a987534d696c36a7d7a77d472c4850919"}}