{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YL3ZYSR2SLJBMVHKGUSOKZADMX","short_pith_number":"pith:YL3ZYSR2","schema_version":"1.0","canonical_sha256":"c2f79c4a3a92d21654ea3524e5640365fd07188ca8b0f79058202aaf99ba90b9","source":{"kind":"arxiv","id":"1504.06316","version":2},"attestation_state":"computed","paper":{"title":"Interactive Communication with Unknown Noise Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Maxwell Young, Thomas P. Hayes, Varsha Dani","submitted_at":"2015-04-23T19:57:46Z","abstract_excerpt":"Alice and Bob want to run a protocol over a noisy channel, where a certain number of bits are flipped adversarially. Several results take a protocol requiring $L$ bits of noise-free communication and make it robust over such a channel. In a recent breakthrough result, Haeupler described an algorithm that sends a number of bits that is conjectured to be near optimal in such a model. However, his algorithm critically requires $a \\ priori$ knowledge of the number of bits that will be flipped by the adversary.\n  We describe an algorithm requiring no such knowledge. If an adversary flips $T$ bits, "},"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":"1504.06316","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-23T19:57:46Z","cross_cats_sorted":["cs.DC","cs.IT","cs.NI","math.IT"],"title_canon_sha256":"89795a61112cf41408359c951b59babc9ebc0e02ccbd1ed4a59df4f1f8fa5fcd","abstract_canon_sha256":"c5e67e56cba4cca57dfa9b0dbfe0f0dc9c851d05280030a9c5a3ebc1abf24c3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:20.180479Z","signature_b64":"GAZDvHfjOtIAe9q3h9yyOIenTRdc5VdI7NfS84m1Mvoo7cvCAXm+lJZ18FMWBli9xTfWw87B5UqpI9mxwZ0tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f79c4a3a92d21654ea3524e5640365fd07188ca8b0f79058202aaf99ba90b9","last_reissued_at":"2026-05-18T01:35:20.179771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:20.179771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Communication with Unknown Noise Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Maxwell Young, Thomas P. Hayes, Varsha Dani","submitted_at":"2015-04-23T19:57:46Z","abstract_excerpt":"Alice and Bob want to run a protocol over a noisy channel, where a certain number of bits are flipped adversarially. Several results take a protocol requiring $L$ bits of noise-free communication and make it robust over such a channel. In a recent breakthrough result, Haeupler described an algorithm that sends a number of bits that is conjectured to be near optimal in such a model. However, his algorithm critically requires $a \\ priori$ knowledge of the number of bits that will be flipped by the adversary.\n  We describe an algorithm requiring no such knowledge. If an adversary flips $T$ bits, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06316","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":"1504.06316","created_at":"2026-05-18T01:35:20.179880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06316v2","created_at":"2026-05-18T01:35:20.179880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06316","created_at":"2026-05-18T01:35:20.179880+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL3ZYSR2SLJB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL3ZYSR2SLJBMVHK","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL3ZYSR2","created_at":"2026-05-18T12:29:50.041715+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/YL3ZYSR2SLJBMVHKGUSOKZADMX","json":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX.json","graph_json":"https://pith.science/api/pith-number/YL3ZYSR2SLJBMVHKGUSOKZADMX/graph.json","events_json":"https://pith.science/api/pith-number/YL3ZYSR2SLJBMVHKGUSOKZADMX/events.json","paper":"https://pith.science/paper/YL3ZYSR2"},"agent_actions":{"view_html":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX","download_json":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX.json","view_paper":"https://pith.science/paper/YL3ZYSR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06316&json=true","fetch_graph":"https://pith.science/api/pith-number/YL3ZYSR2SLJBMVHKGUSOKZADMX/graph.json","fetch_events":"https://pith.science/api/pith-number/YL3ZYSR2SLJBMVHKGUSOKZADMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX/action/storage_attestation","attest_author":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX/action/author_attestation","sign_citation":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX/action/citation_signature","submit_replication":"https://pith.science/pith/YL3ZYSR2SLJBMVHKGUSOKZADMX/action/replication_record"}},"created_at":"2026-05-18T01:35:20.179880+00:00","updated_at":"2026-05-18T01:35:20.179880+00:00"}