{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5MICNPPLVJAIUTTO5NZKARXDXS","short_pith_number":"pith:5MICNPPL","canonical_record":{"source":{"id":"1401.7079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-28T03:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"8a0a2c04b038a3a23791cde275987bc6f8eea88dc9deca2bf48e2e1a6ebba97e","abstract_canon_sha256":"04ad48af60700dac605679e0d399738c01561df082c196e0a38cd6fcb75bb3a0"},"schema_version":"1.0"},"canonical_sha256":"eb1026bdebaa408a4e6eeb72a046e3bc866356a984f8c394ecc90eae958a4a7e","source":{"kind":"arxiv","id":"1401.7079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7079","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7079v1","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7079","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"5MICNPPLVJAI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5MICNPPLVJAIUTTO","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5MICNPPL","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5MICNPPLVJAIUTTO5NZKARXDXS","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-28T03:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"8a0a2c04b038a3a23791cde275987bc6f8eea88dc9deca2bf48e2e1a6ebba97e","abstract_canon_sha256":"04ad48af60700dac605679e0d399738c01561df082c196e0a38cd6fcb75bb3a0"},"schema_version":"1.0"},"canonical_sha256":"eb1026bdebaa408a4e6eeb72a046e3bc866356a984f8c394ecc90eae958a4a7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:50.921283Z","signature_b64":"sPp+si0cCSrVziU6YJgVNxaLYy2Ved8DvTrO3aQuPrGV4AIp4vIyBLAJLf5XTW0nEW51DbPu9bpqFtH2kk3uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb1026bdebaa408a4e6eeb72a046e3bc866356a984f8c394ecc90eae958a4a7e","last_reissued_at":"2026-05-18T03:00:50.920792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:50.920792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7079","source_version":1,"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-18T03:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VK99X36t6zGNyYlO0ZcZPyC5f75By5Z8cJ7XveJhTDFwWyPro8QgtZarizIwwkbHSaCEmc5C5QDzw+N1yLKABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:02.417110Z"},"content_sha256":"32b7f44dc0a15d8315fd8c52656a9d73fbec8586e159ecf072dbbb98db7b25a5","schema_version":"1.0","event_id":"sha256:32b7f44dc0a15d8315fd8c52656a9d73fbec8586e159ecf072dbbb98db7b25a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5MICNPPLVJAIUTTO5NZKARXDXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Meisam Razaviyayn, Mingyi Hong, Shiqian Ma, Tsung-Hui Chang, Xiangfeng Wang, Zhi-Quan Luo","submitted_at":"2014-01-28T03:54:12Z","abstract_excerpt":"Consider the problem of minimizing the sum of a smooth convex function and a separable nonsmooth convex function subject to linear coupling constraints. Problems of this form arise in many contemporary applications including signal processing, wireless networking and smart grid provisioning. Motivated by the huge size of these applications, we propose a new class of first order primal-dual algorithms called the block successive upper-bound minimization method of multipliers (BSUM-M) to solve this family of problems. The BSUM-M updates the primal variable blocks successively by minimizing local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7079","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"},"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-18T03:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyQu0LtCvuU+ZvHzLljwmiLiFuAHvRpwVmm5qEyWp8MyEF9aeoUDeR6u03v48gjd285G+H99Ufoo7nG/NJWVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:02.417784Z"},"content_sha256":"95271faf38bcae366620ab15dce19ce3d4779502d49ee18edf7fa27f317a5218","schema_version":"1.0","event_id":"sha256:95271faf38bcae366620ab15dce19ce3d4779502d49ee18edf7fa27f317a5218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MICNPPLVJAIUTTO5NZKARXDXS/bundle.json","state_url":"https://pith.science/pith/5MICNPPLVJAIUTTO5NZKARXDXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MICNPPLVJAIUTTO5NZKARXDXS/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-05-25T18:59:02Z","links":{"resolver":"https://pith.science/pith/5MICNPPLVJAIUTTO5NZKARXDXS","bundle":"https://pith.science/pith/5MICNPPLVJAIUTTO5NZKARXDXS/bundle.json","state":"https://pith.science/pith/5MICNPPLVJAIUTTO5NZKARXDXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MICNPPLVJAIUTTO5NZKARXDXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5MICNPPLVJAIUTTO5NZKARXDXS","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":"04ad48af60700dac605679e0d399738c01561df082c196e0a38cd6fcb75bb3a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-28T03:54:12Z","title_canon_sha256":"8a0a2c04b038a3a23791cde275987bc6f8eea88dc9deca2bf48e2e1a6ebba97e"},"schema_version":"1.0","source":{"id":"1401.7079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7079","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7079v1","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7079","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"5MICNPPLVJAI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5MICNPPLVJAIUTTO","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5MICNPPL","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:95271faf38bcae366620ab15dce19ce3d4779502d49ee18edf7fa27f317a5218","target":"graph","created_at":"2026-05-18T03:00:50Z","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":"Consider the problem of minimizing the sum of a smooth convex function and a separable nonsmooth convex function subject to linear coupling constraints. Problems of this form arise in many contemporary applications including signal processing, wireless networking and smart grid provisioning. Motivated by the huge size of these applications, we propose a new class of first order primal-dual algorithms called the block successive upper-bound minimization method of multipliers (BSUM-M) to solve this family of problems. The BSUM-M updates the primal variable blocks successively by minimizing local","authors_text":"Meisam Razaviyayn, Mingyi Hong, Shiqian Ma, Tsung-Hui Chang, Xiangfeng Wang, Zhi-Quan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-28T03:54:12Z","title":"A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7079","kind":"arxiv","version":1},"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:32b7f44dc0a15d8315fd8c52656a9d73fbec8586e159ecf072dbbb98db7b25a5","target":"record","created_at":"2026-05-18T03:00:50Z","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":"04ad48af60700dac605679e0d399738c01561df082c196e0a38cd6fcb75bb3a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-28T03:54:12Z","title_canon_sha256":"8a0a2c04b038a3a23791cde275987bc6f8eea88dc9deca2bf48e2e1a6ebba97e"},"schema_version":"1.0","source":{"id":"1401.7079","kind":"arxiv","version":1}},"canonical_sha256":"eb1026bdebaa408a4e6eeb72a046e3bc866356a984f8c394ecc90eae958a4a7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb1026bdebaa408a4e6eeb72a046e3bc866356a984f8c394ecc90eae958a4a7e","first_computed_at":"2026-05-18T03:00:50.920792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:50.920792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sPp+si0cCSrVziU6YJgVNxaLYy2Ved8DvTrO3aQuPrGV4AIp4vIyBLAJLf5XTW0nEW51DbPu9bpqFtH2kk3uDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:50.921283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32b7f44dc0a15d8315fd8c52656a9d73fbec8586e159ecf072dbbb98db7b25a5","sha256:95271faf38bcae366620ab15dce19ce3d4779502d49ee18edf7fa27f317a5218"],"state_sha256":"563fb3bbcc90aed43a641f7ba221795eaced1d9af123285771c297564b27c422"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puhmKSwlCkbSAiN1VT+qPTlO3j7Tfk4zG//7ElcirzdTJm8P0GV5Iha2fD2uo3sK54hqYrLUlJUnwRC39kHFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:02.421349Z","bundle_sha256":"267ab4f3a3f2620345665e9b426d67606e23262c19409f894962bb02e454e6f7"}}