{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O6VURFNOTMEWMCGZ4TBVLJK543","short_pith_number":"pith:O6VURFNO","schema_version":"1.0","canonical_sha256":"77ab4895ae9b096608d9e4c355a55de6d104081f94570379cf993b2ba270a5d8","source":{"kind":"arxiv","id":"1304.0740","version":1},"attestation_state":"computed","paper":{"title":"O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lijun Zhang, Rong Jin, Tianbao Yang, Xiaofei He","submitted_at":"2013-04-02T19:11:23Z","abstract_excerpt":"Traditional algorithms for stochastic optimization require projecting the solution at each iteration into a given domain to ensure its feasibility. When facing complex domains, such as positive semi-definite cones, the projection operation can be expensive, leading to a high computational cost per iteration. In this paper, we present a novel algorithm that aims to reduce the number of projections for stochastic optimization. The proposed algorithm combines the strength of several recent developments in stochastic optimization, including mini-batch, extra-gradient, and epoch gradient descent, i"},"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":"1304.0740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-02T19:11:23Z","cross_cats_sorted":[],"title_canon_sha256":"2b05a323859f701040623ed4d9176c524c1c2d03c316aba07969b0e8f43b9dd3","abstract_canon_sha256":"d5a621cf741a896735b31a89075327017fdf7b06313f5c2087b2bfda0b45b40c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:14.411216Z","signature_b64":"lumTI2qY6yLCyg7zXFWjWy/R5nOGw2N5+9Z7jtVlpLFPOaTWZ4N5b2uEUR/mNkH7hjs0jmvT7VtffUOMBI2pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ab4895ae9b096608d9e4c355a55de6d104081f94570379cf993b2ba270a5d8","last_reissued_at":"2026-05-18T03:29:14.410578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:14.410578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lijun Zhang, Rong Jin, Tianbao Yang, Xiaofei He","submitted_at":"2013-04-02T19:11:23Z","abstract_excerpt":"Traditional algorithms for stochastic optimization require projecting the solution at each iteration into a given domain to ensure its feasibility. When facing complex domains, such as positive semi-definite cones, the projection operation can be expensive, leading to a high computational cost per iteration. In this paper, we present a novel algorithm that aims to reduce the number of projections for stochastic optimization. The proposed algorithm combines the strength of several recent developments in stochastic optimization, including mini-batch, extra-gradient, and epoch gradient descent, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0740","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":"1304.0740","created_at":"2026-05-18T03:29:14.410672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0740v1","created_at":"2026-05-18T03:29:14.410672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0740","created_at":"2026-05-18T03:29:14.410672+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6VURFNOTMEW","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6VURFNOTMEWMCGZ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6VURFNO","created_at":"2026-05-18T12:27:54.935989+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/O6VURFNOTMEWMCGZ4TBVLJK543","json":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543.json","graph_json":"https://pith.science/api/pith-number/O6VURFNOTMEWMCGZ4TBVLJK543/graph.json","events_json":"https://pith.science/api/pith-number/O6VURFNOTMEWMCGZ4TBVLJK543/events.json","paper":"https://pith.science/paper/O6VURFNO"},"agent_actions":{"view_html":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543","download_json":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543.json","view_paper":"https://pith.science/paper/O6VURFNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0740&json=true","fetch_graph":"https://pith.science/api/pith-number/O6VURFNOTMEWMCGZ4TBVLJK543/graph.json","fetch_events":"https://pith.science/api/pith-number/O6VURFNOTMEWMCGZ4TBVLJK543/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/action/storage_attestation","attest_author":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/action/author_attestation","sign_citation":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/action/citation_signature","submit_replication":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/action/replication_record"}},"created_at":"2026-05-18T03:29:14.410672+00:00","updated_at":"2026-05-18T03:29:14.410672+00:00"}