{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UIRQZDYZCV2TGQPHZMTSP5AYQG","short_pith_number":"pith:UIRQZDYZ","schema_version":"1.0","canonical_sha256":"a2230c8f1915753341e7cb2727f418819e6f01ef8317a806e8d35e5907ea2eb6","source":{"kind":"arxiv","id":"1309.2574","version":1},"attestation_state":"computed","paper":{"title":"Randomized Consensus with Attractive and Repulsive Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Alexandre Proutiere, Guodong Shi, Karl H. Johansson, Mikael Johansson","submitted_at":"2013-09-09T15:28:15Z","abstract_excerpt":"We study convergence properties of a randomized consensus algorithm over a graph with both attractive and repulsive links. At each time instant, a node is randomly selected to interact with a random neighbor. Depending on if the link between the two nodes belongs to a given subgraph of attractive or repulsive links, the node update follows a standard attractive weighted average or a repulsive weighted average, respectively. The repulsive update has the opposite sign of the standard consensus update. In this way, it counteracts the consensus formation and can be seen as a model of link faults o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.2574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-09T15:28:15Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"2fcb7fbc69fc835e3b03c36f8ca070eaf8b5f0254234f713759d4985a11b45de","abstract_canon_sha256":"c187f630aef2876d3520fc795b5a8549d8092310a27e4b09e7e64eb8ca2b8c4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:44.192637Z","signature_b64":"u6flDkvs2lTDufV2RAySdVnd6mUnMe4PcR7uahAmTAl6Nv7/mwX75zHg6vDD+fE0CR1mT+CgsBV5Ql27NnEiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2230c8f1915753341e7cb2727f418819e6f01ef8317a806e8d35e5907ea2eb6","last_reissued_at":"2026-05-18T03:13:44.192001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:44.192001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Consensus with Attractive and Repulsive Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Alexandre Proutiere, Guodong Shi, Karl H. Johansson, Mikael Johansson","submitted_at":"2013-09-09T15:28:15Z","abstract_excerpt":"We study convergence properties of a randomized consensus algorithm over a graph with both attractive and repulsive links. At each time instant, a node is randomly selected to interact with a random neighbor. Depending on if the link between the two nodes belongs to a given subgraph of attractive or repulsive links, the node update follows a standard attractive weighted average or a repulsive weighted average, respectively. The repulsive update has the opposite sign of the standard consensus update. In this way, it counteracts the consensus formation and can be seen as a model of link faults o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2574","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.2574","created_at":"2026-05-18T03:13:44.192130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2574v1","created_at":"2026-05-18T03:13:44.192130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2574","created_at":"2026-05-18T03:13:44.192130+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIRQZDYZCV2T","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIRQZDYZCV2TGQPH","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIRQZDYZ","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG","json":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG.json","graph_json":"https://pith.science/api/pith-number/UIRQZDYZCV2TGQPHZMTSP5AYQG/graph.json","events_json":"https://pith.science/api/pith-number/UIRQZDYZCV2TGQPHZMTSP5AYQG/events.json","paper":"https://pith.science/paper/UIRQZDYZ"},"agent_actions":{"view_html":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG","download_json":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG.json","view_paper":"https://pith.science/paper/UIRQZDYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2574&json=true","fetch_graph":"https://pith.science/api/pith-number/UIRQZDYZCV2TGQPHZMTSP5AYQG/graph.json","fetch_events":"https://pith.science/api/pith-number/UIRQZDYZCV2TGQPHZMTSP5AYQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG/action/storage_attestation","attest_author":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG/action/author_attestation","sign_citation":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG/action/citation_signature","submit_replication":"https://pith.science/pith/UIRQZDYZCV2TGQPHZMTSP5AYQG/action/replication_record"}},"created_at":"2026-05-18T03:13:44.192130+00:00","updated_at":"2026-05-18T03:13:44.192130+00:00"}