{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DQTSSUP7B44SHOUHOD6VSE23IS","short_pith_number":"pith:DQTSSUP7","canonical_record":{"source":{"id":"1603.07981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-25T18:45:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"336de0a5a55f97792b84553073cbae7b6decbc5a32f8ae615a4b8387176bd3b3","abstract_canon_sha256":"95f906f68a0ddd415ab45ada969f2faa871a6e622730c58e7d9e66f44482c57c"},"schema_version":"1.0"},"canonical_sha256":"1c272951ff0f3923ba8770fd59135b449676332c65638e5aaea21d2e693ab419","source":{"kind":"arxiv","id":"1603.07981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07981","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07981v1","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07981","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"DQTSSUP7B44S","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DQTSSUP7B44SHOUH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DQTSSUP7","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DQTSSUP7B44SHOUHOD6VSE23IS","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-25T18:45:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"336de0a5a55f97792b84553073cbae7b6decbc5a32f8ae615a4b8387176bd3b3","abstract_canon_sha256":"95f906f68a0ddd415ab45ada969f2faa871a6e622730c58e7d9e66f44482c57c"},"schema_version":"1.0"},"canonical_sha256":"1c272951ff0f3923ba8770fd59135b449676332c65638e5aaea21d2e693ab419","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:15.671058Z","signature_b64":"g4BpPZaQEbsQfavt+Z0cQVCKgQpn0Juf2PuS6izmhtMzuO9S/DXofOeJA6gXL/jBSeNhnlwbi11TdQ7BWlAbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c272951ff0f3923ba8770fd59135b449676332c65638e5aaea21d2e693ab419","last_reissued_at":"2026-05-18T01:18:15.670330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:15.670330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07981","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-18T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97NcGLyFj5WZtg+l93qDb8V9XaF/YaOkXRolYz2XgnOjKFFM50ugoRn+z36yfWX2dcsh9JM84lfO05H3JkBlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:35.036116Z"},"content_sha256":"289badab627d3a81e1fea822b9691f4607f24e21feb475fc9fee1ac44f9a6895","schema_version":"1.0","event_id":"sha256:289badab627d3a81e1fea822b9691f4607f24e21feb475fc9fee1ac44f9a6895"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DQTSSUP7B44SHOUHOD6VSE23IS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Experimental Analysis of Algorithms for Coflow Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Cliff Stein, Yuan Zhong, Zhen Qiu","submitted_at":"2016-03-25T18:45:51Z","abstract_excerpt":"Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal (e.g., the shuffle operations in MapReduce applications). Chowdhury and Stoica introduced the coflow abstraction to capture these parallel communication patterns, and Chowdhury et al. proposed effective heuristics to schedule coflows efficiently. In our previous paper, we considered the strongly NP-hard problem of minimizing the total weighted completion time of coflows with release dates,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07981","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-18T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEa0OTCbfNXscEMAHf0sggSeC4C8ju8Any04Pf+AoLlK31RUnDl0PHBE6pwKNVA1494Pc2Z6O1N32R/nyB/sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:35.036608Z"},"content_sha256":"71b7a3b794154bb58cb30d1c30dc75e59f346f11b50444fc06be031b1751c53f","schema_version":"1.0","event_id":"sha256:71b7a3b794154bb58cb30d1c30dc75e59f346f11b50444fc06be031b1751c53f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQTSSUP7B44SHOUHOD6VSE23IS/bundle.json","state_url":"https://pith.science/pith/DQTSSUP7B44SHOUHOD6VSE23IS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQTSSUP7B44SHOUHOD6VSE23IS/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-05-26T11:49:35Z","links":{"resolver":"https://pith.science/pith/DQTSSUP7B44SHOUHOD6VSE23IS","bundle":"https://pith.science/pith/DQTSSUP7B44SHOUHOD6VSE23IS/bundle.json","state":"https://pith.science/pith/DQTSSUP7B44SHOUHOD6VSE23IS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQTSSUP7B44SHOUHOD6VSE23IS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DQTSSUP7B44SHOUHOD6VSE23IS","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":"95f906f68a0ddd415ab45ada969f2faa871a6e622730c58e7d9e66f44482c57c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-25T18:45:51Z","title_canon_sha256":"336de0a5a55f97792b84553073cbae7b6decbc5a32f8ae615a4b8387176bd3b3"},"schema_version":"1.0","source":{"id":"1603.07981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07981","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07981v1","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07981","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"DQTSSUP7B44S","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DQTSSUP7B44SHOUH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DQTSSUP7","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:71b7a3b794154bb58cb30d1c30dc75e59f346f11b50444fc06be031b1751c53f","target":"graph","created_at":"2026-05-18T01:18:15Z","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":"Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal (e.g., the shuffle operations in MapReduce applications). Chowdhury and Stoica introduced the coflow abstraction to capture these parallel communication patterns, and Chowdhury et al. proposed effective heuristics to schedule coflows efficiently. In our previous paper, we considered the strongly NP-hard problem of minimizing the total weighted completion time of coflows with release dates,","authors_text":"Cliff Stein, Yuan Zhong, Zhen Qiu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-25T18:45:51Z","title":"Experimental Analysis of Algorithms for Coflow Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07981","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:289badab627d3a81e1fea822b9691f4607f24e21feb475fc9fee1ac44f9a6895","target":"record","created_at":"2026-05-18T01:18:15Z","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":"95f906f68a0ddd415ab45ada969f2faa871a6e622730c58e7d9e66f44482c57c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-25T18:45:51Z","title_canon_sha256":"336de0a5a55f97792b84553073cbae7b6decbc5a32f8ae615a4b8387176bd3b3"},"schema_version":"1.0","source":{"id":"1603.07981","kind":"arxiv","version":1}},"canonical_sha256":"1c272951ff0f3923ba8770fd59135b449676332c65638e5aaea21d2e693ab419","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c272951ff0f3923ba8770fd59135b449676332c65638e5aaea21d2e693ab419","first_computed_at":"2026-05-18T01:18:15.670330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:15.670330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g4BpPZaQEbsQfavt+Z0cQVCKgQpn0Juf2PuS6izmhtMzuO9S/DXofOeJA6gXL/jBSeNhnlwbi11TdQ7BWlAbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:15.671058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:289badab627d3a81e1fea822b9691f4607f24e21feb475fc9fee1ac44f9a6895","sha256:71b7a3b794154bb58cb30d1c30dc75e59f346f11b50444fc06be031b1751c53f"],"state_sha256":"b21d065ab05d10d23da6a4362f3f117770e5fcda670e2513aa5fce092bd66bb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueLc5U258LqEaQfPkwuF6SZqu5kyAm4/X0DcnrTSxuoNpm5kb3nkmFi7vmTuJrTgpOGL9jbKKHC4RJqZc1I3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:49:35.039656Z","bundle_sha256":"f8351a64da6ed683eaa929a96ea8e0be73629a56d68f15cb60a57374a14462dc"}}