{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LN5GXLZG7FODEF2M4UCQRVLBVZ","short_pith_number":"pith:LN5GXLZG","canonical_record":{"source":{"id":"1802.04079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T14:47:55Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"cb9827dc0b047c96058aa7ff3863cc757be9439dd1aed1337472020c3443296e","abstract_canon_sha256":"67c3eb347d2ae97b3b385756e86685d4bbb4cf74fc11dac455df3bdc7e4eb26b"},"schema_version":"1.0"},"canonical_sha256":"5b7a6baf26f95c32174ce50508d561ae58d72f40509b54c6bc404b68faf9deb3","source":{"kind":"arxiv","id":"1802.04079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04079","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04079v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04079","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"LN5GXLZG7FOD","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LN5GXLZG7FODEF2M","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LN5GXLZG","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LN5GXLZG7FODEF2M4UCQRVLBVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T14:47:55Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"cb9827dc0b047c96058aa7ff3863cc757be9439dd1aed1337472020c3443296e","abstract_canon_sha256":"67c3eb347d2ae97b3b385756e86685d4bbb4cf74fc11dac455df3bdc7e4eb26b"},"schema_version":"1.0"},"canonical_sha256":"5b7a6baf26f95c32174ce50508d561ae58d72f40509b54c6bc404b68faf9deb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:48.364740Z","signature_b64":"PTgyHeLJnnt59qdXS2g7dsG0yCJWTuCebzfgpLrZYSiFQq+URndhp1Re3eiU5n0u/MVp2REqnKSzo2pOZZxuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b7a6baf26f95c32174ce50508d561ae58d72f40509b54c6bc404b68faf9deb3","last_reissued_at":"2026-05-18T00:12:48.364059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:48.364059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04079","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:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBg98Zo2s7ZjMAJq+pZVRN8i+cpSKuN4gecMUEQNCz5A6ofcP6rH0IcSD7qchI3K6Yy/Tbs2cTq4nd7wjsF0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:37:09.593550Z"},"content_sha256":"5ffc5d60eefccac8cf868f1bfde0f39447cd75629eacd3eca82bbd43d496bb13","schema_version":"1.0","event_id":"sha256:5ffc5d60eefccac8cf868f1bfde0f39447cd75629eacd3eca82bbd43d496bb13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LN5GXLZG7FODEF2M4UCQRVLBVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Stochastic Matrix Inversion: General Theory and Speeding up BFGS Rules for Faster Second-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Filip Hanzely, Peter Richt\\'arik, Robert M. Gower, Sebastian Stich","submitted_at":"2018-02-12T14:47:55Z","abstract_excerpt":"We present the first accelerated randomized algorithm for solving linear systems in Euclidean spaces. One essential problem of this type is the matrix inversion problem. In particular, our algorithm can be specialized to invert positive definite matrices in such a way that all iterates (approximate solutions) generated by the algorithm are positive definite matrices themselves. This opens the way for many applications in the field of optimization and machine learning. As an application of our general theory, we develop the {\\em first accelerated (deterministic and stochastic) quasi-Newton upda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04079","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:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPwkX2KKEqoR36TOzMGyFTVmP5wrTeKMXNR0gRxBQpe8tKbP1ziNIpSfraXMSnA2VKPd3XU9ZA9YGvlZMTyhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:37:09.593891Z"},"content_sha256":"d87177c3b1b9571c761e225b6ed080ee187ea872f6eba9a3a75842204639a542","schema_version":"1.0","event_id":"sha256:d87177c3b1b9571c761e225b6ed080ee187ea872f6eba9a3a75842204639a542"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ/bundle.json","state_url":"https://pith.science/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ/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-20T16:37:09Z","links":{"resolver":"https://pith.science/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ","bundle":"https://pith.science/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ/bundle.json","state":"https://pith.science/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LN5GXLZG7FODEF2M4UCQRVLBVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LN5GXLZG7FODEF2M4UCQRVLBVZ","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":"67c3eb347d2ae97b3b385756e86685d4bbb4cf74fc11dac455df3bdc7e4eb26b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T14:47:55Z","title_canon_sha256":"cb9827dc0b047c96058aa7ff3863cc757be9439dd1aed1337472020c3443296e"},"schema_version":"1.0","source":{"id":"1802.04079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04079","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04079v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04079","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"LN5GXLZG7FOD","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LN5GXLZG7FODEF2M","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LN5GXLZG","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:d87177c3b1b9571c761e225b6ed080ee187ea872f6eba9a3a75842204639a542","target":"graph","created_at":"2026-05-18T00:12:48Z","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 present the first accelerated randomized algorithm for solving linear systems in Euclidean spaces. One essential problem of this type is the matrix inversion problem. In particular, our algorithm can be specialized to invert positive definite matrices in such a way that all iterates (approximate solutions) generated by the algorithm are positive definite matrices themselves. This opens the way for many applications in the field of optimization and machine learning. As an application of our general theory, we develop the {\\em first accelerated (deterministic and stochastic) quasi-Newton upda","authors_text":"Filip Hanzely, Peter Richt\\'arik, Robert M. Gower, Sebastian Stich","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T14:47:55Z","title":"Accelerated Stochastic Matrix Inversion: General Theory and Speeding up BFGS Rules for Faster Second-Order Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04079","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:5ffc5d60eefccac8cf868f1bfde0f39447cd75629eacd3eca82bbd43d496bb13","target":"record","created_at":"2026-05-18T00:12:48Z","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":"67c3eb347d2ae97b3b385756e86685d4bbb4cf74fc11dac455df3bdc7e4eb26b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T14:47:55Z","title_canon_sha256":"cb9827dc0b047c96058aa7ff3863cc757be9439dd1aed1337472020c3443296e"},"schema_version":"1.0","source":{"id":"1802.04079","kind":"arxiv","version":2}},"canonical_sha256":"5b7a6baf26f95c32174ce50508d561ae58d72f40509b54c6bc404b68faf9deb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b7a6baf26f95c32174ce50508d561ae58d72f40509b54c6bc404b68faf9deb3","first_computed_at":"2026-05-18T00:12:48.364059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:48.364059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTgyHeLJnnt59qdXS2g7dsG0yCJWTuCebzfgpLrZYSiFQq+URndhp1Re3eiU5n0u/MVp2REqnKSzo2pOZZxuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:48.364740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ffc5d60eefccac8cf868f1bfde0f39447cd75629eacd3eca82bbd43d496bb13","sha256:d87177c3b1b9571c761e225b6ed080ee187ea872f6eba9a3a75842204639a542"],"state_sha256":"af310e701ff7387b72886f4861a574463c7844755637888fad0376c0c81b4d98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FM+jDMsK/wcUmMEn4A2jB8Z2o9BFQFqihqkppWuAHfqPJr9QvNJCHezocgktTfYBPE+5FV7rY3kPpqgcMSvkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:37:09.595848Z","bundle_sha256":"53dcc89fbcbe409fc6f31fe695c4d2a7268bd479b1e4f4b9bfb062b27152e4ac"}}