{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SXW64ANHYWCQVN22EL3GIJWTPC","short_pith_number":"pith:SXW64ANH","schema_version":"1.0","canonical_sha256":"95edee01a7c5850ab75a22f66426d378aabea6c4b3076fe2875ea04fc54ba11e","source":{"kind":"arxiv","id":"1412.5716","version":1},"attestation_state":"computed","paper":{"title":"Naming game with learning errors in communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Guanrong Chen, Yang Lou","submitted_at":"2014-12-18T04:18:38Z","abstract_excerpt":"Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network topology. By pair-wise iterative interactions, the population reaches a consensus state asymptotically. In this paper, we study naming game with communication errors during pair-wise conversations, where errors are represented by error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topolo"},"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.5716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-18T04:18:38Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"08908bc504c41be21b35ba29eb15d3d85ab1b27150439e212b1608da88216acf","abstract_canon_sha256":"8393b7a7ec46c7ba3f8cd4a34e6ed92fa0653fe6245aaf1d50d3829e9ad133c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.548748Z","signature_b64":"QLN5TT6ea/pGo1Rbo8augcM1qKE6c4BdJ6oTnfzSKxC7AyuVoRa6qPNAwPy543PHXsrDG6/ayWoOj7VWUA9sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95edee01a7c5850ab75a22f66426d378aabea6c4b3076fe2875ea04fc54ba11e","last_reissued_at":"2026-05-18T02:31:01.548243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.548243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Naming game with learning errors in communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Guanrong Chen, Yang Lou","submitted_at":"2014-12-18T04:18:38Z","abstract_excerpt":"Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network topology. By pair-wise iterative interactions, the population reaches a consensus state asymptotically. In this paper, we study naming game with communication errors during pair-wise conversations, where errors are represented by error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topolo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5716","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.5716","created_at":"2026-05-18T02:31:01.548311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5716v1","created_at":"2026-05-18T02:31:01.548311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5716","created_at":"2026-05-18T02:31:01.548311+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXW64ANHYWCQ","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXW64ANHYWCQVN22","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXW64ANH","created_at":"2026-05-18T12:28:49.207871+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/SXW64ANHYWCQVN22EL3GIJWTPC","json":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC.json","graph_json":"https://pith.science/api/pith-number/SXW64ANHYWCQVN22EL3GIJWTPC/graph.json","events_json":"https://pith.science/api/pith-number/SXW64ANHYWCQVN22EL3GIJWTPC/events.json","paper":"https://pith.science/paper/SXW64ANH"},"agent_actions":{"view_html":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC","download_json":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC.json","view_paper":"https://pith.science/paper/SXW64ANH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5716&json=true","fetch_graph":"https://pith.science/api/pith-number/SXW64ANHYWCQVN22EL3GIJWTPC/graph.json","fetch_events":"https://pith.science/api/pith-number/SXW64ANHYWCQVN22EL3GIJWTPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC/action/storage_attestation","attest_author":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC/action/author_attestation","sign_citation":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC/action/citation_signature","submit_replication":"https://pith.science/pith/SXW64ANHYWCQVN22EL3GIJWTPC/action/replication_record"}},"created_at":"2026-05-18T02:31:01.548311+00:00","updated_at":"2026-05-18T02:31:01.548311+00:00"}