{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2RJNKKQ56Y33MZMA5TDRAEKBVP","short_pith_number":"pith:2RJNKKQ5","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"},"canonical_sha256":"d452d52a1df637b66580ecc7101141abccf4cb79380425fb861317647099fd2c","source":{"kind":"arxiv","id":"1412.4166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4166","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4166v1","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4166","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"2RJNKKQ56Y33","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2RJNKKQ56Y33MZMA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2RJNKKQ5","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2RJNKKQ56Y33MZMA5TDRAEKBVP","target":"record","payload":{"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"},"canonical_sha256":"d452d52a1df637b66580ecc7101141abccf4cb79380425fb861317647099fd2c","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"},"source_kind":"arxiv","source_id":"1412.4166","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:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6VkHTR+8cezBDh7IttRvJy28GeiwmTTUZflwU5NyZ4LnwRxGAGtjAK4IavptFe20oKccAywcvXQgHD99PCRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:00:17.360498Z"},"content_sha256":"0e51ff15e7fbd44897db349dc046dff209fef88e6bb64d4e6796a9435060c09d","schema_version":"1.0","event_id":"sha256:0e51ff15e7fbd44897db349dc046dff209fef88e6bb64d4e6796a9435060c09d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2RJNKKQ56Y33MZMA5TDRAEKBVP","target":"graph","payload":{"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"},"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:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/g8OHqEgfiT/tZmAAc89DlS/BPGZYbkk4FN+A3QpsrXW4neDu0oFLICXM/NB6Ekof8eYvePbqLU60xOjr7FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:00:17.361188Z"},"content_sha256":"84ee09a641b650420e2fd9345fac33afd2af42074fcae632390d121860530650","schema_version":"1.0","event_id":"sha256:84ee09a641b650420e2fd9345fac33afd2af42074fcae632390d121860530650"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/bundle.json","state_url":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/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-10T06:00:17Z","links":{"resolver":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP","bundle":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/bundle.json","state":"https://pith.science/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RJNKKQ56Y33MZMA5TDRAEKBVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2RJNKKQ56Y33MZMA5TDRAEKBVP","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":"fc2352edec0784d21b0d0f64aacde38c6c1aa0912a4631cfc3cb470e4e728e3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-12-12T23:59:42Z","title_canon_sha256":"d3368104299e894b84268e3bdc0fe5f0b885e3494592633b8dc461f2342b6e65"},"schema_version":"1.0","source":{"id":"1412.4166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4166","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4166v1","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4166","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"2RJNKKQ56Y33","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2RJNKKQ56Y33MZMA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2RJNKKQ5","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:84ee09a641b650420e2fd9345fac33afd2af42074fcae632390d121860530650","target":"graph","created_at":"2026-05-18T02:31:20Z","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 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","authors_text":"Arjun Muralidharan, Yasamin Mostofi, Yuan Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-12-12T23:59:42Z","title":"Binary Log-Linear Learning with Stochastic Communication Links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4166","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:0e51ff15e7fbd44897db349dc046dff209fef88e6bb64d4e6796a9435060c09d","target":"record","created_at":"2026-05-18T02:31:20Z","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":"fc2352edec0784d21b0d0f64aacde38c6c1aa0912a4631cfc3cb470e4e728e3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-12-12T23:59:42Z","title_canon_sha256":"d3368104299e894b84268e3bdc0fe5f0b885e3494592633b8dc461f2342b6e65"},"schema_version":"1.0","source":{"id":"1412.4166","kind":"arxiv","version":1}},"canonical_sha256":"d452d52a1df637b66580ecc7101141abccf4cb79380425fb861317647099fd2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d452d52a1df637b66580ecc7101141abccf4cb79380425fb861317647099fd2c","first_computed_at":"2026-05-18T02:31:20.046294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:20.046294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NPRaYup5PdrrdCn16frs2B2UgBDVL2PzqhFzLxWVGanD+JhqnfFgdxVbwdPJTSlUoYy83eKN5T+OVy7OIh+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:20.046971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e51ff15e7fbd44897db349dc046dff209fef88e6bb64d4e6796a9435060c09d","sha256:84ee09a641b650420e2fd9345fac33afd2af42074fcae632390d121860530650"],"state_sha256":"bcc45da5fa157b52e7bf2b18529604e1ccfb133bfe60a42fb9b9f58a5121b75c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DZMS6gbClBjB1OZ4uR4NVOVKVIMSUS3mS6LIEaIzhFg4sqzcd9I5PYp9nFWxvoe2dai51W4BkNrhJLJepLtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:00:17.364784Z","bundle_sha256":"4bf9f874788b6afceafe978b973e53b651504a89be902f675f04c4529f6f1e27"}}