{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5UPBLBAIL3FFL7S5ZPX2IW7ZZ4","short_pith_number":"pith:5UPBLBAI","canonical_record":{"source":{"id":"1709.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-05T14:58:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"63669a0d5af51c92a9c0e5bf2d5d96081eb2e2613a42981a579d301ae8571095","abstract_canon_sha256":"c02bd3881b2b6fa53ee3f494e2bb7d4d747c1895a3d02763af09b2aba820d4d2"},"schema_version":"1.0"},"canonical_sha256":"ed1e1584085eca55fe5dcbefa45bf9cf21d447659e845f614c387580607d38c0","source":{"kind":"arxiv","id":"1709.01434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01434","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01434v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01434","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"5UPBLBAIL3FF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UPBLBAIL3FFL7S5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UPBLBAI","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5UPBLBAIL3FFL7S5ZPX2IW7ZZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-05T14:58:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"63669a0d5af51c92a9c0e5bf2d5d96081eb2e2613a42981a579d301ae8571095","abstract_canon_sha256":"c02bd3881b2b6fa53ee3f494e2bb7d4d747c1895a3d02763af09b2aba820d4d2"},"schema_version":"1.0"},"canonical_sha256":"ed1e1584085eca55fe5dcbefa45bf9cf21d447659e845f614c387580607d38c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.125268Z","signature_b64":"3sqtOlvfsyfY5AgkKSDjltRn79OeooD1U7BZ2S95N7lLj4A15Z06zj0ZotHaIisFF/zRlbXvhjtFIG27td6DCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed1e1584085eca55fe5dcbefa45bf9cf21d447659e845f614c387580607d38c0","last_reissued_at":"2026-05-18T00:36:00.124661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.124661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01434","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwPcbVWPGCpei9vLpP7H6kj//pAxsKA171Ibw9ALpX/pw0tnwbKGzyAjKMGhjV41ME6HBXY8LEduf+xj4+JnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:58:19.223749Z"},"content_sha256":"024ede6685a3b2fa71a5968374d5163ec8b7eaa61c8fe8809805ff35db656634","schema_version":"1.0","event_id":"sha256:024ede6685a3b2fa71a5968374d5163ec8b7eaa61c8fe8809805ff35db656634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5UPBLBAIL3FFL7S5ZPX2IW7ZZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generic Approach for Escaping Saddle points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander J Smola, Barnabas Poczos, Francis Bach, Manzil Zaheer, Ruslan Salakhutdinov, Sashank J Reddi, Suvrit Sra","submitted_at":"2017-09-05T14:58:15Z","abstract_excerpt":"A central challenge to using first-order methods for optimizing nonconvex problems is the presence of saddle points. First-order methods often get stuck at saddle points, greatly deteriorating their performance. Typically, to escape from saddles one has to use second-order methods. However, most works on second-order methods rely extensively on expensive Hessian-based computations, making them impractical in large-scale settings. To tackle this challenge, we introduce a generic framework that minimizes Hessian based computations while at the same time provably converging to second-order critic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01434","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/oPJqUsR5izteVxVvK9QWZKHcnJ1hqJZc52AuNWGAbQJfxWE7aBd7m39nHTmllAvboDprScjL5kS6qmZfhwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:58:19.224396Z"},"content_sha256":"47c18c813d0b70876d3d77108c192997db9de341d4b6f209027b6f0d1f0353b7","schema_version":"1.0","event_id":"sha256:47c18c813d0b70876d3d77108c192997db9de341d4b6f209027b6f0d1f0353b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4/bundle.json","state_url":"https://pith.science/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4/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-24T17:58:19Z","links":{"resolver":"https://pith.science/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4","bundle":"https://pith.science/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4/bundle.json","state":"https://pith.science/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UPBLBAIL3FFL7S5ZPX2IW7ZZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5UPBLBAIL3FFL7S5ZPX2IW7ZZ4","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":"c02bd3881b2b6fa53ee3f494e2bb7d4d747c1895a3d02763af09b2aba820d4d2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-05T14:58:15Z","title_canon_sha256":"63669a0d5af51c92a9c0e5bf2d5d96081eb2e2613a42981a579d301ae8571095"},"schema_version":"1.0","source":{"id":"1709.01434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01434","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01434v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01434","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"5UPBLBAIL3FF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UPBLBAIL3FFL7S5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UPBLBAI","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:47c18c813d0b70876d3d77108c192997db9de341d4b6f209027b6f0d1f0353b7","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"A central challenge to using first-order methods for optimizing nonconvex problems is the presence of saddle points. First-order methods often get stuck at saddle points, greatly deteriorating their performance. Typically, to escape from saddles one has to use second-order methods. However, most works on second-order methods rely extensively on expensive Hessian-based computations, making them impractical in large-scale settings. To tackle this challenge, we introduce a generic framework that minimizes Hessian based computations while at the same time provably converging to second-order critic","authors_text":"Alexander J Smola, Barnabas Poczos, Francis Bach, Manzil Zaheer, Ruslan Salakhutdinov, Sashank J Reddi, Suvrit Sra","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping Saddle points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01434","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:024ede6685a3b2fa71a5968374d5163ec8b7eaa61c8fe8809805ff35db656634","target":"record","created_at":"2026-05-18T00:36:00Z","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":"c02bd3881b2b6fa53ee3f494e2bb7d4d747c1895a3d02763af09b2aba820d4d2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-05T14:58:15Z","title_canon_sha256":"63669a0d5af51c92a9c0e5bf2d5d96081eb2e2613a42981a579d301ae8571095"},"schema_version":"1.0","source":{"id":"1709.01434","kind":"arxiv","version":1}},"canonical_sha256":"ed1e1584085eca55fe5dcbefa45bf9cf21d447659e845f614c387580607d38c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed1e1584085eca55fe5dcbefa45bf9cf21d447659e845f614c387580607d38c0","first_computed_at":"2026-05-18T00:36:00.124661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.124661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3sqtOlvfsyfY5AgkKSDjltRn79OeooD1U7BZ2S95N7lLj4A15Z06zj0ZotHaIisFF/zRlbXvhjtFIG27td6DCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.125268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:024ede6685a3b2fa71a5968374d5163ec8b7eaa61c8fe8809805ff35db656634","sha256:47c18c813d0b70876d3d77108c192997db9de341d4b6f209027b6f0d1f0353b7"],"state_sha256":"0929b514be2d618a3affd76eb731d1fc1a3ec3c50c1beb9cd52732435e7da2db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+LduYYhasSPy8koaT8tnLl+JBQa0jlZ5hj8YlRke81Kf15QGdhTbztXvjvnW+0cm9aHaPBkNa1RCQSeCmRKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:58:19.228079Z","bundle_sha256":"804159bc859f3df60c974a05ab31fdc6b92061139f6740c5bf1b9d90a6ba69ca"}}