{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CJ4YCPAQARR77XWBCINPJ5MRFT","short_pith_number":"pith:CJ4YCPAQ","canonical_record":{"source":{"id":"1203.1505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:44:31Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"83f8ba6650e3cd7910d70f0cc18b8e4ba661cda1daac9ef19f7736653aeb47d0","abstract_canon_sha256":"f83eabad9af9f8c82e35e90a889321af51750af00101173f7bbbc74601b12c3d"},"schema_version":"1.0"},"canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","source":{"kind":"arxiv","id":"1203.1505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1505","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1505v2","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1505","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"CJ4YCPAQARR7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJ4YCPAQARR77XWB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJ4YCPAQ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CJ4YCPAQARR77XWBCINPJ5MRFT","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:44:31Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"83f8ba6650e3cd7910d70f0cc18b8e4ba661cda1daac9ef19f7736653aeb47d0","abstract_canon_sha256":"f83eabad9af9f8c82e35e90a889321af51750af00101173f7bbbc74601b12c3d"},"schema_version":"1.0"},"canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.118499Z","signature_b64":"m3D9AZKfSv7XwrikrM2GIo2eAdPRa5kTpJOLTUGPgU/1iczF1srfW//9E6Q4oysXnS2i2q7wuGrkKIh4t3gMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","last_reissued_at":"2026-05-18T03:05:55.117878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.117878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1505","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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+L4iH9hLZknmjRhNbbSiRx4EySXW59lx/VvSchFeXqD+3zQKSxt5qO0yNqZbgv8Med9C2ZmDAV6LlsHN2HiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:26:07.110729Z"},"content_sha256":"8d20d95f03e29b8d906b6a66c60e0eb5e2d7a4f3b4bed667e69858910862cd9f","schema_version":"1.0","event_id":"sha256:8d20d95f03e29b8d906b6a66c60e0eb5e2d7a4f3b4bed667e69858910862cd9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CJ4YCPAQARR77XWBCINPJ5MRFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance of a Distributed Stochastic Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Gersende Fort, Pascal Bianchi, Walid Hachem","submitted_at":"2012-03-07T15:44:31Z","abstract_excerpt":"In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1505","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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHX+k5araPYk6AQHWeQIWFeCLV0XCIPdQjrdSuNYY9oVVtQdjrVi2Sk+To0A7gleBgMbO74yQ12Kdj1X2NxCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:26:07.111605Z"},"content_sha256":"046917c2b4319b3e1ac3accfad9384d97762af5e6283405390a33a0c8a8b0447","schema_version":"1.0","event_id":"sha256:046917c2b4319b3e1ac3accfad9384d97762af5e6283405390a33a0c8a8b0447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/bundle.json","state_url":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/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-27T21:26:07Z","links":{"resolver":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT","bundle":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/bundle.json","state":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CJ4YCPAQARR77XWBCINPJ5MRFT","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":"f83eabad9af9f8c82e35e90a889321af51750af00101173f7bbbc74601b12c3d","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:44:31Z","title_canon_sha256":"83f8ba6650e3cd7910d70f0cc18b8e4ba661cda1daac9ef19f7736653aeb47d0"},"schema_version":"1.0","source":{"id":"1203.1505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1505","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1505v2","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1505","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"CJ4YCPAQARR7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJ4YCPAQARR77XWB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJ4YCPAQ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:046917c2b4319b3e1ac3accfad9384d97762af5e6283405390a33a0c8a8b0447","target":"graph","created_at":"2026-05-18T03:05:55Z","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":"In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients:","authors_text":"Gersende Fort, Pascal Bianchi, Walid Hachem","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:44:31Z","title":"Performance of a Distributed Stochastic Approximation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1505","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:8d20d95f03e29b8d906b6a66c60e0eb5e2d7a4f3b4bed667e69858910862cd9f","target":"record","created_at":"2026-05-18T03:05:55Z","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":"f83eabad9af9f8c82e35e90a889321af51750af00101173f7bbbc74601b12c3d","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:44:31Z","title_canon_sha256":"83f8ba6650e3cd7910d70f0cc18b8e4ba661cda1daac9ef19f7736653aeb47d0"},"schema_version":"1.0","source":{"id":"1203.1505","kind":"arxiv","version":2}},"canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","first_computed_at":"2026-05-18T03:05:55.117878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:55.117878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3D9AZKfSv7XwrikrM2GIo2eAdPRa5kTpJOLTUGPgU/1iczF1srfW//9E6Q4oysXnS2i2q7wuGrkKIh4t3gMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:55.118499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d20d95f03e29b8d906b6a66c60e0eb5e2d7a4f3b4bed667e69858910862cd9f","sha256:046917c2b4319b3e1ac3accfad9384d97762af5e6283405390a33a0c8a8b0447"],"state_sha256":"e1bae87c929e87d1d1e874828281793635a0b6ef214d1f03d39eabba16156cc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBVw0hwW2VIaIO074+axe02zIT1akpzVdAbAuYXTHHCS8ncexd3k8ou6VtAC1sPBbDp9en6aoOIlGAGWpngdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:26:07.114753Z","bundle_sha256":"b9729e23a3e5dfc35cf5d5d4b205216d600872499a677b3db674894098a8b0da"}}