{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GZ7CCP4CVPJHR5ZSAW336OGXZL","short_pith_number":"pith:GZ7CCP4C","canonical_record":{"source":{"id":"1307.4457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-17T00:19:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6cb1da92785136df42fd5c54fb77f920e2f0bebbb76ccea9cd70f9030d335690","abstract_canon_sha256":"2e224ec30c319204aa8b9c33806642f679621e7cb81f730ac1e440e5f205ae0a"},"schema_version":"1.0"},"canonical_sha256":"367e213f82abd278f73205b7bf38d7caf5de4c0c1c2997e8fa9da50be6848f96","source":{"kind":"arxiv","id":"1307.4457","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4457","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4457v2","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4457","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"GZ7CCP4CVPJH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GZ7CCP4CVPJHR5ZS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GZ7CCP4C","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GZ7CCP4CVPJHR5ZSAW336OGXZL","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-17T00:19:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6cb1da92785136df42fd5c54fb77f920e2f0bebbb76ccea9cd70f9030d335690","abstract_canon_sha256":"2e224ec30c319204aa8b9c33806642f679621e7cb81f730ac1e440e5f205ae0a"},"schema_version":"1.0"},"canonical_sha256":"367e213f82abd278f73205b7bf38d7caf5de4c0c1c2997e8fa9da50be6848f96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:46.114270Z","signature_b64":"bjryM2kwSEt9MbNM2r8tAC6XC0NtevBbg6W5Fw2t/mGzS6GX1pfRy7E2DTbZqWXIfsd5ZWPqg7ku6T0J8YSlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"367e213f82abd278f73205b7bf38d7caf5de4c0c1c2997e8fa9da50be6848f96","last_reissued_at":"2026-05-18T03:17:46.113601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:46.113601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4457","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-18T03:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ti2gzrr7FPOWA3JtwMoOqO9EozhBpLKe4XiiUSBnhWNvHlAHJandxFaCSk2dOQpTIk0uafa24YzP57PfTHWhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:26:53.411188Z"},"content_sha256":"0a16ed40a4834f3b2bf1d858c77b6af39814a452d1ed9dbf8eb3d71fe703f21b","schema_version":"1.0","event_id":"sha256:0a16ed40a4834f3b2bf1d858c77b6af39814a452d1ed9dbf8eb3d71fe703f21b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GZ7CCP4CVPJHR5ZSAW336OGXZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stochastic Successive Minimization Method for Nonsmooth Nonconvex Optimization with Applications to Transceiver Design in Wireless Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Maziar Sanjabi, Meisam Razaviyayn, Zhi-Quan Luo","submitted_at":"2013-07-17T00:19:59Z","abstract_excerpt":"Consider the problem of minimizing the expected value of a cost function parameterized by a random variable. The classical sample average approximation (SAA) method for solving this problem requires minimization of an ensemble average of the objective at each step, which can be expensive. In this paper, we propose a stochastic successive upper-bound minimization method (SSUM) which minimizes an approximate ensemble average at each iteration. To ensure convergence and to facilitate computation, we require the approximate ensemble average to be a locally tight upper-bound of the expected cost fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4457","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-18T03:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKJ7mkf35biczIK24P69tKXDWP34EQoFGzaneaRoIZ26iOWEZekW5ovAaMuTgZihGzYajxRZE5Dl25yvkwDEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:26:53.411946Z"},"content_sha256":"8e105f8db9c9bdac83ae26a80aee84f2a7df2d9d8d7f46e296d31aa8d07fb163","schema_version":"1.0","event_id":"sha256:8e105f8db9c9bdac83ae26a80aee84f2a7df2d9d8d7f46e296d31aa8d07fb163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL/bundle.json","state_url":"https://pith.science/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL/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-30T02:26:53Z","links":{"resolver":"https://pith.science/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL","bundle":"https://pith.science/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL/bundle.json","state":"https://pith.science/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZ7CCP4CVPJHR5ZSAW336OGXZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GZ7CCP4CVPJHR5ZSAW336OGXZL","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":"2e224ec30c319204aa8b9c33806642f679621e7cb81f730ac1e440e5f205ae0a","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-17T00:19:59Z","title_canon_sha256":"6cb1da92785136df42fd5c54fb77f920e2f0bebbb76ccea9cd70f9030d335690"},"schema_version":"1.0","source":{"id":"1307.4457","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4457","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4457v2","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4457","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"GZ7CCP4CVPJH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GZ7CCP4CVPJHR5ZS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GZ7CCP4C","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:8e105f8db9c9bdac83ae26a80aee84f2a7df2d9d8d7f46e296d31aa8d07fb163","target":"graph","created_at":"2026-05-18T03:17:46Z","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 expected value of a cost function parameterized by a random variable. The classical sample average approximation (SAA) method for solving this problem requires minimization of an ensemble average of the objective at each step, which can be expensive. In this paper, we propose a stochastic successive upper-bound minimization method (SSUM) which minimizes an approximate ensemble average at each iteration. To ensure convergence and to facilitate computation, we require the approximate ensemble average to be a locally tight upper-bound of the expected cost fu","authors_text":"Maziar Sanjabi, Meisam Razaviyayn, Zhi-Quan Luo","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-17T00:19:59Z","title":"A Stochastic Successive Minimization Method for Nonsmooth Nonconvex Optimization with Applications to Transceiver Design in Wireless Communication Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4457","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:0a16ed40a4834f3b2bf1d858c77b6af39814a452d1ed9dbf8eb3d71fe703f21b","target":"record","created_at":"2026-05-18T03:17:46Z","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":"2e224ec30c319204aa8b9c33806642f679621e7cb81f730ac1e440e5f205ae0a","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-17T00:19:59Z","title_canon_sha256":"6cb1da92785136df42fd5c54fb77f920e2f0bebbb76ccea9cd70f9030d335690"},"schema_version":"1.0","source":{"id":"1307.4457","kind":"arxiv","version":2}},"canonical_sha256":"367e213f82abd278f73205b7bf38d7caf5de4c0c1c2997e8fa9da50be6848f96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"367e213f82abd278f73205b7bf38d7caf5de4c0c1c2997e8fa9da50be6848f96","first_computed_at":"2026-05-18T03:17:46.113601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:46.113601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bjryM2kwSEt9MbNM2r8tAC6XC0NtevBbg6W5Fw2t/mGzS6GX1pfRy7E2DTbZqWXIfsd5ZWPqg7ku6T0J8YSlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:46.114270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4457","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a16ed40a4834f3b2bf1d858c77b6af39814a452d1ed9dbf8eb3d71fe703f21b","sha256:8e105f8db9c9bdac83ae26a80aee84f2a7df2d9d8d7f46e296d31aa8d07fb163"],"state_sha256":"f968010fd011ab23f589028865bae7ac96aa680752ed9467eac5a5726c7d7c14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvBKEs/3r3G+/afJZD/ErOslLSdHbg+6i2KQfyQei61OXgganTpl+fIJ2BTfyz4e2goLWFX4kJIG9l2R/WAxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:26:53.414968Z","bundle_sha256":"656f6c5de1476adfc520fcfaace9a5e38a7496eee00dc42a5f8cdf122806387c"}}