{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QIHHYERIVTUK5EKOCSMF6YULW2","short_pith_number":"pith:QIHHYERI","canonical_record":{"source":{"id":"1410.6956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-25T20:16:51Z","cross_cats_sorted":["cs.NA","cs.SY"],"title_canon_sha256":"cb2c364b8202909d24e0abeccfc910f86c3be6ccb6976d61fc3db0ade6f8a408","abstract_canon_sha256":"9adcb3bbbd14b62fad08e50590e10df0dcc2cd32415b25471998cb1b0398b0af"},"schema_version":"1.0"},"canonical_sha256":"820e7c1228ace8ae914e14985f628bb69d169d8475fac38d7bb684989b3b4a33","source":{"kind":"arxiv","id":"1410.6956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6956","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6956v1","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6956","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"QIHHYERIVTUK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QIHHYERIVTUK5EKO","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QIHHYERI","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QIHHYERIVTUK5EKOCSMF6YULW2","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-25T20:16:51Z","cross_cats_sorted":["cs.NA","cs.SY"],"title_canon_sha256":"cb2c364b8202909d24e0abeccfc910f86c3be6ccb6976d61fc3db0ade6f8a408","abstract_canon_sha256":"9adcb3bbbd14b62fad08e50590e10df0dcc2cd32415b25471998cb1b0398b0af"},"schema_version":"1.0"},"canonical_sha256":"820e7c1228ace8ae914e14985f628bb69d169d8475fac38d7bb684989b3b4a33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.242334Z","signature_b64":"j6GgmeHGwYidAPfDB5fJtAHgZio2UcT73xYCqFKV5JKN2cyUJ3M5qxiktu9P36nxzFW9qt7RyweKIn+DJbxLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820e7c1228ace8ae914e14985f628bb69d169d8475fac38d7bb684989b3b4a33","last_reissued_at":"2026-05-18T02:39:18.241982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.241982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6956","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-18T02:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz/1fERWBNw6pDyfP4dnpkJgTvLCTCoKSKCy91NDcPBZpUQ561aBw8XoKXHUe3Niek40ckVFAGWtDUUprOxRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:30:35.640897Z"},"content_sha256":"0624d1eb00d01e2e6f64eaca7941d6df3d30505816a3e4103cd566330829abea","schema_version":"1.0","event_id":"sha256:0624d1eb00d01e2e6f64eaca7941d6df3d30505816a3e4103cd566330829abea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QIHHYERIVTUK5EKOCSMF6YULW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multi-Agent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SY"],"primary_cat":"cs.MA","authors_text":"Gemma Morral, Gersende Fort, Pascal Bianchi","submitted_at":"2014-10-25T20:16:51Z","abstract_excerpt":"This paper investigates the problem of distributed stochastic approximation in multi-agent systems. The algorithm under study consists of two steps: a local stochastic approximation step and a diffusion step which drives the network to a consensus. The diffusion step uses row-stochastic matrices to weight the network exchanges. As opposed to previous works, exchange matrices are not supposed to be doubly stochastic, and may also depend on the past estimate.\n  We prove that non-doubly stochastic matrices generally influence the limit points of the algorithm. Nevertheless, the limit points are n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6956","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-18T02:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHhDfc1ibL7bdEXmr+ybeWFkRtssPP/9HKw1zKPyF6dB08y5qavRVr/BMidnynyAt3VuLdGSj8jUSCKcQADcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:30:35.641242Z"},"content_sha256":"6d0c2c1186e33e4a49d9c98c4f97f060f567776837cefa8efccd063267d05c2b","schema_version":"1.0","event_id":"sha256:6d0c2c1186e33e4a49d9c98c4f97f060f567776837cefa8efccd063267d05c2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIHHYERIVTUK5EKOCSMF6YULW2/bundle.json","state_url":"https://pith.science/pith/QIHHYERIVTUK5EKOCSMF6YULW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIHHYERIVTUK5EKOCSMF6YULW2/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-28T03:30:35Z","links":{"resolver":"https://pith.science/pith/QIHHYERIVTUK5EKOCSMF6YULW2","bundle":"https://pith.science/pith/QIHHYERIVTUK5EKOCSMF6YULW2/bundle.json","state":"https://pith.science/pith/QIHHYERIVTUK5EKOCSMF6YULW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIHHYERIVTUK5EKOCSMF6YULW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QIHHYERIVTUK5EKOCSMF6YULW2","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":"9adcb3bbbd14b62fad08e50590e10df0dcc2cd32415b25471998cb1b0398b0af","cross_cats_sorted":["cs.NA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-25T20:16:51Z","title_canon_sha256":"cb2c364b8202909d24e0abeccfc910f86c3be6ccb6976d61fc3db0ade6f8a408"},"schema_version":"1.0","source":{"id":"1410.6956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6956","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6956v1","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6956","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"QIHHYERIVTUK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QIHHYERIVTUK5EKO","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QIHHYERI","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:6d0c2c1186e33e4a49d9c98c4f97f060f567776837cefa8efccd063267d05c2b","target":"graph","created_at":"2026-05-18T02:39: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":"This paper investigates the problem of distributed stochastic approximation in multi-agent systems. The algorithm under study consists of two steps: a local stochastic approximation step and a diffusion step which drives the network to a consensus. The diffusion step uses row-stochastic matrices to weight the network exchanges. As opposed to previous works, exchange matrices are not supposed to be doubly stochastic, and may also depend on the past estimate.\n  We prove that non-doubly stochastic matrices generally influence the limit points of the algorithm. Nevertheless, the limit points are n","authors_text":"Gemma Morral, Gersende Fort, Pascal Bianchi","cross_cats":["cs.NA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-25T20:16:51Z","title":"Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multi-Agent Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6956","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:0624d1eb00d01e2e6f64eaca7941d6df3d30505816a3e4103cd566330829abea","target":"record","created_at":"2026-05-18T02:39: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":"9adcb3bbbd14b62fad08e50590e10df0dcc2cd32415b25471998cb1b0398b0af","cross_cats_sorted":["cs.NA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-25T20:16:51Z","title_canon_sha256":"cb2c364b8202909d24e0abeccfc910f86c3be6ccb6976d61fc3db0ade6f8a408"},"schema_version":"1.0","source":{"id":"1410.6956","kind":"arxiv","version":1}},"canonical_sha256":"820e7c1228ace8ae914e14985f628bb69d169d8475fac38d7bb684989b3b4a33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"820e7c1228ace8ae914e14985f628bb69d169d8475fac38d7bb684989b3b4a33","first_computed_at":"2026-05-18T02:39:18.241982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:18.241982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j6GgmeHGwYidAPfDB5fJtAHgZio2UcT73xYCqFKV5JKN2cyUJ3M5qxiktu9P36nxzFW9qt7RyweKIn+DJbxLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:18.242334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0624d1eb00d01e2e6f64eaca7941d6df3d30505816a3e4103cd566330829abea","sha256:6d0c2c1186e33e4a49d9c98c4f97f060f567776837cefa8efccd063267d05c2b"],"state_sha256":"482547b9e1f73dfe3bd2b1492f87c51a020d676d7d212b937b1ed99267a80f24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kcaq+aUhsteyD77K9dpScuXBBU1IU+b+3B013LprUObgf2kMN4xlemAQVMpiY6l17kzlDkS0MHF803BUq/iHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:30:35.643177Z","bundle_sha256":"5cc5d6f9aafeb95721c03b722da6340a83b8cb08358a62a1e93d1458ee3d663b"}}