{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ANDP4ORJUXQIEY5EZCIYLJIP4U","short_pith_number":"pith:ANDP4ORJ","schema_version":"1.0","canonical_sha256":"0346fe3a29a5e08263a4c89185a50fe510cfde2bf6a946c2e80630bcc98f0dd4","source":{"kind":"arxiv","id":"1603.01203","version":1},"attestation_state":"computed","paper":{"title":"Kulfi: Robust Traffic Engineering Using Semi-Oblivious Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chris Yu, Nate Foster, Praveen Kumar, Robert Kleinberg, Robert Soul\\'e, Yang Yuan","submitted_at":"2016-03-03T18:04:36Z","abstract_excerpt":"Wide-area network traffic engineering enables network operators to reduce congestion and improve utilization by balancing load across multiple paths. Current approaches to traffic engineering can be modeled in terms of a routing component that computes forwarding paths, and a load balancing component that maps incoming flows onto those paths dynamically, adjusting sending rates to fit current conditions. Unfortunately, existing systems rely on simple strategies for one or both of these components, which leads to poor performance or requires making frequent updates to forwarding paths, signific"},"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":"1603.01203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-03T18:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"d45dd928a4cab4f396b9d375e08d9527b1770939e6b1b767d5e6de942a3059d2","abstract_canon_sha256":"428650a521e4131b2864bd831e4a27c4227af350b5b0d68e29000a5fc5109c3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.879029Z","signature_b64":"eCCa/DDZYX8aBEi+m1cH6W3PC3cY5ilA5J5bTdjibYb/dZoy6CPm6nM1MLrvy3Qkhvr2ZSX6OjA/pp0SSFkoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0346fe3a29a5e08263a4c89185a50fe510cfde2bf6a946c2e80630bcc98f0dd4","last_reissued_at":"2026-05-17T23:49:22.878626Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.878626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kulfi: Robust Traffic Engineering Using Semi-Oblivious Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chris Yu, Nate Foster, Praveen Kumar, Robert Kleinberg, Robert Soul\\'e, Yang Yuan","submitted_at":"2016-03-03T18:04:36Z","abstract_excerpt":"Wide-area network traffic engineering enables network operators to reduce congestion and improve utilization by balancing load across multiple paths. Current approaches to traffic engineering can be modeled in terms of a routing component that computes forwarding paths, and a load balancing component that maps incoming flows onto those paths dynamically, adjusting sending rates to fit current conditions. Unfortunately, existing systems rely on simple strategies for one or both of these components, which leads to poor performance or requires making frequent updates to forwarding paths, signific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01203","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":"1603.01203","created_at":"2026-05-17T23:49:22.878689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01203v1","created_at":"2026-05-17T23:49:22.878689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01203","created_at":"2026-05-17T23:49:22.878689+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANDP4ORJUXQI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANDP4ORJUXQIEY5E","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANDP4ORJ","created_at":"2026-05-18T12:30:07.202191+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/ANDP4ORJUXQIEY5EZCIYLJIP4U","json":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U.json","graph_json":"https://pith.science/api/pith-number/ANDP4ORJUXQIEY5EZCIYLJIP4U/graph.json","events_json":"https://pith.science/api/pith-number/ANDP4ORJUXQIEY5EZCIYLJIP4U/events.json","paper":"https://pith.science/paper/ANDP4ORJ"},"agent_actions":{"view_html":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U","download_json":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U.json","view_paper":"https://pith.science/paper/ANDP4ORJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01203&json=true","fetch_graph":"https://pith.science/api/pith-number/ANDP4ORJUXQIEY5EZCIYLJIP4U/graph.json","fetch_events":"https://pith.science/api/pith-number/ANDP4ORJUXQIEY5EZCIYLJIP4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U/action/storage_attestation","attest_author":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U/action/author_attestation","sign_citation":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U/action/citation_signature","submit_replication":"https://pith.science/pith/ANDP4ORJUXQIEY5EZCIYLJIP4U/action/replication_record"}},"created_at":"2026-05-17T23:49:22.878689+00:00","updated_at":"2026-05-17T23:49:22.878689+00:00"}