{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XEZNCD62ESX5LOTPPBO2GBJTR3","short_pith_number":"pith:XEZNCD62","canonical_record":{"source":{"id":"1508.02087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-09T21:40:33Z","cross_cats_sorted":["cs.LG","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"c3f68a9436ec7312a5c39bad55ea5618f731898ec19845263d6138ffd5a21798","abstract_canon_sha256":"988486be4a80368c22340f88c3605661d88e441be5556b9987feb672e7256fa0"},"schema_version":"1.0"},"canonical_sha256":"b932d10fda24afd5ba6f785da305338ee04511fd82c913553b435594d1ca8dda","source":{"kind":"arxiv","id":"1508.02087","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02087","created_at":"2026-05-18T01:17:08Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02087v2","created_at":"2026-05-18T01:17:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02087","created_at":"2026-05-18T01:17:08Z"},{"alias_kind":"pith_short_12","alias_value":"XEZNCD62ESX5","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XEZNCD62ESX5LOTP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XEZNCD62","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XEZNCD62ESX5LOTPPBO2GBJTR3","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-09T21:40:33Z","cross_cats_sorted":["cs.LG","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"c3f68a9436ec7312a5c39bad55ea5618f731898ec19845263d6138ffd5a21798","abstract_canon_sha256":"988486be4a80368c22340f88c3605661d88e441be5556b9987feb672e7256fa0"},"schema_version":"1.0"},"canonical_sha256":"b932d10fda24afd5ba6f785da305338ee04511fd82c913553b435594d1ca8dda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:08.037414Z","signature_b64":"0QUGcDJXMhy3IaSwrxJP7LF0D7/BsQDOju/6CyH7r/8nIEbtUk/wzO3oG5hpS+JVJbAxsPoESmYKHIt5g5A7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b932d10fda24afd5ba6f785da305338ee04511fd82c913553b435594d1ca8dda","last_reissued_at":"2026-05-18T01:17:08.036286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:08.036286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02087","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-18T01:17:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4z1X6wUs/BcVv2ZNkfQL8AxiE3pRRvTcvJK/khQn9HW4s/C+eBzejWSvoScnNobB3y8HoC16Qq4W8VCAQYGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:18:57.522885Z"},"content_sha256":"8084bf9e01a404c899ab2789ad8e9053d39ccff6d4def06df0542c78688446ed","schema_version":"1.0","event_id":"sha256:8084bf9e01a404c899ab2789ad8e9053d39ccff6d4def06df0542c78688446ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XEZNCD62ESX5LOTPPBO2GBJTR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linearly-Convergent Stochastic L-BFGS Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Michael I. Jordan, Philipp Moritz, Robert Nishihara","submitted_at":"2015-08-09T21:40:33Z","abstract_excerpt":"We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a recent approach to variance reduction for stochastic gradient descent from Johnson and Zhang (2013). We demonstrate experimentally that our algorithm performs well on large-scale convex and non-convex optimization problems, exhibiting linear convergence and rapidly solving the optimization problems to high levels of precision. Furthermore, we show that our alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02087","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-18T01:17:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoAe+Qhj/m0n2Zk6Y5YFx/SeiUFGZHubIKn3Ju+89VeRQAMoVxSU4SR5URJf8IT+kyJQhL8ND/XMoNEmtP6dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:18:57.523235Z"},"content_sha256":"a9fdb74099bec94fb11754911a1e32f17e01053fe02b13ced90d5be1a8cd2eaa","schema_version":"1.0","event_id":"sha256:a9fdb74099bec94fb11754911a1e32f17e01053fe02b13ced90d5be1a8cd2eaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEZNCD62ESX5LOTPPBO2GBJTR3/bundle.json","state_url":"https://pith.science/pith/XEZNCD62ESX5LOTPPBO2GBJTR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEZNCD62ESX5LOTPPBO2GBJTR3/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-03T07:18:57Z","links":{"resolver":"https://pith.science/pith/XEZNCD62ESX5LOTPPBO2GBJTR3","bundle":"https://pith.science/pith/XEZNCD62ESX5LOTPPBO2GBJTR3/bundle.json","state":"https://pith.science/pith/XEZNCD62ESX5LOTPPBO2GBJTR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEZNCD62ESX5LOTPPBO2GBJTR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XEZNCD62ESX5LOTPPBO2GBJTR3","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":"988486be4a80368c22340f88c3605661d88e441be5556b9987feb672e7256fa0","cross_cats_sorted":["cs.LG","math.NA","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-09T21:40:33Z","title_canon_sha256":"c3f68a9436ec7312a5c39bad55ea5618f731898ec19845263d6138ffd5a21798"},"schema_version":"1.0","source":{"id":"1508.02087","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02087","created_at":"2026-05-18T01:17:08Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02087v2","created_at":"2026-05-18T01:17:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02087","created_at":"2026-05-18T01:17:08Z"},{"alias_kind":"pith_short_12","alias_value":"XEZNCD62ESX5","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XEZNCD62ESX5LOTP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XEZNCD62","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:a9fdb74099bec94fb11754911a1e32f17e01053fe02b13ced90d5be1a8cd2eaa","target":"graph","created_at":"2026-05-18T01:17:08Z","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 new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a recent approach to variance reduction for stochastic gradient descent from Johnson and Zhang (2013). We demonstrate experimentally that our algorithm performs well on large-scale convex and non-convex optimization problems, exhibiting linear convergence and rapidly solving the optimization problems to high levels of precision. Furthermore, we show that our alg","authors_text":"Michael I. Jordan, Philipp Moritz, Robert Nishihara","cross_cats":["cs.LG","math.NA","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-09T21:40:33Z","title":"A Linearly-Convergent Stochastic L-BFGS Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02087","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:8084bf9e01a404c899ab2789ad8e9053d39ccff6d4def06df0542c78688446ed","target":"record","created_at":"2026-05-18T01:17:08Z","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":"988486be4a80368c22340f88c3605661d88e441be5556b9987feb672e7256fa0","cross_cats_sorted":["cs.LG","math.NA","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-09T21:40:33Z","title_canon_sha256":"c3f68a9436ec7312a5c39bad55ea5618f731898ec19845263d6138ffd5a21798"},"schema_version":"1.0","source":{"id":"1508.02087","kind":"arxiv","version":2}},"canonical_sha256":"b932d10fda24afd5ba6f785da305338ee04511fd82c913553b435594d1ca8dda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b932d10fda24afd5ba6f785da305338ee04511fd82c913553b435594d1ca8dda","first_computed_at":"2026-05-18T01:17:08.036286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:08.036286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0QUGcDJXMhy3IaSwrxJP7LF0D7/BsQDOju/6CyH7r/8nIEbtUk/wzO3oG5hpS+JVJbAxsPoESmYKHIt5g5A7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:08.037414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02087","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8084bf9e01a404c899ab2789ad8e9053d39ccff6d4def06df0542c78688446ed","sha256:a9fdb74099bec94fb11754911a1e32f17e01053fe02b13ced90d5be1a8cd2eaa"],"state_sha256":"6156eb32fc4e691116a144c28680dc04eda33fe8e15418243daf0bdd05b3505a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmxrjaHgtFsTeLscDOJPQ+B0vCjdzn9TFmivi144in7kjT+YhwNS60y/HQUFxWw1xAMX23y2clWwUv2D8pSEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:18:57.525299Z","bundle_sha256":"e7e0ee921e1315b99fa8dfaadda9477e0d83c0242dea39385f85f3b5ec25a119"}}