{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:D2EF7KXHYW57YO54YMYSHS2ZJW","short_pith_number":"pith:D2EF7KXH","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"},"canonical_sha256":"1e885faae7c5bbfc3bbcc33123cb594d9f3abae4c36783b54eceb74af3bb1b58","source":{"kind":"arxiv","id":"math/0407185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407185","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407185v1","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407185","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"D2EF7KXHYW57","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"pith_short_16","alias_value":"D2EF7KXHYW57YO54","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"pith_short_8","alias_value":"D2EF7KXH","created_at":"2026-07-04T14:38:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:D2EF7KXHYW57YO54YMYSHS2ZJW","target":"record","payload":{"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"},"canonical_sha256":"1e885faae7c5bbfc3bbcc33123cb594d9f3abae4c36783b54eceb74af3bb1b58","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"},"source_kind":"arxiv","source_id":"math/0407185","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-07-04T14:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"391jA1TFXgvUsMlYpcq3BQNrCsc5FA6SxKJJtVkufVzhvie6IKmwyYpRvPTIavX6wBG/LSUloFrMXmp5Uxo0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:45:56.545764Z"},"content_sha256":"60504f8b8ed564939732d7b6a8b4786487ac3976b4dffffadf3527df1b2eeb3d","schema_version":"1.0","event_id":"sha256:60504f8b8ed564939732d7b6a8b4786487ac3976b4dffffadf3527df1b2eeb3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:D2EF7KXHYW57YO54YMYSHS2ZJW","target":"graph","payload":{"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"},"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-07-04T14:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXsmtlPe23Fyobg5QznPkor0IroQT00QrPF4baV3OnRSlTodpViHJ3B8suFepFRl7tO5mXUmw4L9HeOiEuRXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:45:56.546288Z"},"content_sha256":"5e14866ac092959ef3bd05588ad77a5ca1585d2dd261f77b80080075ede88ddb","schema_version":"1.0","event_id":"sha256:5e14866ac092959ef3bd05588ad77a5ca1585d2dd261f77b80080075ede88ddb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/bundle.json","state_url":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/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-08-11T04:45:56Z","links":{"resolver":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW","bundle":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/bundle.json","state":"https://pith.science/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2EF7KXHYW57YO54YMYSHS2ZJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:D2EF7KXHYW57YO54YMYSHS2ZJW","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":"2f041b800db4a504940843d56f40c5bfe62c5eba6a8e5fc5a9c226f264b56edc","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2004-07-11T09:21:48Z","title_canon_sha256":"c9710fc5ea92b49cdfde8d2b615ea2649fbee8b6d72ef696e98726005f22e7bc"},"schema_version":"1.0","source":{"id":"math/0407185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407185","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407185v1","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407185","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"D2EF7KXHYW57","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"pith_short_16","alias_value":"D2EF7KXHYW57YO54","created_at":"2026-07-04T14:38:54Z"},{"alias_kind":"pith_short_8","alias_value":"D2EF7KXH","created_at":"2026-07-04T14:38:54Z"}],"graph_snapshots":[{"event_id":"sha256:5e14866ac092959ef3bd05588ad77a5ca1585d2dd261f77b80080075ede88ddb","target":"graph","created_at":"2026-07-04T14:38:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0407185/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eran Ofek, Itai Benjamini, Omer Angel, Udi Wieder","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2004-07-11T09:21:48Z","title":"Routing Complexity of Faulty Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407185","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:60504f8b8ed564939732d7b6a8b4786487ac3976b4dffffadf3527df1b2eeb3d","target":"record","created_at":"2026-07-04T14:38:54Z","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":"2f041b800db4a504940843d56f40c5bfe62c5eba6a8e5fc5a9c226f264b56edc","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2004-07-11T09:21:48Z","title_canon_sha256":"c9710fc5ea92b49cdfde8d2b615ea2649fbee8b6d72ef696e98726005f22e7bc"},"schema_version":"1.0","source":{"id":"math/0407185","kind":"arxiv","version":1}},"canonical_sha256":"1e885faae7c5bbfc3bbcc33123cb594d9f3abae4c36783b54eceb74af3bb1b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e885faae7c5bbfc3bbcc33123cb594d9f3abae4c36783b54eceb74af3bb1b58","first_computed_at":"2026-07-04T14:38:54.646531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:38:54.646531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dj1JgAnYsCc1l7usfGGl6ZL/Hqm30K4bg90MtCGlgrMWJA4Teo3z+Rr4YC0kWn/lDnhhmeCiib+/eASNYch0BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:38:54.646933Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0407185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60504f8b8ed564939732d7b6a8b4786487ac3976b4dffffadf3527df1b2eeb3d","sha256:5e14866ac092959ef3bd05588ad77a5ca1585d2dd261f77b80080075ede88ddb"],"state_sha256":"bf9f055c5fb7ce6aedd37657f514654274f14d3c5508d7135b0adfa378c8a51d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGaeqPLpXD9JdxRoiHV1fNIvW9ha52t/FJvFkHTF18AN+mUGucUKfzE8vBcI5oWgzH8K1/F31M9SjILxJyaYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:45:56.550832Z","bundle_sha256":"d68f21c295d58db115e009b76cafd7815c660e84b53a2a9e0953537dd27837e2"}}