{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NI4MARBHYOOASBZS7ZP3OTULAC","short_pith_number":"pith:NI4MARBH","schema_version":"1.0","canonical_sha256":"6a38c04427c39c090732fe5fb74e8b0089c9d75ec0f4336946554ad6cd35fb7b","source":{"kind":"arxiv","id":"1703.05907","version":2},"attestation_state":"computed","paper":{"title":"Centrality-based Middlepoint Selection for Traffic Engineering with Segment Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"George Trimponias, Hong Xu, Xiaorui Wu, Yanhui Geng, Yan Xiao","submitted_at":"2017-03-17T06:52:19Z","abstract_excerpt":"Segment routing is an emerging technology to simplify traffic engineering implementation in WANs. It expresses an end-to-end logical path as a sequence of segments through a set of middlepoints. Traffic along each segment is routed along shortest paths. In this paper, we study practical traffic engineering (TE) with segment routing in SDN based WANs. We consider two common types of TE, and show that the TE problem can be solved in weakly polynomial time when the number of middlepoints is fixed and not part of the input. However, the corresponding linear program is of large scale and computatio"},"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":"1703.05907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-17T06:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"3615d4e6cbf662d608ae63e39d3ad7599b9da737f72027e90342768c33246ea4","abstract_canon_sha256":"b6891acc5eeb7c7b6b747c1886c4bebb1750b0e69f2bbdfe2dca873a27c89625"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.240605Z","signature_b64":"3EZ/qb1lTBfgm4yoZmjV72FhAayDBCjG7voHluguaVQ6CS1w+S1hdVgKdTFe7bi6HQpR53m7scRun4/r/uwkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a38c04427c39c090732fe5fb74e8b0089c9d75ec0f4336946554ad6cd35fb7b","last_reissued_at":"2026-05-17T23:45:00.239940Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.239940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centrality-based Middlepoint Selection for Traffic Engineering with Segment Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"George Trimponias, Hong Xu, Xiaorui Wu, Yanhui Geng, Yan Xiao","submitted_at":"2017-03-17T06:52:19Z","abstract_excerpt":"Segment routing is an emerging technology to simplify traffic engineering implementation in WANs. It expresses an end-to-end logical path as a sequence of segments through a set of middlepoints. Traffic along each segment is routed along shortest paths. In this paper, we study practical traffic engineering (TE) with segment routing in SDN based WANs. We consider two common types of TE, and show that the TE problem can be solved in weakly polynomial time when the number of middlepoints is fixed and not part of the input. However, the corresponding linear program is of large scale and computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05907","kind":"arxiv","version":2},"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":"1703.05907","created_at":"2026-05-17T23:45:00.240041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05907v2","created_at":"2026-05-17T23:45:00.240041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05907","created_at":"2026-05-17T23:45:00.240041+00:00"},{"alias_kind":"pith_short_12","alias_value":"NI4MARBHYOOA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NI4MARBHYOOASBZS","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NI4MARBH","created_at":"2026-05-18T12:31:31.346846+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/NI4MARBHYOOASBZS7ZP3OTULAC","json":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC.json","graph_json":"https://pith.science/api/pith-number/NI4MARBHYOOASBZS7ZP3OTULAC/graph.json","events_json":"https://pith.science/api/pith-number/NI4MARBHYOOASBZS7ZP3OTULAC/events.json","paper":"https://pith.science/paper/NI4MARBH"},"agent_actions":{"view_html":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC","download_json":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC.json","view_paper":"https://pith.science/paper/NI4MARBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05907&json=true","fetch_graph":"https://pith.science/api/pith-number/NI4MARBHYOOASBZS7ZP3OTULAC/graph.json","fetch_events":"https://pith.science/api/pith-number/NI4MARBHYOOASBZS7ZP3OTULAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC/action/storage_attestation","attest_author":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC/action/author_attestation","sign_citation":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC/action/citation_signature","submit_replication":"https://pith.science/pith/NI4MARBHYOOASBZS7ZP3OTULAC/action/replication_record"}},"created_at":"2026-05-17T23:45:00.240041+00:00","updated_at":"2026-05-17T23:45:00.240041+00:00"}