{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IZ726JOQ3VFBJA4HKI74JMZ6XI","short_pith_number":"pith:IZ726JOQ","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"},"canonical_sha256":"467faf25d0dd4a148387523fc4b33eba0df4545086213a9e270c9dcf89364021","source":{"kind":"arxiv","id":"1805.06872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06872","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06872v2","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06872","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"IZ726JOQ3VFB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZ726JOQ3VFBJA4H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZ726JOQ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IZ726JOQ3VFBJA4HKI74JMZ6XI","target":"record","payload":{"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"},"canonical_sha256":"467faf25d0dd4a148387523fc4b33eba0df4545086213a9e270c9dcf89364021","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"},"source_kind":"arxiv","source_id":"1805.06872","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-17T23:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+vfgOZDsqF546EybLi/m0423FBzt4+JV5CaCnPXMeqogZUNZ1BWPxudIMy2gmj/aFzZDKhYePQOVwJ5wgXNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:07:26.013856Z"},"content_sha256":"69b17079a7b1ea3f6110b7ae1d7306a9d0af2353cff8d1f0267c686f63e56439","schema_version":"1.0","event_id":"sha256:69b17079a7b1ea3f6110b7ae1d7306a9d0af2353cff8d1f0267c686f63e56439"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IZ726JOQ3VFBJA4HKI74JMZ6XI","target":"graph","payload":{"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"},"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-17T23:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMjXOnDjRpTJr2vGlbMaNH5sZMTKo+w7X2N1u+JBxSKnArnmxtS912wwvlpBIodFQtk39RAGTzv3DIhcOOGhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:07:26.014210Z"},"content_sha256":"e69b93f782feb9d2981774fe54ec202a30b794c3243c77bc6e819de9f9639cba","schema_version":"1.0","event_id":"sha256:e69b93f782feb9d2981774fe54ec202a30b794c3243c77bc6e819de9f9639cba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/bundle.json","state_url":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/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-26T13:07:26Z","links":{"resolver":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI","bundle":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/bundle.json","state":"https://pith.science/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZ726JOQ3VFBJA4HKI74JMZ6XI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IZ726JOQ3VFBJA4HKI74JMZ6XI","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":"a18d009a9f69a92a2e8ec2a94dbead95da18bec4faa2380e5bcfbcefc5ccfb41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T17:26:53Z","title_canon_sha256":"b59293195860cd8ae9aa72e540d27aa80f69408db91130eb347e32a3c55234b2"},"schema_version":"1.0","source":{"id":"1805.06872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06872","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06872v2","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06872","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"IZ726JOQ3VFB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZ726JOQ3VFBJA4H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZ726JOQ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e69b93f782feb9d2981774fe54ec202a30b794c3243c77bc6e819de9f9639cba","target":"graph","created_at":"2026-05-17T23:39:41Z","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":"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","authors_text":"Bernhard Haeupler, Nicolas Resch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T17:26:53Z","title":"Coding for Interactive Communication with Small Memory and Applications to Robust Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06872","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:69b17079a7b1ea3f6110b7ae1d7306a9d0af2353cff8d1f0267c686f63e56439","target":"record","created_at":"2026-05-17T23:39:41Z","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":"a18d009a9f69a92a2e8ec2a94dbead95da18bec4faa2380e5bcfbcefc5ccfb41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T17:26:53Z","title_canon_sha256":"b59293195860cd8ae9aa72e540d27aa80f69408db91130eb347e32a3c55234b2"},"schema_version":"1.0","source":{"id":"1805.06872","kind":"arxiv","version":2}},"canonical_sha256":"467faf25d0dd4a148387523fc4b33eba0df4545086213a9e270c9dcf89364021","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"467faf25d0dd4a148387523fc4b33eba0df4545086213a9e270c9dcf89364021","first_computed_at":"2026-05-17T23:39:41.810043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:41.810043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOHUHUTdRmmZkSU/RuAwuEJ18aem3ttDKJ5COCpSW8GoOcan1hgMxNwzgE+nwqase1AGIv/T2dgNyFCA9kc/Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:41.810781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69b17079a7b1ea3f6110b7ae1d7306a9d0af2353cff8d1f0267c686f63e56439","sha256:e69b93f782feb9d2981774fe54ec202a30b794c3243c77bc6e819de9f9639cba"],"state_sha256":"5a9531cf7a1d051924df8ef00337d9cb49311b8dad892630f0b666190145d75c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPm5nCXMRfOZ5Bi2tCJgYvycRKk4Dkiao8slJ0CMK53HGgoi9NayPRiCEA0ighovd8/jC/L9/O50KLI1xDLDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:07:26.016142Z","bundle_sha256":"d4e61c5d179df0c3413cdf42557630735119154a5389ee090c24a40f656986c5"}}