{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RBBSW2TOWS6U5DACBNFBUIWD5H","short_pith_number":"pith:RBBSW2TO","canonical_record":{"source":{"id":"1908.08014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-05T15:50:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"810f359fcfcd20d13a6592092c4ee52679a98a43332e57a7906fb3b571b4e8d8","abstract_canon_sha256":"877236a3912d4e82a9dd5d14f72c6b7cb3ce7258ab68db061e7d93168e7f8cab"},"schema_version":"1.0"},"canonical_sha256":"88432b6a6eb4bd4e8c020b4a1a22c3e9f7ab0e9c8e2efa81cea7234eed7f6d40","source":{"kind":"arxiv","id":"1908.08014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08014","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08014v1","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08014","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"RBBSW2TOWS6U","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"pith_short_16","alias_value":"RBBSW2TOWS6U5DAC","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"pith_short_8","alias_value":"RBBSW2TO","created_at":"2026-07-04T23:59:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RBBSW2TOWS6U5DACBNFBUIWD5H","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-05T15:50:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"810f359fcfcd20d13a6592092c4ee52679a98a43332e57a7906fb3b571b4e8d8","abstract_canon_sha256":"877236a3912d4e82a9dd5d14f72c6b7cb3ce7258ab68db061e7d93168e7f8cab"},"schema_version":"1.0"},"canonical_sha256":"88432b6a6eb4bd4e8c020b4a1a22c3e9f7ab0e9c8e2efa81cea7234eed7f6d40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:03.310867Z","signature_b64":"3Q1khq9QrjA0qnVFUfpEciN4MbJtzg2L42DaLAAHeHVaUKynQD3A3UsSazbGAPX2ncQR/rrEA2GDxxTlA41jCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88432b6a6eb4bd4e8c020b4a1a22c3e9f7ab0e9c8e2efa81cea7234eed7f6d40","last_reissued_at":"2026-07-04T23:59:03.310485Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:03.310485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08014","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-07-04T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0bk/NOikdLUUFLRngNIl0d7Osg8948EoTUYTL8N3YBRWZleJa4ui5seHz7PpZWVZYd/Wveat58EJYKkEPITAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:41:09.001306Z"},"content_sha256":"3b55513e7b0b037739a599116e520ecd4ff6264337d861020cdc7dd98c3fbb2f","schema_version":"1.0","event_id":"sha256:3b55513e7b0b037739a599116e520ecd4ff6264337d861020cdc7dd98c3fbb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RBBSW2TOWS6U5DACBNFBUIWD5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph based adaptive evolutionary algorithm for continuous optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NE","authors_text":"Amir Nakib, Asmaa Ghoumari","submitted_at":"2019-08-05T15:50:05Z","abstract_excerpt":"he greatest weakness of evolutionary algorithms, widely used today, is the premature convergence due to the loss of population diversity over generations. To overcome this problem, several algorithms have been proposed, such as the Graph-based Evolutionary Algorithm (GEA) \\cite{1} which uses graphs to model the structure of the population, but also memetic or differential evolution algorithms \\cite{2,3}, or diversity-based ones \\cite{4,5} have been designed. These algorithms are based on multi-populations, or often rather focus on the self-tuning parameters, however, they become complex to tun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08014","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08014/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rcyC/P6uM1vFlvOOG9cCx3oZHOoOtYjjTRFt1goMxSGnH/9MrQazX5GAP/PmWmvrC3qoWYIkpZNjhIvqhKGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:41:09.001818Z"},"content_sha256":"5b63803b5db8f7879790358b614224f932ff5ac1d5e98612ac067dcf49ce7fa6","schema_version":"1.0","event_id":"sha256:5b63803b5db8f7879790358b614224f932ff5ac1d5e98612ac067dcf49ce7fa6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBBSW2TOWS6U5DACBNFBUIWD5H/bundle.json","state_url":"https://pith.science/pith/RBBSW2TOWS6U5DACBNFBUIWD5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBBSW2TOWS6U5DACBNFBUIWD5H/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-08-16T17:41:09Z","links":{"resolver":"https://pith.science/pith/RBBSW2TOWS6U5DACBNFBUIWD5H","bundle":"https://pith.science/pith/RBBSW2TOWS6U5DACBNFBUIWD5H/bundle.json","state":"https://pith.science/pith/RBBSW2TOWS6U5DACBNFBUIWD5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBBSW2TOWS6U5DACBNFBUIWD5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RBBSW2TOWS6U5DACBNFBUIWD5H","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":"877236a3912d4e82a9dd5d14f72c6b7cb3ce7258ab68db061e7d93168e7f8cab","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-05T15:50:05Z","title_canon_sha256":"810f359fcfcd20d13a6592092c4ee52679a98a43332e57a7906fb3b571b4e8d8"},"schema_version":"1.0","source":{"id":"1908.08014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08014","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08014v1","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08014","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"RBBSW2TOWS6U","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"pith_short_16","alias_value":"RBBSW2TOWS6U5DAC","created_at":"2026-07-04T23:59:03Z"},{"alias_kind":"pith_short_8","alias_value":"RBBSW2TO","created_at":"2026-07-04T23:59:03Z"}],"graph_snapshots":[{"event_id":"sha256:5b63803b5db8f7879790358b614224f932ff5ac1d5e98612ac067dcf49ce7fa6","target":"graph","created_at":"2026-07-04T23:59:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08014/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"he greatest weakness of evolutionary algorithms, widely used today, is the premature convergence due to the loss of population diversity over generations. To overcome this problem, several algorithms have been proposed, such as the Graph-based Evolutionary Algorithm (GEA) \\cite{1} which uses graphs to model the structure of the population, but also memetic or differential evolution algorithms \\cite{2,3}, or diversity-based ones \\cite{4,5} have been designed. These algorithms are based on multi-populations, or often rather focus on the self-tuning parameters, however, they become complex to tun","authors_text":"Amir Nakib, Asmaa Ghoumari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-05T15:50:05Z","title":"Graph based adaptive evolutionary algorithm for continuous optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08014","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:3b55513e7b0b037739a599116e520ecd4ff6264337d861020cdc7dd98c3fbb2f","target":"record","created_at":"2026-07-04T23:59:03Z","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":"877236a3912d4e82a9dd5d14f72c6b7cb3ce7258ab68db061e7d93168e7f8cab","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-05T15:50:05Z","title_canon_sha256":"810f359fcfcd20d13a6592092c4ee52679a98a43332e57a7906fb3b571b4e8d8"},"schema_version":"1.0","source":{"id":"1908.08014","kind":"arxiv","version":1}},"canonical_sha256":"88432b6a6eb4bd4e8c020b4a1a22c3e9f7ab0e9c8e2efa81cea7234eed7f6d40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88432b6a6eb4bd4e8c020b4a1a22c3e9f7ab0e9c8e2efa81cea7234eed7f6d40","first_computed_at":"2026-07-04T23:59:03.310485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:03.310485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Q1khq9QrjA0qnVFUfpEciN4MbJtzg2L42DaLAAHeHVaUKynQD3A3UsSazbGAPX2ncQR/rrEA2GDxxTlA41jCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:03.310867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b55513e7b0b037739a599116e520ecd4ff6264337d861020cdc7dd98c3fbb2f","sha256:5b63803b5db8f7879790358b614224f932ff5ac1d5e98612ac067dcf49ce7fa6"],"state_sha256":"513c7e8a0361455dc57048c91fe0b684e6d64948b0024c329bd7b550f10d0cdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgB3J7K3ajXu4ee08WFjmzMJOL77Po6UZ2tDnAapuXCaTOLBrm4pm7wjfn8yWamqbHZ4hlvLe5Nm3mokpruZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:41:09.006900Z","bundle_sha256":"ba0dc85b72e7edf9d2a867ad0119e5dc6e8cc9b22052c3e278253df09d45ba86"}}