{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IJZRQLZBEIVWLMAPH4GQSC36G7","short_pith_number":"pith:IJZRQLZB","schema_version":"1.0","canonical_sha256":"4273182f21222b65b00f3f0d090b7e37e59053cb41edf62c199acd0187d34f1a","source":{"kind":"arxiv","id":"2311.11296","version":3},"attestation_state":"computed","paper":{"title":"Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chi-Yeh Chen","submitted_at":"2023-11-19T11:02:04Z","abstract_excerpt":"This paper addresses the challenging scheduling problem of coflows with release times, with the objective of minimizing the total weighted completion time. Previous literature has predominantly concentrated on establishing the scheduling order of coflows. In advancing this research, we contribute by optimizing performance through the determination of the flow scheduling order. The proposed approximation algorithm achieves approximation ratios of $3$ and $2+\\frac{1}{LB}$ for arbitrary and zero release times, respectively, where $LB$ is the minimum lower bound of coflow completion time. To furth"},"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":"2311.11296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-19T11:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"c1f0e689d3638d139f2dcb9cacb37139c5bb97b7bf9d9af73e2a44410948fbb8","abstract_canon_sha256":"109407717b7e62725ea5ed830367b320bdae094174bd22018ea8e13361d82726"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:52.759356Z","signature_b64":"KHu4drZUhBSGhg2jkmaU1WctRDJrl6/3xlCPlL0C7FgwzeVWQb8/AHYDTLUTrMK0roF2ROoJHYlKulscciRkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4273182f21222b65b00f3f0d090b7e37e59053cb41edf62c199acd0187d34f1a","last_reissued_at":"2026-07-05T07:27:52.758833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:52.758833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chi-Yeh Chen","submitted_at":"2023-11-19T11:02:04Z","abstract_excerpt":"This paper addresses the challenging scheduling problem of coflows with release times, with the objective of minimizing the total weighted completion time. Previous literature has predominantly concentrated on establishing the scheduling order of coflows. In advancing this research, we contribute by optimizing performance through the determination of the flow scheduling order. The proposed approximation algorithm achieves approximation ratios of $3$ and $2+\\frac{1}{LB}$ for arbitrary and zero release times, respectively, where $LB$ is the minimum lower bound of coflow completion time. To furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.11296","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.11296/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.11296","created_at":"2026-07-05T07:27:52.758893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.11296v3","created_at":"2026-07-05T07:27:52.758893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.11296","created_at":"2026-07-05T07:27:52.758893+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJZRQLZBEIVW","created_at":"2026-07-05T07:27:52.758893+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJZRQLZBEIVWLMAP","created_at":"2026-07-05T07:27:52.758893+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJZRQLZB","created_at":"2026-07-05T07:27:52.758893+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.09293","citing_title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7","json":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7.json","graph_json":"https://pith.science/api/pith-number/IJZRQLZBEIVWLMAPH4GQSC36G7/graph.json","events_json":"https://pith.science/api/pith-number/IJZRQLZBEIVWLMAPH4GQSC36G7/events.json","paper":"https://pith.science/paper/IJZRQLZB"},"agent_actions":{"view_html":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7","download_json":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7.json","view_paper":"https://pith.science/paper/IJZRQLZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.11296&json=true","fetch_graph":"https://pith.science/api/pith-number/IJZRQLZBEIVWLMAPH4GQSC36G7/graph.json","fetch_events":"https://pith.science/api/pith-number/IJZRQLZBEIVWLMAPH4GQSC36G7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7/action/storage_attestation","attest_author":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7/action/author_attestation","sign_citation":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7/action/citation_signature","submit_replication":"https://pith.science/pith/IJZRQLZBEIVWLMAPH4GQSC36G7/action/replication_record"}},"created_at":"2026-07-05T07:27:52.758893+00:00","updated_at":"2026-07-05T07:27:52.758893+00:00"}