{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EIU66ZIY42XB3RTQ4NRQ5FQ7GS","short_pith_number":"pith:EIU66ZIY","canonical_record":{"source":{"id":"1406.4445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-13T20:08:58Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9d0a47e758035365f067078c857f6c0600667fa7f83748eebd9a3fcef188ae63","abstract_canon_sha256":"65d3101cddc0ea210d4a1f51349eb643d957076630cc2e2010092bb084ea3c4d"},"schema_version":"1.0"},"canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","source":{"kind":"arxiv","id":"1406.4445","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4445","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4445v2","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4445","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"EIU66ZIY42XB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EIU66ZIY42XB3RTQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EIU66ZIY","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EIU66ZIY42XB3RTQ4NRQ5FQ7GS","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-13T20:08:58Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9d0a47e758035365f067078c857f6c0600667fa7f83748eebd9a3fcef188ae63","abstract_canon_sha256":"65d3101cddc0ea210d4a1f51349eb643d957076630cc2e2010092bb084ea3c4d"},"schema_version":"1.0"},"canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:31.338303Z","signature_b64":"dOsFHJSFfVMnVv8FZFsj4ZGZQqjqQ1qHcJV7r5QqOLi65XFWnOfjuCMRIBWvsS++sbVsXvcd1++TO0/KFPpyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","last_reissued_at":"2026-05-18T02:49:31.337924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:31.337924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4445","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-18T02:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/b1xjgaLZgVfcvdUyP5QsHiXwJx9kfP4CMsiwbhZjClr+q+PPVXqMRE+c9uVCb+RQZ106WkvJJ2Q39V/vTRoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:02:08.979487Z"},"content_sha256":"948e2e6d07772d5805228b456bd22a47db5a9e2cebce4779e348ad75ef9663da","schema_version":"1.0","event_id":"sha256:948e2e6d07772d5805228b456bd22a47db5a9e2cebce4779e348ad75ef9663da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EIU66ZIY42XB3RTQ4NRQ5FQ7GS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RAPID: Rapidly Accelerated Proximal Gradient Algorithms for Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Venkatesh Saligrama, Ziming Zhang","submitted_at":"2014-06-13T20:08:58Z","abstract_excerpt":"In this paper, we propose a new algorithm to speed-up the convergence of accelerated proximal gradient (APG) methods. In order to minimize a convex function $f(\\mathbf{x})$, our algorithm introduces a simple line search step after each proximal gradient step in APG so that a biconvex function $f(\\theta\\mathbf{x})$ is minimized over scalar variable $\\theta>0$ while fixing variable $\\mathbf{x}$. We propose two new ways of constructing the auxiliary variables in APG based on the intermediate solutions of the proximal gradient and the line search steps. We prove that at arbitrary iteration step $t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4445","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-18T02:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZnzUnKoDFiwiAaaod9mJnU3bl0GG0DxE+6cEMGsxmfTvT6QX5oDtA1b+4K0fDw3MHMwcFpn74MynVMmmSkrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:02:08.979844Z"},"content_sha256":"15e029523d32fa1eb9e258555e4dae2d22c8b5c697185e2bd016c9c40c2c028d","schema_version":"1.0","event_id":"sha256:15e029523d32fa1eb9e258555e4dae2d22c8b5c697185e2bd016c9c40c2c028d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/bundle.json","state_url":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/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-07T07:02:08Z","links":{"resolver":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS","bundle":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/bundle.json","state":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EIU66ZIY42XB3RTQ4NRQ5FQ7GS","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":"65d3101cddc0ea210d4a1f51349eb643d957076630cc2e2010092bb084ea3c4d","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-13T20:08:58Z","title_canon_sha256":"9d0a47e758035365f067078c857f6c0600667fa7f83748eebd9a3fcef188ae63"},"schema_version":"1.0","source":{"id":"1406.4445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4445","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4445v2","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4445","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"EIU66ZIY42XB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EIU66ZIY42XB3RTQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EIU66ZIY","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:15e029523d32fa1eb9e258555e4dae2d22c8b5c697185e2bd016c9c40c2c028d","target":"graph","created_at":"2026-05-18T02:49:31Z","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":"In this paper, we propose a new algorithm to speed-up the convergence of accelerated proximal gradient (APG) methods. In order to minimize a convex function $f(\\mathbf{x})$, our algorithm introduces a simple line search step after each proximal gradient step in APG so that a biconvex function $f(\\theta\\mathbf{x})$ is minimized over scalar variable $\\theta>0$ while fixing variable $\\mathbf{x}$. We propose two new ways of constructing the auxiliary variables in APG based on the intermediate solutions of the proximal gradient and the line search steps. We prove that at arbitrary iteration step $t","authors_text":"Venkatesh Saligrama, Ziming Zhang","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-13T20:08:58Z","title":"RAPID: Rapidly Accelerated Proximal Gradient Algorithms for Convex Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4445","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:948e2e6d07772d5805228b456bd22a47db5a9e2cebce4779e348ad75ef9663da","target":"record","created_at":"2026-05-18T02:49:31Z","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":"65d3101cddc0ea210d4a1f51349eb643d957076630cc2e2010092bb084ea3c4d","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-13T20:08:58Z","title_canon_sha256":"9d0a47e758035365f067078c857f6c0600667fa7f83748eebd9a3fcef188ae63"},"schema_version":"1.0","source":{"id":"1406.4445","kind":"arxiv","version":2}},"canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","first_computed_at":"2026-05-18T02:49:31.337924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:31.337924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dOsFHJSFfVMnVv8FZFsj4ZGZQqjqQ1qHcJV7r5QqOLi65XFWnOfjuCMRIBWvsS++sbVsXvcd1++TO0/KFPpyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:31.338303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:948e2e6d07772d5805228b456bd22a47db5a9e2cebce4779e348ad75ef9663da","sha256:15e029523d32fa1eb9e258555e4dae2d22c8b5c697185e2bd016c9c40c2c028d"],"state_sha256":"d92103233bdf3444b9e6ac702ad1f048369b489b176b587cf21416e17d34ee33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7KwN9VJYBvEHcID5KkhjODJjpe7UYQqVLsixvKCVaiitnesiet+fK/PyRLlyHUjr7hktS4cap6tlkSMDhuqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:02:08.981993Z","bundle_sha256":"319f979328cf2fa0a8b9a543e3b0cebc03f930971d4d2f1909f1a83bdebf8986"}}