{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IDEOS3BOXS22IB7K6JRWJPSNC6","short_pith_number":"pith:IDEOS3BO","canonical_record":{"source":{"id":"2606.31530","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T11:44:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"57f83921c1c3648eee72231e28d9633a8882d62d5b4b4767af7bfca09d4b050f","abstract_canon_sha256":"b28b8cbd9d89f946654848d0d3622d74f3abdb5d341e912104aba32e6c5a72b3"},"schema_version":"1.0"},"canonical_sha256":"40c8e96c2ebcb5a407eaf26364be4d1788b74722617faf9cb8d515c7f09d83c7","source":{"kind":"arxiv","id":"2606.31530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31530","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31530v1","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31530","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"IDEOS3BOXS22","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"pith_short_16","alias_value":"IDEOS3BOXS22IB7K","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"pith_short_8","alias_value":"IDEOS3BO","created_at":"2026-07-01T01:18:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IDEOS3BOXS22IB7K6JRWJPSNC6","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31530","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T11:44:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"57f83921c1c3648eee72231e28d9633a8882d62d5b4b4767af7bfca09d4b050f","abstract_canon_sha256":"b28b8cbd9d89f946654848d0d3622d74f3abdb5d341e912104aba32e6c5a72b3"},"schema_version":"1.0"},"canonical_sha256":"40c8e96c2ebcb5a407eaf26364be4d1788b74722617faf9cb8d515c7f09d83c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:06.233035Z","signature_b64":"SfbCpMmsr7llA3IP7NxqpCP0omaxLrLRzVr6rFe0hB3hpnMtJ6StYBukFD4eWG2sUtocD8EQmDuJLNcp7kOdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c8e96c2ebcb5a407eaf26364be4d1788b74722617faf9cb8d515c7f09d83c7","last_reissued_at":"2026-07-01T01:18:06.232581Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:06.232581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31530","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-07-01T01:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87xERVPlq4nRg+VoUcdi0pQeAKppx+rY+w89YoyKNasW0IALCgOgTfKMSWkCD/WX+GR0QLOgT+rV2LX9FeOwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:27:12.913945Z"},"content_sha256":"117b1e721543ac42a10a70e17574a8f751001b012324da3e4e65f219777806a1","schema_version":"1.0","event_id":"sha256:117b1e721543ac42a10a70e17574a8f751001b012324da3e4e65f219777806a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IDEOS3BOXS22IB7K6JRWJPSNC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Scheduling with Group Completion Times","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Lars Rohwedder, Leander Schnaars","submitted_at":"2026-06-30T11:44:19Z","abstract_excerpt":"In the Graph Scheduling problem we schedule a given multiset of edges on discrete time steps, such that at each step the set of edges forms a matching. The goal is to minimize the sum of weighted group completion times, where a group is a set of edges and it completes when the last edge has been scheduled. Two popular variants of this problem are Coflow Scheduling and Data Migration. Our main result is extending a recent iterated rounding approach from Coflow Scheduling, roughly corresponding to the bipartite case, to the general Graph Scheduling problem. This yields an essentially tight $(2+\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31530","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.31530/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"},"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-07-01T01:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mucuETOcRWWabApBP1lquKFSpCdLeldKY4vtKENobw6FGA/JAMAkd/ST1tXTJv9dOfF7Lm4r97SG13Ttj2fqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:27:12.914596Z"},"content_sha256":"dff150e19b91176c00e5373a95830c64559cc5f8a75315dad13cd355e326c05e","schema_version":"1.0","event_id":"sha256:dff150e19b91176c00e5373a95830c64559cc5f8a75315dad13cd355e326c05e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDEOS3BOXS22IB7K6JRWJPSNC6/bundle.json","state_url":"https://pith.science/pith/IDEOS3BOXS22IB7K6JRWJPSNC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDEOS3BOXS22IB7K6JRWJPSNC6/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-07-01T08:27:12Z","links":{"resolver":"https://pith.science/pith/IDEOS3BOXS22IB7K6JRWJPSNC6","bundle":"https://pith.science/pith/IDEOS3BOXS22IB7K6JRWJPSNC6/bundle.json","state":"https://pith.science/pith/IDEOS3BOXS22IB7K6JRWJPSNC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDEOS3BOXS22IB7K6JRWJPSNC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IDEOS3BOXS22IB7K6JRWJPSNC6","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":"b28b8cbd9d89f946654848d0d3622d74f3abdb5d341e912104aba32e6c5a72b3","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T11:44:19Z","title_canon_sha256":"57f83921c1c3648eee72231e28d9633a8882d62d5b4b4767af7bfca09d4b050f"},"schema_version":"1.0","source":{"id":"2606.31530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31530","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31530v1","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31530","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"IDEOS3BOXS22","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"pith_short_16","alias_value":"IDEOS3BOXS22IB7K","created_at":"2026-07-01T01:18:06Z"},{"alias_kind":"pith_short_8","alias_value":"IDEOS3BO","created_at":"2026-07-01T01:18:06Z"}],"graph_snapshots":[{"event_id":"sha256:dff150e19b91176c00e5373a95830c64559cc5f8a75315dad13cd355e326c05e","target":"graph","created_at":"2026-07-01T01:18:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.31530/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Graph Scheduling problem we schedule a given multiset of edges on discrete time steps, such that at each step the set of edges forms a matching. The goal is to minimize the sum of weighted group completion times, where a group is a set of edges and it completes when the last edge has been scheduled. Two popular variants of this problem are Coflow Scheduling and Data Migration. Our main result is extending a recent iterated rounding approach from Coflow Scheduling, roughly corresponding to the bipartite case, to the general Graph Scheduling problem. This yields an essentially tight $(2+\\","authors_text":"Lars Rohwedder, Leander Schnaars","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T11:44:19Z","title":"Graph Scheduling with Group Completion Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31530","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:117b1e721543ac42a10a70e17574a8f751001b012324da3e4e65f219777806a1","target":"record","created_at":"2026-07-01T01:18:06Z","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":"b28b8cbd9d89f946654848d0d3622d74f3abdb5d341e912104aba32e6c5a72b3","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T11:44:19Z","title_canon_sha256":"57f83921c1c3648eee72231e28d9633a8882d62d5b4b4767af7bfca09d4b050f"},"schema_version":"1.0","source":{"id":"2606.31530","kind":"arxiv","version":1}},"canonical_sha256":"40c8e96c2ebcb5a407eaf26364be4d1788b74722617faf9cb8d515c7f09d83c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40c8e96c2ebcb5a407eaf26364be4d1788b74722617faf9cb8d515c7f09d83c7","first_computed_at":"2026-07-01T01:18:06.232581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:06.232581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfbCpMmsr7llA3IP7NxqpCP0omaxLrLRzVr6rFe0hB3hpnMtJ6StYBukFD4eWG2sUtocD8EQmDuJLNcp7kOdBQ==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:06.233035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117b1e721543ac42a10a70e17574a8f751001b012324da3e4e65f219777806a1","sha256:dff150e19b91176c00e5373a95830c64559cc5f8a75315dad13cd355e326c05e"],"state_sha256":"95bc9e6d49d5b533254221478b8f8d314ba45ee51d8c1dae88f0b70b7cb0f6dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdsRej1ImKn8LiF8giX2BDxWWWLftEHwA7ekV9KVbudDu9yb5m7l6k0ik0+9Mjg2AlafsXC9IWRB75cf1KMzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T08:27:12.919412Z","bundle_sha256":"e1d4de8d58aca5b47e3c190aced1104437c036bfa84f4ec34442fcb5453356bb"}}