{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FS3GZX6GICXKGZV62ZYORWVH5F","short_pith_number":"pith:FS3GZX6G","schema_version":"1.0","canonical_sha256":"2cb66cdfc640aea366bed670e8daa7e94fecc1b4c7649ffda4a13de72b78c27b","source":{"kind":"arxiv","id":"2307.05547","version":1},"attestation_state":"computed","paper":{"title":"Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Mehrdad Saberi, Moti Medina, Stefan Schmid","submitted_at":"2023-07-09T05:50:46Z","abstract_excerpt":"With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure connectivity despite such failures. While most modern communication networks feature robust routing mechanisms, these mechanisms are often fairly complex to design and verify, as they need to account for the effects of failures and rerouting on communication.\n  This paper conceptualizes the design of robust routing mechanisms, with the aim to avoid such comple"},"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":"2307.05547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-07-09T05:50:46Z","cross_cats_sorted":[],"title_canon_sha256":"a5d0710034bba0bbdf494ea8b76ee12e39c2ee3e38d7f46d5d081d791a89372c","abstract_canon_sha256":"e1780ec763f4dc5bc07a7059f3b0f49a772985ff82d453e0c8b2b3dd57c70b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:09.665638Z","signature_b64":"gvUVoxgnAtz/jKY38HO+ANR3kPiD7ONYqHvNb2yKXZqO8+aUGpEbHuYt3z7RgtA+vKAFCcNbCYJ8t4oh2uamBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb66cdfc640aea366bed670e8daa7e94fecc1b4c7649ffda4a13de72b78c27b","last_reissued_at":"2026-07-05T06:30:09.665238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:09.665238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Mehrdad Saberi, Moti Medina, Stefan Schmid","submitted_at":"2023-07-09T05:50:46Z","abstract_excerpt":"With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure connectivity despite such failures. While most modern communication networks feature robust routing mechanisms, these mechanisms are often fairly complex to design and verify, as they need to account for the effects of failures and rerouting on communication.\n  This paper conceptualizes the design of robust routing mechanisms, with the aim to avoid such comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.05547","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/2307.05547/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":"2307.05547","created_at":"2026-07-05T06:30:09.665297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.05547v1","created_at":"2026-07-05T06:30:09.665297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.05547","created_at":"2026-07-05T06:30:09.665297+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS3GZX6GICXK","created_at":"2026-07-05T06:30:09.665297+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS3GZX6GICXKGZV6","created_at":"2026-07-05T06:30:09.665297+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS3GZX6G","created_at":"2026-07-05T06:30:09.665297+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/FS3GZX6GICXKGZV62ZYORWVH5F","json":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F.json","graph_json":"https://pith.science/api/pith-number/FS3GZX6GICXKGZV62ZYORWVH5F/graph.json","events_json":"https://pith.science/api/pith-number/FS3GZX6GICXKGZV62ZYORWVH5F/events.json","paper":"https://pith.science/paper/FS3GZX6G"},"agent_actions":{"view_html":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F","download_json":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F.json","view_paper":"https://pith.science/paper/FS3GZX6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.05547&json=true","fetch_graph":"https://pith.science/api/pith-number/FS3GZX6GICXKGZV62ZYORWVH5F/graph.json","fetch_events":"https://pith.science/api/pith-number/FS3GZX6GICXKGZV62ZYORWVH5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F/action/storage_attestation","attest_author":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F/action/author_attestation","sign_citation":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F/action/citation_signature","submit_replication":"https://pith.science/pith/FS3GZX6GICXKGZV62ZYORWVH5F/action/replication_record"}},"created_at":"2026-07-05T06:30:09.665297+00:00","updated_at":"2026-07-05T06:30:09.665297+00:00"}