{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MOWYEI7HMNIBE3KONB3E767YMG","short_pith_number":"pith:MOWYEI7H","canonical_record":{"source":{"id":"1312.1763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T04:18:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a28913cf9cc569eb0371146093764347b36505b1257346e16262a3144c83db8c","abstract_canon_sha256":"649a630fb50d7d5f54c44639ec5eab3417cc61ff3a55547e1a5e79d62c69ea92"},"schema_version":"1.0"},"canonical_sha256":"63ad8223e76350126d4e68764ffbf86194e500807d844ace480a7835db17455b","source":{"kind":"arxiv","id":"1312.1763","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1763","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1763v2","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1763","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"MOWYEI7HMNIB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOWYEI7HMNIBE3KO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOWYEI7H","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MOWYEI7HMNIBE3KONB3E767YMG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T04:18:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a28913cf9cc569eb0371146093764347b36505b1257346e16262a3144c83db8c","abstract_canon_sha256":"649a630fb50d7d5f54c44639ec5eab3417cc61ff3a55547e1a5e79d62c69ea92"},"schema_version":"1.0"},"canonical_sha256":"63ad8223e76350126d4e68764ffbf86194e500807d844ace480a7835db17455b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:06.944258Z","signature_b64":"ZLZXoJlw+aByKTxPPGe3PpGB0hPdS/vidlb80CHJ5Pl4gt30yDAXbTCow0GX39RBBj1JgvsWSQZ9wgtGvC8cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63ad8223e76350126d4e68764ffbf86194e500807d844ace480a7835db17455b","last_reissued_at":"2026-05-18T02:54:06.943672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:06.943672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1763","source_version":2,"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:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLafBZvvvqsojVGfj5edXu8zkaAWPQ2slQusKb2y8STFAO8Gm6iIVHxub6lw3vxAhUReVHr6D51P8z4jposaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:09:30.554810Z"},"content_sha256":"fddd49b1f8a0bf9665522c2d15ed2f1d316c71d5e94a37f0782a4fe21615819f","schema_version":"1.0","event_id":"sha256:fddd49b1f8a0bf9665522c2d15ed2f1d316c71d5e94a37f0782a4fe21615819f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MOWYEI7HMNIBE3KONB3E767YMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Mohsen Ghaffari","submitted_at":"2013-12-06T04:18:55Z","abstract_excerpt":"We study coding schemes for error correction in interactive communications. Such interactive coding schemes simulate any $n$-round interactive protocol using $N$ rounds over an adversarial channel that corrupts up to $\\rho N$ transmissions. Important performance measures for a coding scheme are its maximum tolerable error rate $\\rho$, communication complexity $N$, and computational complexity.\n  We give the first coding scheme for the standard setting which performs optimally in all three measures: Our randomized non-adaptive coding scheme has a near-linear computational complexity and tolerat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1763","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"},"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:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmM8nBM8zhsJ+iR0s1Iki9afcONup8YVsuhpnoTluecbNj2hBmKnGIYhQCFBYiiyWzWH881LGXmEBi6x5WyQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:09:30.555485Z"},"content_sha256":"639fa517b238a4744f50770aa4cef4a4b0eb4e50fb3663f160b8da61cc271d76","schema_version":"1.0","event_id":"sha256:639fa517b238a4744f50770aa4cef4a4b0eb4e50fb3663f160b8da61cc271d76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOWYEI7HMNIBE3KONB3E767YMG/bundle.json","state_url":"https://pith.science/pith/MOWYEI7HMNIBE3KONB3E767YMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOWYEI7HMNIBE3KONB3E767YMG/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-04T06:09:30Z","links":{"resolver":"https://pith.science/pith/MOWYEI7HMNIBE3KONB3E767YMG","bundle":"https://pith.science/pith/MOWYEI7HMNIBE3KONB3E767YMG/bundle.json","state":"https://pith.science/pith/MOWYEI7HMNIBE3KONB3E767YMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOWYEI7HMNIBE3KONB3E767YMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MOWYEI7HMNIBE3KONB3E767YMG","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":"649a630fb50d7d5f54c44639ec5eab3417cc61ff3a55547e1a5e79d62c69ea92","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T04:18:55Z","title_canon_sha256":"a28913cf9cc569eb0371146093764347b36505b1257346e16262a3144c83db8c"},"schema_version":"1.0","source":{"id":"1312.1763","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1763","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1763v2","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1763","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"MOWYEI7HMNIB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOWYEI7HMNIBE3KO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOWYEI7H","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:639fa517b238a4744f50770aa4cef4a4b0eb4e50fb3663f160b8da61cc271d76","target":"graph","created_at":"2026-05-18T02:54:06Z","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 study coding schemes for error correction in interactive communications. Such interactive coding schemes simulate any $n$-round interactive protocol using $N$ rounds over an adversarial channel that corrupts up to $\\rho N$ transmissions. Important performance measures for a coding scheme are its maximum tolerable error rate $\\rho$, communication complexity $N$, and computational complexity.\n  We give the first coding scheme for the standard setting which performs optimally in all three measures: Our randomized non-adaptive coding scheme has a near-linear computational complexity and tolerat","authors_text":"Bernhard Haeupler, Mohsen Ghaffari","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T04:18:55Z","title":"Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1763","kind":"arxiv","version":2},"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:fddd49b1f8a0bf9665522c2d15ed2f1d316c71d5e94a37f0782a4fe21615819f","target":"record","created_at":"2026-05-18T02:54:06Z","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":"649a630fb50d7d5f54c44639ec5eab3417cc61ff3a55547e1a5e79d62c69ea92","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T04:18:55Z","title_canon_sha256":"a28913cf9cc569eb0371146093764347b36505b1257346e16262a3144c83db8c"},"schema_version":"1.0","source":{"id":"1312.1763","kind":"arxiv","version":2}},"canonical_sha256":"63ad8223e76350126d4e68764ffbf86194e500807d844ace480a7835db17455b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63ad8223e76350126d4e68764ffbf86194e500807d844ace480a7835db17455b","first_computed_at":"2026-05-18T02:54:06.943672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:06.943672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLZXoJlw+aByKTxPPGe3PpGB0hPdS/vidlb80CHJ5Pl4gt30yDAXbTCow0GX39RBBj1JgvsWSQZ9wgtGvC8cCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:06.944258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1763","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fddd49b1f8a0bf9665522c2d15ed2f1d316c71d5e94a37f0782a4fe21615819f","sha256:639fa517b238a4744f50770aa4cef4a4b0eb4e50fb3663f160b8da61cc271d76"],"state_sha256":"1b6a573d3975932f0e8f53d817f19723c9187c89006b95353d3479df3b33d608"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iv3HGSJFqrFQUaVyMCk/xFUqU18NQJs/cNUwGehLc04oUY6mQXwv7JxtvEX7HoWCAhyJeEY3n9rTSAhrOvpkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:09:30.558938Z","bundle_sha256":"e0c270764b565ba2440b85d5245eaa6bb10412cb4e146b30ab18fa4747b3b233"}}