{"paper":{"title":"Classification in a Large Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Vinay A. Vaishampayan","submitted_at":"2019-02-14T18:18:16Z","abstract_excerpt":"We construct and analyze the communication cost of protocols (interactive and one-way) for classifying ${\\mathbf X}=(X_1,X_2,\\ldots,X_n) \\in [0,1)^n \\subset \\mathbb{R}^n$, in a network with $n\\geq 2$ nodes, with $X_i$ known only at node $i$. The classifier takes the form $\\sum_{i=1}^nh_iX_i \\gtrless a$, with weights $h_i \\in \\{-1,+1\\}$. The interactive protocol (a zero-error protocol) exchanges a variable number of messages depending on the input ${\\mathbf X}$ and its sum rate is directly proportional to its mean stopping time. An exact analysis, as well as an approximation of the mean stoppin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05531","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"}