{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:O6VURFNOTMEWMCGZ4TBVLJK543","short_pith_number":"pith:O6VURFNO","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"},"canonical_sha256":"77ab4895ae9b096608d9e4c355a55de6d104081f94570379cf993b2ba270a5d8","source":{"kind":"arxiv","id":"1304.0740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0740","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0740v1","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0740","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"O6VURFNOTMEW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O6VURFNOTMEWMCGZ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O6VURFNO","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:O6VURFNOTMEWMCGZ4TBVLJK543","target":"record","payload":{"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"},"canonical_sha256":"77ab4895ae9b096608d9e4c355a55de6d104081f94570379cf993b2ba270a5d8","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"},"source_kind":"arxiv","source_id":"1304.0740","source_version":1,"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-18T03:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7oxVF2hoj7zPN+guwbc3FToyYBxEJiuS43PamHmobv4MgvJDe/+5xXArQ8NCvUskCD/h1plLGT56JtDIDwbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:58:03.302691Z"},"content_sha256":"d60615b8041975e1535ee71af2c3f8a93ee45744100c70acb3325a80c263ff5c","schema_version":"1.0","event_id":"sha256:d60615b8041975e1535ee71af2c3f8a93ee45744100c70acb3325a80c263ff5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:O6VURFNOTMEWMCGZ4TBVLJK543","target":"graph","payload":{"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"},"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-18T03:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyPE4lBRzBG3tjd547YkIWVf4TFI/95LTz4p/26q/CMrxnrVdjLhti9SyCEqBjcoiYVtQPGAAtYjkEstYQrMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:58:03.303412Z"},"content_sha256":"d7e84c5111b0828fa02b8bdfc2f7ac8c78e452e3165c2f9e6ef1257f6e0048da","schema_version":"1.0","event_id":"sha256:d7e84c5111b0828fa02b8bdfc2f7ac8c78e452e3165c2f9e6ef1257f6e0048da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/bundle.json","state_url":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6VURFNOTMEWMCGZ4TBVLJK543/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-05-26T11:58:03Z","links":{"resolver":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543","bundle":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/bundle.json","state":"https://pith.science/pith/O6VURFNOTMEWMCGZ4TBVLJK543/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6VURFNOTMEWMCGZ4TBVLJK543/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O6VURFNOTMEWMCGZ4TBVLJK543","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":"d5a621cf741a896735b31a89075327017fdf7b06313f5c2087b2bfda0b45b40c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-02T19:11:23Z","title_canon_sha256":"2b05a323859f701040623ed4d9176c524c1c2d03c316aba07969b0e8f43b9dd3"},"schema_version":"1.0","source":{"id":"1304.0740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0740","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0740v1","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0740","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"O6VURFNOTMEW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O6VURFNOTMEWMCGZ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O6VURFNO","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:d7e84c5111b0828fa02b8bdfc2f7ac8c78e452e3165c2f9e6ef1257f6e0048da","target":"graph","created_at":"2026-05-18T03:29:14Z","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":"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","authors_text":"Lijun Zhang, Rong Jin, Tianbao Yang, Xiaofei He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-02T19:11:23Z","title":"O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0740","kind":"arxiv","version":1},"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:d60615b8041975e1535ee71af2c3f8a93ee45744100c70acb3325a80c263ff5c","target":"record","created_at":"2026-05-18T03:29:14Z","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":"d5a621cf741a896735b31a89075327017fdf7b06313f5c2087b2bfda0b45b40c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-02T19:11:23Z","title_canon_sha256":"2b05a323859f701040623ed4d9176c524c1c2d03c316aba07969b0e8f43b9dd3"},"schema_version":"1.0","source":{"id":"1304.0740","kind":"arxiv","version":1}},"canonical_sha256":"77ab4895ae9b096608d9e4c355a55de6d104081f94570379cf993b2ba270a5d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ab4895ae9b096608d9e4c355a55de6d104081f94570379cf993b2ba270a5d8","first_computed_at":"2026-05-18T03:29:14.410578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:14.410578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lumTI2qY6yLCyg7zXFWjWy/R5nOGw2N5+9Z7jtVlpLFPOaTWZ4N5b2uEUR/mNkH7hjs0jmvT7VtffUOMBI2pBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:14.411216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d60615b8041975e1535ee71af2c3f8a93ee45744100c70acb3325a80c263ff5c","sha256:d7e84c5111b0828fa02b8bdfc2f7ac8c78e452e3165c2f9e6ef1257f6e0048da"],"state_sha256":"9c0b09b67af2b5a614a336c13cad46e4c44a8400522be1976641587bc84818a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LypyqEjbMqs5kpxfnMfXgloxABeoZAkMF59wwGdFz2f8nhWMa83M+GTxlu1Ed1VT3b21qN+eZu1m+7eISDEYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:58:03.306920Z","bundle_sha256":"34ae125971c0036eaaba175014b5c62fb02d34b3e60227b77a38549c15614f2e"}}