{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PD7YKGFEMVSJU7QDKJICBNPOQC","short_pith_number":"pith:PD7YKGFE","canonical_record":{"source":{"id":"1702.07403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-23T21:49:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5f42f38a271484ab1586153bdc3e3ac5a26ed0bf86f9dfa5a2700777a42b192d","abstract_canon_sha256":"cfc4c4f7d16d4f34a5897544f490e89b805bcb1a2f51ecb744d79edf09037517"},"schema_version":"1.0"},"canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","source":{"kind":"arxiv","id":"1702.07403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07403","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07403v1","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07403","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"PD7YKGFEMVSJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PD7YKGFEMVSJU7QD","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PD7YKGFE","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PD7YKGFEMVSJU7QDKJICBNPOQC","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-23T21:49:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5f42f38a271484ab1586153bdc3e3ac5a26ed0bf86f9dfa5a2700777a42b192d","abstract_canon_sha256":"cfc4c4f7d16d4f34a5897544f490e89b805bcb1a2f51ecb744d79edf09037517"},"schema_version":"1.0"},"canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.489718Z","signature_b64":"q3cWM/ve/AttAfqaSLAFMIEoATCCQ+oYYcgrN4ibs7QMKjIS8BQAfSjfT4J006EAuZe8qjJkBrc2l35XqG5yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","last_reissued_at":"2026-05-18T00:50:03.489013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.489013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07403","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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"On8rVymMUuOYXUjqXLk0ZFA4LkVsicnqs5YarFSBrrqES/8FORDKV9cyT8NjZ2Z+MKbGkiS3IZZepIdhsIlGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:31:52.449042Z"},"content_sha256":"0ef16c1e7058dba80775354cfd5a65104ae99cb24980be42f0ee092f287a307c","schema_version":"1.0","event_id":"sha256:0ef16c1e7058dba80775354cfd5a65104ae99cb24980be42f0ee092f287a307c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PD7YKGFEMVSJU7QDKJICBNPOQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making Asynchronous Distributed Computations Robust to Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Keren Censor-Hillel, Ran Gelles","submitted_at":"2017-02-23T21:49:52Z","abstract_excerpt":"We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $\\Theta(1/n)$ fraction of all messages while incurring a moderate blowup of $O(n\\log^2 n)$ in the communication complexity.\n  Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07403","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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XoPT/++9L7CVHo0q619CKAXVJ9SaUjmiKtNh/6HDp2Z327cEDNyeLTHOCbhvgLFsetF3mRZeY+oafUIDBmKlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:31:52.449672Z"},"content_sha256":"03d1bf370683c3fc3ab7cc9db8ea59a3e694ebbc04011157485fcbae1fad30a8","schema_version":"1.0","event_id":"sha256:03d1bf370683c3fc3ab7cc9db8ea59a3e694ebbc04011157485fcbae1fad30a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/bundle.json","state_url":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/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-01T07:31:52Z","links":{"resolver":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC","bundle":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/bundle.json","state":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PD7YKGFEMVSJU7QDKJICBNPOQC","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":"cfc4c4f7d16d4f34a5897544f490e89b805bcb1a2f51ecb744d79edf09037517","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-23T21:49:52Z","title_canon_sha256":"5f42f38a271484ab1586153bdc3e3ac5a26ed0bf86f9dfa5a2700777a42b192d"},"schema_version":"1.0","source":{"id":"1702.07403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07403","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07403v1","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07403","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"PD7YKGFEMVSJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PD7YKGFEMVSJU7QD","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PD7YKGFE","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:03d1bf370683c3fc3ab7cc9db8ea59a3e694ebbc04011157485fcbae1fad30a8","target":"graph","created_at":"2026-05-18T00:50:03Z","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 consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $\\Theta(1/n)$ fraction of all messages while incurring a moderate blowup of $O(n\\log^2 n)$ in the communication complexity.\n  Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coor","authors_text":"Bernhard Haeupler, Keren Censor-Hillel, Ran Gelles","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-23T21:49:52Z","title":"Making Asynchronous Distributed Computations Robust to Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07403","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:0ef16c1e7058dba80775354cfd5a65104ae99cb24980be42f0ee092f287a307c","target":"record","created_at":"2026-05-18T00:50:03Z","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":"cfc4c4f7d16d4f34a5897544f490e89b805bcb1a2f51ecb744d79edf09037517","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-23T21:49:52Z","title_canon_sha256":"5f42f38a271484ab1586153bdc3e3ac5a26ed0bf86f9dfa5a2700777a42b192d"},"schema_version":"1.0","source":{"id":"1702.07403","kind":"arxiv","version":1}},"canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","first_computed_at":"2026-05-18T00:50:03.489013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:03.489013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q3cWM/ve/AttAfqaSLAFMIEoATCCQ+oYYcgrN4ibs7QMKjIS8BQAfSjfT4J006EAuZe8qjJkBrc2l35XqG5yBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:03.489718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ef16c1e7058dba80775354cfd5a65104ae99cb24980be42f0ee092f287a307c","sha256:03d1bf370683c3fc3ab7cc9db8ea59a3e694ebbc04011157485fcbae1fad30a8"],"state_sha256":"695dbfd0f10a727c88e7ba0355dfe6b5a2ae6ccfb1ecc49cad4be2a3eeea44e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0wd5bhWBWVEnxDaw4a7Uvj+xvoWWrAbRtNshpZHGD3L3GRMERlUtV8cUhqGgM3ti1l870/0hh4PG2MdNpjnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:31:52.452640Z","bundle_sha256":"410e7959129f29882e885cd4dd6bb31747d2ed9b3f39d3a3036cd6a7c8006370"}}