{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XFJGUW4FSG3FUFRZBWVNHKRJSQ","short_pith_number":"pith:XFJGUW4F","schema_version":"1.0","canonical_sha256":"b9526a5b8591b65a16390daad3aa29943a9d60037281b9354e5cb9008fa1f2d1","source":{"kind":"arxiv","id":"1906.10266","version":1},"attestation_state":"computed","paper":{"title":"Hop-by-Hop Multipath Routing: Choosing the Right Nexthop Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Beichuan Zhang, Klaus Schneider, Lotfi Benmohamed","submitted_at":"2019-06-24T23:29:20Z","abstract_excerpt":"The Internet can be made more efficient and robust with hop-by-hop multipath routing: Each router on the path can split packets between multiple nexthops in order to 1) avoid failed links and 2) reduce traffic on congested links. Before deciding how to split traffic, one first needs to decide which nexthops to allow at each step. In this paper, we investigate the requirements and trade-offs for making this choice.\n  Most related work chooses the viable nexthops by applying the \"Downward Criterion\", i.e., only adding nexthops that lead closer to the destination; or more generally by creating a "},"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":"1906.10266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-06-24T23:29:20Z","cross_cats_sorted":[],"title_canon_sha256":"92a7ea6a29a272685480f63cd97f759945b7cc05524f562d4c62e34e13fd9fbb","abstract_canon_sha256":"65e2cfb3242dc18b346fe2d45f82b799f683ae889ddc86c820791612792a53e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:31.799308Z","signature_b64":"DATmWR/VHBgMw4qxUIjwwcJZ/dqXQcseV6YD8ap/qRmvekPNBR8FrM0V3PlSkeXQPhfKXKbFhfFydyKAdO4PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9526a5b8591b65a16390daad3aa29943a9d60037281b9354e5cb9008fa1f2d1","last_reissued_at":"2026-05-17T23:42:31.798735Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:31.798735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hop-by-Hop Multipath Routing: Choosing the Right Nexthop Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Beichuan Zhang, Klaus Schneider, Lotfi Benmohamed","submitted_at":"2019-06-24T23:29:20Z","abstract_excerpt":"The Internet can be made more efficient and robust with hop-by-hop multipath routing: Each router on the path can split packets between multiple nexthops in order to 1) avoid failed links and 2) reduce traffic on congested links. Before deciding how to split traffic, one first needs to decide which nexthops to allow at each step. In this paper, we investigate the requirements and trade-offs for making this choice.\n  Most related work chooses the viable nexthops by applying the \"Downward Criterion\", i.e., only adding nexthops that lead closer to the destination; or more generally by creating a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10266","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":"1906.10266","created_at":"2026-05-17T23:42:31.798809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10266v1","created_at":"2026-05-17T23:42:31.798809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10266","created_at":"2026-05-17T23:42:31.798809+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFJGUW4FSG3F","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFJGUW4FSG3FUFRZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFJGUW4F","created_at":"2026-05-18T12:33:33.725879+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/XFJGUW4FSG3FUFRZBWVNHKRJSQ","json":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ.json","graph_json":"https://pith.science/api/pith-number/XFJGUW4FSG3FUFRZBWVNHKRJSQ/graph.json","events_json":"https://pith.science/api/pith-number/XFJGUW4FSG3FUFRZBWVNHKRJSQ/events.json","paper":"https://pith.science/paper/XFJGUW4F"},"agent_actions":{"view_html":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ","download_json":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ.json","view_paper":"https://pith.science/paper/XFJGUW4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10266&json=true","fetch_graph":"https://pith.science/api/pith-number/XFJGUW4FSG3FUFRZBWVNHKRJSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XFJGUW4FSG3FUFRZBWVNHKRJSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ/action/storage_attestation","attest_author":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ/action/author_attestation","sign_citation":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ/action/citation_signature","submit_replication":"https://pith.science/pith/XFJGUW4FSG3FUFRZBWVNHKRJSQ/action/replication_record"}},"created_at":"2026-05-17T23:42:31.798809+00:00","updated_at":"2026-05-17T23:42:31.798809+00:00"}