{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X5U6E3IXRSKP73JQP5KA67JGXE","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":"b3781903a3a253dc2133aeac12f4090d39cb39472d4aa77c552c41a6917e64f8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-20T15:51:31Z","title_canon_sha256":"480e8f1757e72767b4052ac8db0d7fbb2f14aa1b817f0e7dae0154b16fc97eb0"},"schema_version":"1.0","source":{"id":"1606.06183","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06183","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06183v5","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06183","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"X5U6E3IXRSKP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5U6E3IXRSKP73JQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5U6E3IX","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:63672e1f43c8b38259cfc4fe3f4355c786dd5103a39ed46b7c3b595caf1fb285","target":"graph","created_at":"2026-05-18T00:21:43Z","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":"Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a computation completes when all of its flows complete. A useful abstraction for modeling such scenarios is a {\\em coflow}, which is a collection of flows (e.g., tasks, packets, data transmissions) that all share the same performance goal.\n  In this paper, we present the first approximation algorithms for scheduling coflows over general network topologies with the objective of minimizing total weighted completion time. W","authors_text":"Erez Kantor, Hamidreza Jahanjou, Rajmohan Rajaraman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-20T15:51:31Z","title":"Asymptotically Optimal Approximation Algorithms for Coflow Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06183","kind":"arxiv","version":5},"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:cf42bcdaa6a2b63382d7cb6192d63e7e1061cc708b553ce46b1b24febace92b6","target":"record","created_at":"2026-05-18T00:21:43Z","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":"b3781903a3a253dc2133aeac12f4090d39cb39472d4aa77c552c41a6917e64f8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-20T15:51:31Z","title_canon_sha256":"480e8f1757e72767b4052ac8db0d7fbb2f14aa1b817f0e7dae0154b16fc97eb0"},"schema_version":"1.0","source":{"id":"1606.06183","kind":"arxiv","version":5}},"canonical_sha256":"bf69e26d178c94ffed307f540f7d26b90ac395fa37aa26abe0acb7115e629395","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf69e26d178c94ffed307f540f7d26b90ac395fa37aa26abe0acb7115e629395","first_computed_at":"2026-05-18T00:21:43.667901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:43.667901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mMdg6MA/vxoVhzqldJFXah0KpozDx8rjdGSSsyh3bE5Wrh3yh2M0U1m3ly+GoNIR+eccPSbRupfzOB1djuCtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:43.668600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06183","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf42bcdaa6a2b63382d7cb6192d63e7e1061cc708b553ce46b1b24febace92b6","sha256:63672e1f43c8b38259cfc4fe3f4355c786dd5103a39ed46b7c3b595caf1fb285"],"state_sha256":"320dc097ac179ddcc01cb7dfc3f01954353675451719ad803ac319c86c7a2f51"}