{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GTKZED4RICQEOJ5NF7G6R574N7","short_pith_number":"pith:GTKZED4R","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"},"canonical_sha256":"34d5920f9140a04727ad2fcde8f7fc6ffddd78000bd283e0484eedce97efa7a8","source":{"kind":"arxiv","id":"1704.08357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08357","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08357v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08357","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"GTKZED4RICQE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTKZED4RICQEOJ5N","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTKZED4R","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GTKZED4RICQEOJ5NF7G6R574N7","target":"record","payload":{"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"},"canonical_sha256":"34d5920f9140a04727ad2fcde8f7fc6ffddd78000bd283e0484eedce97efa7a8","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"},"source_kind":"arxiv","source_id":"1704.08357","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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2r3NrtNdx6iykUn2xZowohYVvnAPTG6S6LaEZrPo4DB1v0X90eTt3VwWhlsoUk0f+i3JgJPhr76LFrdkr9UuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:24:43.788100Z"},"content_sha256":"7e4a13780e26689cee6e6e2de6a810474b0536e37977b0853c1961fa978403dd","schema_version":"1.0","event_id":"sha256:7e4a13780e26689cee6e6e2de6a810474b0536e37977b0853c1961fa978403dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GTKZED4RICQEOJ5NF7G6R574N7","target":"graph","payload":{"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"},"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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8Q+kCV8DfqPlgsArzesaVdJmKjqpUVJh8wuoD4SZJ4UR3nyU887Hia7BYHb3QoQigojZFg4TPMSe4WWcXY+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:24:43.788464Z"},"content_sha256":"efaedcb30b2bb872c445ffcb5878deae809311fd4a012467fce5940687343f29","schema_version":"1.0","event_id":"sha256:efaedcb30b2bb872c445ffcb5878deae809311fd4a012467fce5940687343f29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/bundle.json","state_url":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTKZED4RICQEOJ5NF7G6R574N7/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-06-21T19:24:43Z","links":{"resolver":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7","bundle":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/bundle.json","state":"https://pith.science/pith/GTKZED4RICQEOJ5NF7G6R574N7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTKZED4RICQEOJ5NF7G6R574N7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GTKZED4RICQEOJ5NF7G6R574N7","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":"41805ba65f84746aaf0d673ad86ea9013b2901be6cf74d72172a3bdc14110444","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T21:33:14Z","title_canon_sha256":"932a1abae6e4e63614f19b84a90d0178eef03c7051cfa97952a65f650da75d4d"},"schema_version":"1.0","source":{"id":"1704.08357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08357","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08357v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08357","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"GTKZED4RICQE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTKZED4RICQEOJ5N","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTKZED4R","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:efaedcb30b2bb872c445ffcb5878deae809311fd4a012467fce5940687343f29","target":"graph","created_at":"2026-05-18T00:45:27Z","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":"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","authors_text":"Javad Ghaderi, Mehrnoosh Shafiee","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T21:33:14Z","title":"An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08357","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:7e4a13780e26689cee6e6e2de6a810474b0536e37977b0853c1961fa978403dd","target":"record","created_at":"2026-05-18T00:45:27Z","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":"41805ba65f84746aaf0d673ad86ea9013b2901be6cf74d72172a3bdc14110444","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T21:33:14Z","title_canon_sha256":"932a1abae6e4e63614f19b84a90d0178eef03c7051cfa97952a65f650da75d4d"},"schema_version":"1.0","source":{"id":"1704.08357","kind":"arxiv","version":1}},"canonical_sha256":"34d5920f9140a04727ad2fcde8f7fc6ffddd78000bd283e0484eedce97efa7a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d5920f9140a04727ad2fcde8f7fc6ffddd78000bd283e0484eedce97efa7a8","first_computed_at":"2026-05-18T00:45:27.874145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.874145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8sWNli3mXBKfBW3NUL20+POQZLt62goq+lD088kvP0sxTMIDqnJ6/KXk53fe79uvtM/k3S2HO8lVVlUAygGNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.874560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e4a13780e26689cee6e6e2de6a810474b0536e37977b0853c1961fa978403dd","sha256:efaedcb30b2bb872c445ffcb5878deae809311fd4a012467fce5940687343f29"],"state_sha256":"bcecc9d752ec2bc56e551ad080ab72d5cd57af105a0f5339e4db5c1c476cdd09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1MXt71rKpDuwTJh39VH3MLIxHFmoZibS2yvk1VW21maz5eAmJrYa0IiNf0cZrLZPly81dutDqCG28n+DRt5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:24:43.790459Z","bundle_sha256":"ef795e581e77aaa3bd1558c498dad6b86489dcf1f845b6c1776c6f338f86383f"}}