{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6GPANTGA2M77Y26INOUVVDZU3P","short_pith_number":"pith:6GPANTGA","canonical_record":{"source":{"id":"1612.05943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-18T16:36:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8fe4691596a93c77a689ee19e122da11ef5c1d9a2f4c755185e18a5baf40ebc8","abstract_canon_sha256":"b4ea463525650756d1bff352aa8bc009bb2fc6311b8fc421978f5b2e1b5f76bb"},"schema_version":"1.0"},"canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","source":{"kind":"arxiv","id":"1612.05943","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05943","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05943v2","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05943","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"6GPANTGA2M77","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GPANTGA2M77Y26I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GPANTGA","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6GPANTGA2M77Y26INOUVVDZU3P","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-18T16:36:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8fe4691596a93c77a689ee19e122da11ef5c1d9a2f4c755185e18a5baf40ebc8","abstract_canon_sha256":"b4ea463525650756d1bff352aa8bc009bb2fc6311b8fc421978f5b2e1b5f76bb"},"schema_version":"1.0"},"canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:39.377722Z","signature_b64":"zRs8avnJtYjYj1poqOyFQVP+B6aVyjYmvvNhd6ZTe75E83yeasvge3MWOcchcnmUF/irHyNTbkpWwO4Sc8l5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","last_reissued_at":"2026-05-18T00:39:39.376987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:39.376987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05943","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-18T00:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoUiIYOiQjeUNnqwglZW5IBFj78owyflI/cuGItWPxrIZj5+CegRaKpRPf436bLsIG9eE6fax5ab7SqqhSgzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:26:50.141616Z"},"content_sha256":"7c792243f435b5d694d9b28c5f80a73532ef8bb3368aa19b94fa41ae481584e5","schema_version":"1.0","event_id":"sha256:7c792243f435b5d694d9b28c5f80a73532ef8bb3368aa19b94fa41ae481584e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6GPANTGA2M77Y26INOUVVDZU3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Computing with Channel Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Abhinav Aggarwal, Jared Saia, Thomas P. Hayes, Varsha Dani","submitted_at":"2016-12-18T16:36:37Z","abstract_excerpt":"A group of $n$ users want to run a distributed protocol $\\pi$ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows $\\pi$, is able to maliciously flip bits on the channels. Can we efficiently simulate $\\pi$ in the presence of such an adversary? We show that this is possible, even when $L$, the number of bits sent in $\\pi$, and $T$, the number of bits flipped by the adversary are not known in advance. In particular, we show how to create a robust version of $\\pi$ that 1) fails with probability at most $\\delta$, for any $\\delta>0$; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05943","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-18T00:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gFdvWabeCRE3Q8K1EB8xbWgoN2if76N7w9fdE5Q6b2HATGMLVFSUpql17N0xxADO9bIyqHmRCiEYMM4Pq65gAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:26:50.142360Z"},"content_sha256":"7efdf8de6ec752cf2e57050a47f26d1318dc940519e5b85945d1ac18aaac0e25","schema_version":"1.0","event_id":"sha256:7efdf8de6ec752cf2e57050a47f26d1318dc940519e5b85945d1ac18aaac0e25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/bundle.json","state_url":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GPANTGA2M77Y26INOUVVDZU3P/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-01T01:26:50Z","links":{"resolver":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P","bundle":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/bundle.json","state":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GPANTGA2M77Y26INOUVVDZU3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6GPANTGA2M77Y26INOUVVDZU3P","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":"b4ea463525650756d1bff352aa8bc009bb2fc6311b8fc421978f5b2e1b5f76bb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-18T16:36:37Z","title_canon_sha256":"8fe4691596a93c77a689ee19e122da11ef5c1d9a2f4c755185e18a5baf40ebc8"},"schema_version":"1.0","source":{"id":"1612.05943","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05943","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05943v2","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05943","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"6GPANTGA2M77","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GPANTGA2M77Y26I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GPANTGA","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7efdf8de6ec752cf2e57050a47f26d1318dc940519e5b85945d1ac18aaac0e25","target":"graph","created_at":"2026-05-18T00:39:39Z","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":"A group of $n$ users want to run a distributed protocol $\\pi$ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows $\\pi$, is able to maliciously flip bits on the channels. Can we efficiently simulate $\\pi$ in the presence of such an adversary? We show that this is possible, even when $L$, the number of bits sent in $\\pi$, and $T$, the number of bits flipped by the adversary are not known in advance. In particular, we show how to create a robust version of $\\pi$ that 1) fails with probability at most $\\delta$, for any $\\delta>0$; ","authors_text":"Abhinav Aggarwal, Jared Saia, Thomas P. Hayes, Varsha Dani","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-18T16:36:37Z","title":"Distributed Computing with Channel Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05943","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:7c792243f435b5d694d9b28c5f80a73532ef8bb3368aa19b94fa41ae481584e5","target":"record","created_at":"2026-05-18T00:39:39Z","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":"b4ea463525650756d1bff352aa8bc009bb2fc6311b8fc421978f5b2e1b5f76bb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-18T16:36:37Z","title_canon_sha256":"8fe4691596a93c77a689ee19e122da11ef5c1d9a2f4c755185e18a5baf40ebc8"},"schema_version":"1.0","source":{"id":"1612.05943","kind":"arxiv","version":2}},"canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","first_computed_at":"2026-05-18T00:39:39.376987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:39.376987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zRs8avnJtYjYj1poqOyFQVP+B6aVyjYmvvNhd6ZTe75E83yeasvge3MWOcchcnmUF/irHyNTbkpWwO4Sc8l5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:39.377722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05943","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c792243f435b5d694d9b28c5f80a73532ef8bb3368aa19b94fa41ae481584e5","sha256:7efdf8de6ec752cf2e57050a47f26d1318dc940519e5b85945d1ac18aaac0e25"],"state_sha256":"ccb385c76e129f3cb986c0893d4c029cb0a43cc5aaf39a68f14f70c975e9b574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TxlZYLPOzvMngKkn1zZx9IeqnBU7fZuVSMhMhXoTOrKw+3qnAPCL3USQA4xwCH74Nk+ikd/8+5JyGJLwBKQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:26:50.145465Z","bundle_sha256":"a7c131ac388bfadcb6c94f2927dc8add9637e3af6167c67f68d8485118cd5197"}}