{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IZ726JOQ3VFBJA4HKI74JMZ6XI","short_pith_number":"pith:IZ726JOQ","schema_version":"1.0","canonical_sha256":"467faf25d0dd4a148387523fc4b33eba0df4545086213a9e270c9dcf89364021","source":{"kind":"arxiv","id":"1805.06872","version":2},"attestation_state":"computed","paper":{"title":"Coding for Interactive Communication with Small Memory and Applications to Robust Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Nicolas Resch","submitted_at":"2018-05-17T17:26:53Z","abstract_excerpt":"Classically, coding theory has been concerned with the problem of transmitting a single message in a format which is robust to noise. Recently, researchers have turned their attention to designing coding schemes to make two-way conversations robust to noise. That is, given an interactive communication protocol $\\Pi$, an \\emph{interactive coding scheme} converts $\\Pi$ into another communication protocol $\\Pi'$ such that, even if errors are introduced during the execution of $\\Pi'$, the parties are able to determine what the outcome of running $\\Pi$ would be in a noise-free setting.\n  We conside"},"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":"1805.06872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T17:26:53Z","cross_cats_sorted":[],"title_canon_sha256":"b59293195860cd8ae9aa72e540d27aa80f69408db91130eb347e32a3c55234b2","abstract_canon_sha256":"a18d009a9f69a92a2e8ec2a94dbead95da18bec4faa2380e5bcfbcefc5ccfb41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:41.810781Z","signature_b64":"EOHUHUTdRmmZkSU/RuAwuEJ18aem3ttDKJ5COCpSW8GoOcan1hgMxNwzgE+nwqase1AGIv/T2dgNyFCA9kc/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467faf25d0dd4a148387523fc4b33eba0df4545086213a9e270c9dcf89364021","last_reissued_at":"2026-05-17T23:39:41.810043Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:41.810043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding for Interactive Communication with Small Memory and Applications to Robust Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Nicolas Resch","submitted_at":"2018-05-17T17:26:53Z","abstract_excerpt":"Classically, coding theory has been concerned with the problem of transmitting a single message in a format which is robust to noise. Recently, researchers have turned their attention to designing coding schemes to make two-way conversations robust to noise. That is, given an interactive communication protocol $\\Pi$, an \\emph{interactive coding scheme} converts $\\Pi$ into another communication protocol $\\Pi'$ such that, even if errors are introduced during the execution of $\\Pi'$, the parties are able to determine what the outcome of running $\\Pi$ would be in a noise-free setting.\n  We conside"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06872","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.06872","created_at":"2026-05-17T23:39:41.810168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06872v2","created_at":"2026-05-17T23:39:41.810168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06872","created_at":"2026-05-17T23:39:41.810168+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZ726JOQ3VFB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZ726JOQ3VFBJA4H","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZ726JOQ","created_at":"2026-05-18T12:32:31.084164+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/IZ726JOQ3VFBJA4HKI74JMZ6XI","json":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI.json","graph_json":"https://pith.science/api/pith-number/IZ726JOQ3VFBJA4HKI74JMZ6XI/graph.json","events_json":"https://pith.science/api/pith-number/IZ726JOQ3VFBJA4HKI74JMZ6XI/events.json","paper":"https://pith.science/paper/IZ726JOQ"},"agent_actions":{"view_html":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI","download_json":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI.json","view_paper":"https://pith.science/paper/IZ726JOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06872&json=true","fetch_graph":"https://pith.science/api/pith-number/IZ726JOQ3VFBJA4HKI74JMZ6XI/graph.json","fetch_events":"https://pith.science/api/pith-number/IZ726JOQ3VFBJA4HKI74JMZ6XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/action/storage_attestation","attest_author":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/action/author_attestation","sign_citation":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/action/citation_signature","submit_replication":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/action/replication_record"}},"created_at":"2026-05-17T23:39:41.810168+00:00","updated_at":"2026-05-17T23:39:41.810168+00:00"}