{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XLIYQN4RVA6WQPLFUHVN27KDFZ","short_pith_number":"pith:XLIYQN4R","canonical_record":{"source":{"id":"1612.01684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-06T06:50:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"073112dee23c9c794d99b945a9462d338a4b59b233f4c67cd83ec1710711d44f","abstract_canon_sha256":"2d2063da1b1d882e2728e496bb929d125fec8a134b0a1cc638f6f2cbb66c558a"},"schema_version":"1.0"},"canonical_sha256":"bad1883791a83d683d65a1eadd7d432e4352dcabcd562b677c3534441cc0d45f","source":{"kind":"arxiv","id":"1612.01684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01684","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01684v1","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01684","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"XLIYQN4RVA6W","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XLIYQN4RVA6WQPLF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XLIYQN4R","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XLIYQN4RVA6WQPLFUHVN27KDFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-06T06:50:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"073112dee23c9c794d99b945a9462d338a4b59b233f4c67cd83ec1710711d44f","abstract_canon_sha256":"2d2063da1b1d882e2728e496bb929d125fec8a134b0a1cc638f6f2cbb66c558a"},"schema_version":"1.0"},"canonical_sha256":"bad1883791a83d683d65a1eadd7d432e4352dcabcd562b677c3534441cc0d45f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:47.834896Z","signature_b64":"LQYR6OOjeFpQP0IdsFOv6vCVSOhvRnUGZHsL4/NaTV3Zs1+r2eaVe8mqc3Jxnpgpyp+H+PRSWrS+nIkj+LSlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bad1883791a83d683d65a1eadd7d432e4352dcabcd562b677c3534441cc0d45f","last_reissued_at":"2026-05-18T00:55:47.834374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:47.834374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01684","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-18T00:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qtuMlhT7vnF029ARqPhKQzh1jQqIjRdTtJAqEMNB05QCurNrxpfqR9/8vj1Cfn2plKvatkuEmFjDvrQkAciAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:23:40.225400Z"},"content_sha256":"f5eeaa4d9d5b4746f20443638d8c828fac74d719b1a0d4090bf1f93568d843fe","schema_version":"1.0","event_id":"sha256:f5eeaa4d9d5b4746f20443638d8c828fac74d719b1a0d4090bf1f93568d843fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XLIYQN4RVA6WQPLFUHVN27KDFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Optimal Load Balancing for Intra Datacenter Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"Michael J. Neely, Sucha Supittayapornpong","submitted_at":"2016-12-06T06:50:23Z","abstract_excerpt":"Traffic load-balancing in datacenters alleviates hot spots and improves network utilization. In this paper, a stable in-network load-balancing algorithm is developed in the setting of software-defined networking. A control plane configures a data plane over successive intervals of time. While the MaxWeight algorithm can be applied in this setting and offers certain throughput optimality properties, its bang-bang control structure rewards single flows on each interval and prohibits link-capacity sharing. This paper develops a new algorithm that is throughput-optimal and allows link-capacity sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01684","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-18T00:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QMuJd5Zze2Y55Y436jluXO4LkIet0IAcevzzdACloqKbQL0ErDDht99tsnb9+y147nS2440cN+82JGAHZMeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:23:40.226056Z"},"content_sha256":"b26a7aa1468e5570a415ae0ab9e50997aefa843017669c7f25a6453272ed82f4","schema_version":"1.0","event_id":"sha256:b26a7aa1468e5570a415ae0ab9e50997aefa843017669c7f25a6453272ed82f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ/bundle.json","state_url":"https://pith.science/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ/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-05-30T02:23:40Z","links":{"resolver":"https://pith.science/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ","bundle":"https://pith.science/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ/bundle.json","state":"https://pith.science/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLIYQN4RVA6WQPLFUHVN27KDFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XLIYQN4RVA6WQPLFUHVN27KDFZ","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":"2d2063da1b1d882e2728e496bb929d125fec8a134b0a1cc638f6f2cbb66c558a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-06T06:50:23Z","title_canon_sha256":"073112dee23c9c794d99b945a9462d338a4b59b233f4c67cd83ec1710711d44f"},"schema_version":"1.0","source":{"id":"1612.01684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01684","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01684v1","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01684","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"XLIYQN4RVA6W","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XLIYQN4RVA6WQPLF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XLIYQN4R","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:b26a7aa1468e5570a415ae0ab9e50997aefa843017669c7f25a6453272ed82f4","target":"graph","created_at":"2026-05-18T00:55:47Z","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":"Traffic load-balancing in datacenters alleviates hot spots and improves network utilization. In this paper, a stable in-network load-balancing algorithm is developed in the setting of software-defined networking. A control plane configures a data plane over successive intervals of time. While the MaxWeight algorithm can be applied in this setting and offers certain throughput optimality properties, its bang-bang control structure rewards single flows on each interval and prohibits link-capacity sharing. This paper develops a new algorithm that is throughput-optimal and allows link-capacity sha","authors_text":"Michael J. Neely, Sucha Supittayapornpong","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-06T06:50:23Z","title":"Throughput-Optimal Load Balancing for Intra Datacenter Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01684","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:f5eeaa4d9d5b4746f20443638d8c828fac74d719b1a0d4090bf1f93568d843fe","target":"record","created_at":"2026-05-18T00:55:47Z","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":"2d2063da1b1d882e2728e496bb929d125fec8a134b0a1cc638f6f2cbb66c558a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-06T06:50:23Z","title_canon_sha256":"073112dee23c9c794d99b945a9462d338a4b59b233f4c67cd83ec1710711d44f"},"schema_version":"1.0","source":{"id":"1612.01684","kind":"arxiv","version":1}},"canonical_sha256":"bad1883791a83d683d65a1eadd7d432e4352dcabcd562b677c3534441cc0d45f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bad1883791a83d683d65a1eadd7d432e4352dcabcd562b677c3534441cc0d45f","first_computed_at":"2026-05-18T00:55:47.834374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:47.834374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQYR6OOjeFpQP0IdsFOv6vCVSOhvRnUGZHsL4/NaTV3Zs1+r2eaVe8mqc3Jxnpgpyp+H+PRSWrS+nIkj+LSlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:47.834896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5eeaa4d9d5b4746f20443638d8c828fac74d719b1a0d4090bf1f93568d843fe","sha256:b26a7aa1468e5570a415ae0ab9e50997aefa843017669c7f25a6453272ed82f4"],"state_sha256":"80c3bf5026ca9fc9578659dfd971a605478f4c9ee0f24040f772268ed3cb246e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shCqV+lWLl2mZwuofU2+ZdsnA66Jy0c1SdYMrdagbnbjuBNup2EIJYbAByxe6+5P/zCSVF7XD1bg14iFlyP+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:23:40.229621Z","bundle_sha256":"d6c4b2cb67044cf93e9bd42c77c8d5f1d8dc700154c18f3c4a4821b8c64c1777"}}