{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WA25RQXBKRIH54W47ZZTQ5MCIQ","short_pith_number":"pith:WA25RQXB","canonical_record":{"source":{"id":"2212.11478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-12-22T04:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"7f00513fbd13f6bf56ebacc720d13d48a7fa0acf92e37fc704cb0fc9109544cc","abstract_canon_sha256":"26fde0945289c8953930eb15235b40892418ab25458106d729a66b986e0cafb5"},"schema_version":"1.0"},"canonical_sha256":"b035d8c2e154507ef2dcfe73387582443966d0cc93c3668a531fc938fb057f2d","source":{"kind":"arxiv","id":"2212.11478","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.11478","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"2212.11478v3","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11478","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"WA25RQXBKRIH","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_16","alias_value":"WA25RQXBKRIH54W4","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_8","alias_value":"WA25RQXB","created_at":"2026-07-05T10:53:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WA25RQXBKRIH54W47ZZTQ5MCIQ","target":"record","payload":{"canonical_record":{"source":{"id":"2212.11478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-12-22T04:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"7f00513fbd13f6bf56ebacc720d13d48a7fa0acf92e37fc704cb0fc9109544cc","abstract_canon_sha256":"26fde0945289c8953930eb15235b40892418ab25458106d729a66b986e0cafb5"},"schema_version":"1.0"},"canonical_sha256":"b035d8c2e154507ef2dcfe73387582443966d0cc93c3668a531fc938fb057f2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:07.499140Z","signature_b64":"8N1EBI7h9krBd40jCZvaTnB+p+UH4wWgP6SW8ErnF7t9KGcMVQgq6fe1nFB9Kpn9/Uk6QtDL8lUh0RUo9VjYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b035d8c2e154507ef2dcfe73387582443966d0cc93c3668a531fc938fb057f2d","last_reissued_at":"2026-07-05T10:53:07.498666Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:07.498666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.11478","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-05T10:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVs+h0FJe25k8MJesd7edVtIIjbXsxOi/Dk5XM7UCcby/mf/zzqedhw9oXHVrlqpwP1kUxJHUwj/FThXR9qTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:59:06.127246Z"},"content_sha256":"4b69fab804c3f9779c34cd3f7f55096d629b96cf5f2521568eaaf11c3291c54d","schema_version":"1.0","event_id":"sha256:4b69fab804c3f9779c34cd3f7f55096d629b96cf5f2521568eaaf11c3291c54d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WA25RQXBKRIH54W47ZZTQ5MCIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Daoyu Huang, Feng Shi, Frank Neumann, Xiankun Yan","submitted_at":"2022-12-22T04:31:23Z","abstract_excerpt":"The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing times to two identical machines such that the makespan is minimized. However, in real life scenarios, the actual processing time of each job may be stochastic around the expected value with a variance, under the influence of external factors, and the actual processing times of these jobs may be correlated with covariances. Thus within this paper, we propose a chance-constrained version of the Makespan Scheduling pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11478","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/2212.11478/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-05T10:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9RA6JRAFPvPio+bwgfRxHxhUat6BxfUxgV4o5rMC44Act0r3tkhLuqyld4TDHcOWOzqwBDbqax0MXVIIeIuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:59:06.127740Z"},"content_sha256":"b5102d29c89189edecaeaf90a62ee01be4e037a4931939c7d6fa0c76f2a95be0","schema_version":"1.0","event_id":"sha256:b5102d29c89189edecaeaf90a62ee01be4e037a4931939c7d6fa0c76f2a95be0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ/bundle.json","state_url":"https://pith.science/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ/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-14T16:59:06Z","links":{"resolver":"https://pith.science/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ","bundle":"https://pith.science/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ/bundle.json","state":"https://pith.science/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WA25RQXBKRIH54W47ZZTQ5MCIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WA25RQXBKRIH54W47ZZTQ5MCIQ","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":"26fde0945289c8953930eb15235b40892418ab25458106d729a66b986e0cafb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-12-22T04:31:23Z","title_canon_sha256":"7f00513fbd13f6bf56ebacc720d13d48a7fa0acf92e37fc704cb0fc9109544cc"},"schema_version":"1.0","source":{"id":"2212.11478","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.11478","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"2212.11478v3","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11478","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"WA25RQXBKRIH","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_16","alias_value":"WA25RQXBKRIH54W4","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_8","alias_value":"WA25RQXB","created_at":"2026-07-05T10:53:07Z"}],"graph_snapshots":[{"event_id":"sha256:b5102d29c89189edecaeaf90a62ee01be4e037a4931939c7d6fa0c76f2a95be0","target":"graph","created_at":"2026-07-05T10:53:07Z","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/2212.11478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing times to two identical machines such that the makespan is minimized. However, in real life scenarios, the actual processing time of each job may be stochastic around the expected value with a variance, under the influence of external factors, and the actual processing times of these jobs may be correlated with covariances. Thus within this paper, we propose a chance-constrained version of the Makespan Scheduling pro","authors_text":"Daoyu Huang, Feng Shi, Frank Neumann, Xiankun Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-12-22T04:31:23Z","title":"Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11478","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:4b69fab804c3f9779c34cd3f7f55096d629b96cf5f2521568eaaf11c3291c54d","target":"record","created_at":"2026-07-05T10:53:07Z","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":"26fde0945289c8953930eb15235b40892418ab25458106d729a66b986e0cafb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-12-22T04:31:23Z","title_canon_sha256":"7f00513fbd13f6bf56ebacc720d13d48a7fa0acf92e37fc704cb0fc9109544cc"},"schema_version":"1.0","source":{"id":"2212.11478","kind":"arxiv","version":3}},"canonical_sha256":"b035d8c2e154507ef2dcfe73387582443966d0cc93c3668a531fc938fb057f2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b035d8c2e154507ef2dcfe73387582443966d0cc93c3668a531fc938fb057f2d","first_computed_at":"2026-07-05T10:53:07.498666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:07.498666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8N1EBI7h9krBd40jCZvaTnB+p+UH4wWgP6SW8ErnF7t9KGcMVQgq6fe1nFB9Kpn9/Uk6QtDL8lUh0RUo9VjYDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:07.499140Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.11478","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b69fab804c3f9779c34cd3f7f55096d629b96cf5f2521568eaaf11c3291c54d","sha256:b5102d29c89189edecaeaf90a62ee01be4e037a4931939c7d6fa0c76f2a95be0"],"state_sha256":"172f5cf6ebd692a78701de1e1983fdeddc2a865ddaedccda767c7536411be47a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpIZKM1lY73OCFgoR5I2QhJsOiLJG4urnA3SodV90OC2MOyC+khIFnWmGNngL2vMU9idtgfeYsMpdgumOv30Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T16:59:06.178351Z","bundle_sha256":"ef93a2136a298613fcf59228be98901b01161fcbc87eb51c52e8d47037a8103f"}}