{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GU56GIZIPU3OPFQY5JYLO35535","short_pith_number":"pith:GU56GIZI","schema_version":"1.0","canonical_sha256":"353be323287d36e79618ea70b76fbddf6c2fa0b335f35397aa4b9edbaff86065","source":{"kind":"arxiv","id":"1503.06381","version":1},"attestation_state":"computed","paper":{"title":"Balancing Communication for Multi-party Interactive Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Allison Lewko, Ellen Vitercik","submitted_at":"2015-03-22T03:50:32Z","abstract_excerpt":"We consider interactive coding in a setting where $n$ parties wish to compute a joint function of their inputs via an interactive protocol over imperfect channels. We assume that adversarial errors can comprise a $\\mathcal{O}(\\frac{1}{n})$ fraction of the total communication, occurring anywhere on the communication network. Our goal is to maintain a constant multiplicative overhead in the total communication required, as compared to the error-free setting, and also to balance the workload over the different parties. We build upon the prior protocol of Jain, Kalai, and Lewko, but while that 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":"1503.06381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-22T03:50:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"24d4854aadcbe32a59a46ca36ca061a2ed325ab21db513bde66cd2424e7ebd88","abstract_canon_sha256":"e6fa772e96403fcf768fa446b32a13bbd6fcf741f7adec9cfd394a0b84645822"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.584298Z","signature_b64":"6hZt1/+exhR37Hx8G13h2+jcZDzjmXbDm7kCsKW8dt2QTDQAoNsDEHNH29vLGF/ohudBBlMUjuKrNIRD3awtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"353be323287d36e79618ea70b76fbddf6c2fa0b335f35397aa4b9edbaff86065","last_reissued_at":"2026-05-18T02:20:38.583605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.583605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing Communication for Multi-party Interactive Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Allison Lewko, Ellen Vitercik","submitted_at":"2015-03-22T03:50:32Z","abstract_excerpt":"We consider interactive coding in a setting where $n$ parties wish to compute a joint function of their inputs via an interactive protocol over imperfect channels. We assume that adversarial errors can comprise a $\\mathcal{O}(\\frac{1}{n})$ fraction of the total communication, occurring anywhere on the communication network. Our goal is to maintain a constant multiplicative overhead in the total communication required, as compared to the error-free setting, and also to balance the workload over the different parties. We build upon the prior protocol of Jain, Kalai, and Lewko, but while that pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06381","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":"1503.06381","created_at":"2026-05-18T02:20:38.583703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06381v1","created_at":"2026-05-18T02:20:38.583703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06381","created_at":"2026-05-18T02:20:38.583703+00:00"},{"alias_kind":"pith_short_12","alias_value":"GU56GIZIPU3O","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GU56GIZIPU3OPFQY","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GU56GIZI","created_at":"2026-05-18T12:29:22.688609+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/GU56GIZIPU3OPFQY5JYLO35535","json":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535.json","graph_json":"https://pith.science/api/pith-number/GU56GIZIPU3OPFQY5JYLO35535/graph.json","events_json":"https://pith.science/api/pith-number/GU56GIZIPU3OPFQY5JYLO35535/events.json","paper":"https://pith.science/paper/GU56GIZI"},"agent_actions":{"view_html":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535","download_json":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535.json","view_paper":"https://pith.science/paper/GU56GIZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06381&json=true","fetch_graph":"https://pith.science/api/pith-number/GU56GIZIPU3OPFQY5JYLO35535/graph.json","fetch_events":"https://pith.science/api/pith-number/GU56GIZIPU3OPFQY5JYLO35535/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/action/storage_attestation","attest_author":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/action/author_attestation","sign_citation":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/action/citation_signature","submit_replication":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/action/replication_record"}},"created_at":"2026-05-18T02:20:38.583703+00:00","updated_at":"2026-05-18T02:20:38.583703+00:00"}