{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UNXIZEZSQMDQJUTHSDGTLZB64K","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":"dd08c591b25e871264a14c9033c1f81a286dca154e72130a9e1b82d9941cb384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T02:43:36Z","title_canon_sha256":"bfaf64f8723f794020fdfee84301f18854d7c194a6f52b8551e488f9a6ee306e"},"schema_version":"1.0","source":{"id":"1902.10312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10312","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10312v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10312","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"UNXIZEZSQMDQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UNXIZEZSQMDQJUTH","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UNXIZEZS","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:802ba6ff480420a86b9c0c066275d2670b4d17b381a3b9a9b736ef5a7b6451ce","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"In this paper, we consider the bandwidth-delay-hop constrained routing problem in large-scaled software defined networks. A number of demands, each of which specifies a source vertex and a sink vertex, are required to route in a given network. We are asked to select a subset of demands, and assign a routing path for each selected demand without violating the hop and delay constraints, while assuring that the bandwidth occupied in each edge is not beyond its capacity. The goal is to maximize the throughput (the total bandwidth) of the selected demands. We develop an efficient heuristic algorith","authors_text":"Chenyang Xu, Deshi Ye, Guochuan Zhang, Huajingling Wu, Liangde Tao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T02:43:36Z","title":"Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10312","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:43672c484803a6aa1b1a06db81f38304e0609531b0dd368bb4338e23cbc30aeb","target":"record","created_at":"2026-05-17T23:52:31Z","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":"dd08c591b25e871264a14c9033c1f81a286dca154e72130a9e1b82d9941cb384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T02:43:36Z","title_canon_sha256":"bfaf64f8723f794020fdfee84301f18854d7c194a6f52b8551e488f9a6ee306e"},"schema_version":"1.0","source":{"id":"1902.10312","kind":"arxiv","version":1}},"canonical_sha256":"a36e8c9332830704d26790cd35e43ee2a45d4e2e85eea3b74b492e1aec1e8b32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a36e8c9332830704d26790cd35e43ee2a45d4e2e85eea3b74b492e1aec1e8b32","first_computed_at":"2026-05-17T23:52:31.241596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.241596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RL9w8//4YZtNOHg1YdkkCPnSM0Nbd0aBtLJkmXgoJ6InbU4el2LDKKU5XgmdqKwl0CADjLNF5smxMk2PqQ5bBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.242077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43672c484803a6aa1b1a06db81f38304e0609531b0dd368bb4338e23cbc30aeb","sha256:802ba6ff480420a86b9c0c066275d2670b4d17b381a3b9a9b736ef5a7b6451ce"],"state_sha256":"61481cb22c0348a36a21ebf4df0931c1cbede5015e2fa10fed0c5ef0eabca2f2"}