{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6HGQMMPOBIKTGMOVGGSQ4CTEIS","short_pith_number":"pith:6HGQMMPO","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"},"canonical_sha256":"f1cd0631ee0a153331d531a50e0a64449d6609d894d2ff427212e1dfd2d6ee5e","source":{"kind":"arxiv","id":"1402.7291","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7291","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7291v3","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7291","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"6HGQMMPOBIKT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6HGQMMPOBIKTGMOV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6HGQMMPO","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6HGQMMPOBIKTGMOVGGSQ4CTEIS","target":"record","payload":{"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"},"canonical_sha256":"f1cd0631ee0a153331d531a50e0a64449d6609d894d2ff427212e1dfd2d6ee5e","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"},"source_kind":"arxiv","source_id":"1402.7291","source_version":3,"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-18T02:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxxS4G/CRcgREt2FPmnN1v8MV48qye4WwHJzZvvUvnBVAnrwwDaeAUARMZKOX+B/CSXJdlQXoIx7RdQpxtGPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:02:42.551735Z"},"content_sha256":"5d203a24fb1fbda0321f1a5decff787f5d6943c89a56eca5b46a8058d0c84036","schema_version":"1.0","event_id":"sha256:5d203a24fb1fbda0321f1a5decff787f5d6943c89a56eca5b46a8058d0c84036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6HGQMMPOBIKTGMOVGGSQ4CTEIS","target":"graph","payload":{"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"},"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-18T02:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yuBJGlSvVBwyWN5Hm5Fohci8HAEpaHgqTp1s6fzVEqFlTiEVQGTo5UvSO1UWyo/8oP+TjgIhGxZkyFizr7fuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:02:42.552071Z"},"content_sha256":"d074eea5291741218cf8e2bbc90a70464a284faec6b459ed9f8e24fe04bb4610","schema_version":"1.0","event_id":"sha256:d074eea5291741218cf8e2bbc90a70464a284faec6b459ed9f8e24fe04bb4610"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/bundle.json","state_url":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/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-06-05T16:02:42Z","links":{"resolver":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS","bundle":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/bundle.json","state":"https://pith.science/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HGQMMPOBIKTGMOVGGSQ4CTEIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6HGQMMPOBIKTGMOVGGSQ4CTEIS","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":"3d38b3b69ce1ddd7b515be2bf6c504d33f488a1bb9cc050b3534a85e8032624f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-28T16:01:49Z","title_canon_sha256":"e27ae6d5f2f382b5abafaeef15afed8df79a989877bdcb07637911df7b7b9e7c"},"schema_version":"1.0","source":{"id":"1402.7291","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7291","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7291v3","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7291","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"6HGQMMPOBIKT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6HGQMMPOBIKTGMOV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6HGQMMPO","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d074eea5291741218cf8e2bbc90a70464a284faec6b459ed9f8e24fe04bb4610","target":"graph","created_at":"2026-05-18T02:51:00Z","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":"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","authors_text":"Masoud Ahookhosh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-28T16:01:49Z","title":"Optimal subgradient algorithms with application to large-scale linear inverse problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7291","kind":"arxiv","version":3},"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:5d203a24fb1fbda0321f1a5decff787f5d6943c89a56eca5b46a8058d0c84036","target":"record","created_at":"2026-05-18T02:51:00Z","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":"3d38b3b69ce1ddd7b515be2bf6c504d33f488a1bb9cc050b3534a85e8032624f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-28T16:01:49Z","title_canon_sha256":"e27ae6d5f2f382b5abafaeef15afed8df79a989877bdcb07637911df7b7b9e7c"},"schema_version":"1.0","source":{"id":"1402.7291","kind":"arxiv","version":3}},"canonical_sha256":"f1cd0631ee0a153331d531a50e0a64449d6609d894d2ff427212e1dfd2d6ee5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1cd0631ee0a153331d531a50e0a64449d6609d894d2ff427212e1dfd2d6ee5e","first_computed_at":"2026-05-18T02:51:00.843604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:00.843604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ps6b0wdIQcEBJLqGuMRD4y5veKlf4BWNvVakFpubtOtoInez35Wju3/Xej1D8KURbuRSfEpawXH+GIBFfgcLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:00.844335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.7291","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d203a24fb1fbda0321f1a5decff787f5d6943c89a56eca5b46a8058d0c84036","sha256:d074eea5291741218cf8e2bbc90a70464a284faec6b459ed9f8e24fe04bb4610"],"state_sha256":"e918c56e3680d519a867d02140b4c701aa86685551c2d6da9ced738af876c84a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7N/M56KyjfkU3huIL3yg7sjLrDfknZTK2VxKtkcwOW80NdXxioqZG1l9s6oY+W5DniEW+n8R+syypl9fUNtuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:02:42.553940Z","bundle_sha256":"1e57e284a6689bafa3e00e104fc1fd735dd8ef0beec9850285a445befa6707e9"}}