{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VH75OQS35JK4XM5HWBDEUH2M6B","short_pith_number":"pith:VH75OQS3","canonical_record":{"source":{"id":"1705.04925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-14T07:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"faae1ac66926da4ecb97047b946c5ad5066021b1c5335e11087e924cda1f0612","abstract_canon_sha256":"98356dfa001a67130f4c9c25e83bb0cb5fc50db8f362e90682804f9f5eb4987c"},"schema_version":"1.0"},"canonical_sha256":"a9ffd7425bea55cbb3a7b0464a1f4cf04979ab956f87cfb8fa0ba2188285e277","source":{"kind":"arxiv","id":"1705.04925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04925","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04925v1","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04925","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"VH75OQS35JK4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VH75OQS35JK4XM5H","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VH75OQS3","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VH75OQS35JK4XM5HWBDEUH2M6B","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-14T07:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"faae1ac66926da4ecb97047b946c5ad5066021b1c5335e11087e924cda1f0612","abstract_canon_sha256":"98356dfa001a67130f4c9c25e83bb0cb5fc50db8f362e90682804f9f5eb4987c"},"schema_version":"1.0"},"canonical_sha256":"a9ffd7425bea55cbb3a7b0464a1f4cf04979ab956f87cfb8fa0ba2188285e277","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:34.326681Z","signature_b64":"tdfJLQ6xdNWU7T4tHyAsMM91Y+wiwtyIMHCQcNkNTMc++Y/Pirt02kjTovho9sQWrQYz/lMcacKSpPxc2wJ0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ffd7425bea55cbb3a7b0464a1f4cf04979ab956f87cfb8fa0ba2188285e277","last_reissued_at":"2026-05-18T00:44:34.326129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:34.326129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04925","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-18T00:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wig0sde1lr0GtvO63lvpkxT8XAl1NEvyidG5pb9GUns2U3tlAXk+RDjW+VaaWGJaAsx5cRyWNOS8KPsFH6LJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:44:21.588373Z"},"content_sha256":"8fcc6af52e7a0fa2b56ba1cb75e59d24329d8710bf2eb3c517a4d5ece418bb85","schema_version":"1.0","event_id":"sha256:8fcc6af52e7a0fa2b56ba1cb75e59d24329d8710bf2eb3c517a4d5ece418bb85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VH75OQS35JK4XM5HWBDEUH2M6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pramod K. Varshney, Qunwei Li, Yingbin Liang, Yi Zhou","submitted_at":"2017-05-14T07:22:20Z","abstract_excerpt":"In many modern machine learning applications, structures of underlying mathematical models often yield nonconvex optimization problems. Due to the intractability of nonconvexity, there is a rising need to develop efficient methods for solving general nonconvex problems with certain performance guarantee. In this work, we investigate the accelerated proximal gradient method for nonconvex programming (APGnc). The method compares between a usual proximal gradient step and a linear extrapolation step, and accepts the one that has a lower function value to achieve a monotonic decrease. In specific,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04925","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-18T00:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsX1mTFlUmSPnnqSEC/ipJ9btksOrljUr6Qks4uDfDIpB7Hmw19pkKk2C2Oy0EzPK8w2c8z/Z5ruWMlCQjH1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:44:21.589418Z"},"content_sha256":"b90a83044d27bb6c787395961038786ce625afe8c065c8c9aa13f468ee713a12","schema_version":"1.0","event_id":"sha256:b90a83044d27bb6c787395961038786ce625afe8c065c8c9aa13f468ee713a12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VH75OQS35JK4XM5HWBDEUH2M6B/bundle.json","state_url":"https://pith.science/pith/VH75OQS35JK4XM5HWBDEUH2M6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VH75OQS35JK4XM5HWBDEUH2M6B/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-30T11:44:21Z","links":{"resolver":"https://pith.science/pith/VH75OQS35JK4XM5HWBDEUH2M6B","bundle":"https://pith.science/pith/VH75OQS35JK4XM5HWBDEUH2M6B/bundle.json","state":"https://pith.science/pith/VH75OQS35JK4XM5HWBDEUH2M6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VH75OQS35JK4XM5HWBDEUH2M6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VH75OQS35JK4XM5HWBDEUH2M6B","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":"98356dfa001a67130f4c9c25e83bb0cb5fc50db8f362e90682804f9f5eb4987c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-14T07:22:20Z","title_canon_sha256":"faae1ac66926da4ecb97047b946c5ad5066021b1c5335e11087e924cda1f0612"},"schema_version":"1.0","source":{"id":"1705.04925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04925","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04925v1","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04925","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"VH75OQS35JK4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VH75OQS35JK4XM5H","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VH75OQS3","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b90a83044d27bb6c787395961038786ce625afe8c065c8c9aa13f468ee713a12","target":"graph","created_at":"2026-05-18T00:44:34Z","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 many modern machine learning applications, structures of underlying mathematical models often yield nonconvex optimization problems. Due to the intractability of nonconvexity, there is a rising need to develop efficient methods for solving general nonconvex problems with certain performance guarantee. In this work, we investigate the accelerated proximal gradient method for nonconvex programming (APGnc). The method compares between a usual proximal gradient step and a linear extrapolation step, and accepts the one that has a lower function value to achieve a monotonic decrease. In specific,","authors_text":"Pramod K. Varshney, Qunwei Li, Yingbin Liang, Yi Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-14T07:22:20Z","title":"Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04925","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:8fcc6af52e7a0fa2b56ba1cb75e59d24329d8710bf2eb3c517a4d5ece418bb85","target":"record","created_at":"2026-05-18T00:44:34Z","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":"98356dfa001a67130f4c9c25e83bb0cb5fc50db8f362e90682804f9f5eb4987c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-14T07:22:20Z","title_canon_sha256":"faae1ac66926da4ecb97047b946c5ad5066021b1c5335e11087e924cda1f0612"},"schema_version":"1.0","source":{"id":"1705.04925","kind":"arxiv","version":1}},"canonical_sha256":"a9ffd7425bea55cbb3a7b0464a1f4cf04979ab956f87cfb8fa0ba2188285e277","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ffd7425bea55cbb3a7b0464a1f4cf04979ab956f87cfb8fa0ba2188285e277","first_computed_at":"2026-05-18T00:44:34.326129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:34.326129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tdfJLQ6xdNWU7T4tHyAsMM91Y+wiwtyIMHCQcNkNTMc++Y/Pirt02kjTovho9sQWrQYz/lMcacKSpPxc2wJ0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:34.326681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fcc6af52e7a0fa2b56ba1cb75e59d24329d8710bf2eb3c517a4d5ece418bb85","sha256:b90a83044d27bb6c787395961038786ce625afe8c065c8c9aa13f468ee713a12"],"state_sha256":"c42039de5bb37eef7f4a9635909754cd28d874fe444ab4717476fe59ee8e056f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYPrIq7JpQ+2QyrjkpYd+lchff+PWu4gMK0j+fFOvYWY8Y1cbF2SYBkWJXeaseHQYjH83SvNaPfhMZj4+uT9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:44:21.593544Z","bundle_sha256":"60cb875d7d40e67500d2b25ce3c6889d2d173d3bbba98e603018e3f9a153b80a"}}