{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BYW5KYGRE5RKPQGO6SENCDGFWE","short_pith_number":"pith:BYW5KYGR","schema_version":"1.0","canonical_sha256":"0e2dd560d12762a7c0cef488d10cc5b1003856a85f3599d66aa4b3c8d76b7e4e","source":{"kind":"arxiv","id":"1511.02746","version":1},"attestation_state":"computed","paper":{"title":"A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jong-Shi Pang, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2015-11-09T16:29:05Z","abstract_excerpt":"This article presents a powerful algorithmic framework for big data optimization, called the Block Successive Upper bound Minimization (BSUM). The BSUM includes as special cases many well-known methods for analyzing massive data sets, such as the Block Coordinate Descent (BCD), the Convex-Concave Procedure (CCCP), the Block Coordinate Proximal Gradient (BCPG) method, the Nonnegative Matrix Factorization (NMF), the Expectation Maximization (EM) method and so on. In this article, various features and properties of the BSUM are discussed from the viewpoint of design flexibility, computational eff"},"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":"1511.02746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-09T16:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"65833c4b163142563d4433fd6f6f5fbe12e8f716c777f6cc1376341da5b51fcb","abstract_canon_sha256":"7b0986634e8dfa155eabff30129766e2b414f78c42778135961b6abf122c86ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:29.466324Z","signature_b64":"mdGfr6/xIJLqqc2RXjwPH0I/7KVUq77RoNECFHK5qELymmHEdGoZiEGtRspteMVghJxdjBEclROPb/9L047xDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2dd560d12762a7c0cef488d10cc5b1003856a85f3599d66aa4b3c8d76b7e4e","last_reissued_at":"2026-05-18T01:27:29.465881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:29.465881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jong-Shi Pang, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2015-11-09T16:29:05Z","abstract_excerpt":"This article presents a powerful algorithmic framework for big data optimization, called the Block Successive Upper bound Minimization (BSUM). The BSUM includes as special cases many well-known methods for analyzing massive data sets, such as the Block Coordinate Descent (BCD), the Convex-Concave Procedure (CCCP), the Block Coordinate Proximal Gradient (BCPG) method, the Nonnegative Matrix Factorization (NMF), the Expectation Maximization (EM) method and so on. In this article, various features and properties of the BSUM are discussed from the viewpoint of design flexibility, computational eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02746","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":"1511.02746","created_at":"2026-05-18T01:27:29.465950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02746v1","created_at":"2026-05-18T01:27:29.465950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02746","created_at":"2026-05-18T01:27:29.465950+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYW5KYGRE5RK","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYW5KYGRE5RKPQGO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYW5KYGR","created_at":"2026-05-18T12:29:14.074870+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/BYW5KYGRE5RKPQGO6SENCDGFWE","json":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE.json","graph_json":"https://pith.science/api/pith-number/BYW5KYGRE5RKPQGO6SENCDGFWE/graph.json","events_json":"https://pith.science/api/pith-number/BYW5KYGRE5RKPQGO6SENCDGFWE/events.json","paper":"https://pith.science/paper/BYW5KYGR"},"agent_actions":{"view_html":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE","download_json":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE.json","view_paper":"https://pith.science/paper/BYW5KYGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02746&json=true","fetch_graph":"https://pith.science/api/pith-number/BYW5KYGRE5RKPQGO6SENCDGFWE/graph.json","fetch_events":"https://pith.science/api/pith-number/BYW5KYGRE5RKPQGO6SENCDGFWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE/action/storage_attestation","attest_author":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE/action/author_attestation","sign_citation":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE/action/citation_signature","submit_replication":"https://pith.science/pith/BYW5KYGRE5RKPQGO6SENCDGFWE/action/replication_record"}},"created_at":"2026-05-18T01:27:29.465950+00:00","updated_at":"2026-05-18T01:27:29.465950+00:00"}