{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GU56GIZIPU3OPFQY5JYLO35535","short_pith_number":"pith:GU56GIZI","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"},"canonical_sha256":"353be323287d36e79618ea70b76fbddf6c2fa0b335f35397aa4b9edbaff86065","source":{"kind":"arxiv","id":"1503.06381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06381","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06381v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06381","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"GU56GIZIPU3O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GU56GIZIPU3OPFQY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GU56GIZI","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GU56GIZIPU3OPFQY5JYLO35535","target":"record","payload":{"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"},"canonical_sha256":"353be323287d36e79618ea70b76fbddf6c2fa0b335f35397aa4b9edbaff86065","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"},"source_kind":"arxiv","source_id":"1503.06381","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:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCdthz5mAZ1rkm6Rww6kvXxFO1fCJVMSN5XM4l+GZrGDoPeWM3nyJjgwLzF9pN3fJNDtRZuovxk+hRtaDqEvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:30:21.930284Z"},"content_sha256":"33c4ea3be3996179944a3e49c99cc4751104b87e1234eaeffadeeec84a163a0f","schema_version":"1.0","event_id":"sha256:33c4ea3be3996179944a3e49c99cc4751104b87e1234eaeffadeeec84a163a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GU56GIZIPU3OPFQY5JYLO35535","target":"graph","payload":{"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"},"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:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caqsl1kQP62RX5aJbeJg8kjC62yF6a/gX6efZCdIpx4A2PZPF3bFY+lePcvPabts4W9wLAY6d1MBFTlGUzYDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:30:21.930651Z"},"content_sha256":"ef0342a01c22e62e9c30bf6f15a66ed7ddcd9ec778d28a5b7bc8fc39870ed70b","schema_version":"1.0","event_id":"sha256:ef0342a01c22e62e9c30bf6f15a66ed7ddcd9ec778d28a5b7bc8fc39870ed70b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/bundle.json","state_url":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GU56GIZIPU3OPFQY5JYLO35535/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-20T03:30:21Z","links":{"resolver":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535","bundle":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/bundle.json","state":"https://pith.science/pith/GU56GIZIPU3OPFQY5JYLO35535/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GU56GIZIPU3OPFQY5JYLO35535/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GU56GIZIPU3OPFQY5JYLO35535","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":"e6fa772e96403fcf768fa446b32a13bbd6fcf741f7adec9cfd394a0b84645822","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-22T03:50:32Z","title_canon_sha256":"24d4854aadcbe32a59a46ca36ca061a2ed325ab21db513bde66cd2424e7ebd88"},"schema_version":"1.0","source":{"id":"1503.06381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06381","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06381v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06381","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"GU56GIZIPU3O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GU56GIZIPU3OPFQY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GU56GIZI","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:ef0342a01c22e62e9c30bf6f15a66ed7ddcd9ec778d28a5b7bc8fc39870ed70b","target":"graph","created_at":"2026-05-18T02:20:38Z","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":"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","authors_text":"Allison Lewko, Ellen Vitercik","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-22T03:50:32Z","title":"Balancing Communication for Multi-party Interactive Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06381","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:33c4ea3be3996179944a3e49c99cc4751104b87e1234eaeffadeeec84a163a0f","target":"record","created_at":"2026-05-18T02:20:38Z","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":"e6fa772e96403fcf768fa446b32a13bbd6fcf741f7adec9cfd394a0b84645822","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-22T03:50:32Z","title_canon_sha256":"24d4854aadcbe32a59a46ca36ca061a2ed325ab21db513bde66cd2424e7ebd88"},"schema_version":"1.0","source":{"id":"1503.06381","kind":"arxiv","version":1}},"canonical_sha256":"353be323287d36e79618ea70b76fbddf6c2fa0b335f35397aa4b9edbaff86065","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"353be323287d36e79618ea70b76fbddf6c2fa0b335f35397aa4b9edbaff86065","first_computed_at":"2026-05-18T02:20:38.583605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:38.583605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6hZt1/+exhR37Hx8G13h2+jcZDzjmXbDm7kCsKW8dt2QTDQAoNsDEHNH29vLGF/ohudBBlMUjuKrNIRD3awtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:38.584298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33c4ea3be3996179944a3e49c99cc4751104b87e1234eaeffadeeec84a163a0f","sha256:ef0342a01c22e62e9c30bf6f15a66ed7ddcd9ec778d28a5b7bc8fc39870ed70b"],"state_sha256":"6faa7e19b9e918ca7658f01ec870620320607b3e3b2bf3dcb073078fadfafcee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Yp/zUKNh8Vkk9A6wFOVZbTz5F8CW56yxGzK1AOnO8hWG553HN/M/TGMnTIrxeUPTq+kAqbg3xhbedAWvzKDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:30:21.932630Z","bundle_sha256":"e7b2517d6bf992b1c8328f60596208127a779eae50253fa8b34b89bd2f4d8610"}}