{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ONEX3DFBMKEDOEAMLHS5UOK6MI","short_pith_number":"pith:ONEX3DFB","canonical_record":{"source":{"id":"1808.04648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-14T12:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"a4e69ab6130b5094da50c1e7d0c38e0c4f836465dc7929945b0c01ad8a57cc74","abstract_canon_sha256":"7797696d3a2702e5308365522e6e628681c84deadf005c9bb64ed3cb5db23efa"},"schema_version":"1.0"},"canonical_sha256":"73497d8ca1628837100c59e5da395e621ce47a987efd4c6854903a94407ff1d0","source":{"kind":"arxiv","id":"1808.04648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04648","created_at":"2026-05-18T00:08:11Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04648v1","created_at":"2026-05-18T00:08:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04648","created_at":"2026-05-18T00:08:11Z"},{"alias_kind":"pith_short_12","alias_value":"ONEX3DFBMKED","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ONEX3DFBMKEDOEAM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ONEX3DFB","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ONEX3DFBMKEDOEAMLHS5UOK6MI","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-14T12:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"a4e69ab6130b5094da50c1e7d0c38e0c4f836465dc7929945b0c01ad8a57cc74","abstract_canon_sha256":"7797696d3a2702e5308365522e6e628681c84deadf005c9bb64ed3cb5db23efa"},"schema_version":"1.0"},"canonical_sha256":"73497d8ca1628837100c59e5da395e621ce47a987efd4c6854903a94407ff1d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:11.960440Z","signature_b64":"G6AC5zQqkbgieHd3kx4SzLl8DlfUM7+D3VXRS5RiUWBsMASfRM2GltNzyHESUg51X1eJ/FI5Zeukk4AsRP9VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73497d8ca1628837100c59e5da395e621ce47a987efd4c6854903a94407ff1d0","last_reissued_at":"2026-05-18T00:08:11.959799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:11.959799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04648","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-18T00:08:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3ko2g835L2z0nlQHweZoBXrpn6IuAiD5kw1rzQHrwpBrs493rQUKg+C+r5CQayLqYEjhgVnPW0WXLjDVM3RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:39:43.763988Z"},"content_sha256":"dde0f7f0c85191c34a627488fa325df23973edbd360ce76f15806aa41866d0c4","schema_version":"1.0","event_id":"sha256:dde0f7f0c85191c34a627488fa325df23973edbd360ce76f15806aa41866d0c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ONEX3DFBMKEDOEAMLHS5UOK6MI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptive Primal-Dual Framework for Nonsmooth Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ahmet Alacaoglu, Olivier Fercoq, Quoc Tran-Dinh, Volkan Cevher","submitted_at":"2018-08-14T12:00:35Z","abstract_excerpt":"We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov's smoothing technique via general Bregman distance functions. It self-adaptively selects the number of iterations in the inner loop to achieve a desired complexity bound without requiring the accuracy a priori as in variants of Augmented Lagrangian methods (ALM). We prove $\\BigO{\\frac{1}{k}}$-convergence rate on the last iterate of the outer sequence for both unconstrained and constrained settings in contrast to ergodic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04648","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-18T00:08:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqbjeTr+TOi2Hl0X4PQOSXrFfkcCKlpCpaB9k4AWwZQ0HFoZdLrcVuoOqc0vGfn+Sef+votymb9gSGVOrrpGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:39:43.764542Z"},"content_sha256":"949137bd43cc868b9e8c8ec34d8a408693261eb621fc56473c77ad16acfb6532","schema_version":"1.0","event_id":"sha256:949137bd43cc868b9e8c8ec34d8a408693261eb621fc56473c77ad16acfb6532"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI/bundle.json","state_url":"https://pith.science/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI/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-27T14:39:43Z","links":{"resolver":"https://pith.science/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI","bundle":"https://pith.science/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI/bundle.json","state":"https://pith.science/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONEX3DFBMKEDOEAMLHS5UOK6MI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ONEX3DFBMKEDOEAMLHS5UOK6MI","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":"7797696d3a2702e5308365522e6e628681c84deadf005c9bb64ed3cb5db23efa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-14T12:00:35Z","title_canon_sha256":"a4e69ab6130b5094da50c1e7d0c38e0c4f836465dc7929945b0c01ad8a57cc74"},"schema_version":"1.0","source":{"id":"1808.04648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04648","created_at":"2026-05-18T00:08:11Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04648v1","created_at":"2026-05-18T00:08:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04648","created_at":"2026-05-18T00:08:11Z"},{"alias_kind":"pith_short_12","alias_value":"ONEX3DFBMKED","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ONEX3DFBMKEDOEAM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ONEX3DFB","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:949137bd43cc868b9e8c8ec34d8a408693261eb621fc56473c77ad16acfb6532","target":"graph","created_at":"2026-05-18T00:08:11Z","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":"We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov's smoothing technique via general Bregman distance functions. It self-adaptively selects the number of iterations in the inner loop to achieve a desired complexity bound without requiring the accuracy a priori as in variants of Augmented Lagrangian methods (ALM). We prove $\\BigO{\\frac{1}{k}}$-convergence rate on the last iterate of the outer sequence for both unconstrained and constrained settings in contrast to ergodic ","authors_text":"Ahmet Alacaoglu, Olivier Fercoq, Quoc Tran-Dinh, Volkan Cevher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-14T12:00:35Z","title":"An Adaptive Primal-Dual Framework for Nonsmooth Convex Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04648","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:dde0f7f0c85191c34a627488fa325df23973edbd360ce76f15806aa41866d0c4","target":"record","created_at":"2026-05-18T00:08:11Z","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":"7797696d3a2702e5308365522e6e628681c84deadf005c9bb64ed3cb5db23efa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-14T12:00:35Z","title_canon_sha256":"a4e69ab6130b5094da50c1e7d0c38e0c4f836465dc7929945b0c01ad8a57cc74"},"schema_version":"1.0","source":{"id":"1808.04648","kind":"arxiv","version":1}},"canonical_sha256":"73497d8ca1628837100c59e5da395e621ce47a987efd4c6854903a94407ff1d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73497d8ca1628837100c59e5da395e621ce47a987efd4c6854903a94407ff1d0","first_computed_at":"2026-05-18T00:08:11.959799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:11.959799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6AC5zQqkbgieHd3kx4SzLl8DlfUM7+D3VXRS5RiUWBsMASfRM2GltNzyHESUg51X1eJ/FI5Zeukk4AsRP9VAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:11.960440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dde0f7f0c85191c34a627488fa325df23973edbd360ce76f15806aa41866d0c4","sha256:949137bd43cc868b9e8c8ec34d8a408693261eb621fc56473c77ad16acfb6532"],"state_sha256":"a7ee88a5e97c5f427927e1aacf7d4ef382f6f87f88a2d48b4de653349cf4bdd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAR5azrCKPNOj+HG8/L6Z1XPtl6gFFI57qLgHx8PiZOOJI0pvQMuEcsa6FNl7sZ0jC99741n1KuOvtNtgqVPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:39:43.768258Z","bundle_sha256":"56b240fb17516e04728bb5ec6a623c2ed3b6bfd768a13f95e2d43ab825ec56ed"}}