{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YDJ4SBVPHHL42LKMYGD2CNQJGB","short_pith_number":"pith:YDJ4SBVP","canonical_record":{"source":{"id":"1610.00960","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-04T12:51:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"27ab4da16d3f70f9d69cfd591b459c02a05e8eb5d664cdfea2f73f8adb926eb2","abstract_canon_sha256":"7210c4290a3da3415311139894c613397160b9a3bcb1daf68393e3ad28504799"},"schema_version":"1.0"},"canonical_sha256":"c0d3c906af39d7cd2d4cc187a13609306dd526b9e56620390fa148f86a766481","source":{"kind":"arxiv","id":"1610.00960","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00960","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00960v4","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00960","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"YDJ4SBVPHHL4","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDJ4SBVPHHL42LKM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDJ4SBVP","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YDJ4SBVPHHL42LKMYGD2CNQJGB","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00960","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-04T12:51:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"27ab4da16d3f70f9d69cfd591b459c02a05e8eb5d664cdfea2f73f8adb926eb2","abstract_canon_sha256":"7210c4290a3da3415311139894c613397160b9a3bcb1daf68393e3ad28504799"},"schema_version":"1.0"},"canonical_sha256":"c0d3c906af39d7cd2d4cc187a13609306dd526b9e56620390fa148f86a766481","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.414914Z","signature_b64":"DwXkOZij4XN9D/9BWyVvCJBPG/7V1Wn/7odvF11j1ar+TU0yTV2TQEU0ZK6kNWznEDIAeNiGc0sbsGtG5C9NCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d3c906af39d7cd2d4cc187a13609306dd526b9e56620390fa148f86a766481","last_reissued_at":"2026-05-17T23:55:23.414522Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.414522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00960","source_version":4,"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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZiKnGRHUzo5uuX3gOxMbcrm0foxWNcvVEY6rEZYBFO4N1AqJ/WYTIA1GygR7U1Qofs9SJxDRzCqb+eqrrpFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:57:15.031773Z"},"content_sha256":"7695a03bfc16eae0a190659781be9b13dfe8a9fa5854a70e9816785a35f2c9e8","schema_version":"1.0","event_id":"sha256:7695a03bfc16eae0a190659781be9b13dfe8a9fa5854a70e9816785a35f2c9e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YDJ4SBVPHHL42LKMYGD2CNQJGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"CSAIL), Hongzhou Lin (Thoth, Julien Mairal (Thoth), Zaid Harchaoui","submitted_at":"2016-10-04T12:51:20Z","abstract_excerpt":"We propose an inexact variable-metric proximal point algorithm to accelerate gradient-based optimization algorithms. The proposed scheme, called QNing can be notably applied to incremental first-order methods such as the stochastic variance-reduced gradient descent algorithm (SVRG) and other randomized incremental optimization algorithms. QNing is also compatible with composite objectives, meaning that it has the ability to provide exactly sparse solutions when the objective involves a sparsity-inducing regularization. When combined with limited-memory BFGS rules, QNing is particularly effecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00960","kind":"arxiv","version":4},"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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUGWUnI9P4rjQCJe+z+oHcgOZRJSO4r8F7EyxmQRx/AekDF9vp+LJSmil94zvpwcPypCMmtiSBkkHgTSl68JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:57:15.032118Z"},"content_sha256":"d672205305fa321228d081984eadc13f695288ee0c34549a3c13f4dfe87ad2de","schema_version":"1.0","event_id":"sha256:d672205305fa321228d081984eadc13f695288ee0c34549a3c13f4dfe87ad2de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB/bundle.json","state_url":"https://pith.science/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB/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-24T04:57:15Z","links":{"resolver":"https://pith.science/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB","bundle":"https://pith.science/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB/bundle.json","state":"https://pith.science/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDJ4SBVPHHL42LKMYGD2CNQJGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YDJ4SBVPHHL42LKMYGD2CNQJGB","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":"7210c4290a3da3415311139894c613397160b9a3bcb1daf68393e3ad28504799","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-04T12:51:20Z","title_canon_sha256":"27ab4da16d3f70f9d69cfd591b459c02a05e8eb5d664cdfea2f73f8adb926eb2"},"schema_version":"1.0","source":{"id":"1610.00960","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00960","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00960v4","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00960","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"YDJ4SBVPHHL4","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDJ4SBVPHHL42LKM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDJ4SBVP","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:d672205305fa321228d081984eadc13f695288ee0c34549a3c13f4dfe87ad2de","target":"graph","created_at":"2026-05-17T23:55:23Z","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 an inexact variable-metric proximal point algorithm to accelerate gradient-based optimization algorithms. The proposed scheme, called QNing can be notably applied to incremental first-order methods such as the stochastic variance-reduced gradient descent algorithm (SVRG) and other randomized incremental optimization algorithms. QNing is also compatible with composite objectives, meaning that it has the ability to provide exactly sparse solutions when the objective involves a sparsity-inducing regularization. When combined with limited-memory BFGS rules, QNing is particularly effecti","authors_text":"CSAIL), Hongzhou Lin (Thoth, Julien Mairal (Thoth), Zaid Harchaoui","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-04T12:51:20Z","title":"An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00960","kind":"arxiv","version":4},"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:7695a03bfc16eae0a190659781be9b13dfe8a9fa5854a70e9816785a35f2c9e8","target":"record","created_at":"2026-05-17T23:55:23Z","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":"7210c4290a3da3415311139894c613397160b9a3bcb1daf68393e3ad28504799","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-04T12:51:20Z","title_canon_sha256":"27ab4da16d3f70f9d69cfd591b459c02a05e8eb5d664cdfea2f73f8adb926eb2"},"schema_version":"1.0","source":{"id":"1610.00960","kind":"arxiv","version":4}},"canonical_sha256":"c0d3c906af39d7cd2d4cc187a13609306dd526b9e56620390fa148f86a766481","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d3c906af39d7cd2d4cc187a13609306dd526b9e56620390fa148f86a766481","first_computed_at":"2026-05-17T23:55:23.414522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.414522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DwXkOZij4XN9D/9BWyVvCJBPG/7V1Wn/7odvF11j1ar+TU0yTV2TQEU0ZK6kNWznEDIAeNiGc0sbsGtG5C9NCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.414914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00960","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7695a03bfc16eae0a190659781be9b13dfe8a9fa5854a70e9816785a35f2c9e8","sha256:d672205305fa321228d081984eadc13f695288ee0c34549a3c13f4dfe87ad2de"],"state_sha256":"849b3e4166dc704c09433328f64884122760f30cd915f9615cfda5aefcfbf539"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHaoIwpQZRg/gXqNXFI2/NuYy4wb7NQ5mHsfuQ0HpJTH/3ZcBQZKxxeNpaRl+T+A6Yik+DDmpz3LbTSUWgchDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:57:15.034077Z","bundle_sha256":"d7129b11be690e72b26af2b7e734a373bb8d42d4239ef03746774977e97db0c8"}}