{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3LQRMNBDQC7N6A7AFCUYAFC6FD","short_pith_number":"pith:3LQRMNBD","canonical_record":{"source":{"id":"1501.00624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-04T02:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"e92ca2cc8e8569eb2faad010a6053fce48cce7bd4439564ad703842eb4ddb225","abstract_canon_sha256":"ceb993e9c57348ab39f28639e0f85602d63d194ce2e81867706ccefd321b340f"},"schema_version":"1.0"},"canonical_sha256":"dae116342380bedf03e028a980145e28e49c1fd1314eeff59e4c0caa23b440ad","source":{"kind":"arxiv","id":"1501.00624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00624","created_at":"2026-05-18T02:30:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00624v1","created_at":"2026-05-18T02:30:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00624","created_at":"2026-05-18T02:30:02Z"},{"alias_kind":"pith_short_12","alias_value":"3LQRMNBDQC7N","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3LQRMNBDQC7N6A7A","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3LQRMNBD","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3LQRMNBDQC7N6A7AFCUYAFC6FD","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-04T02:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"e92ca2cc8e8569eb2faad010a6053fce48cce7bd4439564ad703842eb4ddb225","abstract_canon_sha256":"ceb993e9c57348ab39f28639e0f85602d63d194ce2e81867706ccefd321b340f"},"schema_version":"1.0"},"canonical_sha256":"dae116342380bedf03e028a980145e28e49c1fd1314eeff59e4c0caa23b440ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:02.118478Z","signature_b64":"btThnneBAaRzmrDnNs+OCVpkxp3b/FM+RlLDZxgvH4H7PWSpHxzx+s+UY0l9Y3ErQD0eAMONqNWroc3nPEJAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dae116342380bedf03e028a980145e28e49c1fd1314eeff59e4c0caa23b440ad","last_reissued_at":"2026-05-18T02:30:02.118047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:02.118047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00624","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:30:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ac5aiDhpaf5ZkAbjcqzmXytH/fhLWcMi43onh/TGFQVqZsJXDTFDd4hzKbprDP6OeBJ93dtDq6qWWJXXnFjpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:11:25.521099Z"},"content_sha256":"f37557c35bcb2816d5260a8c1888c8a04489563dae1e231876425e45081b4cde","schema_version":"1.0","event_id":"sha256:f37557c35bcb2816d5260a8c1888c8a04489563dae1e231876425e45081b4cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3LQRMNBDQC7N6A7AFCUYAFC6FD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Klim Efremenko, Ran Gelles","submitted_at":"2015-01-04T02:14:44Z","abstract_excerpt":"We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3. Additionally, we provide a simple and efficient robust protocol that succeeds as long as the fraction of noise is at most 1/3 - \\epsilon. Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider interactive communication over erasure channels. We provide a protocol that matches the opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00624","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:30:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aV9UWNVtesiS9m2tG6kFbSePDMP6UvH0u/21t9W3AR7jj6GqaNcZYIj6MfgnGgm24qQ1lU0aRWqmzln5nQAPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:11:25.521728Z"},"content_sha256":"a5dc3bcd463c11de4151dca1fc0d12cd753261e88d8fa043577b4b46baa8ea7a","schema_version":"1.0","event_id":"sha256:a5dc3bcd463c11de4151dca1fc0d12cd753261e88d8fa043577b4b46baa8ea7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD/bundle.json","state_url":"https://pith.science/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD/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-05-29T21:11:25Z","links":{"resolver":"https://pith.science/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD","bundle":"https://pith.science/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD/bundle.json","state":"https://pith.science/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LQRMNBDQC7N6A7AFCUYAFC6FD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3LQRMNBDQC7N6A7AFCUYAFC6FD","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":"ceb993e9c57348ab39f28639e0f85602d63d194ce2e81867706ccefd321b340f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-04T02:14:44Z","title_canon_sha256":"e92ca2cc8e8569eb2faad010a6053fce48cce7bd4439564ad703842eb4ddb225"},"schema_version":"1.0","source":{"id":"1501.00624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00624","created_at":"2026-05-18T02:30:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00624v1","created_at":"2026-05-18T02:30:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00624","created_at":"2026-05-18T02:30:02Z"},{"alias_kind":"pith_short_12","alias_value":"3LQRMNBDQC7N","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3LQRMNBDQC7N6A7A","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3LQRMNBD","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:a5dc3bcd463c11de4151dca1fc0d12cd753261e88d8fa043577b4b46baa8ea7a","target":"graph","created_at":"2026-05-18T02:30:02Z","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 provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3. Additionally, we provide a simple and efficient robust protocol that succeeds as long as the fraction of noise is at most 1/3 - \\epsilon. Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider interactive communication over erasure channels. We provide a protocol that matches the opt","authors_text":"Bernhard Haeupler, Klim Efremenko, Ran Gelles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-04T02:14:44Z","title":"Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00624","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:f37557c35bcb2816d5260a8c1888c8a04489563dae1e231876425e45081b4cde","target":"record","created_at":"2026-05-18T02:30:02Z","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":"ceb993e9c57348ab39f28639e0f85602d63d194ce2e81867706ccefd321b340f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-04T02:14:44Z","title_canon_sha256":"e92ca2cc8e8569eb2faad010a6053fce48cce7bd4439564ad703842eb4ddb225"},"schema_version":"1.0","source":{"id":"1501.00624","kind":"arxiv","version":1}},"canonical_sha256":"dae116342380bedf03e028a980145e28e49c1fd1314eeff59e4c0caa23b440ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dae116342380bedf03e028a980145e28e49c1fd1314eeff59e4c0caa23b440ad","first_computed_at":"2026-05-18T02:30:02.118047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:02.118047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btThnneBAaRzmrDnNs+OCVpkxp3b/FM+RlLDZxgvH4H7PWSpHxzx+s+UY0l9Y3ErQD0eAMONqNWroc3nPEJAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:02.118478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f37557c35bcb2816d5260a8c1888c8a04489563dae1e231876425e45081b4cde","sha256:a5dc3bcd463c11de4151dca1fc0d12cd753261e88d8fa043577b4b46baa8ea7a"],"state_sha256":"ee347a5dbe0a1bf32f1a8f4fa268e0334bccc87834430e40dc0f343ae58b03bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbgohNfjqOySI6fWFvrFEcaSRIJ5SKUL6M6fNbAk8xM7kfIDgTAucWcnGxPIeQmBh7h1Ozhtdjx9i/JYuWkwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:11:25.525295Z","bundle_sha256":"a98e4c8fd2a6a63eb742a1103bf60c052d6f39af6784e1d29f4af171e690f5b9"}}