{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZYDDTN2X3UMD62Y4T3AICSPTPF","short_pith_number":"pith:ZYDDTN2X","schema_version":"1.0","canonical_sha256":"ce0639b757dd183f6b1c9ec08149f379543688f95b7d54df984702f905658959","source":{"kind":"arxiv","id":"1707.04331","version":2},"attestation_state":"computed","paper":{"title":"A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manish Purohit, Sungjin Im","submitted_at":"2017-07-13T21:28:44Z","abstract_excerpt":"Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are $m$ input ports and $m$ output ports. Each co-flow $j \\in J$ can be represented by a bipartite graph between the input and output ports, where each edge $(i,o)$ with demand $d_{i,o}^j$ means that $d_{i,o}^j$ units of packets must be delivered from port $i$ to port $o$. To complete co-flow $j$, we must satisfy all of its demands. Due to capacity constraints, a port can only transmit (or receive) one unit of data in unit time. A feasi"},"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":"1707.04331","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T21:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"3f4bf603149f6fe5c1c22ad12362a894f0450237d1a413a9dacf39d0b7a7e0b4","abstract_canon_sha256":"f8f667e92982d0beafd4e293e642039e57a016566143cd007695dd8d4e1c0088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.976430Z","signature_b64":"7rwvOJ38KP1cUqGDMrzdDLkXkkbMjfkvLcWoLPqvbRKBkcYkSwEMgmtHYvaYC5ZKn6yKSXwHfpg7l1Eiy/D9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0639b757dd183f6b1c9ec08149f379543688f95b7d54df984702f905658959","last_reissued_at":"2026-05-17T23:59:27.975951Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.975951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manish Purohit, Sungjin Im","submitted_at":"2017-07-13T21:28:44Z","abstract_excerpt":"Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are $m$ input ports and $m$ output ports. Each co-flow $j \\in J$ can be represented by a bipartite graph between the input and output ports, where each edge $(i,o)$ with demand $d_{i,o}^j$ means that $d_{i,o}^j$ units of packets must be delivered from port $i$ to port $o$. To complete co-flow $j$, we must satisfy all of its demands. Due to capacity constraints, a port can only transmit (or receive) one unit of data in unit time. A feasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04331","kind":"arxiv","version":2},"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":"1707.04331","created_at":"2026-05-17T23:59:27.976025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04331v2","created_at":"2026-05-17T23:59:27.976025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04331","created_at":"2026-05-17T23:59:27.976025+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYDDTN2X3UMD","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYDDTN2X3UMD62Y4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYDDTN2X","created_at":"2026-05-18T12:31:59.375834+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/ZYDDTN2X3UMD62Y4T3AICSPTPF","json":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF.json","graph_json":"https://pith.science/api/pith-number/ZYDDTN2X3UMD62Y4T3AICSPTPF/graph.json","events_json":"https://pith.science/api/pith-number/ZYDDTN2X3UMD62Y4T3AICSPTPF/events.json","paper":"https://pith.science/paper/ZYDDTN2X"},"agent_actions":{"view_html":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF","download_json":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF.json","view_paper":"https://pith.science/paper/ZYDDTN2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04331&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYDDTN2X3UMD62Y4T3AICSPTPF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYDDTN2X3UMD62Y4T3AICSPTPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/action/storage_attestation","attest_author":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/action/author_attestation","sign_citation":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/action/citation_signature","submit_replication":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/action/replication_record"}},"created_at":"2026-05-17T23:59:27.976025+00:00","updated_at":"2026-05-17T23:59:27.976025+00:00"}