{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X6OMPMHJU5WFET7SQR5KRVLBVM","short_pith_number":"pith:X6OMPMHJ","canonical_record":{"source":{"id":"1108.3223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-08-16T12:33:07Z","cross_cats_sorted":["cs.CG","cs.DC"],"title_canon_sha256":"4bcfc428bbbdf95f06159852517d8f6961ac61e03ad721e1b1572b50b518fbd4","abstract_canon_sha256":"01ef39e78d707e21e1f0befd2843f3604c0d84b7f1d5b7e693f3b357d54995b0"},"schema_version":"1.0"},"canonical_sha256":"bf9cc7b0e9a76c524ff2847aa8d561ab2dc42ffd9b7175363b9109b260395e62","source":{"kind":"arxiv","id":"1108.3223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3223","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3223v2","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3223","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"X6OMPMHJU5WF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X6OMPMHJU5WFET7S","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X6OMPMHJ","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X6OMPMHJU5WFET7SQR5KRVLBVM","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-08-16T12:33:07Z","cross_cats_sorted":["cs.CG","cs.DC"],"title_canon_sha256":"4bcfc428bbbdf95f06159852517d8f6961ac61e03ad721e1b1572b50b518fbd4","abstract_canon_sha256":"01ef39e78d707e21e1f0befd2843f3604c0d84b7f1d5b7e693f3b357d54995b0"},"schema_version":"1.0"},"canonical_sha256":"bf9cc7b0e9a76c524ff2847aa8d561ab2dc42ffd9b7175363b9109b260395e62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:37.182536Z","signature_b64":"2AQdkiY0YQx9Zv0v4ikMlwEvshwKbO2ApIVDPqQQ1H44TY7J+2RplYIjKZrxIDGOEkqcnYaPD9sCAqnlcURlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9cc7b0e9a76c524ff2847aa8d561ab2dc42ffd9b7175363b9109b260395e62","last_reissued_at":"2026-05-18T02:21:37.182104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:37.182104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3223","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:21:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3Rp8urKSRvMIHSGu4NeimvKjOOoI+eprmJBwF6iWhhlJZ4tK6v+poQpI66Ero7sK9/jF5Pbi0u7R+/ikiNRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:07:22.862818Z"},"content_sha256":"7bf081a74fe75b5308e15806de403b797928883f551fca26db81cfb3d847a074","schema_version":"1.0","event_id":"sha256:7bf081a74fe75b5308e15806de403b797928883f551fca26db81cfb3d847a074"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X6OMPMHJU5WFET7SQR5KRVLBVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Optimal Consensus of Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DC"],"primary_cat":"cs.MA","authors_text":"Guodong Shi, Karl Henrik Johansson","submitted_at":"2011-08-16T12:33:07Z","abstract_excerpt":"In this paper, we formulate and solve a randomized optimal consensus problem for multi-agent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem $\\min_{z\\in \\mathds{R}^d}\\ \\sum_{i=1}^n f_i(z),$ in which the optimal solution set of objective function $f_i$ can only be observed by agent $i$ itself. At each time step, simply determined by a Bernoulli trial, each agent independently and randomly chooses either taking an average among "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3223","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:21:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxhxxkC1Cw1qhDRqwXDC0cowD5s4ey1sfLDqb2b+oPOUQmowq+RX5vL/jFFrkpHmF+MEtqBAUTKOcZJKLY0qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:07:22.863155Z"},"content_sha256":"f17f7ea798b37789224ef5d8551a18f097b96cad99d212c91192b627659f2470","schema_version":"1.0","event_id":"sha256:f17f7ea798b37789224ef5d8551a18f097b96cad99d212c91192b627659f2470"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6OMPMHJU5WFET7SQR5KRVLBVM/bundle.json","state_url":"https://pith.science/pith/X6OMPMHJU5WFET7SQR5KRVLBVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6OMPMHJU5WFET7SQR5KRVLBVM/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-30T16:07:22Z","links":{"resolver":"https://pith.science/pith/X6OMPMHJU5WFET7SQR5KRVLBVM","bundle":"https://pith.science/pith/X6OMPMHJU5WFET7SQR5KRVLBVM/bundle.json","state":"https://pith.science/pith/X6OMPMHJU5WFET7SQR5KRVLBVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6OMPMHJU5WFET7SQR5KRVLBVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X6OMPMHJU5WFET7SQR5KRVLBVM","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":"01ef39e78d707e21e1f0befd2843f3604c0d84b7f1d5b7e693f3b357d54995b0","cross_cats_sorted":["cs.CG","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-08-16T12:33:07Z","title_canon_sha256":"4bcfc428bbbdf95f06159852517d8f6961ac61e03ad721e1b1572b50b518fbd4"},"schema_version":"1.0","source":{"id":"1108.3223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3223","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3223v2","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3223","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"X6OMPMHJU5WF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X6OMPMHJU5WFET7S","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X6OMPMHJ","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:f17f7ea798b37789224ef5d8551a18f097b96cad99d212c91192b627659f2470","target":"graph","created_at":"2026-05-18T02:21:37Z","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, we formulate and solve a randomized optimal consensus problem for multi-agent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem $\\min_{z\\in \\mathds{R}^d}\\ \\sum_{i=1}^n f_i(z),$ in which the optimal solution set of objective function $f_i$ can only be observed by agent $i$ itself. At each time step, simply determined by a Bernoulli trial, each agent independently and randomly chooses either taking an average among ","authors_text":"Guodong Shi, Karl Henrik Johansson","cross_cats":["cs.CG","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-08-16T12:33:07Z","title":"Randomized Optimal Consensus of Multi-agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3223","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:7bf081a74fe75b5308e15806de403b797928883f551fca26db81cfb3d847a074","target":"record","created_at":"2026-05-18T02:21:37Z","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":"01ef39e78d707e21e1f0befd2843f3604c0d84b7f1d5b7e693f3b357d54995b0","cross_cats_sorted":["cs.CG","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-08-16T12:33:07Z","title_canon_sha256":"4bcfc428bbbdf95f06159852517d8f6961ac61e03ad721e1b1572b50b518fbd4"},"schema_version":"1.0","source":{"id":"1108.3223","kind":"arxiv","version":2}},"canonical_sha256":"bf9cc7b0e9a76c524ff2847aa8d561ab2dc42ffd9b7175363b9109b260395e62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf9cc7b0e9a76c524ff2847aa8d561ab2dc42ffd9b7175363b9109b260395e62","first_computed_at":"2026-05-18T02:21:37.182104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:37.182104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AQdkiY0YQx9Zv0v4ikMlwEvshwKbO2ApIVDPqQQ1H44TY7J+2RplYIjKZrxIDGOEkqcnYaPD9sCAqnlcURlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:37.182536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bf081a74fe75b5308e15806de403b797928883f551fca26db81cfb3d847a074","sha256:f17f7ea798b37789224ef5d8551a18f097b96cad99d212c91192b627659f2470"],"state_sha256":"4712e3b0de5b2c5d8d9c83cc24eb258a7d658d6867e99fa49ba878112a66dd30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyVltO1CKojmMu4HVYz0i+JcpK1dak5W4XIn9zUVwypsStTMNmJ3aXF4uV5PgWbJdtL03EdDHRFH1KlLkO4pBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T16:07:22.865013Z","bundle_sha256":"be68cb63d030a960ed129cff774166491c7e3d40de24896d3cb3890e04d04dc0"}}