{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3SA5FVPWHDHDUR2JC3DJEQUDCY","short_pith_number":"pith:3SA5FVPW","canonical_record":{"source":{"id":"1701.02419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-10T02:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"978c6b44bb6d406ccd3030121e4ca6d17466a45800ca0f58f766f75e9e0604ae","abstract_canon_sha256":"f90e46d0b6ef639cd60fef842cabd2d515cef95e5298534a2ee785858e198f8c"},"schema_version":"1.0"},"canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","source":{"kind":"arxiv","id":"1701.02419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02419","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02419v1","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02419","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"3SA5FVPWHDHD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SA5FVPWHDHDUR2J","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SA5FVPW","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3SA5FVPWHDHDUR2JC3DJEQUDCY","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-10T02:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"978c6b44bb6d406ccd3030121e4ca6d17466a45800ca0f58f766f75e9e0604ae","abstract_canon_sha256":"f90e46d0b6ef639cd60fef842cabd2d515cef95e5298534a2ee785858e198f8c"},"schema_version":"1.0"},"canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:04.306150Z","signature_b64":"Qguu7fYJf78ZThimpEKrr9bx0BVUsR0/oEDWaIBJlxDQT2xbxjjhlZDyR3GBAJiImzEIYg3cm67SvCC39LH8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","last_reissued_at":"2026-05-18T00:53:04.305634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:04.305634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02419","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:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+halM75/XQnqdi8bKcIgmkZqVKBhGxyLpzgko87plQp3zC1fO+IZCFs9r6+QvSyyNl0adMYlSXsnMjPmTdmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:23:33.210420Z"},"content_sha256":"c76d4cbe697a86b68dbf078d59a87c498efdb9d15b28d393861f0317197744db","schema_version":"1.0","event_id":"sha256:c76d4cbe697a86b68dbf078d59a87c498efdb9d15b28d393861f0317197744db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3SA5FVPWHDHDUR2JC3DJEQUDCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Qingkai Liang","submitted_at":"2017-01-10T02:33:25Z","abstract_excerpt":"A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \\emph{coflow-level delay}, i.e., the time to complete all the flows in a coflow, in the context of an $N\\times N$ input-queued switch. In particular, we develop a throughput-optimal scheduling policy that achieves the best scaling of coflow-level delay as $N\\rightarrow\\infty$. We first derive lower bounds on the coflow-level delay that can be achieved by any scheduling policy. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02419","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:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ej6gqJglLVU8CA5GyJKjabkAmVRUPJkzbeakD+FJCLNwzHMYkZxWVz5/E9h44i0KtPTVC+tL+lkxLS/gPjpqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:23:33.210792Z"},"content_sha256":"9986b1c20617409c42742ee4cb557331cbce17c03c758d3406119ff6a3eb80e3","schema_version":"1.0","event_id":"sha256:9986b1c20617409c42742ee4cb557331cbce17c03c758d3406119ff6a3eb80e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/bundle.json","state_url":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/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-28T10:23:33Z","links":{"resolver":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY","bundle":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/bundle.json","state":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3SA5FVPWHDHDUR2JC3DJEQUDCY","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":"f90e46d0b6ef639cd60fef842cabd2d515cef95e5298534a2ee785858e198f8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-10T02:33:25Z","title_canon_sha256":"978c6b44bb6d406ccd3030121e4ca6d17466a45800ca0f58f766f75e9e0604ae"},"schema_version":"1.0","source":{"id":"1701.02419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02419","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02419v1","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02419","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"3SA5FVPWHDHD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SA5FVPWHDHDUR2J","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SA5FVPW","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:9986b1c20617409c42742ee4cb557331cbce17c03c758d3406119ff6a3eb80e3","target":"graph","created_at":"2026-05-18T00:53:04Z","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":"A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \\emph{coflow-level delay}, i.e., the time to complete all the flows in a coflow, in the context of an $N\\times N$ input-queued switch. In particular, we develop a throughput-optimal scheduling policy that achieves the best scaling of coflow-level delay as $N\\rightarrow\\infty$. We first derive lower bounds on the coflow-level delay that can be achieved by any scheduling policy. ","authors_text":"Eytan Modiano, Qingkai Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-10T02:33:25Z","title":"Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02419","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:c76d4cbe697a86b68dbf078d59a87c498efdb9d15b28d393861f0317197744db","target":"record","created_at":"2026-05-18T00:53:04Z","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":"f90e46d0b6ef639cd60fef842cabd2d515cef95e5298534a2ee785858e198f8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-10T02:33:25Z","title_canon_sha256":"978c6b44bb6d406ccd3030121e4ca6d17466a45800ca0f58f766f75e9e0604ae"},"schema_version":"1.0","source":{"id":"1701.02419","kind":"arxiv","version":1}},"canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","first_computed_at":"2026-05-18T00:53:04.305634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:04.305634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qguu7fYJf78ZThimpEKrr9bx0BVUsR0/oEDWaIBJlxDQT2xbxjjhlZDyR3GBAJiImzEIYg3cm67SvCC39LH8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:04.306150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c76d4cbe697a86b68dbf078d59a87c498efdb9d15b28d393861f0317197744db","sha256:9986b1c20617409c42742ee4cb557331cbce17c03c758d3406119ff6a3eb80e3"],"state_sha256":"2191ab635f8aff74b70cd6490208d43cccca257c66b6b76f6bdc33247e5486e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJE18daZaaJ04ZJRyA5qSFQdRD3Vz3iUkVm5NcwYK5B0gzPofVJOtEnnO4yRgokA0wcDQdd5IsyTKYfSM3hAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:23:33.213179Z","bundle_sha256":"ec6587167eba8199915e7e6555f623286102e54af162151bd6afb864645513b9"}}