{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F2HWNKOE3YUWSH7XLEAICSCYHU","short_pith_number":"pith:F2HWNKOE","schema_version":"1.0","canonical_sha256":"2e8f66a9c4de29691ff759008148583d3718480a4fcd29e290f189f067424d61","source":{"kind":"arxiv","id":"2501.00337","version":1},"attestation_state":"computed","paper":{"title":"Constant Degree Networks for Almost-Everywhere Reliable Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.DC","authors_text":"Dor Minzer, Mitali Bafna","submitted_at":"2024-12-31T08:18:28Z","abstract_excerpt":"In the almost-everywhere reliable message transmission problem, introduced by [Dwork, Pippenger, Peleg, Upfal'86], the goal is to design a sparse communication network $G$ that supports efficient, fault-tolerant protocols for interactions between all node pairs. By fault-tolerant, we mean that that even if an adversary corrupts a small fraction of vertices in $G$, then all but a small fraction of vertices can still communicate perfectly via the constructed protocols. Being successful to do so allows one to simulate, on a sparse graph, any fault-tolerant distributed computing task and secure mu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.00337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-12-31T08:18:28Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"4c8780c6aea9a360676691e3d63ecd8785e62eee0237c6760ed6b9dff13e7bea","abstract_canon_sha256":"5c325bb9d339771d89f76aa2b9a4d7f6e54e0cf468376ccddc5a186c82d5e5c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:43.275376Z","signature_b64":"+fw5xUhI5+Ipn6BGjm1khPST0xaB4KqXfN9MWu8V79bC3yTVCAwcfcG7tOeeEJxyf3XCFScPP+zi3mBQSq20Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e8f66a9c4de29691ff759008148583d3718480a4fcd29e290f189f067424d61","last_reissued_at":"2026-07-05T09:55:43.274962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:43.274962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Degree Networks for Almost-Everywhere Reliable Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.DC","authors_text":"Dor Minzer, Mitali Bafna","submitted_at":"2024-12-31T08:18:28Z","abstract_excerpt":"In the almost-everywhere reliable message transmission problem, introduced by [Dwork, Pippenger, Peleg, Upfal'86], the goal is to design a sparse communication network $G$ that supports efficient, fault-tolerant protocols for interactions between all node pairs. By fault-tolerant, we mean that that even if an adversary corrupts a small fraction of vertices in $G$, then all but a small fraction of vertices can still communicate perfectly via the constructed protocols. Being successful to do so allows one to simulate, on a sparse graph, any fault-tolerant distributed computing task and secure mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00337","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.00337/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.00337","created_at":"2026-07-05T09:55:43.275018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00337v1","created_at":"2026-07-05T09:55:43.275018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00337","created_at":"2026-07-05T09:55:43.275018+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2HWNKOE3YUW","created_at":"2026-07-05T09:55:43.275018+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2HWNKOE3YUWSH7X","created_at":"2026-07-05T09:55:43.275018+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2HWNKOE","created_at":"2026-07-05T09:55:43.275018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05735","citing_title":"All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU","json":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU.json","graph_json":"https://pith.science/api/pith-number/F2HWNKOE3YUWSH7XLEAICSCYHU/graph.json","events_json":"https://pith.science/api/pith-number/F2HWNKOE3YUWSH7XLEAICSCYHU/events.json","paper":"https://pith.science/paper/F2HWNKOE"},"agent_actions":{"view_html":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU","download_json":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU.json","view_paper":"https://pith.science/paper/F2HWNKOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00337&json=true","fetch_graph":"https://pith.science/api/pith-number/F2HWNKOE3YUWSH7XLEAICSCYHU/graph.json","fetch_events":"https://pith.science/api/pith-number/F2HWNKOE3YUWSH7XLEAICSCYHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU/action/storage_attestation","attest_author":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU/action/author_attestation","sign_citation":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU/action/citation_signature","submit_replication":"https://pith.science/pith/F2HWNKOE3YUWSH7XLEAICSCYHU/action/replication_record"}},"created_at":"2026-07-05T09:55:43.275018+00:00","updated_at":"2026-07-05T09:55:43.275018+00:00"}