{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:H552V35FJF5ETLBENI3OECWVUY","short_pith_number":"pith:H552V35F","canonical_record":{"source":{"id":"1601.04738","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-18T22:04:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cc92190b4be1591aee05185817aae8b9f0d328521c4a63f4a5d1aa0d438ff86e","abstract_canon_sha256":"6cff733546eb78f12ca6d3d63edb2669e13a786b82b4e8d82f0e599b5890825b"},"schema_version":"1.0"},"canonical_sha256":"3f7baaefa5497a49ac246a36e20ad5a600152e1ebeca7dd6ff4fb326a88a8ce1","source":{"kind":"arxiv","id":"1601.04738","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04738","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04738v3","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04738","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"H552V35FJF5E","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H552V35FJF5ETLBE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H552V35F","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:H552V35FJF5ETLBENI3OECWVUY","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04738","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-18T22:04:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cc92190b4be1591aee05185817aae8b9f0d328521c4a63f4a5d1aa0d438ff86e","abstract_canon_sha256":"6cff733546eb78f12ca6d3d63edb2669e13a786b82b4e8d82f0e599b5890825b"},"schema_version":"1.0"},"canonical_sha256":"3f7baaefa5497a49ac246a36e20ad5a600152e1ebeca7dd6ff4fb326a88a8ce1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.973052Z","signature_b64":"ygXlMLE+x3xmWnnt3CADHsoBAk4OfrglpYVM1vbSLiZxUfLs9IStjzxPh9SIvW28erdtjz4+J6Xc4a61fwzLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f7baaefa5497a49ac246a36e20ad5a600152e1ebeca7dd6ff4fb326a88a8ce1","last_reissued_at":"2026-05-18T01:19:56.972351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.972351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04738","source_version":3,"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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLR2F09kq/+dnazZQ6D3X8PKkpzwU2RRbSgfUEAOoEBG1/OTHmJ08Vx4bUr6jkpHmK+XxDO78AirrX6Vs3N0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:27.068599Z"},"content_sha256":"1924aa72af53022314da9a16e0cc92681535530af5a9f7a872afbdc03157394d","schema_version":"1.0","event_id":"sha256:1924aa72af53022314da9a16e0cc92681535530af5a9f7a872afbdc03157394d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:H552V35FJF5ETLBENI3OECWVUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sub-Sampled Newton Methods II: Local Convergence Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Farbod Roosta-Khorasani, Michael W. Mahoney","submitted_at":"2016-01-18T22:04:32Z","abstract_excerpt":"Many data-fitting applications require the solution of an optimization problem involving a sum of large number of functions of high dimensional parameter. Here, we consider the problem of minimizing a sum of $n$ functions over a convex constraint set $\\mathcal{X} \\subseteq \\mathbb{R}^{p}$ where both $n$ and $p$ are large. In such problems, sub-sampling as a way to reduce $n$ can offer great amount of computational efficiency.\n  Within the context of second order methods, we first give quantitative local convergence results for variants of Newton's method where the Hessian is uniformly sub-samp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04738","kind":"arxiv","version":3},"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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnTEk7ZrRI7mmcQ7a6mxIyybap/Kd+q29fvoUgFRU8hI9vq4cvBrUSnDyCZbipxaG1IM9zwojJVH34F0bn2fCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:27.068959Z"},"content_sha256":"75d97587b6830b2bdfc2a13726473e92e434ab0ea36a5f3746dda07c93b6526e","schema_version":"1.0","event_id":"sha256:75d97587b6830b2bdfc2a13726473e92e434ab0ea36a5f3746dda07c93b6526e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H552V35FJF5ETLBENI3OECWVUY/bundle.json","state_url":"https://pith.science/pith/H552V35FJF5ETLBENI3OECWVUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H552V35FJF5ETLBENI3OECWVUY/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-11T13:10:27Z","links":{"resolver":"https://pith.science/pith/H552V35FJF5ETLBENI3OECWVUY","bundle":"https://pith.science/pith/H552V35FJF5ETLBENI3OECWVUY/bundle.json","state":"https://pith.science/pith/H552V35FJF5ETLBENI3OECWVUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H552V35FJF5ETLBENI3OECWVUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H552V35FJF5ETLBENI3OECWVUY","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":"6cff733546eb78f12ca6d3d63edb2669e13a786b82b4e8d82f0e599b5890825b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-18T22:04:32Z","title_canon_sha256":"cc92190b4be1591aee05185817aae8b9f0d328521c4a63f4a5d1aa0d438ff86e"},"schema_version":"1.0","source":{"id":"1601.04738","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04738","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04738v3","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04738","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"H552V35FJF5E","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H552V35FJF5ETLBE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H552V35F","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:75d97587b6830b2bdfc2a13726473e92e434ab0ea36a5f3746dda07c93b6526e","target":"graph","created_at":"2026-05-18T01:19:56Z","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":"Many data-fitting applications require the solution of an optimization problem involving a sum of large number of functions of high dimensional parameter. Here, we consider the problem of minimizing a sum of $n$ functions over a convex constraint set $\\mathcal{X} \\subseteq \\mathbb{R}^{p}$ where both $n$ and $p$ are large. In such problems, sub-sampling as a way to reduce $n$ can offer great amount of computational efficiency.\n  Within the context of second order methods, we first give quantitative local convergence results for variants of Newton's method where the Hessian is uniformly sub-samp","authors_text":"Farbod Roosta-Khorasani, Michael W. Mahoney","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-18T22:04:32Z","title":"Sub-Sampled Newton Methods II: Local Convergence Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04738","kind":"arxiv","version":3},"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:1924aa72af53022314da9a16e0cc92681535530af5a9f7a872afbdc03157394d","target":"record","created_at":"2026-05-18T01:19:56Z","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":"6cff733546eb78f12ca6d3d63edb2669e13a786b82b4e8d82f0e599b5890825b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-18T22:04:32Z","title_canon_sha256":"cc92190b4be1591aee05185817aae8b9f0d328521c4a63f4a5d1aa0d438ff86e"},"schema_version":"1.0","source":{"id":"1601.04738","kind":"arxiv","version":3}},"canonical_sha256":"3f7baaefa5497a49ac246a36e20ad5a600152e1ebeca7dd6ff4fb326a88a8ce1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f7baaefa5497a49ac246a36e20ad5a600152e1ebeca7dd6ff4fb326a88a8ce1","first_computed_at":"2026-05-18T01:19:56.972351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:56.972351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ygXlMLE+x3xmWnnt3CADHsoBAk4OfrglpYVM1vbSLiZxUfLs9IStjzxPh9SIvW28erdtjz4+J6Xc4a61fwzLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:56.973052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04738","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1924aa72af53022314da9a16e0cc92681535530af5a9f7a872afbdc03157394d","sha256:75d97587b6830b2bdfc2a13726473e92e434ab0ea36a5f3746dda07c93b6526e"],"state_sha256":"6a31bb9c4bb892d889488c7dc829e3059b13ab4e3ccde437e415d5ad7606b1e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FeUO+SypUE7Xey1auDmVTYDuAugNXYAvlNzdgweFzaxEZ004m4pM66NoWn6/DdNuOCuqqlmqs6pzG5ABJwVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:10:27.071059Z","bundle_sha256":"0e2c8a1ebd643648299b7f408c24984eeff1f58c31067a55b14fd9babe9b8f4c"}}