{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:W56MULIDCRPQYOC3J3S4CFLFGD","short_pith_number":"pith:W56MULID","canonical_record":{"source":{"id":"2102.08677","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-02-17T10:43:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d045556fcc19135cdcc4b3fb074c3b9b667a000b323625089a9306776de7fed3","abstract_canon_sha256":"823841b9569ccf1337b782645fa88cddaad78152fe22001540341a3086eaee04"},"schema_version":"1.0"},"canonical_sha256":"b77cca2d03145f0c385b4ee5c1156530ee5e3e109b4457a5c8dd07a59a32e56a","source":{"kind":"arxiv","id":"2102.08677","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.08677","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"2102.08677v3","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08677","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"W56MULIDCRPQ","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"pith_short_16","alias_value":"W56MULIDCRPQYOC3","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"pith_short_8","alias_value":"W56MULID","created_at":"2026-07-05T07:14:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:W56MULIDCRPQYOC3J3S4CFLFGD","target":"record","payload":{"canonical_record":{"source":{"id":"2102.08677","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-02-17T10:43:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d045556fcc19135cdcc4b3fb074c3b9b667a000b323625089a9306776de7fed3","abstract_canon_sha256":"823841b9569ccf1337b782645fa88cddaad78152fe22001540341a3086eaee04"},"schema_version":"1.0"},"canonical_sha256":"b77cca2d03145f0c385b4ee5c1156530ee5e3e109b4457a5c8dd07a59a32e56a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:48.709531Z","signature_b64":"6j6q4xRwT6crvhB0LUzeSnIyH9X+oyybRFRw2yghkCQsWGrUNMk6Sl5wCCE9ux/mGpoZvs4N/z+OvxR6Atw3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b77cca2d03145f0c385b4ee5c1156530ee5e3e109b4457a5c8dd07a59a32e56a","last_reissued_at":"2026-07-05T07:14:48.709108Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:48.709108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.08677","source_version":3,"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:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGEkeHjolQlXbiaua5F92DWVQKqyAuRlFQkgSpb4v9hCqQYXdltSwTlHDAcNh9ZDDpnEfPeO01aH4AfADj1OAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:39:15.395355Z"},"content_sha256":"b58c401166c410b05a6dbf2c20d3bebfde54b10b58a8d29f503f4289332672cd","schema_version":"1.0","event_id":"sha256:b58c401166c410b05a6dbf2c20d3bebfde54b10b58a8d29f503f4289332672cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:W56MULIDCRPQYOC3J3S4CFLFGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An adaptive robust optimization model for parallel machine scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Izack Cohen, Krzysztof Postek, Shimrit Shtern","submitted_at":"2021-02-17T10:43:01Z","abstract_excerpt":"Real-life parallel machine scheduling problems can be characterized by: (i) limited information about the exact task duration at scheduling time, and (ii) an opportunity to reschedule the remaining tasks each time a task processing is completed and a machine becomes idle. Robust optimization is the natural methodology to cope with the first characteristic of duration uncertainty, yet the existing literature on robust scheduling does not explicitly consider the second characteristic - the possibility to adjust decisions as more information about the tasks' duration becomes available, despite th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08677","kind":"arxiv","version":3},"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/2102.08677/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:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yt61z1nWsYqT4JZz4cx4uLivmxL0qSEeP3ox2DLfprxueAUK6yR7cphiWlP8gRNxmNSGAprPPJU4g3ibKC9ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:39:15.396022Z"},"content_sha256":"cc64239a0ed12112d2bc14fa1bf6bf864a6dd4b01e7e98f23e18d55a3d2815e6","schema_version":"1.0","event_id":"sha256:cc64239a0ed12112d2bc14fa1bf6bf864a6dd4b01e7e98f23e18d55a3d2815e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W56MULIDCRPQYOC3J3S4CFLFGD/bundle.json","state_url":"https://pith.science/pith/W56MULIDCRPQYOC3J3S4CFLFGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W56MULIDCRPQYOC3J3S4CFLFGD/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-15T22:39:15Z","links":{"resolver":"https://pith.science/pith/W56MULIDCRPQYOC3J3S4CFLFGD","bundle":"https://pith.science/pith/W56MULIDCRPQYOC3J3S4CFLFGD/bundle.json","state":"https://pith.science/pith/W56MULIDCRPQYOC3J3S4CFLFGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W56MULIDCRPQYOC3J3S4CFLFGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:W56MULIDCRPQYOC3J3S4CFLFGD","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":"823841b9569ccf1337b782645fa88cddaad78152fe22001540341a3086eaee04","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-02-17T10:43:01Z","title_canon_sha256":"d045556fcc19135cdcc4b3fb074c3b9b667a000b323625089a9306776de7fed3"},"schema_version":"1.0","source":{"id":"2102.08677","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.08677","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"2102.08677v3","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08677","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"W56MULIDCRPQ","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"pith_short_16","alias_value":"W56MULIDCRPQYOC3","created_at":"2026-07-05T07:14:48Z"},{"alias_kind":"pith_short_8","alias_value":"W56MULID","created_at":"2026-07-05T07:14:48Z"}],"graph_snapshots":[{"event_id":"sha256:cc64239a0ed12112d2bc14fa1bf6bf864a6dd4b01e7e98f23e18d55a3d2815e6","target":"graph","created_at":"2026-07-05T07:14:48Z","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/2102.08677/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real-life parallel machine scheduling problems can be characterized by: (i) limited information about the exact task duration at scheduling time, and (ii) an opportunity to reschedule the remaining tasks each time a task processing is completed and a machine becomes idle. Robust optimization is the natural methodology to cope with the first characteristic of duration uncertainty, yet the existing literature on robust scheduling does not explicitly consider the second characteristic - the possibility to adjust decisions as more information about the tasks' duration becomes available, despite th","authors_text":"Izack Cohen, Krzysztof Postek, Shimrit Shtern","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-02-17T10:43:01Z","title":"An adaptive robust optimization model for parallel machine scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08677","kind":"arxiv","version":3},"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:b58c401166c410b05a6dbf2c20d3bebfde54b10b58a8d29f503f4289332672cd","target":"record","created_at":"2026-07-05T07:14:48Z","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":"823841b9569ccf1337b782645fa88cddaad78152fe22001540341a3086eaee04","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-02-17T10:43:01Z","title_canon_sha256":"d045556fcc19135cdcc4b3fb074c3b9b667a000b323625089a9306776de7fed3"},"schema_version":"1.0","source":{"id":"2102.08677","kind":"arxiv","version":3}},"canonical_sha256":"b77cca2d03145f0c385b4ee5c1156530ee5e3e109b4457a5c8dd07a59a32e56a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b77cca2d03145f0c385b4ee5c1156530ee5e3e109b4457a5c8dd07a59a32e56a","first_computed_at":"2026-07-05T07:14:48.709108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:14:48.709108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6j6q4xRwT6crvhB0LUzeSnIyH9X+oyybRFRw2yghkCQsWGrUNMk6Sl5wCCE9ux/mGpoZvs4N/z+OvxR6Atw3BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:14:48.709531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.08677","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b58c401166c410b05a6dbf2c20d3bebfde54b10b58a8d29f503f4289332672cd","sha256:cc64239a0ed12112d2bc14fa1bf6bf864a6dd4b01e7e98f23e18d55a3d2815e6"],"state_sha256":"59f0fe1b728e52f585fdce5af5deb505baffc07c00bb2af3a97cfccf3f60f62e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovoFOf3w5J9rBeeiPRicZoQ8/0G4nw98Zg1b2uQ57FJP518gOmpVhzwIdvcf9zLWLS4/tn9uZGhC6qX+1jPmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:39:15.402876Z","bundle_sha256":"eb63b148a5252f7b25e17b01439120d2dac0e2954899ea90f478b16552d93317"}}