{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TDTEWJVTMQVHTV5VQFYTP37VKG","short_pith_number":"pith:TDTEWJVT","schema_version":"1.0","canonical_sha256":"98e64b26b3642a79d7b5817137eff5519f98084ad814447bcfa94453379277f9","source":{"kind":"arxiv","id":"1501.01497","version":1},"attestation_state":"computed","paper":{"title":"An optimal subgradient algorithm for large-scale bound-constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arnold Neumaier, Masoud Ahookhosh","submitted_at":"2015-01-07T14:04:21Z","abstract_excerpt":"This paper shows that the OSGA algorithm -- which uses first-order information to solve convex optimization problems with optimal complexity -- can be used to efficiently solve arbitrary bound-constrained convex optimization problems. This is done by constructing an explicit method as well as an inexact scheme for solving the bound-constrained rational subproblem required by OSGA. This leads to an efficient implementation of OSGA on large-scale problems in applications arising signal and image processing, machine learning and statistics. Numerical experiments demonstrate the promising performa"},"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":"1501.01497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-07T14:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"f6a3a4f86e2f7a348156198181e585496c937248f1a97764a4ed5987199377b4","abstract_canon_sha256":"f87ebb497b675ede068bde6ee69351467ef8d9227ed4189a3f1bdd8c5ab89151"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:53.977534Z","signature_b64":"igQVKSd9Qs8/ElM8ntFFntlAyiZ4/rhamb5N0IzTKgbbwC+3mGA2GD1Q6aePfCk0D7jElF+PUHxv+fsEeR6bCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98e64b26b3642a79d7b5817137eff5519f98084ad814447bcfa94453379277f9","last_reissued_at":"2026-05-18T02:29:53.976987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:53.976987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal subgradient algorithm for large-scale bound-constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arnold Neumaier, Masoud Ahookhosh","submitted_at":"2015-01-07T14:04:21Z","abstract_excerpt":"This paper shows that the OSGA algorithm -- which uses first-order information to solve convex optimization problems with optimal complexity -- can be used to efficiently solve arbitrary bound-constrained convex optimization problems. This is done by constructing an explicit method as well as an inexact scheme for solving the bound-constrained rational subproblem required by OSGA. This leads to an efficient implementation of OSGA on large-scale problems in applications arising signal and image processing, machine learning and statistics. Numerical experiments demonstrate the promising performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01497","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.01497","created_at":"2026-05-18T02:29:53.977066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01497v1","created_at":"2026-05-18T02:29:53.977066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01497","created_at":"2026-05-18T02:29:53.977066+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDTEWJVTMQVH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDTEWJVTMQVHTV5V","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDTEWJVT","created_at":"2026-05-18T12:29:42.218222+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/TDTEWJVTMQVHTV5VQFYTP37VKG","json":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG.json","graph_json":"https://pith.science/api/pith-number/TDTEWJVTMQVHTV5VQFYTP37VKG/graph.json","events_json":"https://pith.science/api/pith-number/TDTEWJVTMQVHTV5VQFYTP37VKG/events.json","paper":"https://pith.science/paper/TDTEWJVT"},"agent_actions":{"view_html":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG","download_json":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG.json","view_paper":"https://pith.science/paper/TDTEWJVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01497&json=true","fetch_graph":"https://pith.science/api/pith-number/TDTEWJVTMQVHTV5VQFYTP37VKG/graph.json","fetch_events":"https://pith.science/api/pith-number/TDTEWJVTMQVHTV5VQFYTP37VKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG/action/storage_attestation","attest_author":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG/action/author_attestation","sign_citation":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG/action/citation_signature","submit_replication":"https://pith.science/pith/TDTEWJVTMQVHTV5VQFYTP37VKG/action/replication_record"}},"created_at":"2026-05-18T02:29:53.977066+00:00","updated_at":"2026-05-18T02:29:53.977066+00:00"}