{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M6A33P7QYQ3S5L6XW362TOYCUH","short_pith_number":"pith:M6A33P7Q","canonical_record":{"source":{"id":"1602.03943","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T01:38:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6e12f70470b713e9ee3e0e587f9331ad92721bc78f46ba3b3aeb4b8cf2f05f33","abstract_canon_sha256":"42132f9eeeed0a621f399b48b1cf74a89e7df7e0e4eee5baf22639e84f9bae29"},"schema_version":"1.0"},"canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","source":{"kind":"arxiv","id":"1602.03943","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03943","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03943v5","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03943","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"M6A33P7QYQ3S","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M6A33P7QYQ3S5L6X","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M6A33P7Q","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M6A33P7QYQ3S5L6XW362TOYCUH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03943","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T01:38:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6e12f70470b713e9ee3e0e587f9331ad92721bc78f46ba3b3aeb4b8cf2f05f33","abstract_canon_sha256":"42132f9eeeed0a621f399b48b1cf74a89e7df7e0e4eee5baf22639e84f9bae29"},"schema_version":"1.0"},"canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.696335Z","signature_b64":"Hj3oQPAJzyVJKXRN5WKpEsKj2BgBcM+DbhxCVDjNiim8UaJizrkPyZYgT4Ejy6yQZoJja7dEq4Y50Ig5/97IDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","last_reissued_at":"2026-05-18T00:29:15.695724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.695724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03943","source_version":5,"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:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyKu9RTheEuQV4JQuUvRVxNSMKc03FaU/DTva6FVsQILICuHgQxXBSI3Ob+m3tdrrEplo7j6D9GSgpMn4+RgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:12:12.707556Z"},"content_sha256":"0ecb2f73846cf3bb78a62f56431c1b274f49d15f3eadd219503d9b03df344426","schema_version":"1.0","event_id":"sha256:0ecb2f73846cf3bb78a62f56431c1b274f49d15f3eadd219503d9b03df344426"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M6A33P7QYQ3S5L6XW362TOYCUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-Order Stochastic Optimization for Machine Learning in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brian Bullins, Elad Hazan, Naman Agarwal","submitted_at":"2016-02-12T01:38:05Z","abstract_excerpt":"First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored due to the high cost of computing the second-order information. In this paper we develop second-order stochastic methods for optimization problems in machine learning that match the per-iteration cost of gradient based methods, and in certain settings improve upon the overall running time over popular first-order methods. Furthermore, our algorithm has the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03943","kind":"arxiv","version":5},"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:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tszXKvQ5hMKU2b8FE5T2Y93OeMRewY2fuTQypIDWxTRjpiIj5LAKuGck/3k0ePMpF/ovSliwfbQFKOTGBG2sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:12:12.707911Z"},"content_sha256":"76208aa2756053fa3f0084dabcf352d214d1ab096004293fb7dd193a55ee8c41","schema_version":"1.0","event_id":"sha256:76208aa2756053fa3f0084dabcf352d214d1ab096004293fb7dd193a55ee8c41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/bundle.json","state_url":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6A33P7QYQ3S5L6XW362TOYCUH/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-04T20:12:12Z","links":{"resolver":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH","bundle":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/bundle.json","state":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6A33P7QYQ3S5L6XW362TOYCUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M6A33P7QYQ3S5L6XW362TOYCUH","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":"42132f9eeeed0a621f399b48b1cf74a89e7df7e0e4eee5baf22639e84f9bae29","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T01:38:05Z","title_canon_sha256":"6e12f70470b713e9ee3e0e587f9331ad92721bc78f46ba3b3aeb4b8cf2f05f33"},"schema_version":"1.0","source":{"id":"1602.03943","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03943","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03943v5","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03943","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"M6A33P7QYQ3S","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M6A33P7QYQ3S5L6X","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M6A33P7Q","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:76208aa2756053fa3f0084dabcf352d214d1ab096004293fb7dd193a55ee8c41","target":"graph","created_at":"2026-05-18T00:29:15Z","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":"First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored due to the high cost of computing the second-order information. In this paper we develop second-order stochastic methods for optimization problems in machine learning that match the per-iteration cost of gradient based methods, and in certain settings improve upon the overall running time over popular first-order methods. Furthermore, our algorithm has the de","authors_text":"Brian Bullins, Elad Hazan, Naman Agarwal","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T01:38:05Z","title":"Second-Order Stochastic Optimization for Machine Learning in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03943","kind":"arxiv","version":5},"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:0ecb2f73846cf3bb78a62f56431c1b274f49d15f3eadd219503d9b03df344426","target":"record","created_at":"2026-05-18T00:29:15Z","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":"42132f9eeeed0a621f399b48b1cf74a89e7df7e0e4eee5baf22639e84f9bae29","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T01:38:05Z","title_canon_sha256":"6e12f70470b713e9ee3e0e587f9331ad92721bc78f46ba3b3aeb4b8cf2f05f33"},"schema_version":"1.0","source":{"id":"1602.03943","kind":"arxiv","version":5}},"canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","first_computed_at":"2026-05-18T00:29:15.695724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:15.695724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hj3oQPAJzyVJKXRN5WKpEsKj2BgBcM+DbhxCVDjNiim8UaJizrkPyZYgT4Ejy6yQZoJja7dEq4Y50Ig5/97IDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:15.696335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03943","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ecb2f73846cf3bb78a62f56431c1b274f49d15f3eadd219503d9b03df344426","sha256:76208aa2756053fa3f0084dabcf352d214d1ab096004293fb7dd193a55ee8c41"],"state_sha256":"587f136c5b05243b2d6189f60f2e08238c6f93f96904b3ec803e68be75dc120e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaZC/n89Jw7IEndWnTmPUoLAGG5eu2TOcQMruW9KKlypVs78mJ1kvPgbcFSdAuu97+2CZ84kpTW9HQfagY7PCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:12:12.710090Z","bundle_sha256":"800b4b709aa49ef15745017d10ccfda370eadf59b5de84aa1aa3a9506a34c3f7"}}