{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GTKZED4RICQEOJ5NF7G6R574N7","short_pith_number":"pith:GTKZED4R","schema_version":"1.0","canonical_sha256":"34d5920f9140a04727ad2fcde8f7fc6ffddd78000bd283e0484eedce97efa7a8","source":{"kind":"arxiv","id":"1704.08357","version":1},"attestation_state":"computed","paper":{"title":"An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Javad Ghaderi, Mehrnoosh Shafiee","submitted_at":"2017-04-26T21:33:14Z","abstract_excerpt":"In data-parallel computing frameworks, intermediate parallel data is often produced at various stages which needs to be transferred among servers in the datacenter network (e.g. the shuffle phase in MapReduce). A stage often cannot start or be completed unless all the required data pieces from the preceding stage are received. \\emph{Coflow} is a recently proposed networking abstraction to capture such communication patterns. We consider the problem of efficiently scheduling coflows with release dates in a shared datacenter network so as to minimize the total weighted completion time of coflows"},"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":"1704.08357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T21:33:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"932a1abae6e4e63614f19b84a90d0178eef03c7051cfa97952a65f650da75d4d","abstract_canon_sha256":"41805ba65f84746aaf0d673ad86ea9013b2901be6cf74d72172a3bdc14110444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.874560Z","signature_b64":"8sWNli3mXBKfBW3NUL20+POQZLt62goq+lD088kvP0sxTMIDqnJ6/KXk53fe79uvtM/k3S2HO8lVVlUAygGNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d5920f9140a04727ad2fcde8f7fc6ffddd78000bd283e0484eedce97efa7a8","last_reissued_at":"2026-05-18T00:45:27.874145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.874145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Javad Ghaderi, Mehrnoosh Shafiee","submitted_at":"2017-04-26T21:33:14Z","abstract_excerpt":"In data-parallel computing frameworks, intermediate parallel data is often produced at various stages which needs to be transferred among servers in the datacenter network (e.g. the shuffle phase in MapReduce). A stage often cannot start or be completed unless all the required data pieces from the preceding stage are received. \\emph{Coflow} is a recently proposed networking abstraction to capture such communication patterns. We consider the problem of efficiently scheduling coflows with release dates in a shared datacenter network so as to minimize the total weighted completion time of coflows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08357","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":"1704.08357","created_at":"2026-05-18T00:45:27.874213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08357v1","created_at":"2026-05-18T00:45:27.874213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08357","created_at":"2026-05-18T00:45:27.874213+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTKZED4RICQE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTKZED4RICQEOJ5N","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTKZED4R","created_at":"2026-05-18T12:31:18.294218+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/GTKZED4RICQEOJ5NF7G6R574N7","json":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7.json","graph_json":"https://pith.science/api/pith-number/GTKZED4RICQEOJ5NF7G6R574N7/graph.json","events_json":"https://pith.science/api/pith-number/GTKZED4RICQEOJ5NF7G6R574N7/events.json","paper":"https://pith.science/paper/GTKZED4R"},"agent_actions":{"view_html":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7","download_json":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7.json","view_paper":"https://pith.science/paper/GTKZED4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08357&json=true","fetch_graph":"https://pith.science/api/pith-number/GTKZED4RICQEOJ5NF7G6R574N7/graph.json","fetch_events":"https://pith.science/api/pith-number/GTKZED4RICQEOJ5NF7G6R574N7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/action/storage_attestation","attest_author":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/action/author_attestation","sign_citation":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/action/citation_signature","submit_replication":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/action/replication_record"}},"created_at":"2026-05-18T00:45:27.874213+00:00","updated_at":"2026-05-18T00:45:27.874213+00:00"}