{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HDWIYL2L46ILWN5K4GU3AXVLA7","short_pith_number":"pith:HDWIYL2L","canonical_record":{"source":{"id":"1708.08552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-28T22:47:48Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"91ab7dbcded274991af7467452ac9ae12e8a0458ddf9eeb10ac928879f73229b","abstract_canon_sha256":"1b5678ee9e42fcc65bfd55b167bb9da15a9f9727794590d5df143f2af0945199"},"schema_version":"1.0"},"canonical_sha256":"38ec8c2f4be790bb37aae1a9b05eab07fe7da6f8b98f93bc46464707d4d614a6","source":{"kind":"arxiv","id":"1708.08552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08552","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08552v1","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08552","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"HDWIYL2L46IL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HDWIYL2L46ILWN5K","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HDWIYL2L","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HDWIYL2L46ILWN5K4GU3AXVLA7","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-28T22:47:48Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"91ab7dbcded274991af7467452ac9ae12e8a0458ddf9eeb10ac928879f73229b","abstract_canon_sha256":"1b5678ee9e42fcc65bfd55b167bb9da15a9f9727794590d5df143f2af0945199"},"schema_version":"1.0"},"canonical_sha256":"38ec8c2f4be790bb37aae1a9b05eab07fe7da6f8b98f93bc46464707d4d614a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:27.444328Z","signature_b64":"R4T5tSOFTlg1nJ22UDEaefRjbuqqPNzdPlP5Ld3mCk1ypEn1yvPBt5ohb/bhpLB041Wk7eLPTVRpUUhD1gdBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38ec8c2f4be790bb37aae1a9b05eab07fe7da6f8b98f93bc46464707d4d614a6","last_reissued_at":"2026-05-18T00:36:27.443601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:27.443601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08552","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-18T00:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOsRVteDa46bqG4xJusougmSq1tkYCbZao71Fpy4iV54Xp/SnYR/yX8C8Micjfaqey8ha7NGcAZmT9KG1cj4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:16:20.422489Z"},"content_sha256":"1aecfe781f042763445415476c2adfb3b93051c9c7dbbc8ec92bee6539870a92","schema_version":"1.0","event_id":"sha256:1aecfe781f042763445415476c2adfb3b93051c9c7dbbc8ec92bee6539870a92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HDWIYL2L46ILWN5K4GU3AXVLA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inexact subsampled proximal Newton-type method for large-scale machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Jason D. Lee, Xuanqing Liu, Yuekai Sun","submitted_at":"2017-08-28T22:47:48Z","abstract_excerpt":"We propose a fast proximal Newton-type algorithm for minimizing regularized finite sums that returns an $\\epsilon$-suboptimal point in $\\tilde{\\mathcal{O}}(d(n + \\sqrt{\\kappa d})\\log(\\frac{1}{\\epsilon}))$ FLOPS, where $n$ is number of samples, $d$ is feature dimension, and $\\kappa$ is the condition number. As long as $n > d$, the proposed method is more efficient than state-of-the-art accelerated stochastic first-order methods for non-smooth regularizers which requires $\\tilde{\\mathcal{O}}(d(n + \\sqrt{\\kappa n})\\log(\\frac{1}{\\epsilon}))$ FLOPS. The key idea is to form the subsampled Newton sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08552","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-18T00:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plDnOJIrD1hl++zjk30U8yasP7+wHDoBOCdHBxcK3Ce/u3GcGjUa5lY96WMB+2BQTn0jrE/x+1EEW9XY01JnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:16:20.422852Z"},"content_sha256":"c638e2f81284b0e0c44f198a2955a66908fac02c28a405b2da46fa5ae4d5579a","schema_version":"1.0","event_id":"sha256:c638e2f81284b0e0c44f198a2955a66908fac02c28a405b2da46fa5ae4d5579a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDWIYL2L46ILWN5K4GU3AXVLA7/bundle.json","state_url":"https://pith.science/pith/HDWIYL2L46ILWN5K4GU3AXVLA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDWIYL2L46ILWN5K4GU3AXVLA7/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-31T04:16:20Z","links":{"resolver":"https://pith.science/pith/HDWIYL2L46ILWN5K4GU3AXVLA7","bundle":"https://pith.science/pith/HDWIYL2L46ILWN5K4GU3AXVLA7/bundle.json","state":"https://pith.science/pith/HDWIYL2L46ILWN5K4GU3AXVLA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDWIYL2L46ILWN5K4GU3AXVLA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HDWIYL2L46ILWN5K4GU3AXVLA7","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":"1b5678ee9e42fcc65bfd55b167bb9da15a9f9727794590d5df143f2af0945199","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-28T22:47:48Z","title_canon_sha256":"91ab7dbcded274991af7467452ac9ae12e8a0458ddf9eeb10ac928879f73229b"},"schema_version":"1.0","source":{"id":"1708.08552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08552","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08552v1","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08552","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"HDWIYL2L46IL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HDWIYL2L46ILWN5K","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HDWIYL2L","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:c638e2f81284b0e0c44f198a2955a66908fac02c28a405b2da46fa5ae4d5579a","target":"graph","created_at":"2026-05-18T00:36:27Z","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 fast proximal Newton-type algorithm for minimizing regularized finite sums that returns an $\\epsilon$-suboptimal point in $\\tilde{\\mathcal{O}}(d(n + \\sqrt{\\kappa d})\\log(\\frac{1}{\\epsilon}))$ FLOPS, where $n$ is number of samples, $d$ is feature dimension, and $\\kappa$ is the condition number. As long as $n > d$, the proposed method is more efficient than state-of-the-art accelerated stochastic first-order methods for non-smooth regularizers which requires $\\tilde{\\mathcal{O}}(d(n + \\sqrt{\\kappa n})\\log(\\frac{1}{\\epsilon}))$ FLOPS. The key idea is to form the subsampled Newton sub","authors_text":"Cho-Jui Hsieh, Jason D. Lee, Xuanqing Liu, Yuekai Sun","cross_cats":["cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-28T22:47:48Z","title":"An inexact subsampled proximal Newton-type method for large-scale machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08552","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:1aecfe781f042763445415476c2adfb3b93051c9c7dbbc8ec92bee6539870a92","target":"record","created_at":"2026-05-18T00:36:27Z","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":"1b5678ee9e42fcc65bfd55b167bb9da15a9f9727794590d5df143f2af0945199","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-28T22:47:48Z","title_canon_sha256":"91ab7dbcded274991af7467452ac9ae12e8a0458ddf9eeb10ac928879f73229b"},"schema_version":"1.0","source":{"id":"1708.08552","kind":"arxiv","version":1}},"canonical_sha256":"38ec8c2f4be790bb37aae1a9b05eab07fe7da6f8b98f93bc46464707d4d614a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38ec8c2f4be790bb37aae1a9b05eab07fe7da6f8b98f93bc46464707d4d614a6","first_computed_at":"2026-05-18T00:36:27.443601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:27.443601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R4T5tSOFTlg1nJ22UDEaefRjbuqqPNzdPlP5Ld3mCk1ypEn1yvPBt5ohb/bhpLB041Wk7eLPTVRpUUhD1gdBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:27.444328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aecfe781f042763445415476c2adfb3b93051c9c7dbbc8ec92bee6539870a92","sha256:c638e2f81284b0e0c44f198a2955a66908fac02c28a405b2da46fa5ae4d5579a"],"state_sha256":"69431c2ecf428368e377ed8058c7c67d2a01e8eff5e9c50962d55091af96c720"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqNts9VzisJDUF7YcyMrIeCpzlotnFA/zwYUyJDiFacMMyhLjClkV5X043vZVVOSSjVnJaWIhIHKLDSJUJwLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:16:20.425100Z","bundle_sha256":"dc4e1696b9bb7f26d239b513dd3e8b5d6e10134fe6ff33199bcb6625ae581341"}}