{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2CDJLYLYUBV2BDDKPQVL46VA4Z","short_pith_number":"pith:2CDJLYLY","canonical_record":{"source":{"id":"1306.3378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-14T12:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"f542649f55d960d74de7eae8c20bb76cb352eda3b058dd372140d7c0f5b5f4dc","abstract_canon_sha256":"733f0e82db1a75dbdcf4bbdd88f6f4707cf7dee9ddf918c9610d467567065cc1"},"schema_version":"1.0"},"canonical_sha256":"d08695e178a06ba08c6a7c2abe7aa0e665f7d1089327513150e84fc09653b67e","source":{"kind":"arxiv","id":"1306.3378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3378","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3378v1","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3378","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"2CDJLYLYUBV2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2CDJLYLYUBV2BDDK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2CDJLYLY","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2CDJLYLYUBV2BDDKPQVL46VA4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-14T12:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"f542649f55d960d74de7eae8c20bb76cb352eda3b058dd372140d7c0f5b5f4dc","abstract_canon_sha256":"733f0e82db1a75dbdcf4bbdd88f6f4707cf7dee9ddf918c9610d467567065cc1"},"schema_version":"1.0"},"canonical_sha256":"d08695e178a06ba08c6a7c2abe7aa0e665f7d1089327513150e84fc09653b67e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:57.763798Z","signature_b64":"s6BWx2JAqgKxy2B/j6JrR4sW3uHbQ0tDm47a7gt0BXsbLSy8hBFWKN3V8pvy/p2c2jbnVPFi0j6fSosfMjwrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d08695e178a06ba08c6a7c2abe7aa0e665f7d1089327513150e84fc09653b67e","last_reissued_at":"2026-05-18T03:20:57.763245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:57.763245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3378","source_version":1,"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-18T03:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZUpcXPaTZLClVXSK0/kqEfp/CeLUAl+gmq7tLq4SMc5e40Tm+eCTO4blDOdQewbVakAQpUAuuBowXlNdWBlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:56:03.378260Z"},"content_sha256":"8662590584c822896443185023b9e17563121316daa0d9a955ab08c3ffa6bc98","schema_version":"1.0","event_id":"sha256:8662590584c822896443185023b9e17563121316daa0d9a955ab08c3ffa6bc98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2CDJLYLYUBV2BDDKPQVL46VA4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Consensus Multi-Agent Control Under Stochastic Environment with Application to Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alexander Fradkov, Dimitrios J. Vergados, Natalia Amelina, Yuming Jiang","submitted_at":"2013-06-14T12:35:19Z","abstract_excerpt":"The paper is devoted to the approximate consensus problem for networks of nonlinear agents with switching topology, noisy and delayed measurements. In contrast to the existing stochastic approximation-based control algorithms (protocols), a local voting protocol with nonvanishing step size is proposed. Nonvanishing (e.g., constant) step size protocols give the opportunity to achieve better convergence rate (by choosing proper step sizes) in coping with time-varying loads and agent states. The price to pay is replacement of the mean square convergence with an approximate one. To analyze dynamic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3378","kind":"arxiv","version":1},"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-18T03:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IP1olIOLWqMREIqkOpPPD1Y69vQ3ux8n+GVqvRPHPVRkvZ00Bp97dxOVM5SlexDCns/RPbQjEEIERdf24Yp2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:56:03.378621Z"},"content_sha256":"6c966e9e268fb96fc484fe1b7f201107ae0b7cdac24c3d1a9d4bb9a5e6236c68","schema_version":"1.0","event_id":"sha256:6c966e9e268fb96fc484fe1b7f201107ae0b7cdac24c3d1a9d4bb9a5e6236c68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z/bundle.json","state_url":"https://pith.science/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z/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:56:03Z","links":{"resolver":"https://pith.science/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z","bundle":"https://pith.science/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z/bundle.json","state":"https://pith.science/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CDJLYLYUBV2BDDKPQVL46VA4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2CDJLYLYUBV2BDDKPQVL46VA4Z","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":"733f0e82db1a75dbdcf4bbdd88f6f4707cf7dee9ddf918c9610d467567065cc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-14T12:35:19Z","title_canon_sha256":"f542649f55d960d74de7eae8c20bb76cb352eda3b058dd372140d7c0f5b5f4dc"},"schema_version":"1.0","source":{"id":"1306.3378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3378","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3378v1","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3378","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"2CDJLYLYUBV2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2CDJLYLYUBV2BDDK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2CDJLYLY","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:6c966e9e268fb96fc484fe1b7f201107ae0b7cdac24c3d1a9d4bb9a5e6236c68","target":"graph","created_at":"2026-05-18T03:20:57Z","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":"The paper is devoted to the approximate consensus problem for networks of nonlinear agents with switching topology, noisy and delayed measurements. In contrast to the existing stochastic approximation-based control algorithms (protocols), a local voting protocol with nonvanishing step size is proposed. Nonvanishing (e.g., constant) step size protocols give the opportunity to achieve better convergence rate (by choosing proper step sizes) in coping with time-varying loads and agent states. The price to pay is replacement of the mean square convergence with an approximate one. To analyze dynamic","authors_text":"Alexander Fradkov, Dimitrios J. Vergados, Natalia Amelina, Yuming Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-14T12:35:19Z","title":"Approximate Consensus Multi-Agent Control Under Stochastic Environment with Application to Load Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3378","kind":"arxiv","version":1},"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:8662590584c822896443185023b9e17563121316daa0d9a955ab08c3ffa6bc98","target":"record","created_at":"2026-05-18T03:20:57Z","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":"733f0e82db1a75dbdcf4bbdd88f6f4707cf7dee9ddf918c9610d467567065cc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-14T12:35:19Z","title_canon_sha256":"f542649f55d960d74de7eae8c20bb76cb352eda3b058dd372140d7c0f5b5f4dc"},"schema_version":"1.0","source":{"id":"1306.3378","kind":"arxiv","version":1}},"canonical_sha256":"d08695e178a06ba08c6a7c2abe7aa0e665f7d1089327513150e84fc09653b67e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d08695e178a06ba08c6a7c2abe7aa0e665f7d1089327513150e84fc09653b67e","first_computed_at":"2026-05-18T03:20:57.763245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:57.763245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6BWx2JAqgKxy2B/j6JrR4sW3uHbQ0tDm47a7gt0BXsbLSy8hBFWKN3V8pvy/p2c2jbnVPFi0j6fSosfMjwrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:57.763798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8662590584c822896443185023b9e17563121316daa0d9a955ab08c3ffa6bc98","sha256:6c966e9e268fb96fc484fe1b7f201107ae0b7cdac24c3d1a9d4bb9a5e6236c68"],"state_sha256":"dda7a89b803700b858b22b6cd2e6c550474f0ca542431b1e83a39f1105f3d3a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUqSmbe9oM8cKEwXSPuOg/QeS8MBLdmyJIRhXhwSOD0onXIsPxVz0qKdUjspgPzttKV12UutoeSsTOBrJ03uAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:56:03.380508Z","bundle_sha256":"1a45f23f209b1ef5a79dee7869615e896fbde94712576468f8b07dd460014962"}}