{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DJOMVJ2EQA43RHR2SHY5ZUVDFY","short_pith_number":"pith:DJOMVJ2E","canonical_record":{"source":{"id":"1608.03487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-11T14:48:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"416211be8e486b1222c9db2f9279d39b391e45ca1b92dd92260ed71e31019c75","abstract_canon_sha256":"427523daa3504fecb593884f3fb2b69b957486dec895654b55ea4467ddf40080"},"schema_version":"1.0"},"canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","source":{"kind":"arxiv","id":"1608.03487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03487","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03487v2","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03487","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"DJOMVJ2EQA43","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DJOMVJ2EQA43RHR2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DJOMVJ2E","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DJOMVJ2EQA43RHR2SHY5ZUVDFY","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-11T14:48:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"416211be8e486b1222c9db2f9279d39b391e45ca1b92dd92260ed71e31019c75","abstract_canon_sha256":"427523daa3504fecb593884f3fb2b69b957486dec895654b55ea4467ddf40080"},"schema_version":"1.0"},"canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.160877Z","signature_b64":"9Se90JAsnN47dvd3zJeJp4C96eAET7AMVm8+JiYntYdY048g9kcd8CZt6ex9OuFp3Xcx9VsKr7J3VmKNfTAHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","last_reissued_at":"2026-05-18T00:42:35.159724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.159724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03487","source_version":2,"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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BSN0wnzaDPly1qwWKpxLXhtobGxBWNJKDEXxIsgLoM/c8THVT4qoON78cpnywe1JIkkZM2qTT+GxUBHku49AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:58:57.597397Z"},"content_sha256":"78a5800162835e7d1549cd8f70330143daa7efe13edaaaab45e13bd440f53b3c","schema_version":"1.0","event_id":"sha256:78a5800162835e7d1549cd8f70330143daa7efe13edaaaab45e13bd440f53b3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DJOMVJ2EQA43RHR2SHY5ZUVDFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Lijun Zhang, Qihang Lin, Tianbao Yang","submitted_at":"2016-08-11T14:48:18Z","abstract_excerpt":"This paper focuses on convex constrained optimization problems, where the solution is subject to a convex inequality constraint. In particular, we aim at challenging problems for which both projection into the constrained domain and a linear optimization under the inequality constraint are time-consuming, which render both projected gradient methods and conditional gradient methods (a.k.a. the Frank-Wolfe algorithm) expensive. In this paper, we develop projection reduced optimization algorithms for both smooth and non-smooth optimization with improved convergence rates under a certain regulari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03487","kind":"arxiv","version":2},"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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ka/OmsvNlgmg3X99Ckyy7mfVMi2+6epzrKdkOe0/IF7NOl6dM3TQzgy7EdrG9AhcnTR8nk3zgqve/PT68WZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:58:57.598119Z"},"content_sha256":"867863d6c8ca0ef71d86d2044c4f6e750d2e35b024bb3555589d371359bf1c05","schema_version":"1.0","event_id":"sha256:867863d6c8ca0ef71d86d2044c4f6e750d2e35b024bb3555589d371359bf1c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/bundle.json","state_url":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/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-26T16:58:57Z","links":{"resolver":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY","bundle":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/bundle.json","state":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DJOMVJ2EQA43RHR2SHY5ZUVDFY","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":"427523daa3504fecb593884f3fb2b69b957486dec895654b55ea4467ddf40080","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-11T14:48:18Z","title_canon_sha256":"416211be8e486b1222c9db2f9279d39b391e45ca1b92dd92260ed71e31019c75"},"schema_version":"1.0","source":{"id":"1608.03487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03487","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03487v2","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03487","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"DJOMVJ2EQA43","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DJOMVJ2EQA43RHR2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DJOMVJ2E","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:867863d6c8ca0ef71d86d2044c4f6e750d2e35b024bb3555589d371359bf1c05","target":"graph","created_at":"2026-05-18T00:42:35Z","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 paper focuses on convex constrained optimization problems, where the solution is subject to a convex inequality constraint. In particular, we aim at challenging problems for which both projection into the constrained domain and a linear optimization under the inequality constraint are time-consuming, which render both projected gradient methods and conditional gradient methods (a.k.a. the Frank-Wolfe algorithm) expensive. In this paper, we develop projection reduced optimization algorithms for both smooth and non-smooth optimization with improved convergence rates under a certain regulari","authors_text":"Lijun Zhang, Qihang Lin, Tianbao Yang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-11T14:48:18Z","title":"A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03487","kind":"arxiv","version":2},"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:78a5800162835e7d1549cd8f70330143daa7efe13edaaaab45e13bd440f53b3c","target":"record","created_at":"2026-05-18T00:42:35Z","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":"427523daa3504fecb593884f3fb2b69b957486dec895654b55ea4467ddf40080","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-11T14:48:18Z","title_canon_sha256":"416211be8e486b1222c9db2f9279d39b391e45ca1b92dd92260ed71e31019c75"},"schema_version":"1.0","source":{"id":"1608.03487","kind":"arxiv","version":2}},"canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","first_computed_at":"2026-05-18T00:42:35.159724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:35.159724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Se90JAsnN47dvd3zJeJp4C96eAET7AMVm8+JiYntYdY048g9kcd8CZt6ex9OuFp3Xcx9VsKr7J3VmKNfTAHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:35.160877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78a5800162835e7d1549cd8f70330143daa7efe13edaaaab45e13bd440f53b3c","sha256:867863d6c8ca0ef71d86d2044c4f6e750d2e35b024bb3555589d371359bf1c05"],"state_sha256":"f80e61561dd0e72f072570dee1666cf891d4cd605208bf0d0a406a22782e2677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qh/0XqHTrPRCRR0nVXcMnluagqkrH40lOBLgB8FXv7nMsc9PkK3xlqsrC7bKxVddpMCDSOZYkR9wEOPhS4EmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:58:57.601677Z","bundle_sha256":"685e99f4692e89bd34aee0c9b73dcc2c065347bc276637c6f188a6701402e1ba"}}