{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XAP5CHGMTGJT7MYYM5N2PECWZ3","short_pith_number":"pith:XAP5CHGM","schema_version":"1.0","canonical_sha256":"b81fd11ccc99933fb318675ba79056cecbee509687ffba0d0dfab3803fc642c7","source":{"kind":"arxiv","id":"1411.2873","version":1},"attestation_state":"computed","paper":{"title":"Improving Robustness of Next-Hop Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Gordon Wilfong, Lisa Zhang, W. Sean Kennedy","submitted_at":"2014-11-11T16:21:10Z","abstract_excerpt":"A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop as the protocol operates to establish new routes. In this article, we address these weaknesses by describing mechanisms to choose alternate next hops.\n  Our first contribution is to model the scenario as the following {\\sc tree augmentation} problem. Consider a mixed graph where some edges are directed and some undirected. The directed edges form a spanning tree pointing towards the common destination node. Each direc"},"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":"1411.2873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-11T16:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"526e135cc45b5270b9c64d1a3502838cc5bd6d7ca518a00169141aa6daffb61b","abstract_canon_sha256":"2dd9c53f90b8e67c3822c816c97e94bf190b5d90725141d47f132cdb310a8923"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:52.836243Z","signature_b64":"QsYR5kqpBgpNGUJ2HrNBvv2xe7WBW1eIxJLSlD16PH6mPuxm7fnGa8OOjwqO387qiKKhEcwQTLdFdmUE5IiwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b81fd11ccc99933fb318675ba79056cecbee509687ffba0d0dfab3803fc642c7","last_reissued_at":"2026-05-18T02:37:52.835618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:52.835618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Robustness of Next-Hop Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Gordon Wilfong, Lisa Zhang, W. Sean Kennedy","submitted_at":"2014-11-11T16:21:10Z","abstract_excerpt":"A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop as the protocol operates to establish new routes. In this article, we address these weaknesses by describing mechanisms to choose alternate next hops.\n  Our first contribution is to model the scenario as the following {\\sc tree augmentation} problem. Consider a mixed graph where some edges are directed and some undirected. The directed edges form a spanning tree pointing towards the common destination node. Each direc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2873","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":""},"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":"1411.2873","created_at":"2026-05-18T02:37:52.835708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2873v1","created_at":"2026-05-18T02:37:52.835708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2873","created_at":"2026-05-18T02:37:52.835708+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAP5CHGMTGJT","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAP5CHGMTGJT7MYY","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAP5CHGM","created_at":"2026-05-18T12:28:57.508820+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/XAP5CHGMTGJT7MYYM5N2PECWZ3","json":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3.json","graph_json":"https://pith.science/api/pith-number/XAP5CHGMTGJT7MYYM5N2PECWZ3/graph.json","events_json":"https://pith.science/api/pith-number/XAP5CHGMTGJT7MYYM5N2PECWZ3/events.json","paper":"https://pith.science/paper/XAP5CHGM"},"agent_actions":{"view_html":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3","download_json":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3.json","view_paper":"https://pith.science/paper/XAP5CHGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2873&json=true","fetch_graph":"https://pith.science/api/pith-number/XAP5CHGMTGJT7MYYM5N2PECWZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/XAP5CHGMTGJT7MYYM5N2PECWZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3/action/storage_attestation","attest_author":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3/action/author_attestation","sign_citation":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3/action/citation_signature","submit_replication":"https://pith.science/pith/XAP5CHGMTGJT7MYYM5N2PECWZ3/action/replication_record"}},"created_at":"2026-05-18T02:37:52.835708+00:00","updated_at":"2026-05-18T02:37:52.835708+00:00"}