{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6HGQMMPOBIKTGMOVGGSQ4CTEIS","short_pith_number":"pith:6HGQMMPO","schema_version":"1.0","canonical_sha256":"f1cd0631ee0a153331d531a50e0a64449d6609d894d2ff427212e1dfd2d6ee5e","source":{"kind":"arxiv","id":"1402.7291","version":3},"attestation_state":"computed","paper":{"title":"Optimal subgradient algorithms with application to large-scale linear inverse problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masoud Ahookhosh","submitted_at":"2014-02-28T16:01:49Z","abstract_excerpt":"This study addresses some algorithms for solving structured unconstrained convex optimiza- tion problems using first-order information where the underlying function includes high-dimensional data. The primary aim is to develop an implementable algorithmic framework for solving problems with multi- term composite objective functions involving linear mappings using the optimal subgradient algorithm, OSGA, proposed by Neumaier in [49]. To this end, we propose some prox-functions for which the cor- responding subproblem of OSGA is solved in a closed form. Considering various inverse problems arisi"},"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":"1402.7291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-28T16:01:49Z","cross_cats_sorted":[],"title_canon_sha256":"e27ae6d5f2f382b5abafaeef15afed8df79a989877bdcb07637911df7b7b9e7c","abstract_canon_sha256":"3d38b3b69ce1ddd7b515be2bf6c504d33f488a1bb9cc050b3534a85e8032624f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:00.844335Z","signature_b64":"ps6b0wdIQcEBJLqGuMRD4y5veKlf4BWNvVakFpubtOtoInez35Wju3/Xej1D8KURbuRSfEpawXH+GIBFfgcLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1cd0631ee0a153331d531a50e0a64449d6609d894d2ff427212e1dfd2d6ee5e","last_reissued_at":"2026-05-18T02:51:00.843604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:00.843604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal subgradient algorithms with application to large-scale linear inverse problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masoud Ahookhosh","submitted_at":"2014-02-28T16:01:49Z","abstract_excerpt":"This study addresses some algorithms for solving structured unconstrained convex optimiza- tion problems using first-order information where the underlying function includes high-dimensional data. The primary aim is to develop an implementable algorithmic framework for solving problems with multi- term composite objective functions involving linear mappings using the optimal subgradient algorithm, OSGA, proposed by Neumaier in [49]. To this end, we propose some prox-functions for which the cor- responding subproblem of OSGA is solved in a closed form. Considering various inverse problems arisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7291","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":"1402.7291","created_at":"2026-05-18T02:51:00.843853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7291v3","created_at":"2026-05-18T02:51:00.843853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7291","created_at":"2026-05-18T02:51:00.843853+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HGQMMPOBIKT","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HGQMMPOBIKTGMOV","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HGQMMPO","created_at":"2026-05-18T12:28:16.859392+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/6HGQMMPOBIKTGMOVGGSQ4CTEIS","json":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS.json","graph_json":"https://pith.science/api/pith-number/6HGQMMPOBIKTGMOVGGSQ4CTEIS/graph.json","events_json":"https://pith.science/api/pith-number/6HGQMMPOBIKTGMOVGGSQ4CTEIS/events.json","paper":"https://pith.science/paper/6HGQMMPO"},"agent_actions":{"view_html":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS","download_json":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS.json","view_paper":"https://pith.science/paper/6HGQMMPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7291&json=true","fetch_graph":"https://pith.science/api/pith-number/6HGQMMPOBIKTGMOVGGSQ4CTEIS/graph.json","fetch_events":"https://pith.science/api/pith-number/6HGQMMPOBIKTGMOVGGSQ4CTEIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/action/storage_attestation","attest_author":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/action/author_attestation","sign_citation":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/action/citation_signature","submit_replication":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/action/replication_record"}},"created_at":"2026-05-18T02:51:00.843853+00:00","updated_at":"2026-05-18T02:51:00.843853+00:00"}