{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QWG4R53VRJBPUYYEQS2GYF5EWL","short_pith_number":"pith:QWG4R53V","schema_version":"1.0","canonical_sha256":"858dc8f7758a42fa630484b46c17a4b2fde13a2f4069b81394e34e17e505f42e","source":{"kind":"arxiv","id":"1509.05196","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05196","created_at":"2026-05-18T00:35:09.597420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05196v2","created_at":"2026-05-18T00:35:09.597420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05196","created_at":"2026-05-18T00:35:09.597420+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWG4R53VRJBP","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWG4R53VRJBPUYYE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWG4R53V","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL","json":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL.json","graph_json":"https://pith.science/api/pith-number/QWG4R53VRJBPUYYEQS2GYF5EWL/graph.json","events_json":"https://pith.science/api/pith-number/QWG4R53VRJBPUYYEQS2GYF5EWL/events.json","paper":"https://pith.science/paper/QWG4R53V"},"agent_actions":{"view_html":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL","download_json":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL.json","view_paper":"https://pith.science/paper/QWG4R53V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05196&json=true","fetch_graph":"https://pith.science/api/pith-number/QWG4R53VRJBPUYYEQS2GYF5EWL/graph.json","fetch_events":"https://pith.science/api/pith-number/QWG4R53VRJBPUYYEQS2GYF5EWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/action/storage_attestation","attest_author":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/action/author_attestation","sign_citation":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/action/citation_signature","submit_replication":"https://pith.science/pith/QWG4R53VRJBPUYYEQS2GYF5EWL/action/replication_record"}},"created_at":"2026-05-18T00:35:09.597420+00:00","updated_at":"2026-05-18T00:35:09.597420+00:00"}