{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OVRLN2KUOBFOEIPTGEJHVLDJUI","short_pith_number":"pith:OVRLN2KU","canonical_record":{"source":{"id":"1809.01050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-04T15:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"cb4bb4ec8db8bf8251d26df95709378a3da12115d377c70e5e14c1d21b78dd42","abstract_canon_sha256":"504658604264852ce5016964aedcb222eee99b71a5ca66f7b958f295d548b295"},"schema_version":"1.0"},"canonical_sha256":"7562b6e954704ae221f331127aac69a224f1337353c6da5f417d128c425c92af","source":{"kind":"arxiv","id":"1809.01050","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01050","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01050v2","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01050","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"OVRLN2KUOBFO","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVRLN2KUOBFOEIPT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVRLN2KU","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OVRLN2KUOBFOEIPTGEJHVLDJUI","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-04T15:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"cb4bb4ec8db8bf8251d26df95709378a3da12115d377c70e5e14c1d21b78dd42","abstract_canon_sha256":"504658604264852ce5016964aedcb222eee99b71a5ca66f7b958f295d548b295"},"schema_version":"1.0"},"canonical_sha256":"7562b6e954704ae221f331127aac69a224f1337353c6da5f417d128c425c92af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:13.646489Z","signature_b64":"HxmUnUR6zUpK041Lt1JFNrbO+NiQgM9eOa8BT2RJZLXVOGOttvciO5N/LEbhkbRz8lepcUg7M9MSxcY7sDi4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7562b6e954704ae221f331127aac69a224f1337353c6da5f417d128c425c92af","last_reissued_at":"2026-05-18T00:05:13.645912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:13.645912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01050","source_version":2,"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:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUFdgH/kGBAPZXrayBJux3ZYT9Rb3bX/5fc2DxaPOx9lA83zHsjRaxtuDAIYggV7MPYwd3CmkCAl0+11P+XUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:58:47.335963Z"},"content_sha256":"1fe83385387726a66c3c00ed6e446af2264586d58c460642b6633f451ffc7fea","schema_version":"1.0","event_id":"sha256:1fe83385387726a66c3c00ed6e446af2264586d58c460642b6633f451ffc7fea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OVRLN2KUOBFOEIPTGEJHVLDJUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"J\\'er\\'emie Leguay, Konstantin Avrachenkov, Lorenzo Maggi, Zaid Allybokus","submitted_at":"2018-09-04T15:37:23Z","abstract_excerpt":"The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time. To address this issue, bandwidth sharing techniques that quickly react to the traffic fluctuations are of interest, especially in large scale settings with hundreds of nodes and thousands of flows. In this context, we propose a distributed algorithm based on the Alternating Direction Method of Multipliers (ADMM) that tackles the multi-path fair resource allocation problem in a distributed SDN control archit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01050","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"},"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:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xuCzRe0CKelbrgb1v1Ml8kejaEjw+wY4GrS9itteKIAB2tXrqmBqPVk2Z7+DkrEU/YD4i30t/Wb2qUbtUinBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:58:47.336697Z"},"content_sha256":"0a2dd62cc9bd0c059dcec6d5c2c16afa1814100e2f6ed7f1212262fd36022ec9","schema_version":"1.0","event_id":"sha256:0a2dd62cc9bd0c059dcec6d5c2c16afa1814100e2f6ed7f1212262fd36022ec9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI/bundle.json","state_url":"https://pith.science/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI/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-30T04:58:47Z","links":{"resolver":"https://pith.science/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI","bundle":"https://pith.science/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI/bundle.json","state":"https://pith.science/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVRLN2KUOBFOEIPTGEJHVLDJUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OVRLN2KUOBFOEIPTGEJHVLDJUI","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":"504658604264852ce5016964aedcb222eee99b71a5ca66f7b958f295d548b295","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-04T15:37:23Z","title_canon_sha256":"cb4bb4ec8db8bf8251d26df95709378a3da12115d377c70e5e14c1d21b78dd42"},"schema_version":"1.0","source":{"id":"1809.01050","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01050","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01050v2","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01050","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"OVRLN2KUOBFO","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVRLN2KUOBFOEIPT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVRLN2KU","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:0a2dd62cc9bd0c059dcec6d5c2c16afa1814100e2f6ed7f1212262fd36022ec9","target":"graph","created_at":"2026-05-18T00:05:13Z","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":"The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time. To address this issue, bandwidth sharing techniques that quickly react to the traffic fluctuations are of interest, especially in large scale settings with hundreds of nodes and thousands of flows. In this context, we propose a distributed algorithm based on the Alternating Direction Method of Multipliers (ADMM) that tackles the multi-path fair resource allocation problem in a distributed SDN control archit","authors_text":"J\\'er\\'emie Leguay, Konstantin Avrachenkov, Lorenzo Maggi, Zaid Allybokus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-04T15:37:23Z","title":"Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01050","kind":"arxiv","version":2},"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:1fe83385387726a66c3c00ed6e446af2264586d58c460642b6633f451ffc7fea","target":"record","created_at":"2026-05-18T00:05:13Z","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":"504658604264852ce5016964aedcb222eee99b71a5ca66f7b958f295d548b295","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-04T15:37:23Z","title_canon_sha256":"cb4bb4ec8db8bf8251d26df95709378a3da12115d377c70e5e14c1d21b78dd42"},"schema_version":"1.0","source":{"id":"1809.01050","kind":"arxiv","version":2}},"canonical_sha256":"7562b6e954704ae221f331127aac69a224f1337353c6da5f417d128c425c92af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7562b6e954704ae221f331127aac69a224f1337353c6da5f417d128c425c92af","first_computed_at":"2026-05-18T00:05:13.645912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:13.645912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HxmUnUR6zUpK041Lt1JFNrbO+NiQgM9eOa8BT2RJZLXVOGOttvciO5N/LEbhkbRz8lepcUg7M9MSxcY7sDi4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:13.646489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01050","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fe83385387726a66c3c00ed6e446af2264586d58c460642b6633f451ffc7fea","sha256:0a2dd62cc9bd0c059dcec6d5c2c16afa1814100e2f6ed7f1212262fd36022ec9"],"state_sha256":"cba872f1cb467b9ab30deb96d200003dc70efe25c3a2aab6635d64eb96524b7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5CkgfpJ8vTz/RoxUMKp3zWXgKywp95qNjeu+js5chJCZTcxtNZYzAP+eVn5jtEjUxktQT9PYAiu8nrq5DF+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:58:47.340573Z","bundle_sha256":"143ce603dea67955195042b93d0156cb5f5dfbf55aa7c3e75c9f6303635ee499"}}