{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EJMOI3N2D5WOQQFWA2HSYBGFJK","short_pith_number":"pith:EJMOI3N2","canonical_record":{"source":{"id":"1505.02250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T09:36:26Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"1a06aed1537e6c14be77363b2be467285812f0ecdfed258dd60182c29739342a","abstract_canon_sha256":"2d12d40b11e11a24d0e48b372477f9d188f284e5060a4972542aeb0055ea76aa"},"schema_version":"1.0"},"canonical_sha256":"2258e46dba1f6ce840b6068f2c04c54a868461e494a8f99807a388519c67c85d","source":{"kind":"arxiv","id":"1505.02250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02250","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02250v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02250","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"EJMOI3N2D5WO","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EJMOI3N2D5WOQQFW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EJMOI3N2","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EJMOI3N2D5WOQQFWA2HSYBGFJK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T09:36:26Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"1a06aed1537e6c14be77363b2be467285812f0ecdfed258dd60182c29739342a","abstract_canon_sha256":"2d12d40b11e11a24d0e48b372477f9d188f284e5060a4972542aeb0055ea76aa"},"schema_version":"1.0"},"canonical_sha256":"2258e46dba1f6ce840b6068f2c04c54a868461e494a8f99807a388519c67c85d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.454249Z","signature_b64":"8m73X6wGZrA/7wTJybkucOOAD12bLWrn23p0FrCpgYdzBde1Sl2Gc8ME1jJ6dCVYC6Thn0rolrpzM8JIXTrQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2258e46dba1f6ce840b6068f2c04c54a868461e494a8f99807a388519c67c85d","last_reissued_at":"2026-05-18T02:16:19.453610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.453610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02250","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKIapL61phnhZ1y59vBW5PCd7RHdhbwbLLqzwVhzOhWtxI+guRzIuJKem++XqIFVDK0JzthuKEUFAv9/fq0GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:59:42.777408Z"},"content_sha256":"d2503350446815976944aca4bd4f14abf9063064f410218fece3fe42aaa3e111","schema_version":"1.0","event_id":"sha256:d2503350446815976944aca4bd4f14abf9063064f410218fece3fe42aaa3e111"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EJMOI3N2D5WOQQFWA2HSYBGFJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Martin J. Wainwright, Mert Pilanci","submitted_at":"2015-05-09T09:36:26Z","abstract_excerpt":"We propose a randomized second-order method for optimization known as the Newton Sketch: it is based on performing an approximate Newton step using a randomly projected or sub-sampled Hessian. For self-concordant functions, we prove that the algorithm has super-linear convergence with exponentially high probability, with convergence and complexity guarantees that are independent of condition numbers and related problem-dependent quantities. Given a suitable initialization, similar guarantees also hold for strongly convex and smooth objectives without self-concordance. When implemented using ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02250","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFuHqvqT5EnPGHgC3aMbyUFZQBKPQdm7Lrgxb3QYynGVk0S2kr2O1i0WKa1iKVS6DxWe58VeIm1pkub3PjlrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:59:42.777769Z"},"content_sha256":"86cb2d7c39d37ec5168266f1ec179967762e6689c63f10f645268ddf1a8c95f4","schema_version":"1.0","event_id":"sha256:86cb2d7c39d37ec5168266f1ec179967762e6689c63f10f645268ddf1a8c95f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK/bundle.json","state_url":"https://pith.science/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK/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-02T22:59:42Z","links":{"resolver":"https://pith.science/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK","bundle":"https://pith.science/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK/bundle.json","state":"https://pith.science/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJMOI3N2D5WOQQFWA2HSYBGFJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EJMOI3N2D5WOQQFWA2HSYBGFJK","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":"2d12d40b11e11a24d0e48b372477f9d188f284e5060a4972542aeb0055ea76aa","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T09:36:26Z","title_canon_sha256":"1a06aed1537e6c14be77363b2be467285812f0ecdfed258dd60182c29739342a"},"schema_version":"1.0","source":{"id":"1505.02250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02250","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02250v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02250","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"EJMOI3N2D5WO","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EJMOI3N2D5WOQQFW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EJMOI3N2","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:86cb2d7c39d37ec5168266f1ec179967762e6689c63f10f645268ddf1a8c95f4","target":"graph","created_at":"2026-05-18T02:16:19Z","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 randomized second-order method for optimization known as the Newton Sketch: it is based on performing an approximate Newton step using a randomly projected or sub-sampled Hessian. For self-concordant functions, we prove that the algorithm has super-linear convergence with exponentially high probability, with convergence and complexity guarantees that are independent of condition numbers and related problem-dependent quantities. Given a suitable initialization, similar guarantees also hold for strongly convex and smooth objectives without self-concordance. When implemented using ra","authors_text":"Martin J. Wainwright, Mert Pilanci","cross_cats":["cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T09:36:26Z","title":"Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02250","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:d2503350446815976944aca4bd4f14abf9063064f410218fece3fe42aaa3e111","target":"record","created_at":"2026-05-18T02:16:19Z","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":"2d12d40b11e11a24d0e48b372477f9d188f284e5060a4972542aeb0055ea76aa","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T09:36:26Z","title_canon_sha256":"1a06aed1537e6c14be77363b2be467285812f0ecdfed258dd60182c29739342a"},"schema_version":"1.0","source":{"id":"1505.02250","kind":"arxiv","version":1}},"canonical_sha256":"2258e46dba1f6ce840b6068f2c04c54a868461e494a8f99807a388519c67c85d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2258e46dba1f6ce840b6068f2c04c54a868461e494a8f99807a388519c67c85d","first_computed_at":"2026-05-18T02:16:19.453610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.453610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8m73X6wGZrA/7wTJybkucOOAD12bLWrn23p0FrCpgYdzBde1Sl2Gc8ME1jJ6dCVYC6Thn0rolrpzM8JIXTrQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.454249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2503350446815976944aca4bd4f14abf9063064f410218fece3fe42aaa3e111","sha256:86cb2d7c39d37ec5168266f1ec179967762e6689c63f10f645268ddf1a8c95f4"],"state_sha256":"749f803025be261c6b47753897c82c612a22990b1d974cff516e4cb4d9c1156d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWD07zGYO86jMmWZl4Iyk6TaUGdcTquD9GTso71cdOmvFPhEmikRckwXUCzJvz5v30V8aP0TkTVdWtGuAC+NBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:59:42.779846Z","bundle_sha256":"e9dc75ecb169843bfa9ae1c196bdf0b47167a1f3d17ff0a9f53f220cb9fed3c1"}}