{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2RJNKKQ56Y33MZMA5TDRAEKBVP","short_pith_number":"pith:2RJNKKQ5","schema_version":"1.0","canonical_sha256":"d452d52a1df637b66580ecc7101141abccf4cb79380425fb861317647099fd2c","source":{"kind":"arxiv","id":"1412.4166","version":1},"attestation_state":"computed","paper":{"title":"Binary Log-Linear Learning with Stochastic Communication Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Arjun Muralidharan, Yasamin Mostofi, Yuan Yan","submitted_at":"2014-12-12T23:59:42Z","abstract_excerpt":"In this paper, we consider distributed decision-making over stochastic communication links in multi-agent systems. We show how to extend the current literature on potential games with binary log-linear learning (which mainly focuses on ideal communication links) to consider the impact of stochastic communication channels. More specifically, we derive conditions on the probability of link connectivity to achieve a target probability for the set of potential maximizers (in the stationary distribution). Furthermore, our toy example demonstrates a transition phenomenon for achieving any target pro"},"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":"1412.4166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-12-12T23:59:42Z","cross_cats_sorted":[],"title_canon_sha256":"d3368104299e894b84268e3bdc0fe5f0b885e3494592633b8dc461f2342b6e65","abstract_canon_sha256":"fc2352edec0784d21b0d0f64aacde38c6c1aa0912a4631cfc3cb470e4e728e3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:20.046971Z","signature_b64":"5NPRaYup5PdrrdCn16frs2B2UgBDVL2PzqhFzLxWVGanD+JhqnfFgdxVbwdPJTSlUoYy83eKN5T+OVy7OIh+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d452d52a1df637b66580ecc7101141abccf4cb79380425fb861317647099fd2c","last_reissued_at":"2026-05-18T02:31:20.046294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:20.046294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Log-Linear Learning with Stochastic Communication Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Arjun Muralidharan, Yasamin Mostofi, Yuan Yan","submitted_at":"2014-12-12T23:59:42Z","abstract_excerpt":"In this paper, we consider distributed decision-making over stochastic communication links in multi-agent systems. We show how to extend the current literature on potential games with binary log-linear learning (which mainly focuses on ideal communication links) to consider the impact of stochastic communication channels. More specifically, we derive conditions on the probability of link connectivity to achieve a target probability for the set of potential maximizers (in the stationary distribution). Furthermore, our toy example demonstrates a transition phenomenon for achieving any target pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4166","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":"1412.4166","created_at":"2026-05-18T02:31:20.046407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4166v1","created_at":"2026-05-18T02:31:20.046407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4166","created_at":"2026-05-18T02:31:20.046407+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RJNKKQ56Y33","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RJNKKQ56Y33MZMA","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RJNKKQ5","created_at":"2026-05-18T12:28:11.866339+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/2RJNKKQ56Y33MZMA5TDRAEKBVP","json":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP.json","graph_json":"https://pith.science/api/pith-number/2RJNKKQ56Y33MZMA5TDRAEKBVP/graph.json","events_json":"https://pith.science/api/pith-number/2RJNKKQ56Y33MZMA5TDRAEKBVP/events.json","paper":"https://pith.science/paper/2RJNKKQ5"},"agent_actions":{"view_html":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP","download_json":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP.json","view_paper":"https://pith.science/paper/2RJNKKQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4166&json=true","fetch_graph":"https://pith.science/api/pith-number/2RJNKKQ56Y33MZMA5TDRAEKBVP/graph.json","fetch_events":"https://pith.science/api/pith-number/2RJNKKQ56Y33MZMA5TDRAEKBVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/action/storage_attestation","attest_author":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/action/author_attestation","sign_citation":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/action/citation_signature","submit_replication":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/action/replication_record"}},"created_at":"2026-05-18T02:31:20.046407+00:00","updated_at":"2026-05-18T02:31:20.046407+00:00"}