{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D2YGF6OGPRAPQJLH2S2TB74XJK","short_pith_number":"pith:D2YGF6OG","canonical_record":{"source":{"id":"1412.8097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T02:02:03Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"920fe6681cae5dcca494ae4e76fb51f9368b407622ddfe9cb5f55703a8ae391a","abstract_canon_sha256":"99c67ef3bccf72107714aa28831d43cdab09c13289992eeb7090fb46699cc391"},"schema_version":"1.0"},"canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","source":{"kind":"arxiv","id":"1412.8097","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8097","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8097v2","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8097","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"D2YGF6OGPRAP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D2YGF6OGPRAPQJLH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D2YGF6OG","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D2YGF6OGPRAPQJLH2S2TB74XJK","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T02:02:03Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"920fe6681cae5dcca494ae4e76fb51f9368b407622ddfe9cb5f55703a8ae391a","abstract_canon_sha256":"99c67ef3bccf72107714aa28831d43cdab09c13289992eeb7090fb46699cc391"},"schema_version":"1.0"},"canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:33.298584Z","signature_b64":"bJTRw3DHpe6i0h+6D7MbSCJbOyGzXILQJP0Q5ohHnpA5gEbi+sZ0DKqKlz5WAy7skLmKKQGGNm0pzam68RX/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","last_reissued_at":"2026-05-18T02:17:33.297918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:33.297918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8097","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:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXniGMFuwSdZuNhveLde9p1tVWVvyCRgAQMTV8Y+V8B8aloy+ddW3uw+dvZDGR+PrF3mdO1umwYZposJplz3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:11:12.986005Z"},"content_sha256":"160fdf4c69cb2d0513cdcbe470116384f30edef499e39c5467337d3e3b8ff3c6","schema_version":"1.0","event_id":"sha256:160fdf4c69cb2d0513cdcbe470116384f30edef499e39c5467337d3e3b8ff3c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D2YGF6OGPRAPQJLH2S2TB74XJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Adversarial Noise Threshold for Distributed Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Leonard J. Schulman, William M. Hoza","submitted_at":"2014-12-28T02:02:03Z","abstract_excerpt":"We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology.\n  In our first result we show that any $n$-party $T$-round protocol on an undirected communication network $G$ can be compiled into a robust simulation protocol on a sparse ($\\mathcal{O}(n)$ edges) subnetwork so that the simulation tolerates an adversarial error rate of $\\Omega\\left(\\frac{1}{n}\\right)$; the simulation has a round complexity of $\\mathcal{O}\\left(\\frac{m \\log n}{n} T\\right)$, where $m$ is the number of edges in $G$. (So the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8097","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:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzEO4eH8jOmWMNjyxMCPuhO9EMGptvuCpLjFwBNp664mCo2V35z3qtgrXxhUe/6gEjGKgJPf7+Ba48STeMQoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:11:12.986366Z"},"content_sha256":"441ffa4fe3dbec8eb7598b41a64b5c2660f83b88161305eff9573f794ea02952","schema_version":"1.0","event_id":"sha256:441ffa4fe3dbec8eb7598b41a64b5c2660f83b88161305eff9573f794ea02952"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/bundle.json","state_url":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/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-24T04:11:12Z","links":{"resolver":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK","bundle":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/bundle.json","state":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D2YGF6OGPRAPQJLH2S2TB74XJK","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":"99c67ef3bccf72107714aa28831d43cdab09c13289992eeb7090fb46699cc391","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T02:02:03Z","title_canon_sha256":"920fe6681cae5dcca494ae4e76fb51f9368b407622ddfe9cb5f55703a8ae391a"},"schema_version":"1.0","source":{"id":"1412.8097","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8097","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8097v2","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8097","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"D2YGF6OGPRAP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D2YGF6OGPRAPQJLH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D2YGF6OG","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:441ffa4fe3dbec8eb7598b41a64b5c2660f83b88161305eff9573f794ea02952","target":"graph","created_at":"2026-05-18T02:17:33Z","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 implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology.\n  In our first result we show that any $n$-party $T$-round protocol on an undirected communication network $G$ can be compiled into a robust simulation protocol on a sparse ($\\mathcal{O}(n)$ edges) subnetwork so that the simulation tolerates an adversarial error rate of $\\Omega\\left(\\frac{1}{n}\\right)$; the simulation has a round complexity of $\\mathcal{O}\\left(\\frac{m \\log n}{n} T\\right)$, where $m$ is the number of edges in $G$. (So the","authors_text":"Leonard J. Schulman, William M. Hoza","cross_cats":["cs.DC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T02:02:03Z","title":"The Adversarial Noise Threshold for Distributed Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8097","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:160fdf4c69cb2d0513cdcbe470116384f30edef499e39c5467337d3e3b8ff3c6","target":"record","created_at":"2026-05-18T02:17:33Z","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":"99c67ef3bccf72107714aa28831d43cdab09c13289992eeb7090fb46699cc391","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T02:02:03Z","title_canon_sha256":"920fe6681cae5dcca494ae4e76fb51f9368b407622ddfe9cb5f55703a8ae391a"},"schema_version":"1.0","source":{"id":"1412.8097","kind":"arxiv","version":2}},"canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","first_computed_at":"2026-05-18T02:17:33.297918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:33.297918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bJTRw3DHpe6i0h+6D7MbSCJbOyGzXILQJP0Q5ohHnpA5gEbi+sZ0DKqKlz5WAy7skLmKKQGGNm0pzam68RX/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:33.298584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8097","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:160fdf4c69cb2d0513cdcbe470116384f30edef499e39c5467337d3e3b8ff3c6","sha256:441ffa4fe3dbec8eb7598b41a64b5c2660f83b88161305eff9573f794ea02952"],"state_sha256":"03cff00892225964110901804cf7b190e00c45bc164113a3af23520aa22b8fec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoXrzafaN+fBsTZggN21s1qcGH6tcVG95k9C5V/aUL4ejROhXC1CsgYc9WzOdkO5e6sdHgob8OdUErlphHyBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:11:12.988424Z","bundle_sha256":"c6678d84d77fcf1d30ef1b94cacd9364ef52216fe6bdc53c9b93d6c5baf76531"}}