{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6QSJIH5MOBXLOREYCYPRJCJK4M","short_pith_number":"pith:6QSJIH5M","canonical_record":{"source":{"id":"1607.06641","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-07-22T11:51:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8e14c09c92b8abb37200216ca3a0ae2a0f59e8206ceb2c05f6ed0d33b8d9b4db","abstract_canon_sha256":"29bc21c5a3184c757873d807bc9c0c8cccd720d98a3469eda4c9d7a28be2286e"},"schema_version":"1.0"},"canonical_sha256":"f424941fac706eb74498161f14892ae32087f94deb99bb4d42dca037bef813ec","source":{"kind":"arxiv","id":"1607.06641","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06641","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06641v3","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06641","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"6QSJIH5MOBXL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6QSJIH5MOBXLOREY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6QSJIH5M","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6QSJIH5MOBXLOREYCYPRJCJK4M","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06641","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-07-22T11:51:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8e14c09c92b8abb37200216ca3a0ae2a0f59e8206ceb2c05f6ed0d33b8d9b4db","abstract_canon_sha256":"29bc21c5a3184c757873d807bc9c0c8cccd720d98a3469eda4c9d7a28be2286e"},"schema_version":"1.0"},"canonical_sha256":"f424941fac706eb74498161f14892ae32087f94deb99bb4d42dca037bef813ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.179948Z","signature_b64":"p9WdTpBmScbO6mvTH0Mg6CHQmmA2aFYsjYv8uWPo37rqqcjPB7dUBna1L8DOIsfXho9cxRVtIM4bt9bVJDEtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f424941fac706eb74498161f14892ae32087f94deb99bb4d42dca037bef813ec","last_reissued_at":"2026-05-18T00:42:35.179380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.179380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06641","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-05-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DsnN3XDLhswp59vguEYH9un5Rx7sE4//M5T62F8u74wOFLazzd4KABZfcuIG7hb2KCzgJwtEH5OXaAlG1F9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:38:16.968343Z"},"content_sha256":"d1a7edc601f0ff33b176273c440bdf507b38cbec1d7fadaa76035de4939e5ff1","schema_version":"1.0","event_id":"sha256:d1a7edc601f0ff33b176273c440bdf507b38cbec1d7fadaa76035de4939e5ff1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6QSJIH5MOBXLOREYCYPRJCJK4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal resampling for the noisy OneMax problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Diego P\\'erez-Li\\'ebana, Jialin Liu, Michael Fairbank, Simon M. Lucas","submitted_at":"2016-07-22T11:51:49Z","abstract_excerpt":"The OneMax problem is a standard benchmark optimisation problem for a binary search space. Recent work on applying a Bandit-Based Random Mutation Hill-Climbing algorithm to the noisy OneMax Problem showed that it is important to choose a good value for the resampling number to make a careful trade off between taking more samples in order to reduce noise, and taking fewer samples to reduce the total computational cost. This paper extends that observation, by deriving an analytical expression for the running time of the RMHC algorithm with resampling applied to the noisy OneMax problem, and show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06641","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":""},"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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pjg+1LvgI+vQpg5FWUS+oJ5gHTUjOXeFCgO3/b/K8dgiQ7Dfi2ZANr39IwiKOH8KrfMq8OQdKLBPa5pPYf2pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:38:16.968685Z"},"content_sha256":"ee4b4b227474c3cc25e48b78093bd4a01d94f9f8aac6d2d0a35c1380571c9457","schema_version":"1.0","event_id":"sha256:ee4b4b227474c3cc25e48b78093bd4a01d94f9f8aac6d2d0a35c1380571c9457"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QSJIH5MOBXLOREYCYPRJCJK4M/bundle.json","state_url":"https://pith.science/pith/6QSJIH5MOBXLOREYCYPRJCJK4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QSJIH5MOBXLOREYCYPRJCJK4M/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-01T14:38:16Z","links":{"resolver":"https://pith.science/pith/6QSJIH5MOBXLOREYCYPRJCJK4M","bundle":"https://pith.science/pith/6QSJIH5MOBXLOREYCYPRJCJK4M/bundle.json","state":"https://pith.science/pith/6QSJIH5MOBXLOREYCYPRJCJK4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QSJIH5MOBXLOREYCYPRJCJK4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6QSJIH5MOBXLOREYCYPRJCJK4M","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":"29bc21c5a3184c757873d807bc9c0c8cccd720d98a3469eda4c9d7a28be2286e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-07-22T11:51:49Z","title_canon_sha256":"8e14c09c92b8abb37200216ca3a0ae2a0f59e8206ceb2c05f6ed0d33b8d9b4db"},"schema_version":"1.0","source":{"id":"1607.06641","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06641","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06641v3","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06641","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"6QSJIH5MOBXL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6QSJIH5MOBXLOREY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6QSJIH5M","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:ee4b4b227474c3cc25e48b78093bd4a01d94f9f8aac6d2d0a35c1380571c9457","target":"graph","created_at":"2026-05-18T00:42:35Z","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 OneMax problem is a standard benchmark optimisation problem for a binary search space. Recent work on applying a Bandit-Based Random Mutation Hill-Climbing algorithm to the noisy OneMax Problem showed that it is important to choose a good value for the resampling number to make a careful trade off between taking more samples in order to reduce noise, and taking fewer samples to reduce the total computational cost. This paper extends that observation, by deriving an analytical expression for the running time of the RMHC algorithm with resampling applied to the noisy OneMax problem, and show","authors_text":"Diego P\\'erez-Li\\'ebana, Jialin Liu, Michael Fairbank, Simon M. Lucas","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-07-22T11:51:49Z","title":"Optimal resampling for the noisy OneMax problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06641","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:d1a7edc601f0ff33b176273c440bdf507b38cbec1d7fadaa76035de4939e5ff1","target":"record","created_at":"2026-05-18T00:42:35Z","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":"29bc21c5a3184c757873d807bc9c0c8cccd720d98a3469eda4c9d7a28be2286e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-07-22T11:51:49Z","title_canon_sha256":"8e14c09c92b8abb37200216ca3a0ae2a0f59e8206ceb2c05f6ed0d33b8d9b4db"},"schema_version":"1.0","source":{"id":"1607.06641","kind":"arxiv","version":3}},"canonical_sha256":"f424941fac706eb74498161f14892ae32087f94deb99bb4d42dca037bef813ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f424941fac706eb74498161f14892ae32087f94deb99bb4d42dca037bef813ec","first_computed_at":"2026-05-18T00:42:35.179380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:35.179380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9WdTpBmScbO6mvTH0Mg6CHQmmA2aFYsjYv8uWPo37rqqcjPB7dUBna1L8DOIsfXho9cxRVtIM4bt9bVJDEtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:35.179948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06641","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a7edc601f0ff33b176273c440bdf507b38cbec1d7fadaa76035de4939e5ff1","sha256:ee4b4b227474c3cc25e48b78093bd4a01d94f9f8aac6d2d0a35c1380571c9457"],"state_sha256":"74f64f66fc0d179d0382bc8fa2bcf50ac89b76afc9ee2bcaed28410a91be015d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RkI7Ss1iC0Ln1RFngI70mGQusCmJvrRWPPxxNc8YZOpviaR7FVGcKMxzmDIq7iwIPWFmTaTYYhOiwS9KLLNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:38:16.970574Z","bundle_sha256":"fb7f2f707fadf426e9d2e58d45ddb342b649d32f8951be3703138f67b0e298ca"}}