{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:POZOMJVH3DII3522PYP6QRJUIC","short_pith_number":"pith:POZOMJVH","canonical_record":{"source":{"id":"1611.08022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T22:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"49619f90f32337d910d9390d307b1ab2d17cd765b1b468cf77690d5b0e369170","abstract_canon_sha256":"a015befa950e9dd8f93cf8ba2cb6cc94ee78f635436ca786d1a50793783c0155"},"schema_version":"1.0"},"canonical_sha256":"7bb2e626a7d8d08df75a7e1fe8453440889876a4e534c250ac8aa76233df39a7","source":{"kind":"arxiv","id":"1611.08022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08022","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08022v1","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08022","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"POZOMJVH3DII","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"POZOMJVH3DII3522","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"POZOMJVH","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:POZOMJVH3DII3522PYP6QRJUIC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T22:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"49619f90f32337d910d9390d307b1ab2d17cd765b1b468cf77690d5b0e369170","abstract_canon_sha256":"a015befa950e9dd8f93cf8ba2cb6cc94ee78f635436ca786d1a50793783c0155"},"schema_version":"1.0"},"canonical_sha256":"7bb2e626a7d8d08df75a7e1fe8453440889876a4e534c250ac8aa76233df39a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:44.619891Z","signature_b64":"FVSPfs5MhefNheGp8Uj8rP4lJVBviI4dU/vsNO/HRv3oknUZ88kkzTZQINFLOqAM/JniXwFQaPC/Ft4tVtCkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bb2e626a7d8d08df75a7e1fe8453440889876a4e534c250ac8aa76233df39a7","last_reissued_at":"2026-05-18T00:56:44.619146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:44.619146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08022","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:56:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4RJkMs3qtWIrljdRV+5R1vm8O8Fuure3/4rWqH4v3CShc8YEvJz61YHAiil+fbIvdip3s8mlgNlZfKY8szWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:38:05.808639Z"},"content_sha256":"39b4ca54df74c238cd2b0a1b3f3f3c24bd9ca5fe35f6b93998d55fe1f5266758","schema_version":"1.0","event_id":"sha256:39b4ca54df74c238cd2b0a1b3f3f3c24bd9ca5fe35f6b93998d55fe1f5266758"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:POZOMJVH3DII3522PYP6QRJUIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stronger Convergence Result on the Proximal Incremental Aggregated Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asu Ozdaglar, Mert Gurbuzbalaban, Nuri Denizcan Vanli","submitted_at":"2016-11-23T22:27:29Z","abstract_excerpt":"We study the convergence rate of the proximal incremental aggregated gradient (PIAG) method for minimizing the sum of a large number of smooth component functions (where the sum is strongly convex) and a non-smooth convex function. At each iteration, the PIAG method moves along an aggregated gradient formed by incrementally updating gradients of component functions at least once in the last $K$ iterations and takes a proximal step with respect to the non-smooth function. We show that the PIAG algorithm attains an iteration complexity that grows linear in the condition number of the problem and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08022","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:56:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvOurYXFrHvS84QMl5S/tydfDpJ9Hbh1pDRJPGxqBEXthYdhqaP5OUCGtT4vOQ5OUQUfx7Hp1PhQU82zVARVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:38:05.809278Z"},"content_sha256":"c21395ea0899dd90699bbbeeb1d0b1c8b3c918c3cfee2fc30d679329e9f60f75","schema_version":"1.0","event_id":"sha256:c21395ea0899dd90699bbbeeb1d0b1c8b3c918c3cfee2fc30d679329e9f60f75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POZOMJVH3DII3522PYP6QRJUIC/bundle.json","state_url":"https://pith.science/pith/POZOMJVH3DII3522PYP6QRJUIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POZOMJVH3DII3522PYP6QRJUIC/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-22T03:38:05Z","links":{"resolver":"https://pith.science/pith/POZOMJVH3DII3522PYP6QRJUIC","bundle":"https://pith.science/pith/POZOMJVH3DII3522PYP6QRJUIC/bundle.json","state":"https://pith.science/pith/POZOMJVH3DII3522PYP6QRJUIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POZOMJVH3DII3522PYP6QRJUIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:POZOMJVH3DII3522PYP6QRJUIC","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":"a015befa950e9dd8f93cf8ba2cb6cc94ee78f635436ca786d1a50793783c0155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T22:27:29Z","title_canon_sha256":"49619f90f32337d910d9390d307b1ab2d17cd765b1b468cf77690d5b0e369170"},"schema_version":"1.0","source":{"id":"1611.08022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08022","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08022v1","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08022","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"POZOMJVH3DII","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"POZOMJVH3DII3522","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"POZOMJVH","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:c21395ea0899dd90699bbbeeb1d0b1c8b3c918c3cfee2fc30d679329e9f60f75","target":"graph","created_at":"2026-05-18T00:56:44Z","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 study the convergence rate of the proximal incremental aggregated gradient (PIAG) method for minimizing the sum of a large number of smooth component functions (where the sum is strongly convex) and a non-smooth convex function. At each iteration, the PIAG method moves along an aggregated gradient formed by incrementally updating gradients of component functions at least once in the last $K$ iterations and takes a proximal step with respect to the non-smooth function. We show that the PIAG algorithm attains an iteration complexity that grows linear in the condition number of the problem and","authors_text":"Asu Ozdaglar, Mert Gurbuzbalaban, Nuri Denizcan Vanli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T22:27:29Z","title":"A Stronger Convergence Result on the Proximal Incremental Aggregated Gradient Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08022","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:39b4ca54df74c238cd2b0a1b3f3f3c24bd9ca5fe35f6b93998d55fe1f5266758","target":"record","created_at":"2026-05-18T00:56:44Z","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":"a015befa950e9dd8f93cf8ba2cb6cc94ee78f635436ca786d1a50793783c0155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T22:27:29Z","title_canon_sha256":"49619f90f32337d910d9390d307b1ab2d17cd765b1b468cf77690d5b0e369170"},"schema_version":"1.0","source":{"id":"1611.08022","kind":"arxiv","version":1}},"canonical_sha256":"7bb2e626a7d8d08df75a7e1fe8453440889876a4e534c250ac8aa76233df39a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bb2e626a7d8d08df75a7e1fe8453440889876a4e534c250ac8aa76233df39a7","first_computed_at":"2026-05-18T00:56:44.619146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:44.619146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FVSPfs5MhefNheGp8Uj8rP4lJVBviI4dU/vsNO/HRv3oknUZ88kkzTZQINFLOqAM/JniXwFQaPC/Ft4tVtCkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:44.619891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39b4ca54df74c238cd2b0a1b3f3f3c24bd9ca5fe35f6b93998d55fe1f5266758","sha256:c21395ea0899dd90699bbbeeb1d0b1c8b3c918c3cfee2fc30d679329e9f60f75"],"state_sha256":"8a2c2ecac645267a7d46d8ab69b4040f630a7e80b2df728593995279055555af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHTYhqrBkX0ZX3OQJrhJJahmpYJ0RmhJ8aboVXQMFWdDooo+9KXDu6T3qkq+tQWIXOZnsu4QktWdI+FJoa6jCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T03:38:05.812618Z","bundle_sha256":"55c057aa65b704c4e9e0e44a46d7b8866f51705e8b80baacd985d32f8a765c0d"}}