{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:D2EF7KXHYW57YO54YMYSHS2ZJW","short_pith_number":"pith:D2EF7KXH","schema_version":"1.0","canonical_sha256":"1e885faae7c5bbfc3bbcc33123cb594d9f3abae4c36783b54eceb74af3bb1b58","source":{"kind":"arxiv","id":"math/0407185","version":1},"attestation_state":"computed","paper":{"title":"Routing Complexity of Faulty Networks","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eran Ofek, Itai Benjamini, Omer Angel, Udi Wieder","submitted_at":"2004-07-11T09:21:48Z","abstract_excerpt":"One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the capability to efficiently find a path in the network is lost. Our main results show tight upper and lower bounds for the failure probability which permits routing, both for the hypercube and for the $d-$dimensional mesh. We use tools from percolation theory to show that in the $d-$dimensional mesh, once a giant component appears -- efficient routing is possibl"},"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":"math/0407185","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-07-11T09:21:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c9710fc5ea92b49cdfde8d2b615ea2649fbee8b6d72ef696e98726005f22e7bc","abstract_canon_sha256":"2f041b800db4a504940843d56f40c5bfe62c5eba6a8e5fc5a9c226f264b56edc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:38:54.646933Z","signature_b64":"dj1JgAnYsCc1l7usfGGl6ZL/Hqm30K4bg90MtCGlgrMWJA4Teo3z+Rr4YC0kWn/lDnhhmeCiib+/eASNYch0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e885faae7c5bbfc3bbcc33123cb594d9f3abae4c36783b54eceb74af3bb1b58","last_reissued_at":"2026-07-04T14:38:54.646531Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:38:54.646531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing Complexity of Faulty Networks","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eran Ofek, Itai Benjamini, Omer Angel, Udi Wieder","submitted_at":"2004-07-11T09:21:48Z","abstract_excerpt":"One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the capability to efficiently find a path in the network is lost. Our main results show tight upper and lower bounds for the failure probability which permits routing, both for the hypercube and for the $d-$dimensional mesh. We use tools from percolation theory to show that in the $d-$dimensional mesh, once a giant component appears -- efficient routing is possibl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407185","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/math/0407185/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":"math/0407185","created_at":"2026-07-04T14:38:54.646596+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0407185v1","created_at":"2026-07-04T14:38:54.646596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407185","created_at":"2026-07-04T14:38:54.646596+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2EF7KXHYW57","created_at":"2026-07-04T14:38:54.646596+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2EF7KXHYW57YO54","created_at":"2026-07-04T14:38:54.646596+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2EF7KXH","created_at":"2026-07-04T14:38:54.646596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW","json":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW.json","graph_json":"https://pith.science/api/pith-number/D2EF7KXHYW57YO54YMYSHS2ZJW/graph.json","events_json":"https://pith.science/api/pith-number/D2EF7KXHYW57YO54YMYSHS2ZJW/events.json","paper":"https://pith.science/paper/D2EF7KXH"},"agent_actions":{"view_html":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW","download_json":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW.json","view_paper":"https://pith.science/paper/D2EF7KXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0407185&json=true","fetch_graph":"https://pith.science/api/pith-number/D2EF7KXHYW57YO54YMYSHS2ZJW/graph.json","fetch_events":"https://pith.science/api/pith-number/D2EF7KXHYW57YO54YMYSHS2ZJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/action/storage_attestation","attest_author":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/action/author_attestation","sign_citation":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/action/citation_signature","submit_replication":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/action/replication_record"}},"created_at":"2026-07-04T14:38:54.646596+00:00","updated_at":"2026-07-04T14:38:54.646596+00:00"}