{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X6U3X7YGCBD3MGM672DDIY7BSF","short_pith_number":"pith:X6U3X7YG","canonical_record":{"source":{"id":"1602.01716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T15:37:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0e22b90bed9980f32c751f3988f84faff73001495b9ef375dfe251835fc1a28b","abstract_canon_sha256":"3b2d41eca756d78a8712c460324d8732025c6521d915899658f137831dc04ea6"},"schema_version":"1.0"},"canonical_sha256":"bfa9bbff061047b6199efe863463e1917432c989246593d6b46c9a2c17d4a9c8","source":{"kind":"arxiv","id":"1602.01716","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01716","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01716v2","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01716","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"X6U3X7YGCBD3","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X6U3X7YGCBD3MGM6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X6U3X7YG","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X6U3X7YGCBD3MGM672DDIY7BSF","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T15:37:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0e22b90bed9980f32c751f3988f84faff73001495b9ef375dfe251835fc1a28b","abstract_canon_sha256":"3b2d41eca756d78a8712c460324d8732025c6521d915899658f137831dc04ea6"},"schema_version":"1.0"},"canonical_sha256":"bfa9bbff061047b6199efe863463e1917432c989246593d6b46c9a2c17d4a9c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:09.736374Z","signature_b64":"Ia/XlE3eQPCby5z20aijzIZ7LqBOmxd1Vf8HbxKBkOwiB0z7OVwN1/NKD4hVAP/sL1arim4YCHWCxuluMwLXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa9bbff061047b6199efe863463e1917432c989246593d6b46c9a2c17d4a9c8","last_reissued_at":"2026-05-18T01:00:09.735726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:09.735726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01716","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:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8CI8TogK8ManMb69t7atcEoxjjPFzG26as0NETK7h2C4202F/tuxQXFnmRyZeQFnT39tN9U6gcrSEXB+yeVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:44:23.239995Z"},"content_sha256":"cd10c80b4b4e9a8bb43c9f46466f1bfdd739a60b00e6a04c8f4fe0b9e40d1f7d","schema_version":"1.0","event_id":"sha256:cd10c80b4b4e9a8bb43c9f46466f1bfdd739a60b00e6a04c8f4fe0b9e40d1f7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X6U3X7YGCBD3MGM672DDIY7BSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Prediction-Correction Methods for Networked Time-Varying Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Alec Koppel, Alejandro Ribeiro, Andrea Simonetto, Aryan Mokhtari, Geert Leus","submitted_at":"2016-02-04T15:37:32Z","abstract_excerpt":"We develop algorithms that find and track the optimal solution trajectory of time-varying convex optimization problems which consist of local and network-related objectives. The algorithms are derived from the prediction-correction methodology, which corresponds to a strategy where the time-varying problem is sampled at discrete time instances and then a sequence is generated via alternatively executing predictions on how the optimizers at the next time sample are changing and corrections on how they actually have changed. Prediction is based on how the optimality conditions evolve in time, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01716","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:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNEYda5sS7rC3BeFVO51f7H8nnmcgdAnWciKuFACMuqB0ADIHCRNVeqUF7voXviuxrM2k9+Eu0WR/yLZYy7GCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:44:23.240366Z"},"content_sha256":"196886e4454de287cc9fdc9c470e3c4d26e6ec8a50f7e1a52f9e167fc12c02a3","schema_version":"1.0","event_id":"sha256:196886e4454de287cc9fdc9c470e3c4d26e6ec8a50f7e1a52f9e167fc12c02a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6U3X7YGCBD3MGM672DDIY7BSF/bundle.json","state_url":"https://pith.science/pith/X6U3X7YGCBD3MGM672DDIY7BSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6U3X7YGCBD3MGM672DDIY7BSF/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-01T23:44:23Z","links":{"resolver":"https://pith.science/pith/X6U3X7YGCBD3MGM672DDIY7BSF","bundle":"https://pith.science/pith/X6U3X7YGCBD3MGM672DDIY7BSF/bundle.json","state":"https://pith.science/pith/X6U3X7YGCBD3MGM672DDIY7BSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6U3X7YGCBD3MGM672DDIY7BSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X6U3X7YGCBD3MGM672DDIY7BSF","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":"3b2d41eca756d78a8712c460324d8732025c6521d915899658f137831dc04ea6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T15:37:32Z","title_canon_sha256":"0e22b90bed9980f32c751f3988f84faff73001495b9ef375dfe251835fc1a28b"},"schema_version":"1.0","source":{"id":"1602.01716","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01716","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01716v2","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01716","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"X6U3X7YGCBD3","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X6U3X7YGCBD3MGM6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X6U3X7YG","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:196886e4454de287cc9fdc9c470e3c4d26e6ec8a50f7e1a52f9e167fc12c02a3","target":"graph","created_at":"2026-05-18T01:00: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":"We develop algorithms that find and track the optimal solution trajectory of time-varying convex optimization problems which consist of local and network-related objectives. The algorithms are derived from the prediction-correction methodology, which corresponds to a strategy where the time-varying problem is sampled at discrete time instances and then a sequence is generated via alternatively executing predictions on how the optimizers at the next time sample are changing and corrections on how they actually have changed. Prediction is based on how the optimality conditions evolve in time, wh","authors_text":"Alec Koppel, Alejandro Ribeiro, Andrea Simonetto, Aryan Mokhtari, Geert Leus","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T15:37:32Z","title":"Decentralized Prediction-Correction Methods for Networked Time-Varying Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01716","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:cd10c80b4b4e9a8bb43c9f46466f1bfdd739a60b00e6a04c8f4fe0b9e40d1f7d","target":"record","created_at":"2026-05-18T01:00: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":"3b2d41eca756d78a8712c460324d8732025c6521d915899658f137831dc04ea6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T15:37:32Z","title_canon_sha256":"0e22b90bed9980f32c751f3988f84faff73001495b9ef375dfe251835fc1a28b"},"schema_version":"1.0","source":{"id":"1602.01716","kind":"arxiv","version":2}},"canonical_sha256":"bfa9bbff061047b6199efe863463e1917432c989246593d6b46c9a2c17d4a9c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfa9bbff061047b6199efe863463e1917432c989246593d6b46c9a2c17d4a9c8","first_computed_at":"2026-05-18T01:00:09.735726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:09.735726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ia/XlE3eQPCby5z20aijzIZ7LqBOmxd1Vf8HbxKBkOwiB0z7OVwN1/NKD4hVAP/sL1arim4YCHWCxuluMwLXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:09.736374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01716","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd10c80b4b4e9a8bb43c9f46466f1bfdd739a60b00e6a04c8f4fe0b9e40d1f7d","sha256:196886e4454de287cc9fdc9c470e3c4d26e6ec8a50f7e1a52f9e167fc12c02a3"],"state_sha256":"9394ab59efbdd109798d3a5b4574c27adf6c9a8317f5f83e722aea78dee54b08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"374RxXcbrzVM3CW/WOj5c7ga69k9FFbJAsGsQRMnTGzjs7bSZaTQu/PVLCC/JuFyFVSQRc5QzFSHF90uWUKsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:44:23.242480Z","bundle_sha256":"613fb2be9b8d6bb27a3582c2c62487af30961d058dd6920efe1db8ed67ec6908"}}