{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UN6SEYYLO2QDNE4OMHGGJSKKFJ","short_pith_number":"pith:UN6SEYYL","canonical_record":{"source":{"id":"1709.08571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T16:19:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e78c428680f3e1fab1a048619e7e5b58cd605ad22bf90ccc76e75e291b11908c","abstract_canon_sha256":"acfe434070f0ba8bc5376f16dc894a432a93b3dce1c12e0209a5141e116f4045"},"schema_version":"1.0"},"canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","source":{"kind":"arxiv","id":"1709.08571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08571","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08571v2","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08571","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"UN6SEYYLO2QD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UN6SEYYLO2QDNE4O","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UN6SEYYL","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UN6SEYYLO2QDNE4OMHGGJSKKFJ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T16:19:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e78c428680f3e1fab1a048619e7e5b58cd605ad22bf90ccc76e75e291b11908c","abstract_canon_sha256":"acfe434070f0ba8bc5376f16dc894a432a93b3dce1c12e0209a5141e116f4045"},"schema_version":"1.0"},"canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:58.312833Z","signature_b64":"DphvmdXQR50cgb2RKmcMLsxle/6GHtz1SrRpp32bvgYEDwTg+PCT3ioA3qgyP/XENq5DUMbmjNL0a9DnXnrbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","last_reissued_at":"2026-05-18T00:33:58.312213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:58.312213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08571","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:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOXPz/ZGYLjynr7cxlZjRTBrDPilL69zBuN20eUjAh6GlUO5zZX1VBd3Uu+cm0TnoEFEyw+WbRGbR9fn3wFADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:36:24.309057Z"},"content_sha256":"a317fd40835196f1aa9b2ec79459dc5908fd842ba2d65849542d67c517d7d804","schema_version":"1.0","event_id":"sha256:a317fd40835196f1aa9b2ec79459dc5908fd842ba2d65849542d67c517d7d804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UN6SEYYLO2QDNE4OMHGGJSKKFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Mingrui Liu, Tianbao Yang","submitted_at":"2017-09-25T16:19:37Z","abstract_excerpt":"The Hessian-vector product has been utilized to find a second-order stationary solution with strong complexity guarantee (e.g., almost linear time complexity in the problem's dimensionality). In this paper, we propose to further reduce the number of Hessian-vector products for faster non-convex optimization. Previous algorithms need to approximate the smallest eigen-value with a sufficient precision (e.g., $\\epsilon_2\\ll 1$) in order to achieve a sufficiently accurate second-order stationary solution (i.e., $\\lambda_{\\min}(\\nabla^2 f(\\x))\\geq -\\epsilon_2)$. In contrast, the proposed algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08571","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:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Y/z1uP56BFIk8NH6gqfMLrXfja6uLhr0ZlXXdStUhjkRe8A4wdbUMMzg1cJwDo0Y/5P9r62+aWkE+rptgO6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:36:24.309821Z"},"content_sha256":"58e017f7c3e80ecff3945ef7651346ca86676e0c458bf7e16ebd335fe53ceec7","schema_version":"1.0","event_id":"sha256:58e017f7c3e80ecff3945ef7651346ca86676e0c458bf7e16ebd335fe53ceec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/bundle.json","state_url":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/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-31T12:36:24Z","links":{"resolver":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ","bundle":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/bundle.json","state":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UN6SEYYLO2QDNE4OMHGGJSKKFJ","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":"acfe434070f0ba8bc5376f16dc894a432a93b3dce1c12e0209a5141e116f4045","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T16:19:37Z","title_canon_sha256":"e78c428680f3e1fab1a048619e7e5b58cd605ad22bf90ccc76e75e291b11908c"},"schema_version":"1.0","source":{"id":"1709.08571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08571","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08571v2","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08571","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"UN6SEYYLO2QD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UN6SEYYLO2QDNE4O","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UN6SEYYL","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:58e017f7c3e80ecff3945ef7651346ca86676e0c458bf7e16ebd335fe53ceec7","target":"graph","created_at":"2026-05-18T00:33:58Z","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":"The Hessian-vector product has been utilized to find a second-order stationary solution with strong complexity guarantee (e.g., almost linear time complexity in the problem's dimensionality). In this paper, we propose to further reduce the number of Hessian-vector products for faster non-convex optimization. Previous algorithms need to approximate the smallest eigen-value with a sufficient precision (e.g., $\\epsilon_2\\ll 1$) in order to achieve a sufficiently accurate second-order stationary solution (i.e., $\\lambda_{\\min}(\\nabla^2 f(\\x))\\geq -\\epsilon_2)$. In contrast, the proposed algorithms","authors_text":"Mingrui Liu, Tianbao Yang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T16:19:37Z","title":"On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08571","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:a317fd40835196f1aa9b2ec79459dc5908fd842ba2d65849542d67c517d7d804","target":"record","created_at":"2026-05-18T00:33:58Z","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":"acfe434070f0ba8bc5376f16dc894a432a93b3dce1c12e0209a5141e116f4045","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T16:19:37Z","title_canon_sha256":"e78c428680f3e1fab1a048619e7e5b58cd605ad22bf90ccc76e75e291b11908c"},"schema_version":"1.0","source":{"id":"1709.08571","kind":"arxiv","version":2}},"canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","first_computed_at":"2026-05-18T00:33:58.312213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:58.312213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DphvmdXQR50cgb2RKmcMLsxle/6GHtz1SrRpp32bvgYEDwTg+PCT3ioA3qgyP/XENq5DUMbmjNL0a9DnXnrbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:58.312833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a317fd40835196f1aa9b2ec79459dc5908fd842ba2d65849542d67c517d7d804","sha256:58e017f7c3e80ecff3945ef7651346ca86676e0c458bf7e16ebd335fe53ceec7"],"state_sha256":"69f456fad4cc756d42a4ea9435dda45660614c28e21ad09dfe2091cfd7668158"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXjx/XT1uBtbT3czgnwC8kNhIHX3Ll1L7/EW0kx0knUQZzvlux6dCcM6aOpeRaUBi/GVWtEbYJwA9A/mt5HNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:36:24.314543Z","bundle_sha256":"2796e49ef8ddf6ffe1081f2e8d7af08c57320a053ac76117c397a6c029582f4c"}}