{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LMG3IN4HBNVPSP4J52S24YY3FE","short_pith_number":"pith:LMG3IN4H","schema_version":"1.0","canonical_sha256":"5b0db437870b6af93f89eea5ae631b2939a14bc40bdb1522684e7dfb3c9297de","source":{"kind":"arxiv","id":"1902.00849","version":1},"attestation_state":"computed","paper":{"title":"Contra: A Programmable System for Performance-aware Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"(2) Microsoft Research, (3) Princeton University), Ang Chen (1), David Walker (3) ((1) Rice University, Jennifer Rexford (3), Kuo-Feng Hsu (1), Praveen Tammana (3), Ryan Beckett (2)","submitted_at":"2019-02-03T05:30:08Z","abstract_excerpt":"We present Contra, a system for performance-aware routing that can adapt to traffic changes at hardware speeds. While existing work has developed point solutions for performance-aware routing on a fixed topology (e.g., a Fattree) with a fixed routing policy (e.g., use least utilized paths), Contra can be configured to operate seamlessly over any network topology and a wide variety of sophisticated routing policies. Users of Contra write network-wide policies that rank network paths given their current performance. A compiler then analyzes such policies in conjunction with the network topology "},"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":"1902.00849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-03T05:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"365df69ad0ec5e104f5ff37bf969471ea096573ad61b24273de6a65196957860","abstract_canon_sha256":"fdec02cdae04d998288c8d9a6039fe660bda18c1bb0fde1b8a7cca10e42124ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:51.959308Z","signature_b64":"a5vjBqJva2ODhK1uUV3ZGM/Y2Mu5wKu8fM5l/pA9dY2pVTmxQiiQATkpZFERNz7er5TWLpVXRSA42YYxL6ZYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b0db437870b6af93f89eea5ae631b2939a14bc40bdb1522684e7dfb3c9297de","last_reissued_at":"2026-05-17T23:54:51.958860Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:51.958860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contra: A Programmable System for Performance-aware Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"(2) Microsoft Research, (3) Princeton University), Ang Chen (1), David Walker (3) ((1) Rice University, Jennifer Rexford (3), Kuo-Feng Hsu (1), Praveen Tammana (3), Ryan Beckett (2)","submitted_at":"2019-02-03T05:30:08Z","abstract_excerpt":"We present Contra, a system for performance-aware routing that can adapt to traffic changes at hardware speeds. While existing work has developed point solutions for performance-aware routing on a fixed topology (e.g., a Fattree) with a fixed routing policy (e.g., use least utilized paths), Contra can be configured to operate seamlessly over any network topology and a wide variety of sophisticated routing policies. Users of Contra write network-wide policies that rank network paths given their current performance. A compiler then analyzes such policies in conjunction with the network topology "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00849","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":"1902.00849","created_at":"2026-05-17T23:54:51.958937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00849v1","created_at":"2026-05-17T23:54:51.958937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00849","created_at":"2026-05-17T23:54:51.958937+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMG3IN4HBNVP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMG3IN4HBNVPSP4J","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMG3IN4H","created_at":"2026-05-18T12:33:21.387695+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/LMG3IN4HBNVPSP4J52S24YY3FE","json":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE.json","graph_json":"https://pith.science/api/pith-number/LMG3IN4HBNVPSP4J52S24YY3FE/graph.json","events_json":"https://pith.science/api/pith-number/LMG3IN4HBNVPSP4J52S24YY3FE/events.json","paper":"https://pith.science/paper/LMG3IN4H"},"agent_actions":{"view_html":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE","download_json":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE.json","view_paper":"https://pith.science/paper/LMG3IN4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00849&json=true","fetch_graph":"https://pith.science/api/pith-number/LMG3IN4HBNVPSP4J52S24YY3FE/graph.json","fetch_events":"https://pith.science/api/pith-number/LMG3IN4HBNVPSP4J52S24YY3FE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/action/storage_attestation","attest_author":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/action/author_attestation","sign_citation":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/action/citation_signature","submit_replication":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/action/replication_record"}},"created_at":"2026-05-17T23:54:51.958937+00:00","updated_at":"2026-05-17T23:54:51.958937+00:00"}