{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U2WH7DBIHARS37JJP3IBIGBSUU","short_pith_number":"pith:U2WH7DBI","canonical_record":{"source":{"id":"1410.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-20T14:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"21049f0d0fca8e696dfdfd82a8f70f56dcd4773b54e4c9012d72cd7cfb36e7f5","abstract_canon_sha256":"750c3523b258faac617662bab3cbaa5dc01c40cff825dd8cd1d74be2359824ac"},"schema_version":"1.0"},"canonical_sha256":"a6ac7f8c2838232dfd297ed0141832a502513d3aab550aa4e914de556fd6eb6d","source":{"kind":"arxiv","id":"1410.5284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5284","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5284v1","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5284","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"U2WH7DBIHARS","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U2WH7DBIHARS37JJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U2WH7DBI","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U2WH7DBIHARS37JJP3IBIGBSUU","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-20T14:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"21049f0d0fca8e696dfdfd82a8f70f56dcd4773b54e4c9012d72cd7cfb36e7f5","abstract_canon_sha256":"750c3523b258faac617662bab3cbaa5dc01c40cff825dd8cd1d74be2359824ac"},"schema_version":"1.0"},"canonical_sha256":"a6ac7f8c2838232dfd297ed0141832a502513d3aab550aa4e914de556fd6eb6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:53.198501Z","signature_b64":"9h9Q7LN9b1wReR7jmyL6Oo3AipX6U4qomuJ0EXpE0QSxwJI7hUPs8UbrQh9bc15A1OnVjBYfkwBlXc/GinPHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6ac7f8c2838232dfd297ed0141832a502513d3aab550aa4e914de556fd6eb6d","last_reissued_at":"2026-05-18T01:17:53.197944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:53.197944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5284","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-18T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2cZkB7ZX0WUs0UzdzjhT6O4tL44GIt2MGPoiw2pGgUaEd7y9SXpO/XvdIE6orjJB5+WQN2DENUJaaCikNd9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:05.770618Z"},"content_sha256":"7d4f8fa206ff1430e0b731ee963e4d00f47257c64c8e634141726b4be93970c7","schema_version":"1.0","event_id":"sha256:7d4f8fa206ff1430e0b731ee963e4d00f47257c64c8e634141726b4be93970c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U2WH7DBIHARS37JJP3IBIGBSUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A globally convergent incremental Newton method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asuman Ozdaglar, Mert G\\\"urb\\\"uzbalaban, Pablo Parrilo","submitted_at":"2014-10-20T14:07:22Z","abstract_excerpt":"Motivated by machine learning problems over large data sets and distributed optimization over networks, we develop and analyze a new method called incremental Newton method for minimizing the sum of a large number of strongly convex functions. We show that our method is globally convergent for a variable stepsize rule. We further show that under a gradient growth condition, convergence rate is linear for both variable and constant stepsize rules. By means of an example, we show that without the gradient growth condition, incremental Newton method cannot achieve linear convergence. Our analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5284","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-18T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oqhd6JD1GWkX5tx3bE/2GQGYqP3zaglh8U8k8JxF7QCCb61M9gePnulzINZUgDET07H7AVD5ar/YXPAOE3X2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:05.771302Z"},"content_sha256":"ee9388a539a6f9e3dd1d8107e4b454296bff5c8d43c9f448c639bdb9e3f85bce","schema_version":"1.0","event_id":"sha256:ee9388a539a6f9e3dd1d8107e4b454296bff5c8d43c9f448c639bdb9e3f85bce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2WH7DBIHARS37JJP3IBIGBSUU/bundle.json","state_url":"https://pith.science/pith/U2WH7DBIHARS37JJP3IBIGBSUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2WH7DBIHARS37JJP3IBIGBSUU/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-30T10:42:05Z","links":{"resolver":"https://pith.science/pith/U2WH7DBIHARS37JJP3IBIGBSUU","bundle":"https://pith.science/pith/U2WH7DBIHARS37JJP3IBIGBSUU/bundle.json","state":"https://pith.science/pith/U2WH7DBIHARS37JJP3IBIGBSUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2WH7DBIHARS37JJP3IBIGBSUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U2WH7DBIHARS37JJP3IBIGBSUU","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":"750c3523b258faac617662bab3cbaa5dc01c40cff825dd8cd1d74be2359824ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-20T14:07:22Z","title_canon_sha256":"21049f0d0fca8e696dfdfd82a8f70f56dcd4773b54e4c9012d72cd7cfb36e7f5"},"schema_version":"1.0","source":{"id":"1410.5284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5284","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5284v1","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5284","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"U2WH7DBIHARS","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U2WH7DBIHARS37JJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U2WH7DBI","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:ee9388a539a6f9e3dd1d8107e4b454296bff5c8d43c9f448c639bdb9e3f85bce","target":"graph","created_at":"2026-05-18T01:17:53Z","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":"Motivated by machine learning problems over large data sets and distributed optimization over networks, we develop and analyze a new method called incremental Newton method for minimizing the sum of a large number of strongly convex functions. We show that our method is globally convergent for a variable stepsize rule. We further show that under a gradient growth condition, convergence rate is linear for both variable and constant stepsize rules. By means of an example, we show that without the gradient growth condition, incremental Newton method cannot achieve linear convergence. Our analysis","authors_text":"Asuman Ozdaglar, Mert G\\\"urb\\\"uzbalaban, Pablo Parrilo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-20T14:07:22Z","title":"A globally convergent incremental Newton method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5284","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:7d4f8fa206ff1430e0b731ee963e4d00f47257c64c8e634141726b4be93970c7","target":"record","created_at":"2026-05-18T01:17:53Z","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":"750c3523b258faac617662bab3cbaa5dc01c40cff825dd8cd1d74be2359824ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-20T14:07:22Z","title_canon_sha256":"21049f0d0fca8e696dfdfd82a8f70f56dcd4773b54e4c9012d72cd7cfb36e7f5"},"schema_version":"1.0","source":{"id":"1410.5284","kind":"arxiv","version":1}},"canonical_sha256":"a6ac7f8c2838232dfd297ed0141832a502513d3aab550aa4e914de556fd6eb6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6ac7f8c2838232dfd297ed0141832a502513d3aab550aa4e914de556fd6eb6d","first_computed_at":"2026-05-18T01:17:53.197944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:53.197944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9h9Q7LN9b1wReR7jmyL6Oo3AipX6U4qomuJ0EXpE0QSxwJI7hUPs8UbrQh9bc15A1OnVjBYfkwBlXc/GinPHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:53.198501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d4f8fa206ff1430e0b731ee963e4d00f47257c64c8e634141726b4be93970c7","sha256:ee9388a539a6f9e3dd1d8107e4b454296bff5c8d43c9f448c639bdb9e3f85bce"],"state_sha256":"fa7970427b756fb29fcb143619ec705f3c338e1cad51bb3386922212c1c6cd59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1ag6KJcIzjTfriUKkv8Qi4Rc21eoEIc8aO8pNQxFte6zob9kXMPoKF4IZENfzsX62ca6m9KVZP3HBeO3Q+RCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:42:05.775229Z","bundle_sha256":"00457771a5acb477bb0ff198492aed3f7581c7a8cabe4b6f13149ad1004d9fce"}}