{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QWG4R53VRJBPUYYEQS2GYF5EWL","short_pith_number":"pith:QWG4R53V","canonical_record":{"source":{"id":"1509.05196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T10:23:46Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"c757e88111470bc095d348ddff1d398302ff7f3c9fdb7ddd87c695c237fe66b5","abstract_canon_sha256":"0c342a9984d5fc4b4713be5dea6c7743359c06fed2136d77b4ebc2cb0ab01140"},"schema_version":"1.0"},"canonical_sha256":"858dc8f7758a42fa630484b46c17a4b2fde13a2f4069b81394e34e17e505f42e","source":{"kind":"arxiv","id":"1509.05196","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05196","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05196v2","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05196","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"QWG4R53VRJBP","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWG4R53VRJBPUYYE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWG4R53V","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QWG4R53VRJBPUYYEQS2GYF5EWL","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T10:23:46Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"c757e88111470bc095d348ddff1d398302ff7f3c9fdb7ddd87c695c237fe66b5","abstract_canon_sha256":"0c342a9984d5fc4b4713be5dea6c7743359c06fed2136d77b4ebc2cb0ab01140"},"schema_version":"1.0"},"canonical_sha256":"858dc8f7758a42fa630484b46c17a4b2fde13a2f4069b81394e34e17e505f42e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:09.597714Z","signature_b64":"7Ieqti7NYZeed7HWa6BerhRR19FLCft4HWuQlaZihI2ry3sAkk45ebR23xf3UnqrdGvAcux/KfGSMbzi4oRjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858dc8f7758a42fa630484b46c17a4b2fde13a2f4069b81394e34e17e505f42e","last_reissued_at":"2026-05-18T00:35:09.597365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:09.597365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05196","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-18T00:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIZBts2k3HONkrhUSYZd1jXwk4kPt5i4kFnDTeHeVy9+ozrvV/e4oaY5uyQUnfl72OHJL0k0HPmCFDTHpv4LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:07:45.359529Z"},"content_sha256":"d5c49db0de5251b913d730739af093e8bd7175d530cc68b39bd96be59777fe5a","schema_version":"1.0","event_id":"sha256:d5c49db0de5251b913d730739af093e8bd7175d530cc68b39bd96be59777fe5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QWG4R53VRJBPUYYEQS2GYF5EWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Class of Prediction-Correction Methods for Time-Varying Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Alec Koppel, Alejandro Ribeiro, Andrea Simonetto, Aryan Mokhtari, Geert Leus","submitted_at":"2015-09-17T10:23:46Z","abstract_excerpt":"This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05196","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-18T00:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATphBDRt+qwoNiOEZxfECgfQ6pZ09YKsAgmbjgx0vKB3U70A2csY5B/sIaVRZOsR+JATaQedP/27yiPFoIPpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:07:45.360161Z"},"content_sha256":"c6dfbe1d5d6dcfbcea9f271465f1597c985d242bb77801c2efe459c2cb6b8855","schema_version":"1.0","event_id":"sha256:c6dfbe1d5d6dcfbcea9f271465f1597c985d242bb77801c2efe459c2cb6b8855"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/bundle.json","state_url":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/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-23T06:07:45Z","links":{"resolver":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL","bundle":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/bundle.json","state":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QWG4R53VRJBPUYYEQS2GYF5EWL","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":"0c342a9984d5fc4b4713be5dea6c7743359c06fed2136d77b4ebc2cb0ab01140","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T10:23:46Z","title_canon_sha256":"c757e88111470bc095d348ddff1d398302ff7f3c9fdb7ddd87c695c237fe66b5"},"schema_version":"1.0","source":{"id":"1509.05196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05196","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05196v2","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05196","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"QWG4R53VRJBP","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWG4R53VRJBPUYYE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWG4R53V","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:c6dfbe1d5d6dcfbcea9f271465f1597c985d242bb77801c2efe459c2cb6b8855","target":"graph","created_at":"2026-05-18T00:35:09Z","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":"This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or ","authors_text":"Alec Koppel, Alejandro Ribeiro, Andrea Simonetto, Aryan Mokhtari, Geert Leus","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T10:23:46Z","title":"A Class of Prediction-Correction Methods for Time-Varying Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05196","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:d5c49db0de5251b913d730739af093e8bd7175d530cc68b39bd96be59777fe5a","target":"record","created_at":"2026-05-18T00:35:09Z","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":"0c342a9984d5fc4b4713be5dea6c7743359c06fed2136d77b4ebc2cb0ab01140","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T10:23:46Z","title_canon_sha256":"c757e88111470bc095d348ddff1d398302ff7f3c9fdb7ddd87c695c237fe66b5"},"schema_version":"1.0","source":{"id":"1509.05196","kind":"arxiv","version":2}},"canonical_sha256":"858dc8f7758a42fa630484b46c17a4b2fde13a2f4069b81394e34e17e505f42e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"858dc8f7758a42fa630484b46c17a4b2fde13a2f4069b81394e34e17e505f42e","first_computed_at":"2026-05-18T00:35:09.597365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:09.597365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Ieqti7NYZeed7HWa6BerhRR19FLCft4HWuQlaZihI2ry3sAkk45ebR23xf3UnqrdGvAcux/KfGSMbzi4oRjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:09.597714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5c49db0de5251b913d730739af093e8bd7175d530cc68b39bd96be59777fe5a","sha256:c6dfbe1d5d6dcfbcea9f271465f1597c985d242bb77801c2efe459c2cb6b8855"],"state_sha256":"660432434701d73701b2eb39a462e043bbe508986ac2f42cb6f9f2ce3f6029ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEirhlooppxoqTEB/Iq/EWNJGmJEPzQbtLJLve8ZiVIThOcsT08NCNRtSUyS7C1Ssh9Cd5v+B/Bi60I1bmPtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T06:07:45.363298Z","bundle_sha256":"24392dbe1464b6e560fbc14ceefb553b7a3356426035661796c7ef2bd117e489"}}