{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IAYPJFVUGHCG2QFLSUSOJJRESE","short_pith_number":"pith:IAYPJFVU","canonical_record":{"source":{"id":"1509.09257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T17:12:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4534db0994a3674e2092cece6c62020957a8f182bbdd8c63fa3c790eb8021e7d","abstract_canon_sha256":"75f71b45e519365267f5881357dcc115439c4a94ea785942f2e861ffab33591f"},"schema_version":"1.0"},"canonical_sha256":"4030f496b431c46d40ab9524e4a62491283eab1921789d4ad63ef914270aca63","source":{"kind":"arxiv","id":"1509.09257","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09257","created_at":"2026-05-18T01:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09257v2","created_at":"2026-05-18T01:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09257","created_at":"2026-05-18T01:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"IAYPJFVUGHCG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IAYPJFVUGHCG2QFL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IAYPJFVU","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IAYPJFVUGHCG2QFLSUSOJJRESE","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T17:12:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4534db0994a3674e2092cece6c62020957a8f182bbdd8c63fa3c790eb8021e7d","abstract_canon_sha256":"75f71b45e519365267f5881357dcc115439c4a94ea785942f2e861ffab33591f"},"schema_version":"1.0"},"canonical_sha256":"4030f496b431c46d40ab9524e4a62491283eab1921789d4ad63ef914270aca63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:53.485688Z","signature_b64":"FUxb8bsdPH/7Q7G1b4V1w2j2WB58o85ol4QUVM2i2HKYlA03AAnizDaLjuIzEncrwom2MVamnItdj1mVZUDqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4030f496b431c46d40ab9524e4a62491283eab1921789d4ad63ef914270aca63","last_reissued_at":"2026-05-18T01:27:53.484991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:53.484991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09257","source_version":2,"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:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4gO7MllUFuUSz++1bwHX7C+ogJELS1nByq4KHdEwxZ85rjAu6nnCFAwdrtl/WLOCx/iMFHDrya4b33VUMuzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:35:09.813734Z"},"content_sha256":"39e9173f8c1d137edb9ab6b4358ab8dfd9b3848411ac8c6ff70a1e946949a889","schema_version":"1.0","event_id":"sha256:39e9173f8c1d137edb9ab6b4358ab8dfd9b3848411ac8c6ff70a1e946949a889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IAYPJFVUGHCG2QFLSUSOJJRESE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Aggregated Proximal and Augmented Lagrangian Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Dimitri P. Bertsekas","submitted_at":"2015-09-30T17:12:09Z","abstract_excerpt":"We consider minimization of the sum of a large number of convex functions, and we propose an incremental aggregated version of the proximal algorithm, which bears similarity to the incremental aggregated gradient and subgradient methods that have received a lot of recent attention. Under cost function differentiability and strong convexity assumptions, we show linear convergence for a sufficiently small constant stepsize. This result also applies to distributed asynchronous variants of the method, involving bounded interprocessor communication delays.\n  We then consider dual versions of increm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09257","kind":"arxiv","version":2},"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:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqptNcnVOkiRKNCEQb8ZexIAIV5OouRr0bWqFDKO1G7LWly4QkxoTh29nIVinNm3r4ep6uDnh6aixocS3XcGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:35:09.814069Z"},"content_sha256":"c66c424ed8e30cbe15a8ba9ae92a9246bde5e5e0af1afd0ae40c83f69e9cf7db","schema_version":"1.0","event_id":"sha256:c66c424ed8e30cbe15a8ba9ae92a9246bde5e5e0af1afd0ae40c83f69e9cf7db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAYPJFVUGHCG2QFLSUSOJJRESE/bundle.json","state_url":"https://pith.science/pith/IAYPJFVUGHCG2QFLSUSOJJRESE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAYPJFVUGHCG2QFLSUSOJJRESE/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-30T04:35:09Z","links":{"resolver":"https://pith.science/pith/IAYPJFVUGHCG2QFLSUSOJJRESE","bundle":"https://pith.science/pith/IAYPJFVUGHCG2QFLSUSOJJRESE/bundle.json","state":"https://pith.science/pith/IAYPJFVUGHCG2QFLSUSOJJRESE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAYPJFVUGHCG2QFLSUSOJJRESE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IAYPJFVUGHCG2QFLSUSOJJRESE","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":"75f71b45e519365267f5881357dcc115439c4a94ea785942f2e861ffab33591f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T17:12:09Z","title_canon_sha256":"4534db0994a3674e2092cece6c62020957a8f182bbdd8c63fa3c790eb8021e7d"},"schema_version":"1.0","source":{"id":"1509.09257","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09257","created_at":"2026-05-18T01:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09257v2","created_at":"2026-05-18T01:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09257","created_at":"2026-05-18T01:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"IAYPJFVUGHCG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IAYPJFVUGHCG2QFL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IAYPJFVU","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:c66c424ed8e30cbe15a8ba9ae92a9246bde5e5e0af1afd0ae40c83f69e9cf7db","target":"graph","created_at":"2026-05-18T01:27: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":"We consider minimization of the sum of a large number of convex functions, and we propose an incremental aggregated version of the proximal algorithm, which bears similarity to the incremental aggregated gradient and subgradient methods that have received a lot of recent attention. Under cost function differentiability and strong convexity assumptions, we show linear convergence for a sufficiently small constant stepsize. This result also applies to distributed asynchronous variants of the method, involving bounded interprocessor communication delays.\n  We then consider dual versions of increm","authors_text":"Dimitri P. Bertsekas","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T17:12:09Z","title":"Incremental Aggregated Proximal and Augmented Lagrangian Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09257","kind":"arxiv","version":2},"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:39e9173f8c1d137edb9ab6b4358ab8dfd9b3848411ac8c6ff70a1e946949a889","target":"record","created_at":"2026-05-18T01:27: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":"75f71b45e519365267f5881357dcc115439c4a94ea785942f2e861ffab33591f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T17:12:09Z","title_canon_sha256":"4534db0994a3674e2092cece6c62020957a8f182bbdd8c63fa3c790eb8021e7d"},"schema_version":"1.0","source":{"id":"1509.09257","kind":"arxiv","version":2}},"canonical_sha256":"4030f496b431c46d40ab9524e4a62491283eab1921789d4ad63ef914270aca63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4030f496b431c46d40ab9524e4a62491283eab1921789d4ad63ef914270aca63","first_computed_at":"2026-05-18T01:27:53.484991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:53.484991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FUxb8bsdPH/7Q7G1b4V1w2j2WB58o85ol4QUVM2i2HKYlA03AAnizDaLjuIzEncrwom2MVamnItdj1mVZUDqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:53.485688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09257","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39e9173f8c1d137edb9ab6b4358ab8dfd9b3848411ac8c6ff70a1e946949a889","sha256:c66c424ed8e30cbe15a8ba9ae92a9246bde5e5e0af1afd0ae40c83f69e9cf7db"],"state_sha256":"9bfb242c74afc15664c15a41012c67aa285e5cc5e44cb0354021d760a4496c3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKIO/JhzfjxIsV2Kcqw6ZY2QHXXcNRMHpNXYWz5m+rApY9kXLtSvG3OmofyTlxut6EVgZsVfav7oHiXqL2TGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:35:09.815904Z","bundle_sha256":"13c0565a4b4af1f041d1fcf7a2b1a1432dc643ecc52e2f1c4e243aadb68be9bb"}}