{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4RUDEL6ZMOTANX6HLP36CLPARI","short_pith_number":"pith:4RUDEL6Z","canonical_record":{"source":{"id":"1312.1273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T10:40:35Z","cross_cats_sorted":[],"title_canon_sha256":"7c49c3668c89f9b29839c0484b9442e6388eaa59775aad30fac3a71707075d4f","abstract_canon_sha256":"58a6368731a121e5fbf151b2781d53bbb869f448f8b0c6f9344102e94bc6c9fb"},"schema_version":"1.0"},"canonical_sha256":"e468322fd963a606dfc75bf7e12de08a0f92cb1a039b1405829d9c442e42e508","source":{"kind":"arxiv","id":"1312.1273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1273","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1273v1","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1273","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"4RUDEL6ZMOTA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4RUDEL6ZMOTANX6H","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4RUDEL6Z","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4RUDEL6ZMOTANX6HLP36CLPARI","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T10:40:35Z","cross_cats_sorted":[],"title_canon_sha256":"7c49c3668c89f9b29839c0484b9442e6388eaa59775aad30fac3a71707075d4f","abstract_canon_sha256":"58a6368731a121e5fbf151b2781d53bbb869f448f8b0c6f9344102e94bc6c9fb"},"schema_version":"1.0"},"canonical_sha256":"e468322fd963a606dfc75bf7e12de08a0f92cb1a039b1405829d9c442e42e508","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:28.881656Z","signature_b64":"WS1eaoSdBQpNl9SKX5ydp6Dbs6KLP2KLUEzXzXxZhZ8Wo8t/QydUrqKsyiYlciDksvByvMen3XU+k/KJClZOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e468322fd963a606dfc75bf7e12de08a0f92cb1a039b1405829d9c442e42e508","last_reissued_at":"2026-05-18T03:05:28.881214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:28.881214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1273","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-18T03:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhVRSs65jEG9DtmqpIsiwbhzNg0YFhCT4y6NEGQBCkCyR+/K7S6VgLUZickKSDwgFeGcUkLe3USknPP84kYoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:34:48.063600Z"},"content_sha256":"93658235b687a7a292dd2b75549fbd0e8f9cbbd872efc79abf47a65c09a10cdd","schema_version":"1.0","event_id":"sha256:93658235b687a7a292dd2b75549fbd0e8f9cbbd872efc79abf47a65c09a10cdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4RUDEL6ZMOTANX6HLP36CLPARI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boris Mitavskiy, Jun He","submitted_at":"2013-12-03T10:40:35Z","abstract_excerpt":"In the current work we introduce a novel estimation of distribution algorithm to tackle a hard combinatorial optimization problem, namely the single-machine scheduling problem, with uncertain delivery times. The majority of the existing research coping with optimization problems in uncertain environment aims at finding a single sufficiently robust solution so that random noise and unpredictable circumstances would have the least possible detrimental effect on the quality of the solution. The measures of robustness are usually based on various kinds of empirically designed averaging techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1273","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-18T03:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iODzz6aksaUebz53a59cPDS/bOTWWV9P5SsylaNl/BT9XTwu3DjrGVZaIPJhxfojscBp3b47iDJoynR6KhfUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:34:48.064096Z"},"content_sha256":"9cf92fc2603dcc0b399e09d73c7b5e852c99bb9d73f71a2f1e99f28a9d9700ee","schema_version":"1.0","event_id":"sha256:9cf92fc2603dcc0b399e09d73c7b5e852c99bb9d73f71a2f1e99f28a9d9700ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RUDEL6ZMOTANX6HLP36CLPARI/bundle.json","state_url":"https://pith.science/pith/4RUDEL6ZMOTANX6HLP36CLPARI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RUDEL6ZMOTANX6HLP36CLPARI/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-05-26T06:34:48Z","links":{"resolver":"https://pith.science/pith/4RUDEL6ZMOTANX6HLP36CLPARI","bundle":"https://pith.science/pith/4RUDEL6ZMOTANX6HLP36CLPARI/bundle.json","state":"https://pith.science/pith/4RUDEL6ZMOTANX6HLP36CLPARI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RUDEL6ZMOTANX6HLP36CLPARI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4RUDEL6ZMOTANX6HLP36CLPARI","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":"58a6368731a121e5fbf151b2781d53bbb869f448f8b0c6f9344102e94bc6c9fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T10:40:35Z","title_canon_sha256":"7c49c3668c89f9b29839c0484b9442e6388eaa59775aad30fac3a71707075d4f"},"schema_version":"1.0","source":{"id":"1312.1273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1273","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1273v1","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1273","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"4RUDEL6ZMOTA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4RUDEL6ZMOTANX6H","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4RUDEL6Z","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:9cf92fc2603dcc0b399e09d73c7b5e852c99bb9d73f71a2f1e99f28a9d9700ee","target":"graph","created_at":"2026-05-18T03:05:28Z","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 the current work we introduce a novel estimation of distribution algorithm to tackle a hard combinatorial optimization problem, namely the single-machine scheduling problem, with uncertain delivery times. The majority of the existing research coping with optimization problems in uncertain environment aims at finding a single sufficiently robust solution so that random noise and unpredictable circumstances would have the least possible detrimental effect on the quality of the solution. The measures of robustness are usually based on various kinds of empirically designed averaging techniques.","authors_text":"Boris Mitavskiy, Jun He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T10:40:35Z","title":"Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1273","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:93658235b687a7a292dd2b75549fbd0e8f9cbbd872efc79abf47a65c09a10cdd","target":"record","created_at":"2026-05-18T03:05:28Z","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":"58a6368731a121e5fbf151b2781d53bbb869f448f8b0c6f9344102e94bc6c9fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T10:40:35Z","title_canon_sha256":"7c49c3668c89f9b29839c0484b9442e6388eaa59775aad30fac3a71707075d4f"},"schema_version":"1.0","source":{"id":"1312.1273","kind":"arxiv","version":1}},"canonical_sha256":"e468322fd963a606dfc75bf7e12de08a0f92cb1a039b1405829d9c442e42e508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e468322fd963a606dfc75bf7e12de08a0f92cb1a039b1405829d9c442e42e508","first_computed_at":"2026-05-18T03:05:28.881214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:28.881214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WS1eaoSdBQpNl9SKX5ydp6Dbs6KLP2KLUEzXzXxZhZ8Wo8t/QydUrqKsyiYlciDksvByvMen3XU+k/KJClZOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:28.881656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93658235b687a7a292dd2b75549fbd0e8f9cbbd872efc79abf47a65c09a10cdd","sha256:9cf92fc2603dcc0b399e09d73c7b5e852c99bb9d73f71a2f1e99f28a9d9700ee"],"state_sha256":"8423d65c61ea8608bd7b04b42405ff8e3bee15be1ec56cc360756951b3bb622a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"forOIUNNyDzpg+UHkbFAF+dXs7DFvQq9AtfeluOtXFm02BQg9n1SqwfVh0ML9X1wMmzrYc7E87260mCcWwt9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:34:48.067262Z","bundle_sha256":"081c12aacd2e7b73a50ab0cdae3923d6a41a0d892dfda85f3979c614979485fc"}}