{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DBGCIEMHXRETF6Z3PBTRVXLDSL","short_pith_number":"pith:DBGCIEMH","canonical_record":{"source":{"id":"1409.1686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-05T08:29:35Z","cross_cats_sorted":[],"title_canon_sha256":"c84dc2fb4ea551933f6ef54c04ec9ef5b1c155f374ef42a7c3fe9f7b810fdb27","abstract_canon_sha256":"1cfaf164c49e28148060bad9bb6e4d10be9a4cc98f212749820bf67cb661471f"},"schema_version":"1.0"},"canonical_sha256":"184c241187bc4932fb3b78671add6392daf5006d38caead94bd59f604815a5ce","source":{"kind":"arxiv","id":"1409.1686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1686","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1686v1","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1686","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"DBGCIEMHXRET","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DBGCIEMHXRETF6Z3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DBGCIEMH","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DBGCIEMHXRETF6Z3PBTRVXLDSL","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-05T08:29:35Z","cross_cats_sorted":[],"title_canon_sha256":"c84dc2fb4ea551933f6ef54c04ec9ef5b1c155f374ef42a7c3fe9f7b810fdb27","abstract_canon_sha256":"1cfaf164c49e28148060bad9bb6e4d10be9a4cc98f212749820bf67cb661471f"},"schema_version":"1.0"},"canonical_sha256":"184c241187bc4932fb3b78671add6392daf5006d38caead94bd59f604815a5ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:49.848527Z","signature_b64":"CIBE/IVN9k7xzMC9hSMAVtFUozOjwhSe06rPCL/MWkvIu9GCfwbkyi1ptoDJRT7YnO5PPlJ84xtA+70EGdqmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"184c241187bc4932fb3b78671add6392daf5006d38caead94bd59f604815a5ce","last_reissued_at":"2026-05-17T23:51:49.847679Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:49.847679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1686","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:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WwtvSrcqPoAQGMm9YT10b1AK5Hxa9C7ySEPDYNarrZmDMMVCvveoI7P0ckwThjetdxRpJ4M2mmbtx8XkdSdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:59:52.845203Z"},"content_sha256":"62f43027118e64202fb902fefcadc543d0849c07e5f17c3a5c3f8854d16aceda","schema_version":"1.0","event_id":"sha256:62f43027118e64202fb902fefcadc543d0849c07e5f17c3a5c3f8854d16aceda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DBGCIEMHXRETF6Z3PBTRVXLDSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating Non Stationary Operators in Search Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adrien Go\\\"effon, Fr\\'ed\\'eric Lardeux, Fr\\'ed\\'eric Saubion","submitted_at":"2014-09-05T08:29:35Z","abstract_excerpt":"In this paper, we propose a model for simulating search operators whose behaviour often changes continuously during the search. In these scenarios, the performance of the operators decreases when they are applied. This is motivated by the fact that operators for optimization problems are often roughly classified into exploitation operators and exploration operators. Our simulation model is used to compare the different performances of operator selection policies and clearly identify their ability to adapt to such specific operators behaviours. The experimental study provides interesting result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1686","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:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqURk8QfU6iWcHbjVbAqnyv9AIsOXU8IieuCSynmSm9ZcFUdEffcQ/gLKciD/YeV3mJo/wS397iPyFRzXaIMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:59:52.845565Z"},"content_sha256":"f24baf0765e44212dfbabca37d6a4e73309ae1751e12f5b4cc682a779b674dbf","schema_version":"1.0","event_id":"sha256:f24baf0765e44212dfbabca37d6a4e73309ae1751e12f5b4cc682a779b674dbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL/bundle.json","state_url":"https://pith.science/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL/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-20T07:59:52Z","links":{"resolver":"https://pith.science/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL","bundle":"https://pith.science/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL/bundle.json","state":"https://pith.science/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBGCIEMHXRETF6Z3PBTRVXLDSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DBGCIEMHXRETF6Z3PBTRVXLDSL","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":"1cfaf164c49e28148060bad9bb6e4d10be9a4cc98f212749820bf67cb661471f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-05T08:29:35Z","title_canon_sha256":"c84dc2fb4ea551933f6ef54c04ec9ef5b1c155f374ef42a7c3fe9f7b810fdb27"},"schema_version":"1.0","source":{"id":"1409.1686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1686","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1686v1","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1686","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"DBGCIEMHXRET","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DBGCIEMHXRETF6Z3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DBGCIEMH","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:f24baf0765e44212dfbabca37d6a4e73309ae1751e12f5b4cc682a779b674dbf","target":"graph","created_at":"2026-05-17T23:51: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":"In this paper, we propose a model for simulating search operators whose behaviour often changes continuously during the search. In these scenarios, the performance of the operators decreases when they are applied. This is motivated by the fact that operators for optimization problems are often roughly classified into exploitation operators and exploration operators. Our simulation model is used to compare the different performances of operator selection policies and clearly identify their ability to adapt to such specific operators behaviours. The experimental study provides interesting result","authors_text":"Adrien Go\\\"effon, Fr\\'ed\\'eric Lardeux, Fr\\'ed\\'eric Saubion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-05T08:29:35Z","title":"Simulating Non Stationary Operators in Search Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1686","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:62f43027118e64202fb902fefcadc543d0849c07e5f17c3a5c3f8854d16aceda","target":"record","created_at":"2026-05-17T23:51: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":"1cfaf164c49e28148060bad9bb6e4d10be9a4cc98f212749820bf67cb661471f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-05T08:29:35Z","title_canon_sha256":"c84dc2fb4ea551933f6ef54c04ec9ef5b1c155f374ef42a7c3fe9f7b810fdb27"},"schema_version":"1.0","source":{"id":"1409.1686","kind":"arxiv","version":1}},"canonical_sha256":"184c241187bc4932fb3b78671add6392daf5006d38caead94bd59f604815a5ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"184c241187bc4932fb3b78671add6392daf5006d38caead94bd59f604815a5ce","first_computed_at":"2026-05-17T23:51:49.847679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:49.847679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CIBE/IVN9k7xzMC9hSMAVtFUozOjwhSe06rPCL/MWkvIu9GCfwbkyi1ptoDJRT7YnO5PPlJ84xtA+70EGdqmCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:49.848527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62f43027118e64202fb902fefcadc543d0849c07e5f17c3a5c3f8854d16aceda","sha256:f24baf0765e44212dfbabca37d6a4e73309ae1751e12f5b4cc682a779b674dbf"],"state_sha256":"8b122d1f4d1797e825bb5fcd96412083163895956563842a0bb1aa48f3811838"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvYWvZSE1+6W63vf5lFFwG70UuWFeM3OTARYZ5qSOALu0tqiHCPyRbY9Wm3TwOpcQ+jDWsHKljJIry6SuqgZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:59:52.847555Z","bundle_sha256":"a97e193b1e136bc6ff07c2f1763c4b71e340864cba4e643883743dbc08fe344d"}}