{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M52YBAOXPN6Q6EADE4HLK4QGND","short_pith_number":"pith:M52YBAOX","canonical_record":{"source":{"id":"1705.07171","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-05-19T20:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"9efc8bd2e8fd70d05d7d2c7448bb905f2e0bfb5d57a4939bad9f970024bb0f43","abstract_canon_sha256":"6c4a2789d92ae6bb1d8e70ffd72069f0be52458a9f89657652acb203bac65e41"},"schema_version":"1.0"},"canonical_sha256":"67758081d77b7d0f1003270eb5720668e9e5e2c70967021cce8decff95ca1b4f","source":{"kind":"arxiv","id":"1705.07171","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07171","created_at":"2026-05-18T00:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07171v2","created_at":"2026-05-18T00:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07171","created_at":"2026-05-18T00:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"M52YBAOXPN6Q","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M52YBAOXPN6Q6EAD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M52YBAOX","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M52YBAOXPN6Q6EADE4HLK4QGND","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07171","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-05-19T20:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"9efc8bd2e8fd70d05d7d2c7448bb905f2e0bfb5d57a4939bad9f970024bb0f43","abstract_canon_sha256":"6c4a2789d92ae6bb1d8e70ffd72069f0be52458a9f89657652acb203bac65e41"},"schema_version":"1.0"},"canonical_sha256":"67758081d77b7d0f1003270eb5720668e9e5e2c70967021cce8decff95ca1b4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:10.108198Z","signature_b64":"ISObjTq9N8Kw2ICzKRmXlaSS/MbL3kkNcWolQHAHj3OyK0YRKMf2r6KecNsz0ETuTlvOYP+8RTZGKZS87TWOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67758081d77b7d0f1003270eb5720668e9e5e2c70967021cce8decff95ca1b4f","last_reissued_at":"2026-05-18T00:32:10.107636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:10.107636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07171","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:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GdlKLoSCji6uyUqO8SW0IBahB+K4Nfe+372uemEnH9Ss4phHNEWoZr/KeJd5LrWgdG/D1KoajntvBXcXZO3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:39.603964Z"},"content_sha256":"8395a070a507aff007b59f69da7ff7dd15ef4eda1fc0709bf8f27fb8829e9a68","schema_version":"1.0","event_id":"sha256:8395a070a507aff007b59f69da7ff7dd15ef4eda1fc0709bf8f27fb8829e9a68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M52YBAOXPN6Q6EADE4HLK4QGND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nestrov's Acceleration For Second Order Method","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haishan Ye, Zhihua Zhang","submitted_at":"2017-05-19T20:17:56Z","abstract_excerpt":"Optimization plays a key role in machine learning. Recently, stochastic second-order methods have attracted much attention due to their low computational cost in each iteration. However, these algorithms might perform poorly especially if it is hard to approximate the Hessian well and efficiently. As far as we know, there is no effective way to handle this problem. In this paper, we resort to Nestrov's acceleration technique to improve the convergence performance of a class of second-order methods called approximate Newton. We give a theoretical analysis that Nestrov's acceleration technique c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07171","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:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXH2NpD179xSMo50vE4dcCrGattffCXF9IJpLYVZ32sCb+KQrmFKy2kzl/b14HIVg/gXwb8QDmOVrlPQGz3zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:39.604643Z"},"content_sha256":"5d010ff2a3640f31fb0a62880c9eeb70f4f83fbea89a79c7b0f1037d08c7bd03","schema_version":"1.0","event_id":"sha256:5d010ff2a3640f31fb0a62880c9eeb70f4f83fbea89a79c7b0f1037d08c7bd03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M52YBAOXPN6Q6EADE4HLK4QGND/bundle.json","state_url":"https://pith.science/pith/M52YBAOXPN6Q6EADE4HLK4QGND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M52YBAOXPN6Q6EADE4HLK4QGND/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-11T22:06:39Z","links":{"resolver":"https://pith.science/pith/M52YBAOXPN6Q6EADE4HLK4QGND","bundle":"https://pith.science/pith/M52YBAOXPN6Q6EADE4HLK4QGND/bundle.json","state":"https://pith.science/pith/M52YBAOXPN6Q6EADE4HLK4QGND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M52YBAOXPN6Q6EADE4HLK4QGND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M52YBAOXPN6Q6EADE4HLK4QGND","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":"6c4a2789d92ae6bb1d8e70ffd72069f0be52458a9f89657652acb203bac65e41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-05-19T20:17:56Z","title_canon_sha256":"9efc8bd2e8fd70d05d7d2c7448bb905f2e0bfb5d57a4939bad9f970024bb0f43"},"schema_version":"1.0","source":{"id":"1705.07171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07171","created_at":"2026-05-18T00:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07171v2","created_at":"2026-05-18T00:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07171","created_at":"2026-05-18T00:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"M52YBAOXPN6Q","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M52YBAOXPN6Q6EAD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M52YBAOX","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5d010ff2a3640f31fb0a62880c9eeb70f4f83fbea89a79c7b0f1037d08c7bd03","target":"graph","created_at":"2026-05-18T00:32:10Z","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":"Optimization plays a key role in machine learning. Recently, stochastic second-order methods have attracted much attention due to their low computational cost in each iteration. However, these algorithms might perform poorly especially if it is hard to approximate the Hessian well and efficiently. As far as we know, there is no effective way to handle this problem. In this paper, we resort to Nestrov's acceleration technique to improve the convergence performance of a class of second-order methods called approximate Newton. We give a theoretical analysis that Nestrov's acceleration technique c","authors_text":"Haishan Ye, Zhihua Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-05-19T20:17:56Z","title":"Nestrov's Acceleration For Second Order Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07171","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:8395a070a507aff007b59f69da7ff7dd15ef4eda1fc0709bf8f27fb8829e9a68","target":"record","created_at":"2026-05-18T00:32:10Z","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":"6c4a2789d92ae6bb1d8e70ffd72069f0be52458a9f89657652acb203bac65e41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-05-19T20:17:56Z","title_canon_sha256":"9efc8bd2e8fd70d05d7d2c7448bb905f2e0bfb5d57a4939bad9f970024bb0f43"},"schema_version":"1.0","source":{"id":"1705.07171","kind":"arxiv","version":2}},"canonical_sha256":"67758081d77b7d0f1003270eb5720668e9e5e2c70967021cce8decff95ca1b4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67758081d77b7d0f1003270eb5720668e9e5e2c70967021cce8decff95ca1b4f","first_computed_at":"2026-05-18T00:32:10.107636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:10.107636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ISObjTq9N8Kw2ICzKRmXlaSS/MbL3kkNcWolQHAHj3OyK0YRKMf2r6KecNsz0ETuTlvOYP+8RTZGKZS87TWOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:10.108198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8395a070a507aff007b59f69da7ff7dd15ef4eda1fc0709bf8f27fb8829e9a68","sha256:5d010ff2a3640f31fb0a62880c9eeb70f4f83fbea89a79c7b0f1037d08c7bd03"],"state_sha256":"231d3386cd61773d39b39c2988941ae1e9e08064b08617fcd678284f5dd736b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5Fy4Fgegr/gfKDFx7a0ilIX1hrx+/WwvvCZsvchqNE7Vfs+fTF3qSQcHovGPzhJ/pisBrURPryl/lBa44+IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:06:39.608485Z","bundle_sha256":"7fc83f39dbee0e72c9fd3988045b83352e44d20a5516d699aab557b5ec40c739"}}