{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HOQEFG33BVZXRQZICRRPUUPHCQ","short_pith_number":"pith:HOQEFG33","canonical_record":{"source":{"id":"1402.5645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-02-23T18:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"0580e7b25d7e859247e2af76438831328a728267cf168791855baac42f3cf5e5","abstract_canon_sha256":"206ba874d963c17690563c46b0f46a7597dbd8d6e742036ab97c6edbf8416eaf"},"schema_version":"1.0"},"canonical_sha256":"3ba0429b7b0d7378c3281462fa51e71406a69afa8550fbeb78d8ac89903b53af","source":{"kind":"arxiv","id":"1402.5645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5645","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5645v1","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5645","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"HOQEFG33BVZX","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOQEFG33BVZXRQZI","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOQEFG33","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HOQEFG33BVZXRQZICRRPUUPHCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-02-23T18:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"0580e7b25d7e859247e2af76438831328a728267cf168791855baac42f3cf5e5","abstract_canon_sha256":"206ba874d963c17690563c46b0f46a7597dbd8d6e742036ab97c6edbf8416eaf"},"schema_version":"1.0"},"canonical_sha256":"3ba0429b7b0d7378c3281462fa51e71406a69afa8550fbeb78d8ac89903b53af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:14.126189Z","signature_b64":"NA7izAr9tlrbf8zPLjSq4hLU80WtVzjYNRKsqp9fFrMCYlSvZmeR/yIwaXgNOL0cNqjaLBZh03Ypqv8FvXn+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba0429b7b0d7378c3281462fa51e71406a69afa8550fbeb78d8ac89903b53af","last_reissued_at":"2026-05-18T02:58:14.125437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:14.125437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5645","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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quZ4Ht8JZwR4p8c7fvt49N5IH0UylumP3rh4OCU4ZvQKWXuVhfd+vABU0Xfkze09gMuTHBHQGcG9echSn3q+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:48:28.536256Z"},"content_sha256":"b5df5a9a4b060c1cc6dad9747e03ca9a977dbb90398988f1886e59d72540dfe5","schema_version":"1.0","event_id":"sha256:b5df5a9a4b060c1cc6dad9747e03ca9a977dbb90398988f1886e59d72540dfe5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HOQEFG33BVZXRQZICRRPUUPHCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Estimation of Distribution Algorithm with Random Walk local Search for Multi-mode Resource-Constrained Project Scheduling problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Elshimaa A. R. Elgendi, Omar S. Soliman","submitted_at":"2014-02-23T18:15:24Z","abstract_excerpt":"Multi-mode resource-constrained project scheduling problems (MRCPSPs) are classified as NP-hard problems, in which a task has different execution modes characterized by different resource requirements. Estimation of distribution algorithm (EDA) has shown an effective performance for solving such real-world optimization problems but it fails to find the desired optima. This paper integrates a novel hybrid local search technique with EDA to enhance their local search ability. The new local search is based on delete-then-insert operator and a random walk (DIRW) to enhance exploitation abilities o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5645","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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwBPppdSLc8vUQZiPCKhKjYsRX+NEn5tcGmV6vZYB3ncjGS2clnueIZEj7JbmmAVb/FGnbnaJZ38YO6MArToCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:48:28.536613Z"},"content_sha256":"5c6194905054b16c6edb8c1cf90b5130804402b52ee2becab26130e811050465","schema_version":"1.0","event_id":"sha256:5c6194905054b16c6edb8c1cf90b5130804402b52ee2becab26130e811050465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOQEFG33BVZXRQZICRRPUUPHCQ/bundle.json","state_url":"https://pith.science/pith/HOQEFG33BVZXRQZICRRPUUPHCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOQEFG33BVZXRQZICRRPUUPHCQ/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-27T03:48:28Z","links":{"resolver":"https://pith.science/pith/HOQEFG33BVZXRQZICRRPUUPHCQ","bundle":"https://pith.science/pith/HOQEFG33BVZXRQZICRRPUUPHCQ/bundle.json","state":"https://pith.science/pith/HOQEFG33BVZXRQZICRRPUUPHCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOQEFG33BVZXRQZICRRPUUPHCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HOQEFG33BVZXRQZICRRPUUPHCQ","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":"206ba874d963c17690563c46b0f46a7597dbd8d6e742036ab97c6edbf8416eaf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-02-23T18:15:24Z","title_canon_sha256":"0580e7b25d7e859247e2af76438831328a728267cf168791855baac42f3cf5e5"},"schema_version":"1.0","source":{"id":"1402.5645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5645","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5645v1","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5645","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"HOQEFG33BVZX","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOQEFG33BVZXRQZI","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOQEFG33","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:5c6194905054b16c6edb8c1cf90b5130804402b52ee2becab26130e811050465","target":"graph","created_at":"2026-05-18T02:58:14Z","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":"Multi-mode resource-constrained project scheduling problems (MRCPSPs) are classified as NP-hard problems, in which a task has different execution modes characterized by different resource requirements. Estimation of distribution algorithm (EDA) has shown an effective performance for solving such real-world optimization problems but it fails to find the desired optima. This paper integrates a novel hybrid local search technique with EDA to enhance their local search ability. The new local search is based on delete-then-insert operator and a random walk (DIRW) to enhance exploitation abilities o","authors_text":"Elshimaa A. R. Elgendi, Omar S. Soliman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-02-23T18:15:24Z","title":"A Hybrid Estimation of Distribution Algorithm with Random Walk local Search for Multi-mode Resource-Constrained Project Scheduling problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5645","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:b5df5a9a4b060c1cc6dad9747e03ca9a977dbb90398988f1886e59d72540dfe5","target":"record","created_at":"2026-05-18T02:58:14Z","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":"206ba874d963c17690563c46b0f46a7597dbd8d6e742036ab97c6edbf8416eaf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-02-23T18:15:24Z","title_canon_sha256":"0580e7b25d7e859247e2af76438831328a728267cf168791855baac42f3cf5e5"},"schema_version":"1.0","source":{"id":"1402.5645","kind":"arxiv","version":1}},"canonical_sha256":"3ba0429b7b0d7378c3281462fa51e71406a69afa8550fbeb78d8ac89903b53af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba0429b7b0d7378c3281462fa51e71406a69afa8550fbeb78d8ac89903b53af","first_computed_at":"2026-05-18T02:58:14.125437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:14.125437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NA7izAr9tlrbf8zPLjSq4hLU80WtVzjYNRKsqp9fFrMCYlSvZmeR/yIwaXgNOL0cNqjaLBZh03Ypqv8FvXn+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:14.126189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5df5a9a4b060c1cc6dad9747e03ca9a977dbb90398988f1886e59d72540dfe5","sha256:5c6194905054b16c6edb8c1cf90b5130804402b52ee2becab26130e811050465"],"state_sha256":"9cf2af54fc91fb060654606f4a310bbc40cc79092ca91e3e6f2c2b36e642ef4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xIV29Eo/x+0kMk8CVTjqiAZ7Uz4Bb5/DM8gqfu7XJeAgxyzbFDBBNMiTLtv34/nZV7Wrn9kK427ZXiMHIvEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:48:28.538454Z","bundle_sha256":"b4e3687490425c82832a38ac1d019337c29f9754af0bed62d48fea3b3df1de81"}}