{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LMG3IN4HBNVPSP4J52S24YY3FE","short_pith_number":"pith:LMG3IN4H","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"},"canonical_sha256":"5b0db437870b6af93f89eea5ae631b2939a14bc40bdb1522684e7dfb3c9297de","source":{"kind":"arxiv","id":"1902.00849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00849","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00849v1","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00849","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"LMG3IN4HBNVP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LMG3IN4HBNVPSP4J","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LMG3IN4H","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LMG3IN4HBNVPSP4J52S24YY3FE","target":"record","payload":{"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"},"canonical_sha256":"5b0db437870b6af93f89eea5ae631b2939a14bc40bdb1522684e7dfb3c9297de","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"},"source_kind":"arxiv","source_id":"1902.00849","source_version":1,"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-17T23:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W5wEEKHC6VCdPvO+IL5wEW5/uLrMbtXIwMkYz6bKrvMOxz1bI+GHGezTwe6AkubzRBJZ2/YVod8rddPYSFP2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:17:14.661017Z"},"content_sha256":"b15738d02d6f8dc0325ed4e2395099697279eb9070ff980df92fdde8dbccdc3c","schema_version":"1.0","event_id":"sha256:b15738d02d6f8dc0325ed4e2395099697279eb9070ff980df92fdde8dbccdc3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LMG3IN4HBNVPSP4J52S24YY3FE","target":"graph","payload":{"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"},"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-17T23:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9gk4FXdNOh/vtLmRGZJGSmfjMm3yUvYvJo8xJdfr+iVet8C826vbZK/156b0Nd699M6Px1goid1VUvDny3mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:17:14.661746Z"},"content_sha256":"90f1846f19bea792793ac9f8363327db3544938879d1855ee66456af24fb3389","schema_version":"1.0","event_id":"sha256:90f1846f19bea792793ac9f8363327db3544938879d1855ee66456af24fb3389"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/bundle.json","state_url":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMG3IN4HBNVPSP4J52S24YY3FE/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-06-01T05:17:14Z","links":{"resolver":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE","bundle":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/bundle.json","state":"https://pith.science/pith/LMG3IN4HBNVPSP4J52S24YY3FE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMG3IN4HBNVPSP4J52S24YY3FE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LMG3IN4HBNVPSP4J52S24YY3FE","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":"fdec02cdae04d998288c8d9a6039fe660bda18c1bb0fde1b8a7cca10e42124ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-03T05:30:08Z","title_canon_sha256":"365df69ad0ec5e104f5ff37bf969471ea096573ad61b24273de6a65196957860"},"schema_version":"1.0","source":{"id":"1902.00849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00849","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00849v1","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00849","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"LMG3IN4HBNVP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LMG3IN4HBNVPSP4J","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LMG3IN4H","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:90f1846f19bea792793ac9f8363327db3544938879d1855ee66456af24fb3389","target":"graph","created_at":"2026-05-17T23:54:51Z","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 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 ","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)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-03T05:30:08Z","title":"Contra: A Programmable System for Performance-aware Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00849","kind":"arxiv","version":1},"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:b15738d02d6f8dc0325ed4e2395099697279eb9070ff980df92fdde8dbccdc3c","target":"record","created_at":"2026-05-17T23:54:51Z","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":"fdec02cdae04d998288c8d9a6039fe660bda18c1bb0fde1b8a7cca10e42124ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-03T05:30:08Z","title_canon_sha256":"365df69ad0ec5e104f5ff37bf969471ea096573ad61b24273de6a65196957860"},"schema_version":"1.0","source":{"id":"1902.00849","kind":"arxiv","version":1}},"canonical_sha256":"5b0db437870b6af93f89eea5ae631b2939a14bc40bdb1522684e7dfb3c9297de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b0db437870b6af93f89eea5ae631b2939a14bc40bdb1522684e7dfb3c9297de","first_computed_at":"2026-05-17T23:54:51.958860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:51.958860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a5vjBqJva2ODhK1uUV3ZGM/Y2Mu5wKu8fM5l/pA9dY2pVTmxQiiQATkpZFERNz7er5TWLpVXRSA42YYxL6ZYCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:51.959308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b15738d02d6f8dc0325ed4e2395099697279eb9070ff980df92fdde8dbccdc3c","sha256:90f1846f19bea792793ac9f8363327db3544938879d1855ee66456af24fb3389"],"state_sha256":"76e2e088b19beed4dfac8449005f25e55aa16a7a2758597bca44149a3834e1d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nO9qucRHhz1lfao+dS1T/tFXLhfMbd/aDYDQ9xSin3yGWVM4Jy/N2JRVgmSpt+wi1djCz3mbZ2NHqIflhbXWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:17:14.665148Z","bundle_sha256":"d9db277b56a893cc8e69a1f666060fadf5b274fb4a4a00a22c05ebf7b57087dc"}}