{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QNWB44YAFZPM3BFHZZSHXWMRHA","short_pith_number":"pith:QNWB44YA","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"},"canonical_sha256":"836c1e73002e5ecd84a7ce647bd991383bf3a081d66e256a5b8ce439cfac7920","source":{"kind":"arxiv","id":"1409.0034","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0034","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0034v4","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0034","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"QNWB44YAFZPM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNWB44YAFZPM3BFH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNWB44YA","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QNWB44YAFZPM3BFHZZSHXWMRHA","target":"record","payload":{"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"},"canonical_sha256":"836c1e73002e5ecd84a7ce647bd991383bf3a081d66e256a5b8ce439cfac7920","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"},"source_kind":"arxiv","source_id":"1409.0034","source_version":4,"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-05-18T01:10:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uSFEx0rZRRzmUYofXVgdmA8ME03c9UcfxieMP6T2+Q3JAyYzW2mdVbQbDggR4UIqOWFVQ0skJSZXrIlZJldCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:05:33.914890Z"},"content_sha256":"f3da7d4fa16eac9b34a6dad5fdcab7e11ed2410bf2f1292fad2c31543ad496e8","schema_version":"1.0","event_id":"sha256:f3da7d4fa16eac9b34a6dad5fdcab7e11ed2410bf2f1292fad2c31543ad496e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QNWB44YAFZPM3BFHZZSHXWMRHA","target":"graph","payload":{"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"},"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-05-18T01:10:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HlMDI4Isxc7SYvFekRViMoXxLVA0sMi2RdQk8ues6Mb/5lU926Nm6THHCTuCkPYa/o+ZooL2U/gZORzLv7TDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:05:33.915230Z"},"content_sha256":"c95a60c551b283f1e9356e6b5d901f8d71ea9186d5eb67f488e1dc9e38eda96c","schema_version":"1.0","event_id":"sha256:c95a60c551b283f1e9356e6b5d901f8d71ea9186d5eb67f488e1dc9e38eda96c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/bundle.json","state_url":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/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-05-28T16:05:33Z","links":{"resolver":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA","bundle":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/bundle.json","state":"https://pith.science/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNWB44YAFZPM3BFHZZSHXWMRHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QNWB44YAFZPM3BFHZZSHXWMRHA","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":"b2d7afed2e8ef6edad3b0b66cad1676336bfa3b804e54a8b94ff7a413b28ea97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-29T21:10:53Z","title_canon_sha256":"463b51d839c7a23fe4cb138443674e2a7809c5a7cdd8a6ee1ef76b99e4e27087"},"schema_version":"1.0","source":{"id":"1409.0034","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0034","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0034v4","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0034","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"QNWB44YAFZPM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNWB44YAFZPM3BFH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNWB44YA","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:c95a60c551b283f1e9356e6b5d901f8d71ea9186d5eb67f488e1dc9e38eda96c","target":"graph","created_at":"2026-05-18T01:10:23Z","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"},"paper":{"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,","authors_text":"Aleksander M\\k{a}dry, Andrei Gurtov, Aurojit Panda, Ilya Nikolaevkiy, Marco Chiesa, Michael Schapira, Scott Shenker, Slobodan Mitrovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-29T21:10:53Z","title":"Exploring the Limits of Static Failover Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0034","kind":"arxiv","version":4},"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:f3da7d4fa16eac9b34a6dad5fdcab7e11ed2410bf2f1292fad2c31543ad496e8","target":"record","created_at":"2026-05-18T01:10:23Z","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":"b2d7afed2e8ef6edad3b0b66cad1676336bfa3b804e54a8b94ff7a413b28ea97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-29T21:10:53Z","title_canon_sha256":"463b51d839c7a23fe4cb138443674e2a7809c5a7cdd8a6ee1ef76b99e4e27087"},"schema_version":"1.0","source":{"id":"1409.0034","kind":"arxiv","version":4}},"canonical_sha256":"836c1e73002e5ecd84a7ce647bd991383bf3a081d66e256a5b8ce439cfac7920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"836c1e73002e5ecd84a7ce647bd991383bf3a081d66e256a5b8ce439cfac7920","first_computed_at":"2026-05-18T01:10:23.887482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:23.887482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"60s3Y+9gUTGjEp7ZR3wgM5KrqmMtECaNSeMVNZVaOfrIQbmF1Ehmcq56Pmc7qum/fyv4Qu4eGidLZeGUeGrWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:23.887935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0034","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3da7d4fa16eac9b34a6dad5fdcab7e11ed2410bf2f1292fad2c31543ad496e8","sha256:c95a60c551b283f1e9356e6b5d901f8d71ea9186d5eb67f488e1dc9e38eda96c"],"state_sha256":"97c946a5b58cf8034ba9d2af9f7e202a693fc9206c81ada21d177b807b5e663a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6tSrHq12/rD4wzoHRXdtuqOeezaVnQDtC8mbt/ywETnTnE39bb7yck9huo/rqWssbEULLKSoVQAoRTiKU8FDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:05:33.917176Z","bundle_sha256":"cc8d6a9fac627b03015a8c455add7f429bd7d046c3958ac34f46ef818dd8e921"}}