{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZJQYWS6ANB2TRSDMIEVNIIC4TZ","short_pith_number":"pith:ZJQYWS6A","canonical_record":{"source":{"id":"1408.5294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T14:04:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"674b24c0ad37a457d420353c1ed9f5e312b1ab08da79d682196f2abe4d08b5f0","abstract_canon_sha256":"cc629acb0703c1ecefd9f647577eb449924ace97e13353f95b20b18d719c3d11"},"schema_version":"1.0"},"canonical_sha256":"ca618b4bc0687538c86c412ad4205c9e4df55b00f19534de2d91d3977146acbb","source":{"kind":"arxiv","id":"1408.5294","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5294","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5294v2","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5294","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZJQYWS6ANB2T","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJQYWS6ANB2TRSDM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJQYWS6A","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZJQYWS6ANB2TRSDMIEVNIIC4TZ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T14:04:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"674b24c0ad37a457d420353c1ed9f5e312b1ab08da79d682196f2abe4d08b5f0","abstract_canon_sha256":"cc629acb0703c1ecefd9f647577eb449924ace97e13353f95b20b18d719c3d11"},"schema_version":"1.0"},"canonical_sha256":"ca618b4bc0687538c86c412ad4205c9e4df55b00f19534de2d91d3977146acbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:18.367284Z","signature_b64":"dTGU5shUixUP/Bg+EjEWk3pG+AfU0gWtIeQ5HcDurN7RyAXU7AnhujRE3W/mlAsZJ6OHOacs0h2QO8fYUHg2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca618b4bc0687538c86c412ad4205c9e4df55b00f19534de2d91d3977146acbb","last_reissued_at":"2026-05-18T02:41:18.366827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:18.366827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5294","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-18T02:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gf/jvghnOJyuyoyKPFsswg29cVBnop4KSBkHQsRBXIMmO5pRtPLjUjazaQqBbah1bwv9TFYFvlZQa2y9mr2HBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:05:06.737070Z"},"content_sha256":"a13c355faf7f74b67a5c79a2916793222977a43555fac3d2b1bb27cabde47ad2","schema_version":"1.0","event_id":"sha256:a13c355faf7f74b67a5c79a2916793222977a43555fac3d2b1bb27cabde47ad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZJQYWS6ANB2TRSDMIEVNIIC4TZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Time-Varying Stochastic Optimization and Utility-Based Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Andrea Simonetto, Geert Leus, Leon Kester","submitted_at":"2014-08-22T14:04:37Z","abstract_excerpt":"We devise a distributed asynchronous stochastic epsilon-gradient-based algorithm to enable a network of computing and communicating nodes to solve a constrained discrete-time time-varying stochastic convex optimization problem. Each node updates its own decision variable only once every discrete time step. Under some assumptions (among which, strong convexity, Lipschitz continuity of the gradient, persistent excitation), we prove the algorithm's asymptotic convergence in expectation to an error bound whose size is related to the constant stepsize choice alpha, the variability in time of the op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5294","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-18T02:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2M5QVgrXQnVw6QepUi6AeoU0pTZ0F6nxNSELMaNW9gcctkGAYj9GIC4JbTh82WXqQsOqN0j6JhvvKknax7N0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:05:06.737688Z"},"content_sha256":"a56383a02772b7c68cd4f217e0b2c2c9e032e02ea414e4780ccf6c919f80dce9","schema_version":"1.0","event_id":"sha256:a56383a02772b7c68cd4f217e0b2c2c9e032e02ea414e4780ccf6c919f80dce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ/bundle.json","state_url":"https://pith.science/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ/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-23T05:05:06Z","links":{"resolver":"https://pith.science/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ","bundle":"https://pith.science/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ/bundle.json","state":"https://pith.science/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJQYWS6ANB2TRSDMIEVNIIC4TZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZJQYWS6ANB2TRSDMIEVNIIC4TZ","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":"cc629acb0703c1ecefd9f647577eb449924ace97e13353f95b20b18d719c3d11","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T14:04:37Z","title_canon_sha256":"674b24c0ad37a457d420353c1ed9f5e312b1ab08da79d682196f2abe4d08b5f0"},"schema_version":"1.0","source":{"id":"1408.5294","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5294","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5294v2","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5294","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZJQYWS6ANB2T","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJQYWS6ANB2TRSDM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJQYWS6A","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:a56383a02772b7c68cd4f217e0b2c2c9e032e02ea414e4780ccf6c919f80dce9","target":"graph","created_at":"2026-05-18T02:41:18Z","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 devise a distributed asynchronous stochastic epsilon-gradient-based algorithm to enable a network of computing and communicating nodes to solve a constrained discrete-time time-varying stochastic convex optimization problem. Each node updates its own decision variable only once every discrete time step. Under some assumptions (among which, strong convexity, Lipschitz continuity of the gradient, persistent excitation), we prove the algorithm's asymptotic convergence in expectation to an error bound whose size is related to the constant stepsize choice alpha, the variability in time of the op","authors_text":"Andrea Simonetto, Geert Leus, Leon Kester","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T14:04:37Z","title":"Distributed Time-Varying Stochastic Optimization and Utility-Based Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5294","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:a13c355faf7f74b67a5c79a2916793222977a43555fac3d2b1bb27cabde47ad2","target":"record","created_at":"2026-05-18T02:41:18Z","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":"cc629acb0703c1ecefd9f647577eb449924ace97e13353f95b20b18d719c3d11","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T14:04:37Z","title_canon_sha256":"674b24c0ad37a457d420353c1ed9f5e312b1ab08da79d682196f2abe4d08b5f0"},"schema_version":"1.0","source":{"id":"1408.5294","kind":"arxiv","version":2}},"canonical_sha256":"ca618b4bc0687538c86c412ad4205c9e4df55b00f19534de2d91d3977146acbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca618b4bc0687538c86c412ad4205c9e4df55b00f19534de2d91d3977146acbb","first_computed_at":"2026-05-18T02:41:18.366827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:18.366827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dTGU5shUixUP/Bg+EjEWk3pG+AfU0gWtIeQ5HcDurN7RyAXU7AnhujRE3W/mlAsZJ6OHOacs0h2QO8fYUHg2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:18.367284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5294","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a13c355faf7f74b67a5c79a2916793222977a43555fac3d2b1bb27cabde47ad2","sha256:a56383a02772b7c68cd4f217e0b2c2c9e032e02ea414e4780ccf6c919f80dce9"],"state_sha256":"24e6c360babee8c32c612b05dbdec99c91c6089305a09d362df24a0885b832c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ls0wyxmSH02jVXhGLBT5aF+bsw0ebPhHxXUQXugb0+JzGDSwkHmgVsjUJA8CsmUQz66NNvylVSOOo2CQCAI1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T05:05:06.740672Z","bundle_sha256":"a80b496f66f14f9bd92b573e3ead58e2a1a2b170f13132487cae01248fb8480b"}}