{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RDRYZRTIFHR2VLPK3GYHPAOEMW","short_pith_number":"pith:RDRYZRTI","canonical_record":{"source":{"id":"1907.08969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-07-21T12:46:05Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"ce1f458f88be5449e28ffaa90385b1a8aac8ebbd1d897e7b0cb669d8671cd327","abstract_canon_sha256":"c99f209e082954edd724fcfa5145b43d571cf85c575e8d714810dd16a9d9beb7"},"schema_version":"1.0"},"canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","source":{"kind":"arxiv","id":"1907.08969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08969","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08969v1","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08969","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"RDRYZRTIFHR2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RDRYZRTIFHR2VLPK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RDRYZRTI","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RDRYZRTIFHR2VLPK3GYHPAOEMW","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-07-21T12:46:05Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"ce1f458f88be5449e28ffaa90385b1a8aac8ebbd1d897e7b0cb669d8671cd327","abstract_canon_sha256":"c99f209e082954edd724fcfa5145b43d571cf85c575e8d714810dd16a9d9beb7"},"schema_version":"1.0"},"canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:02.546007Z","signature_b64":"CFsrAlDUe/WeOIA1OdD/1lHGIORS97mNRu8kTEwwMnF+G0BpD0v4pcPuJaMZOcVjzQuGnXMEOECZsP/t3AL4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","last_reissued_at":"2026-05-17T23:40:02.545459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:02.545459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08969","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-17T23:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aC42C1hQIHaDe2UcTkXPFBNXzPpMvfsQCnoiaaM1Yyd77XRh+YdsI1pgtyjfwIVdL8aH8K8ad57XLtkVd4TgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:16:56.171662Z"},"content_sha256":"6d3031808be3bdda40903bed3bab2a0d2edb47417ebf047ea281318cbeaaa32e","schema_version":"1.0","event_id":"sha256:6d3031808be3bdda40903bed3bab2a0d2edb47417ebf047ea281318cbeaaa32e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RDRYZRTIFHR2VLPK3GYHPAOEMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Palomar, Ketan Rajawat, Sandeep Kumar","submitted_at":"2019-07-21T12:46:05Z","abstract_excerpt":"In this two-part work, we propose an algorithmic framework for solving non-convex problems whose objective function is the sum of a number of smooth component functions plus a convex (possibly non-smooth) or/and smooth (possibly non-convex) regularization function. The proposed algorithm incorporates ideas from several existing approaches such as alternate direction method of multipliers (ADMM), successive convex approximation (SCA), distributed and asynchronous algorithms, and inexact gradient methods. Different from a number of existing approaches, however, the proposed framework is flexible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08969","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-17T23:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doQv2eHUTxHq0EQsc0mpAIpgYnU5UEUVSAsd6oQSd+kdUy1XVD5B31y7LAAI8yM434usbsFGcaNifcbO0tPWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:16:56.172187Z"},"content_sha256":"6a9a0930a6830a271a6597865c7db37de60fea5fcef81c17f4438aa326ecee4d","schema_version":"1.0","event_id":"sha256:6a9a0930a6830a271a6597865c7db37de60fea5fcef81c17f4438aa326ecee4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/bundle.json","state_url":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/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-26T21:16:56Z","links":{"resolver":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW","bundle":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/bundle.json","state":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RDRYZRTIFHR2VLPK3GYHPAOEMW","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":"c99f209e082954edd724fcfa5145b43d571cf85c575e8d714810dd16a9d9beb7","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-07-21T12:46:05Z","title_canon_sha256":"ce1f458f88be5449e28ffaa90385b1a8aac8ebbd1d897e7b0cb669d8671cd327"},"schema_version":"1.0","source":{"id":"1907.08969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08969","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08969v1","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08969","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"RDRYZRTIFHR2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RDRYZRTIFHR2VLPK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RDRYZRTI","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:6a9a0930a6830a271a6597865c7db37de60fea5fcef81c17f4438aa326ecee4d","target":"graph","created_at":"2026-05-17T23:40:02Z","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":"In this two-part work, we propose an algorithmic framework for solving non-convex problems whose objective function is the sum of a number of smooth component functions plus a convex (possibly non-smooth) or/and smooth (possibly non-convex) regularization function. The proposed algorithm incorporates ideas from several existing approaches such as alternate direction method of multipliers (ADMM), successive convex approximation (SCA), distributed and asynchronous algorithms, and inexact gradient methods. Different from a number of existing approaches, however, the proposed framework is flexible","authors_text":"Daniel P. Palomar, Ketan Rajawat, Sandeep Kumar","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-07-21T12:46:05Z","title":"Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08969","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:6d3031808be3bdda40903bed3bab2a0d2edb47417ebf047ea281318cbeaaa32e","target":"record","created_at":"2026-05-17T23:40:02Z","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":"c99f209e082954edd724fcfa5145b43d571cf85c575e8d714810dd16a9d9beb7","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-07-21T12:46:05Z","title_canon_sha256":"ce1f458f88be5449e28ffaa90385b1a8aac8ebbd1d897e7b0cb669d8671cd327"},"schema_version":"1.0","source":{"id":"1907.08969","kind":"arxiv","version":1}},"canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","first_computed_at":"2026-05-17T23:40:02.545459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:02.545459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CFsrAlDUe/WeOIA1OdD/1lHGIORS97mNRu8kTEwwMnF+G0BpD0v4pcPuJaMZOcVjzQuGnXMEOECZsP/t3AL4Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:02.546007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d3031808be3bdda40903bed3bab2a0d2edb47417ebf047ea281318cbeaaa32e","sha256:6a9a0930a6830a271a6597865c7db37de60fea5fcef81c17f4438aa326ecee4d"],"state_sha256":"5ea158c7f76d0fed0d756e6e1445f40cceb58a8c8a0e73036bc30e389a70c625"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buMXAqsSropDwbQSS42m44EIDVA1Ej4WPkhnl9pjTr3bPk2GWua0nvltHwh/mzbHr40EEGVyDYXw56gCUUWSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:16:56.175425Z","bundle_sha256":"8b346024ddd87e25f48df77372213dbfaa92fd7a85a9500eb2ae0f6aaa9680bb"}}