{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZYDDTN2X3UMD62Y4T3AICSPTPF","short_pith_number":"pith:ZYDDTN2X","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"},"canonical_sha256":"ce0639b757dd183f6b1c9ec08149f379543688f95b7d54df984702f905658959","source":{"kind":"arxiv","id":"1707.04331","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04331","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04331v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04331","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZYDDTN2X3UMD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYDDTN2X3UMD62Y4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYDDTN2X","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZYDDTN2X3UMD62Y4T3AICSPTPF","target":"record","payload":{"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"},"canonical_sha256":"ce0639b757dd183f6b1c9ec08149f379543688f95b7d54df984702f905658959","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"},"source_kind":"arxiv","source_id":"1707.04331","source_version":2,"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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKbnpyN6yPNCD6Kobpd1ezI/lmy4hTQqpzdaFNz4CRuX7cd82Xqev/K9b823YlFUO56U/Bn/aCdnMZPbKg2pCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:02:57.075149Z"},"content_sha256":"2ac06b914329fa27932357a7e8cbf5195a5eab300728889e10e1f5f7b21513a9","schema_version":"1.0","event_id":"sha256:2ac06b914329fa27932357a7e8cbf5195a5eab300728889e10e1f5f7b21513a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZYDDTN2X3UMD62Y4T3AICSPTPF","target":"graph","payload":{"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"},"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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBU2PmRo56M8BZqq50lkrOkcAS6mRzs54B1ODmtFXUtpfX06uQrvo4iN7hzfzioqe7EGtNA+y5p9DHXSESBjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:02:57.075491Z"},"content_sha256":"04097f5e55223b7ce19f419a3886cbb28caf62b4772ccb50469a259edaddaf49","schema_version":"1.0","event_id":"sha256:04097f5e55223b7ce19f419a3886cbb28caf62b4772ccb50469a259edaddaf49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/bundle.json","state_url":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/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-27T14:02:57Z","links":{"resolver":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF","bundle":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/bundle.json","state":"https://pith.science/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYDDTN2X3UMD62Y4T3AICSPTPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZYDDTN2X3UMD62Y4T3AICSPTPF","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":"f8f667e92982d0beafd4e293e642039e57a016566143cd007695dd8d4e1c0088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T21:28:44Z","title_canon_sha256":"3f4bf603149f6fe5c1c22ad12362a894f0450237d1a413a9dacf39d0b7a7e0b4"},"schema_version":"1.0","source":{"id":"1707.04331","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04331","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04331v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04331","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZYDDTN2X3UMD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYDDTN2X3UMD62Y4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYDDTN2X","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:04097f5e55223b7ce19f419a3886cbb28caf62b4772ccb50469a259edaddaf49","target":"graph","created_at":"2026-05-17T23:59: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":"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","authors_text":"Manish Purohit, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T21:28:44Z","title":"A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04331","kind":"arxiv","version":2},"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:2ac06b914329fa27932357a7e8cbf5195a5eab300728889e10e1f5f7b21513a9","target":"record","created_at":"2026-05-17T23:59: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":"f8f667e92982d0beafd4e293e642039e57a016566143cd007695dd8d4e1c0088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T21:28:44Z","title_canon_sha256":"3f4bf603149f6fe5c1c22ad12362a894f0450237d1a413a9dacf39d0b7a7e0b4"},"schema_version":"1.0","source":{"id":"1707.04331","kind":"arxiv","version":2}},"canonical_sha256":"ce0639b757dd183f6b1c9ec08149f379543688f95b7d54df984702f905658959","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce0639b757dd183f6b1c9ec08149f379543688f95b7d54df984702f905658959","first_computed_at":"2026-05-17T23:59:27.975951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:27.975951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7rwvOJ38KP1cUqGDMrzdDLkXkkbMjfkvLcWoLPqvbRKBkcYkSwEMgmtHYvaYC5ZKn6yKSXwHfpg7l1Eiy/D9Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:27.976430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04331","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ac06b914329fa27932357a7e8cbf5195a5eab300728889e10e1f5f7b21513a9","sha256:04097f5e55223b7ce19f419a3886cbb28caf62b4772ccb50469a259edaddaf49"],"state_sha256":"62111ed11b61c404b70fe39573e6b1820fa269675935f518b7c31a37cfa81c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsFzYt/i67Tb8XclLlPvdhT6+xUOovPTg7pQzT9bOkAv9C7McHs8nnMgYea2yuirVH31wgOiUmiLsf2sRvKJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:02:57.077354Z","bundle_sha256":"e04e2e9f197492a7e61201135c6e42b3dbec4d8d77b62787c8cd6ebf88059d66"}}