{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QNWB44YAFZPM3BFHZZSHXWMRHA","short_pith_number":"pith:QNWB44YA","schema_version":"1.0","canonical_sha256":"836c1e73002e5ecd84a7ce647bd991383bf3a081d66e256a5b8ce439cfac7920","source":{"kind":"arxiv","id":"1409.0034","version":4},"attestation_state":"computed","paper":{"title":"Exploring the Limits of Static Failover Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aleksander M\\k{a}dry, Andrei Gurtov, Aurojit Panda, Ilya Nikolaevkiy, Marco Chiesa, Michael Schapira, Scott Shenker, Slobodan Mitrovi\\'c","submitted_at":"2014-08-29T21:10:53Z","abstract_excerpt":"We present and study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph $G$, a unique destination vertex $d$, and an integer constant $c>0$, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source $s$ to the destination $d$ is guaranteed so long as (1) no more than $c$ edges fail and (2) there exists a physical path from $s$ to $d$? We embark upon a systematic exploration of this fundamental question in a variety of models (deterministic routing, randomized routing, with packet-duplication,"},"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":"1409.0034","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-29T21:10:53Z","cross_cats_sorted":[],"title_canon_sha256":"463b51d839c7a23fe4cb138443674e2a7809c5a7cdd8a6ee1ef76b99e4e27087","abstract_canon_sha256":"b2d7afed2e8ef6edad3b0b66cad1676336bfa3b804e54a8b94ff7a413b28ea97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:23.887935Z","signature_b64":"60s3Y+9gUTGjEp7ZR3wgM5KrqmMtECaNSeMVNZVaOfrIQbmF1Ehmcq56Pmc7qum/fyv4Qu4eGidLZeGUeGrWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"836c1e73002e5ecd84a7ce647bd991383bf3a081d66e256a5b8ce439cfac7920","last_reissued_at":"2026-05-18T01:10:23.887482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:23.887482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the Limits of Static Failover Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aleksander M\\k{a}dry, Andrei Gurtov, Aurojit Panda, Ilya Nikolaevkiy, Marco Chiesa, Michael Schapira, Scott Shenker, Slobodan Mitrovi\\'c","submitted_at":"2014-08-29T21:10:53Z","abstract_excerpt":"We present and study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph $G$, a unique destination vertex $d$, and an integer constant $c>0$, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source $s$ to the destination $d$ is guaranteed so long as (1) no more than $c$ edges fail and (2) there exists a physical path from $s$ to $d$? We embark upon a systematic exploration of this fundamental question in a variety of models (deterministic routing, randomized routing, with packet-duplication,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0034","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.0034","created_at":"2026-05-18T01:10:23.887557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0034v4","created_at":"2026-05-18T01:10:23.887557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0034","created_at":"2026-05-18T01:10:23.887557+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNWB44YAFZPM","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNWB44YAFZPM3BFH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNWB44YA","created_at":"2026-05-18T12:28:46.137349+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/QNWB44YAFZPM3BFHZZSHXWMRHA","json":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA.json","graph_json":"https://pith.science/api/pith-number/QNWB44YAFZPM3BFHZZSHXWMRHA/graph.json","events_json":"https://pith.science/api/pith-number/QNWB44YAFZPM3BFHZZSHXWMRHA/events.json","paper":"https://pith.science/paper/QNWB44YA"},"agent_actions":{"view_html":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA","download_json":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA.json","view_paper":"https://pith.science/paper/QNWB44YA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0034&json=true","fetch_graph":"https://pith.science/api/pith-number/QNWB44YAFZPM3BFHZZSHXWMRHA/graph.json","fetch_events":"https://pith.science/api/pith-number/QNWB44YAFZPM3BFHZZSHXWMRHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/action/storage_attestation","attest_author":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/action/author_attestation","sign_citation":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/action/citation_signature","submit_replication":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/action/replication_record"}},"created_at":"2026-05-18T01:10:23.887557+00:00","updated_at":"2026-05-18T01:10:23.887557+00:00"}