{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:76IQ5GEDOIQE47TFXWVIM2HIXT","short_pith_number":"pith:76IQ5GED","canonical_record":{"source":{"id":"1604.03277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-12T07:54:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7bdd16ea9b33a66d53306228bdbf261b21e155c2a66dbfe900cfec9030b95232","abstract_canon_sha256":"da3a8835bb4744671d6b12c03f370f4faf3e847bfebef38203300ec5a467e2b5"},"schema_version":"1.0"},"canonical_sha256":"ff910e988372204e7e65bdaa8668e8bcd0778425debba48cd675f8d722b198fb","source":{"kind":"arxiv","id":"1604.03277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03277","created_at":"2026-05-18T01:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03277v1","created_at":"2026-05-18T01:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03277","created_at":"2026-05-18T01:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"76IQ5GEDOIQE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"76IQ5GEDOIQE47TF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"76IQ5GED","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:76IQ5GEDOIQE47TFXWVIM2HIXT","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-12T07:54:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7bdd16ea9b33a66d53306228bdbf261b21e155c2a66dbfe900cfec9030b95232","abstract_canon_sha256":"da3a8835bb4744671d6b12c03f370f4faf3e847bfebef38203300ec5a467e2b5"},"schema_version":"1.0"},"canonical_sha256":"ff910e988372204e7e65bdaa8668e8bcd0778425debba48cd675f8d722b198fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:14.019456Z","signature_b64":"er72haYUpnijII9gONBr4YG9Gxp2AHHPxYShYOE/Vr2G2K6amV5YzBwK8BEVyB5gOkPiS+/ty6WWVIVAvRX3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff910e988372204e7e65bdaa8668e8bcd0778425debba48cd675f8d722b198fb","last_reissued_at":"2026-05-18T01:17:14.018848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:14.018848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03277","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-18T01:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njaazTIWg2SDLYdFd76ga+BLCO/J3thnuWqXs/5ZoGp8eIAwZav9Yb9OpKrsNhS2bsBTw/PPtFZabz0NqOZoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:23:12.754440Z"},"content_sha256":"6b07ae462ebe54913fb8de0be6b6f9ba63cd7c32992994ef45abe926aac9339b","schema_version":"1.0","event_id":"sha256:6b07ae462ebe54913fb8de0be6b6f9ba63cd7c32992994ef45abe926aac9339b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:76IQ5GEDOIQE47TFXWVIM2HIXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Right Mutation Strength for Multi-Valued Decision Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Doerr, Timo K\\\"otzing","submitted_at":"2016-04-12T07:54:10Z","abstract_excerpt":"The most common representation in evolutionary computation are bit strings. This is ideal to model binary decision variables, but less useful for variables taking more values. With very little theoretical work existing on how to use evolutionary algorithms for such optimization problems, we study the run time of simple evolutionary algorithms on some OneMax-like functions defined over $\\Omega = \\{0, 1, \\dots, r-1\\}^n$. More precisely, we regard a variety of problem classes requesting the component-wise minimization of the distance to an unknown target vector $z \\in \\Omega$. For such problems w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03277","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-18T01:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9j37sq3dpOE3+srWaIiEhGENjRMyI4AFt/RUMRzLeJakxYbwh1hLaspg13E81UMBiZCkiYgWhGpa0o8+wlgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:23:12.755030Z"},"content_sha256":"1badebab104aafc0aeb5dfa0c56314f0ee5e929f00c9f0034ce37f92e83dd0c1","schema_version":"1.0","event_id":"sha256:1badebab104aafc0aeb5dfa0c56314f0ee5e929f00c9f0034ce37f92e83dd0c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76IQ5GEDOIQE47TFXWVIM2HIXT/bundle.json","state_url":"https://pith.science/pith/76IQ5GEDOIQE47TFXWVIM2HIXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76IQ5GEDOIQE47TFXWVIM2HIXT/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-30T05:23:12Z","links":{"resolver":"https://pith.science/pith/76IQ5GEDOIQE47TFXWVIM2HIXT","bundle":"https://pith.science/pith/76IQ5GEDOIQE47TFXWVIM2HIXT/bundle.json","state":"https://pith.science/pith/76IQ5GEDOIQE47TFXWVIM2HIXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76IQ5GEDOIQE47TFXWVIM2HIXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:76IQ5GEDOIQE47TFXWVIM2HIXT","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":"da3a8835bb4744671d6b12c03f370f4faf3e847bfebef38203300ec5a467e2b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-12T07:54:10Z","title_canon_sha256":"7bdd16ea9b33a66d53306228bdbf261b21e155c2a66dbfe900cfec9030b95232"},"schema_version":"1.0","source":{"id":"1604.03277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03277","created_at":"2026-05-18T01:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03277v1","created_at":"2026-05-18T01:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03277","created_at":"2026-05-18T01:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"76IQ5GEDOIQE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"76IQ5GEDOIQE47TF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"76IQ5GED","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:1badebab104aafc0aeb5dfa0c56314f0ee5e929f00c9f0034ce37f92e83dd0c1","target":"graph","created_at":"2026-05-18T01:17: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":"The most common representation in evolutionary computation are bit strings. This is ideal to model binary decision variables, but less useful for variables taking more values. With very little theoretical work existing on how to use evolutionary algorithms for such optimization problems, we study the run time of simple evolutionary algorithms on some OneMax-like functions defined over $\\Omega = \\{0, 1, \\dots, r-1\\}^n$. More precisely, we regard a variety of problem classes requesting the component-wise minimization of the distance to an unknown target vector $z \\in \\Omega$. For such problems w","authors_text":"Benjamin Doerr, Carola Doerr, Timo K\\\"otzing","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-12T07:54:10Z","title":"The Right Mutation Strength for Multi-Valued Decision Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03277","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:6b07ae462ebe54913fb8de0be6b6f9ba63cd7c32992994ef45abe926aac9339b","target":"record","created_at":"2026-05-18T01:17: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":"da3a8835bb4744671d6b12c03f370f4faf3e847bfebef38203300ec5a467e2b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-12T07:54:10Z","title_canon_sha256":"7bdd16ea9b33a66d53306228bdbf261b21e155c2a66dbfe900cfec9030b95232"},"schema_version":"1.0","source":{"id":"1604.03277","kind":"arxiv","version":1}},"canonical_sha256":"ff910e988372204e7e65bdaa8668e8bcd0778425debba48cd675f8d722b198fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff910e988372204e7e65bdaa8668e8bcd0778425debba48cd675f8d722b198fb","first_computed_at":"2026-05-18T01:17:14.018848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:14.018848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"er72haYUpnijII9gONBr4YG9Gxp2AHHPxYShYOE/Vr2G2K6amV5YzBwK8BEVyB5gOkPiS+/ty6WWVIVAvRX3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:14.019456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b07ae462ebe54913fb8de0be6b6f9ba63cd7c32992994ef45abe926aac9339b","sha256:1badebab104aafc0aeb5dfa0c56314f0ee5e929f00c9f0034ce37f92e83dd0c1"],"state_sha256":"0b5a6e12c404545a6cf3af69685e2ae9e16d3233a5e0a7171e59ce2af0ed121b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRVp+FSsI5CwpzILIU+ehPyY2ZZ95SLRCFrEnTJwxHICyt8XPLUZzDAu+xAIxkQCa0RCpaBk2yxsUppM2J2VAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:23:12.758290Z","bundle_sha256":"67078ec95704a47980366d45c50df063cb48cc78f98fbc62a0400b236515f78a"}}