{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JQHPFJN3DWTKWAW7R7O2SLMLRI","short_pith_number":"pith:JQHPFJN3","canonical_record":{"source":{"id":"2402.19259","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T15:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"a30c16d796c7489b13ce31c6c453b9ba55755baeb190af4333f09230b322a0e0","abstract_canon_sha256":"3f7bad246255e2f5246f67e8a6cce63564f69533b863ea5a69ba9b97965fc36b"},"schema_version":"1.0"},"canonical_sha256":"4c0ef2a5bb1da6ab02df8fdda92d8b8a2fbf929c805e5a9961fc5a515b4e00c5","source":{"kind":"arxiv","id":"2402.19259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.19259","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"2402.19259v1","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.19259","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"JQHPFJN3DWTK","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"pith_short_16","alias_value":"JQHPFJN3DWTKWAW7","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"pith_short_8","alias_value":"JQHPFJN3","created_at":"2026-07-05T07:50:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JQHPFJN3DWTKWAW7R7O2SLMLRI","target":"record","payload":{"canonical_record":{"source":{"id":"2402.19259","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T15:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"a30c16d796c7489b13ce31c6c453b9ba55755baeb190af4333f09230b322a0e0","abstract_canon_sha256":"3f7bad246255e2f5246f67e8a6cce63564f69533b863ea5a69ba9b97965fc36b"},"schema_version":"1.0"},"canonical_sha256":"4c0ef2a5bb1da6ab02df8fdda92d8b8a2fbf929c805e5a9961fc5a515b4e00c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:43.167694Z","signature_b64":"LVX1SIDN50wXNgIpw8rQdHPjQh+ezqDBn9d7FH1hpod3AyUp24yyxTNUMUgDIOqfKQS6osxg0yOLEYi/grkyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c0ef2a5bb1da6ab02df8fdda92d8b8a2fbf929c805e5a9961fc5a515b4e00c5","last_reissued_at":"2026-07-05T07:50:43.167124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:43.167124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.19259","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-05T07:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmXehlPbAWNs7vsyym5TsQn8gKj26HvbY/LBowViCx879TrVaxXFr8Yf0M2yarOSUTWZmsimOCRrH5j6d90cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T20:35:53.786765Z"},"content_sha256":"3703f0de5a500cdd18f14d62888cea78527b167632c7a1648c0d6c7147bd1185","schema_version":"1.0","event_id":"sha256:3703f0de5a500cdd18f14d62888cea78527b167632c7a1648c0d6c7147bd1185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JQHPFJN3DWTKWAW7R7O2SLMLRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total Completion Time Scheduling Under Scenarios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Marchetti-Spaccamela, Csanad Imreh, Ekin Ergen, Leen Stougie, Martijn van Ee, Martin Skutella, Thomas Bosman","submitted_at":"2024-02-29T15:31:15Z","abstract_excerpt":"Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study interesting generalizations of this classical problem involving scenarios. In our model, a scenario is defined as a subset of a predefined and fully specified set of jobs. The aim is to find an assignment of the whole set of jobs to identical parallel machines such that the schedule, obtained for the given scenarios by simply skipping the jobs not in the scenario, optimizes a function of the total completion times over a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.19259","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/2402.19259/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-05T07:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1uNxVF3JZJWVwpNoCPsYW0HqjB2eJgY7MNqWyllMvpuTAdb9C1rdwSiTPwerxtmdYeuhh0OfS25Q7DJ3W5IBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T20:35:53.787662Z"},"content_sha256":"e69740dcac812a5f8ac18cf96fb312bc6827cde720edfc4787cd8db7c77e3ffc","schema_version":"1.0","event_id":"sha256:e69740dcac812a5f8ac18cf96fb312bc6827cde720edfc4787cd8db7c77e3ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI/bundle.json","state_url":"https://pith.science/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI/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-08-22T20:35:53Z","links":{"resolver":"https://pith.science/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI","bundle":"https://pith.science/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI/bundle.json","state":"https://pith.science/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQHPFJN3DWTKWAW7R7O2SLMLRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JQHPFJN3DWTKWAW7R7O2SLMLRI","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":"3f7bad246255e2f5246f67e8a6cce63564f69533b863ea5a69ba9b97965fc36b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T15:31:15Z","title_canon_sha256":"a30c16d796c7489b13ce31c6c453b9ba55755baeb190af4333f09230b322a0e0"},"schema_version":"1.0","source":{"id":"2402.19259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.19259","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"2402.19259v1","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.19259","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"JQHPFJN3DWTK","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"pith_short_16","alias_value":"JQHPFJN3DWTKWAW7","created_at":"2026-07-05T07:50:43Z"},{"alias_kind":"pith_short_8","alias_value":"JQHPFJN3","created_at":"2026-07-05T07:50:43Z"}],"graph_snapshots":[{"event_id":"sha256:e69740dcac812a5f8ac18cf96fb312bc6827cde720edfc4787cd8db7c77e3ffc","target":"graph","created_at":"2026-07-05T07:50:43Z","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/2402.19259/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study interesting generalizations of this classical problem involving scenarios. In our model, a scenario is defined as a subset of a predefined and fully specified set of jobs. The aim is to find an assignment of the whole set of jobs to identical parallel machines such that the schedule, obtained for the given scenarios by simply skipping the jobs not in the scenario, optimizes a function of the total completion times over a","authors_text":"Alberto Marchetti-Spaccamela, Csanad Imreh, Ekin Ergen, Leen Stougie, Martijn van Ee, Martin Skutella, Thomas Bosman","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T15:31:15Z","title":"Total Completion Time Scheduling Under Scenarios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.19259","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:3703f0de5a500cdd18f14d62888cea78527b167632c7a1648c0d6c7147bd1185","target":"record","created_at":"2026-07-05T07:50:43Z","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":"3f7bad246255e2f5246f67e8a6cce63564f69533b863ea5a69ba9b97965fc36b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T15:31:15Z","title_canon_sha256":"a30c16d796c7489b13ce31c6c453b9ba55755baeb190af4333f09230b322a0e0"},"schema_version":"1.0","source":{"id":"2402.19259","kind":"arxiv","version":1}},"canonical_sha256":"4c0ef2a5bb1da6ab02df8fdda92d8b8a2fbf929c805e5a9961fc5a515b4e00c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c0ef2a5bb1da6ab02df8fdda92d8b8a2fbf929c805e5a9961fc5a515b4e00c5","first_computed_at":"2026-07-05T07:50:43.167124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:43.167124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVX1SIDN50wXNgIpw8rQdHPjQh+ezqDBn9d7FH1hpod3AyUp24yyxTNUMUgDIOqfKQS6osxg0yOLEYi/grkyBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:43.167694Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.19259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3703f0de5a500cdd18f14d62888cea78527b167632c7a1648c0d6c7147bd1185","sha256:e69740dcac812a5f8ac18cf96fb312bc6827cde720edfc4787cd8db7c77e3ffc"],"state_sha256":"b765e70d2c9752d36dc640370cf484f1dfd5d38f9f5d68d41998954548e4dce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yx6MGzHSwsyF8bPJALg40OLJTgfThfFccLPTrMqLVQFRdIil4FKckB4B8hOxpYsh7hRagr+FEZ6rp4YcQcfuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T20:35:53.792549Z","bundle_sha256":"5ea5d301633055a95df573b932513770240e625202cb034faa0b7e7c4d05aa63"}}