{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D5WLY42ZMQSQL4LMW6LUCRCZCW","short_pith_number":"pith:D5WLY42Z","canonical_record":{"source":{"id":"1411.7101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T03:56:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d6c06a03cedc91951bb24321c547756ea54a7c2bfcd9bfc3992954ab555e078","abstract_canon_sha256":"3ae358ba7b0454ce403823d109a0f4d7ec8fde44476c22b05a9e717786eaab5c"},"schema_version":"1.0"},"canonical_sha256":"1f6cbc7359642505f16cb79741445915853a1f8ed3a118396ee672e101f630e6","source":{"kind":"arxiv","id":"1411.7101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7101","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7101v1","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7101","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"D5WLY42ZMQSQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D5WLY42ZMQSQL4LM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D5WLY42Z","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D5WLY42ZMQSQL4LMW6LUCRCZCW","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T03:56:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d6c06a03cedc91951bb24321c547756ea54a7c2bfcd9bfc3992954ab555e078","abstract_canon_sha256":"3ae358ba7b0454ce403823d109a0f4d7ec8fde44476c22b05a9e717786eaab5c"},"schema_version":"1.0"},"canonical_sha256":"1f6cbc7359642505f16cb79741445915853a1f8ed3a118396ee672e101f630e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:45.352692Z","signature_b64":"NrX42Dxg1NYlHSl7hCYCcEzPXDVgV+qMMaurGm6DnhnS3O6fFB74T7GXLGjrS8zrV3mbgkm6Cy07RJerq/6KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6cbc7359642505f16cb79741445915853a1f8ed3a118396ee672e101f630e6","last_reissued_at":"2026-05-18T02:32:45.352091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:45.352091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7101","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-18T02:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGsYCdf2wdbfzsZTwRGcqJ6Rw+N698fb1kWy4JHWlgad9dRmqFNtXebc0aaVUZFMBRC/NcTWx4xYUoYbphyLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:33:19.077745Z"},"content_sha256":"53ab6610447bb90a96f54c97495e34971d3df9b490a03780b807bae3a41fce32","schema_version":"1.0","event_id":"sha256:53ab6610447bb90a96f54c97495e34971d3df9b490a03780b807bae3a41fce32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D5WLY42ZMQSQL4LMW6LUCRCZCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The robust single machine scheduling problem with uncertain release and processing times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alan L. Erera, Michel Bierlaire, Nitish Umang","submitted_at":"2014-11-26T03:56:59Z","abstract_excerpt":"In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case objective function value from the set of all possible realizations of release and processing times. The objective function value is the total flow time of all jobs. We discuss some important properties of robust schedules for zero and non-zero release times, and illustrate the added complexity in robust scheduling given non-zero release time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7101","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-18T02:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2s9z/dP8MBhFt7aq+gMU6S8qNcIpgoK5kU4EFIgdKQYgWolgMc5tkdQgH+F9rL4wR726WRpyf6aPmuwUXIyrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:33:19.078083Z"},"content_sha256":"4169d55d8a4b5d48f6f5eb3d7573f5f2b8a151626063c8aa512068728bcd946f","schema_version":"1.0","event_id":"sha256:4169d55d8a4b5d48f6f5eb3d7573f5f2b8a151626063c8aa512068728bcd946f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW/bundle.json","state_url":"https://pith.science/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW/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-23T15:33:19Z","links":{"resolver":"https://pith.science/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW","bundle":"https://pith.science/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW/bundle.json","state":"https://pith.science/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5WLY42ZMQSQL4LMW6LUCRCZCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D5WLY42ZMQSQL4LMW6LUCRCZCW","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":"3ae358ba7b0454ce403823d109a0f4d7ec8fde44476c22b05a9e717786eaab5c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T03:56:59Z","title_canon_sha256":"4d6c06a03cedc91951bb24321c547756ea54a7c2bfcd9bfc3992954ab555e078"},"schema_version":"1.0","source":{"id":"1411.7101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7101","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7101v1","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7101","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"D5WLY42ZMQSQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D5WLY42ZMQSQL4LM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D5WLY42Z","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:4169d55d8a4b5d48f6f5eb3d7573f5f2b8a151626063c8aa512068728bcd946f","target":"graph","created_at":"2026-05-18T02:32:45Z","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":"In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case objective function value from the set of all possible realizations of release and processing times. The objective function value is the total flow time of all jobs. We discuss some important properties of robust schedules for zero and non-zero release times, and illustrate the added complexity in robust scheduling given non-zero release time","authors_text":"Alan L. Erera, Michel Bierlaire, Nitish Umang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T03:56:59Z","title":"The robust single machine scheduling problem with uncertain release and processing times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7101","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:53ab6610447bb90a96f54c97495e34971d3df9b490a03780b807bae3a41fce32","target":"record","created_at":"2026-05-18T02:32:45Z","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":"3ae358ba7b0454ce403823d109a0f4d7ec8fde44476c22b05a9e717786eaab5c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T03:56:59Z","title_canon_sha256":"4d6c06a03cedc91951bb24321c547756ea54a7c2bfcd9bfc3992954ab555e078"},"schema_version":"1.0","source":{"id":"1411.7101","kind":"arxiv","version":1}},"canonical_sha256":"1f6cbc7359642505f16cb79741445915853a1f8ed3a118396ee672e101f630e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f6cbc7359642505f16cb79741445915853a1f8ed3a118396ee672e101f630e6","first_computed_at":"2026-05-18T02:32:45.352091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:45.352091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NrX42Dxg1NYlHSl7hCYCcEzPXDVgV+qMMaurGm6DnhnS3O6fFB74T7GXLGjrS8zrV3mbgkm6Cy07RJerq/6KBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:45.352692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53ab6610447bb90a96f54c97495e34971d3df9b490a03780b807bae3a41fce32","sha256:4169d55d8a4b5d48f6f5eb3d7573f5f2b8a151626063c8aa512068728bcd946f"],"state_sha256":"5d1b37de87f726372f46328965c01098637d3b64d5a7f5cd381ec866715d6f94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tplN3n+ke2EoJVYf7Q3z10sRRfYEikQTPdxGDPhf4xcYG61q0rCLLG02CKWWWU3qpio3/GjNR0mTUoY9+F8zCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:33:19.079949Z","bundle_sha256":"d64dc493d2f1e698661752dd89c7da3306416d88d9c1547ea00c4cbd60db8675"}}