{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BEQ2WGXUVLQB5FLWBHIUKZHNUB","short_pith_number":"pith:BEQ2WGXU","canonical_record":{"source":{"id":"1805.10902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T13:05:02Z","cross_cats_sorted":[],"title_canon_sha256":"8087c641834e13565846130302336f95614dfb1d3709bf268b46acbef745be47","abstract_canon_sha256":"873e1dd705666439e847965c213a8cfc12286fbfea7d1d253799b09e2572ec77"},"schema_version":"1.0"},"canonical_sha256":"0921ab1af4aae01e957609d14564eda04748aca637f83d83b01f13943f5d34a7","source":{"kind":"arxiv","id":"1805.10902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10902","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10902v2","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10902","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"BEQ2WGXUVLQB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BEQ2WGXUVLQB5FLW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BEQ2WGXU","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BEQ2WGXUVLQB5FLWBHIUKZHNUB","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T13:05:02Z","cross_cats_sorted":[],"title_canon_sha256":"8087c641834e13565846130302336f95614dfb1d3709bf268b46acbef745be47","abstract_canon_sha256":"873e1dd705666439e847965c213a8cfc12286fbfea7d1d253799b09e2572ec77"},"schema_version":"1.0"},"canonical_sha256":"0921ab1af4aae01e957609d14564eda04748aca637f83d83b01f13943f5d34a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:13.134158Z","signature_b64":"OqPIhFCjbmy3s2GTrLBdQ0KX9+Ul8zaPuixd0VckxDzkYvza33afTjtR7F/8w0S6upr/OGRJPAQXrXS5r0J2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0921ab1af4aae01e957609d14564eda04748aca637f83d83b01f13943f5d34a7","last_reissued_at":"2026-05-18T00:00:13.133550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:13.133550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10902","source_version":2,"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02gVDniO56w2SHoFwZvj6ibBzyFZrbbJPXT1Sg0yoV8Yjuq+DoqfeZEoN3tdeomuNlaOgq5fTRhLgk6t4vunAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:08:33.510881Z"},"content_sha256":"96d118ad1c21a342e15be424a92ba2cacb11787d7183ba63fa24cc4bc748ed72","schema_version":"1.0","event_id":"sha256:96d118ad1c21a342e15be424a92ba2cacb11787d7183ba63fa24cc4bc748ed72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BEQ2WGXUVLQB5FLWBHIUKZHNUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas G\\\"obel, Francesco Quinzan, Markus Wagner, Tobias Friedrich","submitted_at":"2018-05-28T13:05:02Z","abstract_excerpt":"A core feature of evolutionary algorithms is their mutation operator. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this line of work, we propose a new mutation operator and analyze its performance on the (1+1) Evolutionary Algorithm (EA).\n  Our analyses show that this mutation operator competes with pre-existing ones, when used by the (1+1) EA on classes of problems for which results on the other mutation operators are available. We show that the (1+1) EA using our mutation operator finds a (1/3)-appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10902","kind":"arxiv","version":2},"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+W4Jw4cTL3xukMM/FhRQ0BAzU3396gFBiWK7EkY6Va0zejSM6UBN319S6m8UWrD+Hd5NgVqNN07IXqIXNlAUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:08:33.511546Z"},"content_sha256":"c7f482d2ab48f43eb52b8ab89a75603da1e9d0e5107ec6f871d4a368685eec0b","schema_version":"1.0","event_id":"sha256:c7f482d2ab48f43eb52b8ab89a75603da1e9d0e5107ec6f871d4a368685eec0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB/bundle.json","state_url":"https://pith.science/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB/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-06T21:08:33Z","links":{"resolver":"https://pith.science/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB","bundle":"https://pith.science/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB/bundle.json","state":"https://pith.science/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEQ2WGXUVLQB5FLWBHIUKZHNUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BEQ2WGXUVLQB5FLWBHIUKZHNUB","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":"873e1dd705666439e847965c213a8cfc12286fbfea7d1d253799b09e2572ec77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T13:05:02Z","title_canon_sha256":"8087c641834e13565846130302336f95614dfb1d3709bf268b46acbef745be47"},"schema_version":"1.0","source":{"id":"1805.10902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10902","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10902v2","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10902","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"BEQ2WGXUVLQB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BEQ2WGXUVLQB5FLW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BEQ2WGXU","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:c7f482d2ab48f43eb52b8ab89a75603da1e9d0e5107ec6f871d4a368685eec0b","target":"graph","created_at":"2026-05-18T00:00:13Z","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":"A core feature of evolutionary algorithms is their mutation operator. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this line of work, we propose a new mutation operator and analyze its performance on the (1+1) Evolutionary Algorithm (EA).\n  Our analyses show that this mutation operator competes with pre-existing ones, when used by the (1+1) EA on classes of problems for which results on the other mutation operators are available. We show that the (1+1) EA using our mutation operator finds a (1/3)-appro","authors_text":"Andreas G\\\"obel, Francesco Quinzan, Markus Wagner, Tobias Friedrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T13:05:02Z","title":"Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10902","kind":"arxiv","version":2},"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:96d118ad1c21a342e15be424a92ba2cacb11787d7183ba63fa24cc4bc748ed72","target":"record","created_at":"2026-05-18T00:00:13Z","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":"873e1dd705666439e847965c213a8cfc12286fbfea7d1d253799b09e2572ec77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T13:05:02Z","title_canon_sha256":"8087c641834e13565846130302336f95614dfb1d3709bf268b46acbef745be47"},"schema_version":"1.0","source":{"id":"1805.10902","kind":"arxiv","version":2}},"canonical_sha256":"0921ab1af4aae01e957609d14564eda04748aca637f83d83b01f13943f5d34a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0921ab1af4aae01e957609d14564eda04748aca637f83d83b01f13943f5d34a7","first_computed_at":"2026-05-18T00:00:13.133550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:13.133550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OqPIhFCjbmy3s2GTrLBdQ0KX9+Ul8zaPuixd0VckxDzkYvza33afTjtR7F/8w0S6upr/OGRJPAQXrXS5r0J2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:13.134158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96d118ad1c21a342e15be424a92ba2cacb11787d7183ba63fa24cc4bc748ed72","sha256:c7f482d2ab48f43eb52b8ab89a75603da1e9d0e5107ec6f871d4a368685eec0b"],"state_sha256":"c4a3bd1e51bc8b9a928be7b209b1e72c4dd64f4f0778024524fded97e8134c23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFhFl5x+e1EocBy3vb/QXz7V30bF4Sbky8pd7i72tKz3B/LL1w1w0GAU5m9sqUUg87erxVx84tc6C35wdj1mDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:08:33.514848Z","bundle_sha256":"90f504992b539f4ad27676a1a7c0589443676e5b1e9a854a4cfb77d3df1400b6"}}