{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DJ5FYWCCR4GFU33W4YNOWBHLUF","short_pith_number":"pith:DJ5FYWCC","schema_version":"1.0","canonical_sha256":"1a7a5c58428f0c5a6f76e61aeb04eba175fcd8a9a004224db860bfa60b58356c","source":{"kind":"arxiv","id":"1812.06898","version":1},"attestation_state":"computed","paper":{"title":"Coflow Scheduling in Data Centers: Routing and Bandwidth Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Junwei Zhang, Li Shi, Thomas Robertazzi, Yang Liu","submitted_at":"2018-12-17T17:08:41Z","abstract_excerpt":"In distributed computing frameworks like MapReduce, Spark, and Dyrad, a coflow is a set of flows transferring data between two stages of a job. The job cannot start its next stage unless all flows in the coflow finish. To improve the execution performance of such a job, it is crucial to reduce the completion time of a coflow which can contribute more than 50% of the job completion time. While several schedulers have been proposed, we observe that routing, as a factor greatly impacting the Coflow Completion Time (CCT), has not been well considered. In this paper, we focus on the coflow scheduli"},"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":"1812.06898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-17T17:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"16bf167506265db1d07ddba6c3060916dd4ac72eaa2950994644bcb1a7246655","abstract_canon_sha256":"91e583db4ea158aa98b317c646c074fca45505921c7280a0268453ba05bddb31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.131984Z","signature_b64":"hBPWTRspPeRqjsKs8iAoYyOOykO1HHoCcV5BhRN+qcx1vWTu/4j6X+l3GEVsfWyTNRfsYC99IKq+EZVxERvvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7a5c58428f0c5a6f76e61aeb04eba175fcd8a9a004224db860bfa60b58356c","last_reissued_at":"2026-05-17T23:58:09.131311Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.131311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coflow Scheduling in Data Centers: Routing and Bandwidth Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Junwei Zhang, Li Shi, Thomas Robertazzi, Yang Liu","submitted_at":"2018-12-17T17:08:41Z","abstract_excerpt":"In distributed computing frameworks like MapReduce, Spark, and Dyrad, a coflow is a set of flows transferring data between two stages of a job. The job cannot start its next stage unless all flows in the coflow finish. To improve the execution performance of such a job, it is crucial to reduce the completion time of a coflow which can contribute more than 50% of the job completion time. While several schedulers have been proposed, we observe that routing, as a factor greatly impacting the Coflow Completion Time (CCT), has not been well considered. In this paper, we focus on the coflow scheduli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06898","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.06898","created_at":"2026-05-17T23:58:09.131437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06898v1","created_at":"2026-05-17T23:58:09.131437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06898","created_at":"2026-05-17T23:58:09.131437+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJ5FYWCCR4GF","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJ5FYWCCR4GFU33W","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJ5FYWCC","created_at":"2026-05-18T12:32:19.392346+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/DJ5FYWCCR4GFU33W4YNOWBHLUF","json":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF.json","graph_json":"https://pith.science/api/pith-number/DJ5FYWCCR4GFU33W4YNOWBHLUF/graph.json","events_json":"https://pith.science/api/pith-number/DJ5FYWCCR4GFU33W4YNOWBHLUF/events.json","paper":"https://pith.science/paper/DJ5FYWCC"},"agent_actions":{"view_html":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF","download_json":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF.json","view_paper":"https://pith.science/paper/DJ5FYWCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06898&json=true","fetch_graph":"https://pith.science/api/pith-number/DJ5FYWCCR4GFU33W4YNOWBHLUF/graph.json","fetch_events":"https://pith.science/api/pith-number/DJ5FYWCCR4GFU33W4YNOWBHLUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF/action/storage_attestation","attest_author":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF/action/author_attestation","sign_citation":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF/action/citation_signature","submit_replication":"https://pith.science/pith/DJ5FYWCCR4GFU33W4YNOWBHLUF/action/replication_record"}},"created_at":"2026-05-17T23:58:09.131437+00:00","updated_at":"2026-05-17T23:58:09.131437+00:00"}