{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TIGZDVKQSAGFLB3AQ3WE4OR7PR","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":"9e50c8402138589f74e54c88ec006ac92a153550bdb178a6ad73007213cbd980","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T17:06:56Z","title_canon_sha256":"6a055dc9ef877d7b6cbbf9384b877c07a6f0f86e99d52a42af2b2226d375dd5d"},"schema_version":"1.0","source":{"id":"2605.16187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16187","created_at":"2026-05-20T00:01:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16187v1","created_at":"2026-05-20T00:01:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16187","created_at":"2026-05-20T00:01:56Z"},{"alias_kind":"pith_short_12","alias_value":"TIGZDVKQSAGF","created_at":"2026-05-20T00:01:56Z"},{"alias_kind":"pith_short_16","alias_value":"TIGZDVKQSAGFLB3A","created_at":"2026-05-20T00:01:56Z"},{"alias_kind":"pith_short_8","alias_value":"TIGZDVKQ","created_at":"2026-05-20T00:01:56Z"}],"graph_snapshots":[{"event_id":"sha256:61af97fac17a72ab575da245e22171a61901526fbc62c34693473a5761be3057","target":"graph","created_at":"2026-05-20T00:01:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"OnlineTE delivers near-optimal solutions within seconds of a change, scales to large WANs, and can outperform the state-of-the-art by up to an order of magnitude on a 750-node WAN topology emulation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the theory of optimization decomposition can be turned into a practical distributed solver whose local subproblems, when coordinated, remain near-optimal under real WAN dynamics, failures, and measurement noise."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"OnlineTE uses optimization decomposition to enable distributed, near-optimal traffic engineering that reacts in seconds to changes in large WANs and outperforms prior centralized approaches in emulation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"OnlineTE uses optimization decomposition for distributed solvers that deliver near-optimal WAN traffic engineering within seconds of changes."}],"snapshot_sha256":"18af2cfb56211438abe4da59aab4a8b2b215e596964f86da7e804204a0321775"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"94f6c6095db3c257e7c5153f939f3d1966ea3d081c2b06d15ca15a65ff2bd975"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.728414Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:30:55.908883Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T17:52:01.113128Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:47.010179Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:30.558646Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T17:31:42.415272Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.414841Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16187/integrity.json","findings":[],"snapshot_sha256":"0a282e694363d3673220125bdac00dab869a08b990fe0c083d4b7785d346a578","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most deployed WAN Traffic Engineering (TE) systems use a logically centralized controller that periodically gathers traffic demands, runs a TE optimization or heuristic, and then programs the network. At scale, these solutions can be sub-optimal, and can take minutes to react to demand changes or failures. In this paper, we introduce OnlineTE, a system that reacts immediately to demand changes and failures, and delivers near-optimal solutions within seconds of a change. OnlineTE builds on the theory of optimization decomposition to devise scalable, near-optimal, distributed TE solvers for path","authors_text":"Arvin Ghavidel, Nikolai Matni, Pooria Namyar, Ramesh Govindan, Walter Willinger","cross_cats":[],"headline":"OnlineTE uses optimization decomposition for distributed solvers that deliver near-optimal WAN traffic engineering within seconds of changes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T17:06:56Z","title":"Near-optimal Online Traffic Engineering"},"references":{"count":48,"internal_anchors":1,"resolved_work":48,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"[n. d.]. Arista 7800 Series. https://www.arista.com/assets/data/pdf/ Datasheets/7800R4-Series-AI-Spine-Datasheet.pdf. ([n. d.])","work_id":"df8f404b-e8a4-4ff2-9019-d77516c4aa7e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"[n. d.]. Internet Topology Zoo. http://www.topology-zoo.org/. ([n. d.])","work_id":"4eb5d0ef-fce1-4d27-a6f1-bb324e76815a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Firas Abuzaid, Srikanth Kandula, Behnaz Arzani, Ishai Menache, Matei Zaharia, and Peter Bailis. 2021. Contracting Wide-area Network Topologies to Solve Flow Problems Quickly. InNSDI","work_id":"e7906b73-c932-4800-8ccf-8cbb741c0ca6","year":2021},{"cited_arxiv_id":"","doi":"10.1145/3651890.3672237","is_internal_anchor":false,"ref_index":5,"title":"Rdma over ethernet for distributed training at meta scale","work_id":"7624824b-e6d7-482d-9b94-0e5d49db10f4","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":6,"title":"David Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O’Donoghue, and Warren Schudy. 2022. Practical Large- Scale Linear Programming using Primal-Dual Hybrid Gradient. (2022). ar","work_id":"e9cbf8af-1e6a-48d4-a236-a47b05a74bd2","year":2022}],"snapshot_sha256":"15dd4ce8441a663f174ce2c0e007d7b07838a7835edd9a4e798a8eacfd8ee424"},"source":{"id":"2605.16187","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:16:02.609354Z","id":"47d221aa-1f7b-4e47-959a-58b7a684b7c4","model_set":{"reader":"grok-4.3"},"one_line_summary":"OnlineTE uses optimization decomposition to enable distributed, near-optimal traffic engineering that reacts in seconds to changes in large WANs and outperforms prior centralized approaches in emulation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"OnlineTE uses optimization decomposition for distributed solvers that deliver near-optimal WAN traffic engineering within seconds of changes.","strongest_claim":"OnlineTE delivers near-optimal solutions within seconds of a change, scales to large WANs, and can outperform the state-of-the-art by up to an order of magnitude on a 750-node WAN topology emulation.","weakest_assumption":"That the theory of optimization decomposition can be turned into a practical distributed solver whose local subproblems, when coordinated, remain near-optimal under real WAN dynamics, failures, and measurement noise."}},"verdict_id":"47d221aa-1f7b-4e47-959a-58b7a684b7c4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:55927fc801f34bd5b0851c7b1d46c98d4796e6bc38c5a90b39e1510fc3ff34bc","target":"record","created_at":"2026-05-20T00:01:56Z","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":"9e50c8402138589f74e54c88ec006ac92a153550bdb178a6ad73007213cbd980","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T17:06:56Z","title_canon_sha256":"6a055dc9ef877d7b6cbbf9384b877c07a6f0f86e99d52a42af2b2226d375dd5d"},"schema_version":"1.0","source":{"id":"2605.16187","kind":"arxiv","version":1}},"canonical_sha256":"9a0d91d550900c55876086ec4e3a3f7c676ea47296b7df4f646862bdf6e6a3ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a0d91d550900c55876086ec4e3a3f7c676ea47296b7df4f646862bdf6e6a3ef","first_computed_at":"2026-05-20T00:01:56.988941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:56.988941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ss+3n9nThfmYDYrtGrSivLR2pqIieS0+4bXHo6/AlhgSIyY1DYMGnR8EsVJRfRf7/Bt6mNOGPyIHIKSMwJSaBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:56.989745Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55927fc801f34bd5b0851c7b1d46c98d4796e6bc38c5a90b39e1510fc3ff34bc","sha256:61af97fac17a72ab575da245e22171a61901526fbc62c34693473a5761be3057"],"state_sha256":"1d70bee9ec50f0cbe8bc2e54daa5ff0381912ebdce92a2fa47581ed7df04b668"}