{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ARAYMXPS2A5QQZS74KJYBAN6EW","short_pith_number":"pith:ARAYMXPS","canonical_record":{"source":{"id":"1902.05946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-15T20:59:20Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"572738e62ad0c98e4db9b793e7a596ccf2d22658eabff3954cb80c34784faa0b","abstract_canon_sha256":"58168c9aa8b00ea379248c4958e818c4cdf5520df7734ce85d2304db7ad61b08"},"schema_version":"1.0"},"canonical_sha256":"0441865df2d03b08665fe2938081be25a98c9aa262196eb2375be26b92db0c64","source":{"kind":"arxiv","id":"1902.05946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05946","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05946v1","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05946","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"ARAYMXPS2A5Q","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ARAYMXPS2A5QQZS7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ARAYMXPS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ARAYMXPS2A5QQZS74KJYBAN6EW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-15T20:59:20Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"572738e62ad0c98e4db9b793e7a596ccf2d22658eabff3954cb80c34784faa0b","abstract_canon_sha256":"58168c9aa8b00ea379248c4958e818c4cdf5520df7734ce85d2304db7ad61b08"},"schema_version":"1.0"},"canonical_sha256":"0441865df2d03b08665fe2938081be25a98c9aa262196eb2375be26b92db0c64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.153946Z","signature_b64":"eq2HIKvKNzZFMSWy+BrgfFiHpNjfDCLgZKA9YNkQHfV2AKs4t2lPvblHx6KNllTu/rXo9rZHqbpcsvX/eQuJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0441865df2d03b08665fe2938081be25a98c9aa262196eb2375be26b92db0c64","last_reissued_at":"2026-05-17T23:53:49.153344Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.153344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05946","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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QmfMvqz81G+u5iMa2D6gh74+0nid0Pa+IJ//5k/+PwQY9CoZsGY06yRG/WrfgLpfIGr9oq2vs635By+8dMHIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:50:08.851171Z"},"content_sha256":"49ad059de349f0c768d5e021883a3acaf4fff730715f61450bf667da1ef85824","schema_version":"1.0","event_id":"sha256:49ad059de349f0c768d5e021883a3acaf4fff730715f61450bf667da1ef85824"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ARAYMXPS2A5QQZS74KJYBAN6EW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On resampling vs. adjusting probabilistic graphical models in estimation of distribution algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Inkyung Sung, Marcella S. R. Martins, Markus Wagner, Mohamed El Yafrani, Myriam R. B. S. Delgado, Ricardo L\\\"uders","submitted_at":"2019-02-15T20:59:20Z","abstract_excerpt":"The Bayesian Optimisation Algorithm (BOA) is an Estimation of Distribution Algorithm (EDA) that uses a Bayesian network as probabilistic graphical model (PGM). Determining the optimal Bayesian network structure given a solution sample is an NP-hard problem. This step should be completed at each iteration of BOA, resulting in a very time-consuming process. For this reason most implementations use greedy estimation algorithms such as K2. However, we show in this paper that significant changes in PGM structure do not occur so frequently, and can be particularly sparse at the end of evolution. A s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05946","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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEe2uJvJLc9VciYqbFy9gzoi4z/JRXeW6GLglbTYPLiQH8rIuOwEuUnasZDYQdYz0DSjhSr2g1VTEMEHb/UiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:50:08.851541Z"},"content_sha256":"7c52a1ecd5f42977ac8750f19137768a9864e692cd739c2a4d0434607c87e044","schema_version":"1.0","event_id":"sha256:7c52a1ecd5f42977ac8750f19137768a9864e692cd739c2a4d0434607c87e044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARAYMXPS2A5QQZS74KJYBAN6EW/bundle.json","state_url":"https://pith.science/pith/ARAYMXPS2A5QQZS74KJYBAN6EW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARAYMXPS2A5QQZS74KJYBAN6EW/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-28T17:50:08Z","links":{"resolver":"https://pith.science/pith/ARAYMXPS2A5QQZS74KJYBAN6EW","bundle":"https://pith.science/pith/ARAYMXPS2A5QQZS74KJYBAN6EW/bundle.json","state":"https://pith.science/pith/ARAYMXPS2A5QQZS74KJYBAN6EW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARAYMXPS2A5QQZS74KJYBAN6EW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ARAYMXPS2A5QQZS74KJYBAN6EW","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":"58168c9aa8b00ea379248c4958e818c4cdf5520df7734ce85d2304db7ad61b08","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-15T20:59:20Z","title_canon_sha256":"572738e62ad0c98e4db9b793e7a596ccf2d22658eabff3954cb80c34784faa0b"},"schema_version":"1.0","source":{"id":"1902.05946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05946","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05946v1","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05946","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"ARAYMXPS2A5Q","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ARAYMXPS2A5QQZS7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ARAYMXPS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:7c52a1ecd5f42977ac8750f19137768a9864e692cd739c2a4d0434607c87e044","target":"graph","created_at":"2026-05-17T23:53:49Z","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":"The Bayesian Optimisation Algorithm (BOA) is an Estimation of Distribution Algorithm (EDA) that uses a Bayesian network as probabilistic graphical model (PGM). Determining the optimal Bayesian network structure given a solution sample is an NP-hard problem. This step should be completed at each iteration of BOA, resulting in a very time-consuming process. For this reason most implementations use greedy estimation algorithms such as K2. However, we show in this paper that significant changes in PGM structure do not occur so frequently, and can be particularly sparse at the end of evolution. A s","authors_text":"Inkyung Sung, Marcella S. R. Martins, Markus Wagner, Mohamed El Yafrani, Myriam R. B. S. Delgado, Ricardo L\\\"uders","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-15T20:59:20Z","title":"On resampling vs. adjusting probabilistic graphical models in estimation of distribution algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05946","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:49ad059de349f0c768d5e021883a3acaf4fff730715f61450bf667da1ef85824","target":"record","created_at":"2026-05-17T23:53:49Z","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":"58168c9aa8b00ea379248c4958e818c4cdf5520df7734ce85d2304db7ad61b08","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-15T20:59:20Z","title_canon_sha256":"572738e62ad0c98e4db9b793e7a596ccf2d22658eabff3954cb80c34784faa0b"},"schema_version":"1.0","source":{"id":"1902.05946","kind":"arxiv","version":1}},"canonical_sha256":"0441865df2d03b08665fe2938081be25a98c9aa262196eb2375be26b92db0c64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0441865df2d03b08665fe2938081be25a98c9aa262196eb2375be26b92db0c64","first_computed_at":"2026-05-17T23:53:49.153344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:49.153344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eq2HIKvKNzZFMSWy+BrgfFiHpNjfDCLgZKA9YNkQHfV2AKs4t2lPvblHx6KNllTu/rXo9rZHqbpcsvX/eQuJAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:49.153946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49ad059de349f0c768d5e021883a3acaf4fff730715f61450bf667da1ef85824","sha256:7c52a1ecd5f42977ac8750f19137768a9864e692cd739c2a4d0434607c87e044"],"state_sha256":"aeec17e4b8381c07bc69e98c4d591c27571159e18aab605ae39a8dcfa4c13c28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/1q7V4OqyLEgaJX6i8pg3pDxfvmJU6GMePIXJKuPMMy/VplKTVue4BifnHDwqHOzN1j2heWP7nVg1Rs63YqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:50:08.853461Z","bundle_sha256":"c5bc30a6784ae3e1a56195f6e34f5904d2a2aec9521a74b59fe92135ec94effa"}}