{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:72Y25R3VTDPUH6SMIA3U2ERZVO","short_pith_number":"pith:72Y25R3V","canonical_record":{"source":{"id":"1805.08095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-21T14:54:28Z","cross_cats_sorted":["cs.CV","cs.NA","stat.ML"],"title_canon_sha256":"b1b0d9dbf2498e19d5fe326c2ba0a0a0c73adfd2918ecdec75bca49ab88a4b01","abstract_canon_sha256":"47874dd60404517c42d98e72a4ad6b8114ad0181a07f6fd5cd07b5f4a5a9730d"},"schema_version":"1.0"},"canonical_sha256":"feb1aec77598df43fa4c40374d1239ab91de5da495694e0353d924902e90cc4a","source":{"kind":"arxiv","id":"1805.08095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08095","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08095v1","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08095","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"72Y25R3VTDPU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72Y25R3VTDPUH6SM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72Y25R3V","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:72Y25R3VTDPUH6SMIA3U2ERZVO","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-21T14:54:28Z","cross_cats_sorted":["cs.CV","cs.NA","stat.ML"],"title_canon_sha256":"b1b0d9dbf2498e19d5fe326c2ba0a0a0c73adfd2918ecdec75bca49ab88a4b01","abstract_canon_sha256":"47874dd60404517c42d98e72a4ad6b8114ad0181a07f6fd5cd07b5f4a5a9730d"},"schema_version":"1.0"},"canonical_sha256":"feb1aec77598df43fa4c40374d1239ab91de5da495694e0353d924902e90cc4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:31.676794Z","signature_b64":"M7dg7toVgC+C5oO9X2IeV/W8NKZ2XjUEbQqAGBAGbDgsjuEzv+jwAYhBKpix91unSgLY640ym1Gg4M4EXbj1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feb1aec77598df43fa4c40374d1239ab91de5da495694e0353d924902e90cc4a","last_reissued_at":"2026-05-18T00:15:31.676036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:31.676036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08095","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:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybUft29+SnYN9boBJj6skZvJR6TCTBSt0hsL3RV0dt73I8qmY3Zl/hOhoS4B9qqMACdKrZeSIHHKOZQ8v2/ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:28:01.063225Z"},"content_sha256":"c1fb06232402d54d1455532918f3044d98aed7335ccf024baf6c8ef1590b22d6","schema_version":"1.0","event_id":"sha256:c1fb06232402d54d1455532918f3044d98aed7335ccf024baf6c8ef1590b22d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:72Y25R3VTDPUH6SMIA3U2ERZVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small steps and giant leaps: Minimal Newton solvers for Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Vedaldi, Jo\\~ao F. Henriques, Samuel Albanie, Sebastien Ehrhardt","submitted_at":"2018-05-21T14:54:28Z","abstract_excerpt":"We propose a fast second-order method that can be used as a drop-in replacement for current deep learning solvers. Compared to stochastic gradient descent (SGD), it only requires two additional forward-mode automatic differentiation operations per iteration, which has a computational cost comparable to two standard forward passes and is easy to implement. Our method addresses long-standing issues with current second-order solvers, which invert an approximate Hessian matrix every iteration exactly or by conjugate-gradient methods, a procedure that is both costly and sensitive to noise. Instead,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08095","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:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLWg65mRuH8FEBXe/7fgBnymJ+5ei9ODlLJDjIPiClRiiRfFx+6RFVlhz0lPvxeoVzBs/u64+tkCd/wQhNnJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:28:01.063651Z"},"content_sha256":"54e6b9172e7486efaf8d46e0f5d542afb7fb5af8c85723a26cf53d2497c0a043","schema_version":"1.0","event_id":"sha256:54e6b9172e7486efaf8d46e0f5d542afb7fb5af8c85723a26cf53d2497c0a043"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72Y25R3VTDPUH6SMIA3U2ERZVO/bundle.json","state_url":"https://pith.science/pith/72Y25R3VTDPUH6SMIA3U2ERZVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72Y25R3VTDPUH6SMIA3U2ERZVO/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-28T08:28:01Z","links":{"resolver":"https://pith.science/pith/72Y25R3VTDPUH6SMIA3U2ERZVO","bundle":"https://pith.science/pith/72Y25R3VTDPUH6SMIA3U2ERZVO/bundle.json","state":"https://pith.science/pith/72Y25R3VTDPUH6SMIA3U2ERZVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72Y25R3VTDPUH6SMIA3U2ERZVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:72Y25R3VTDPUH6SMIA3U2ERZVO","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":"47874dd60404517c42d98e72a4ad6b8114ad0181a07f6fd5cd07b5f4a5a9730d","cross_cats_sorted":["cs.CV","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-21T14:54:28Z","title_canon_sha256":"b1b0d9dbf2498e19d5fe326c2ba0a0a0c73adfd2918ecdec75bca49ab88a4b01"},"schema_version":"1.0","source":{"id":"1805.08095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08095","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08095v1","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08095","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"72Y25R3VTDPU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72Y25R3VTDPUH6SM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72Y25R3V","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:54e6b9172e7486efaf8d46e0f5d542afb7fb5af8c85723a26cf53d2497c0a043","target":"graph","created_at":"2026-05-18T00:15: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":"We propose a fast second-order method that can be used as a drop-in replacement for current deep learning solvers. Compared to stochastic gradient descent (SGD), it only requires two additional forward-mode automatic differentiation operations per iteration, which has a computational cost comparable to two standard forward passes and is easy to implement. Our method addresses long-standing issues with current second-order solvers, which invert an approximate Hessian matrix every iteration exactly or by conjugate-gradient methods, a procedure that is both costly and sensitive to noise. Instead,","authors_text":"Andrea Vedaldi, Jo\\~ao F. Henriques, Samuel Albanie, Sebastien Ehrhardt","cross_cats":["cs.CV","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-21T14:54:28Z","title":"Small steps and giant leaps: Minimal Newton solvers for Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08095","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:c1fb06232402d54d1455532918f3044d98aed7335ccf024baf6c8ef1590b22d6","target":"record","created_at":"2026-05-18T00:15: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":"47874dd60404517c42d98e72a4ad6b8114ad0181a07f6fd5cd07b5f4a5a9730d","cross_cats_sorted":["cs.CV","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-21T14:54:28Z","title_canon_sha256":"b1b0d9dbf2498e19d5fe326c2ba0a0a0c73adfd2918ecdec75bca49ab88a4b01"},"schema_version":"1.0","source":{"id":"1805.08095","kind":"arxiv","version":1}},"canonical_sha256":"feb1aec77598df43fa4c40374d1239ab91de5da495694e0353d924902e90cc4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feb1aec77598df43fa4c40374d1239ab91de5da495694e0353d924902e90cc4a","first_computed_at":"2026-05-18T00:15:31.676036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:31.676036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7dg7toVgC+C5oO9X2IeV/W8NKZ2XjUEbQqAGBAGbDgsjuEzv+jwAYhBKpix91unSgLY640ym1Gg4M4EXbj1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:31.676794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1fb06232402d54d1455532918f3044d98aed7335ccf024baf6c8ef1590b22d6","sha256:54e6b9172e7486efaf8d46e0f5d542afb7fb5af8c85723a26cf53d2497c0a043"],"state_sha256":"9bc738b3e6234ce7c3015c4ea95e679ec5cd3b4b62288ab1ed9f90e1cde6605c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRw7aQkoVAtowunxAMh2HiAxzPBy8IRyOvxCMn6zrmUjMT4idICrdGbK62H1ZXVLirIBl7IwQ3STCBBSqa99Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:28:01.066252Z","bundle_sha256":"3399ca9aca69ef0871cb4bfde0454f0f756dbb9a26d07cc93c5631a8beabbed1"}}