{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YAIUUNWQ6GYGFNOHS44DZ47EPH","short_pith_number":"pith:YAIUUNWQ","schema_version":"1.0","canonical_sha256":"c0114a36d0f1b062b5c797383cf3e479d82defe26cf240828d9268a514d2601c","source":{"kind":"arxiv","id":"1509.05715","version":3},"attestation_state":"computed","paper":{"title":"MAGMA: Multi-level accelerated gradient mirror descent algorithm for large-scale convex composite minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"math.OC","authors_text":"Panos Parpas, Stefanos Zafeiriou, Vahan Hovhannisyan","submitted_at":"2015-09-18T17:25:16Z","abstract_excerpt":"Composite convex optimization models arise in several applications, and are especially prevalent in inverse problems with a sparsity inducing norm and in general convex optimization with simple constraints. The most widely used algorithms for convex composite models are accelerated first order methods, however they can take a large number of iterations to compute an acceptable solution for large-scale problems. In this paper we propose to speed up first order methods by taking advantage of the structure present in many applications and in image processing in particular. Our method is based on "},"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":"1509.05715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-18T17:25:16Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"4d433808dc70b8bbb9303ea78ee6d377df04b791408468048f308d6e518daf21","abstract_canon_sha256":"8c2770b2ce48130ac05a0d2ffb56903c5e7fe4102b4e347bb1651b470334e380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:05.144244Z","signature_b64":"bqzH94LDlhmnTDajTiVTM2TBIPp5bFhJ/TFXoXz2VnICjItmV+UTz71mVVFAiKkJMrVQzQeDksShmXbxKY5mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0114a36d0f1b062b5c797383cf3e479d82defe26cf240828d9268a514d2601c","last_reissued_at":"2026-05-18T01:11:05.143686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:05.143686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MAGMA: Multi-level accelerated gradient mirror descent algorithm for large-scale convex composite minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"math.OC","authors_text":"Panos Parpas, Stefanos Zafeiriou, Vahan Hovhannisyan","submitted_at":"2015-09-18T17:25:16Z","abstract_excerpt":"Composite convex optimization models arise in several applications, and are especially prevalent in inverse problems with a sparsity inducing norm and in general convex optimization with simple constraints. The most widely used algorithms for convex composite models are accelerated first order methods, however they can take a large number of iterations to compute an acceptable solution for large-scale problems. In this paper we propose to speed up first order methods by taking advantage of the structure present in many applications and in image processing in particular. Our method is based on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05715","kind":"arxiv","version":3},"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":"1509.05715","created_at":"2026-05-18T01:11:05.143761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05715v3","created_at":"2026-05-18T01:11:05.143761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05715","created_at":"2026-05-18T01:11:05.143761+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAIUUNWQ6GYG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAIUUNWQ6GYGFNOH","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAIUUNWQ","created_at":"2026-05-18T12:29:50.041715+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/YAIUUNWQ6GYGFNOHS44DZ47EPH","json":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH.json","graph_json":"https://pith.science/api/pith-number/YAIUUNWQ6GYGFNOHS44DZ47EPH/graph.json","events_json":"https://pith.science/api/pith-number/YAIUUNWQ6GYGFNOHS44DZ47EPH/events.json","paper":"https://pith.science/paper/YAIUUNWQ"},"agent_actions":{"view_html":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH","download_json":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH.json","view_paper":"https://pith.science/paper/YAIUUNWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05715&json=true","fetch_graph":"https://pith.science/api/pith-number/YAIUUNWQ6GYGFNOHS44DZ47EPH/graph.json","fetch_events":"https://pith.science/api/pith-number/YAIUUNWQ6GYGFNOHS44DZ47EPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH/action/storage_attestation","attest_author":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH/action/author_attestation","sign_citation":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH/action/citation_signature","submit_replication":"https://pith.science/pith/YAIUUNWQ6GYGFNOHS44DZ47EPH/action/replication_record"}},"created_at":"2026-05-18T01:11:05.143761+00:00","updated_at":"2026-05-18T01:11:05.143761+00:00"}