{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:57PJ5VW7FROCC2RBTNRKTHDTQH","short_pith_number":"pith:57PJ5VW7","canonical_record":{"source":{"id":"1804.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-14T12:03:25Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"2b5beca91a2525ac6e8214f16cf30aebde5cb8bc07afa0dcaebd3c6f0d570374","abstract_canon_sha256":"679c04f3429c5674575657bd907c6b1933d34062b5ce585c09c6e92d5d828b7f"},"schema_version":"1.0"},"canonical_sha256":"efde9ed6df2c5c216a219b62a99c7381fae452fab5be25054f9a13dd56df1145","source":{"kind":"arxiv","id":"1804.05208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05208","created_at":"2026-05-18T00:18:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05208v1","created_at":"2026-05-18T00:18:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05208","created_at":"2026-05-18T00:18:30Z"},{"alias_kind":"pith_short_12","alias_value":"57PJ5VW7FROC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57PJ5VW7FROCC2RB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57PJ5VW7","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:57PJ5VW7FROCC2RBTNRKTHDTQH","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-14T12:03:25Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"2b5beca91a2525ac6e8214f16cf30aebde5cb8bc07afa0dcaebd3c6f0d570374","abstract_canon_sha256":"679c04f3429c5674575657bd907c6b1933d34062b5ce585c09c6e92d5d828b7f"},"schema_version":"1.0"},"canonical_sha256":"efde9ed6df2c5c216a219b62a99c7381fae452fab5be25054f9a13dd56df1145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:30.318868Z","signature_b64":"YKwIE3t7E6h8WzDqDhY9ILiTZWvEjbxxd54i4rkuUThGKDvXVsBDRkp2jERcQfbHVcKcSweEOm7f7sRFpM6MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efde9ed6df2c5c216a219b62a99c7381fae452fab5be25054f9a13dd56df1145","last_reissued_at":"2026-05-18T00:18:30.318429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:30.318429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05208","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-18T00:18:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUuWLRuES88OIfCt5Sfo4JZjdYpKJ/T1LBc1GG0mBeyys1hzENxE33R2bo+stxputEulHpVyXCyhMbaAZ95jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:32:34.103943Z"},"content_sha256":"6df4b4aaba1f051a7760b61d2dbbefbbe54c6c7d0d5e2b67808c7d3b4db8df3d","schema_version":"1.0","event_id":"sha256:6df4b4aaba1f051a7760b61d2dbbefbbe54c6c7d0d5e2b67808c7d3b4db8df3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:57PJ5VW7FROCC2RBTNRKTHDTQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Ilya Yakupov, Maxim Buzdalov","submitted_at":"2018-04-14T12:03:25Z","abstract_excerpt":"In parallel and distributed environments, generational evolutionary algorithms often do not exploit the full potential of the computation system since they have to wait until the entire population is evaluated before starting selection procedures. Steady-state algorithms are often seen as a solution to this problem, since fitness evaluation can be done by multiple threads in an asynchronous way. However, if the algorithm updates its state in a complicated way, the threads will eventually have to wait until this update finishes. State update procedures that are computationally expensive are com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05208","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-18T00:18:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCAzjupEGJWr13lgDBmU4YIxwrm7zQncBznnMleNrJWwnARvyVVlMt+nhItJXtuRE0QpR74PgSX+EBPJJc6rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:32:34.104366Z"},"content_sha256":"8eefbac051d01a8a3e93a73496e77e25c075b987b3049aae19d7acb65aeb9370","schema_version":"1.0","event_id":"sha256:8eefbac051d01a8a3e93a73496e77e25c075b987b3049aae19d7acb65aeb9370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57PJ5VW7FROCC2RBTNRKTHDTQH/bundle.json","state_url":"https://pith.science/pith/57PJ5VW7FROCC2RBTNRKTHDTQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57PJ5VW7FROCC2RBTNRKTHDTQH/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-28T20:32:34Z","links":{"resolver":"https://pith.science/pith/57PJ5VW7FROCC2RBTNRKTHDTQH","bundle":"https://pith.science/pith/57PJ5VW7FROCC2RBTNRKTHDTQH/bundle.json","state":"https://pith.science/pith/57PJ5VW7FROCC2RBTNRKTHDTQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57PJ5VW7FROCC2RBTNRKTHDTQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:57PJ5VW7FROCC2RBTNRKTHDTQH","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":"679c04f3429c5674575657bd907c6b1933d34062b5ce585c09c6e92d5d828b7f","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-14T12:03:25Z","title_canon_sha256":"2b5beca91a2525ac6e8214f16cf30aebde5cb8bc07afa0dcaebd3c6f0d570374"},"schema_version":"1.0","source":{"id":"1804.05208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05208","created_at":"2026-05-18T00:18:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05208v1","created_at":"2026-05-18T00:18:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05208","created_at":"2026-05-18T00:18:30Z"},{"alias_kind":"pith_short_12","alias_value":"57PJ5VW7FROC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57PJ5VW7FROCC2RB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57PJ5VW7","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:8eefbac051d01a8a3e93a73496e77e25c075b987b3049aae19d7acb65aeb9370","target":"graph","created_at":"2026-05-18T00:18:30Z","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 parallel and distributed environments, generational evolutionary algorithms often do not exploit the full potential of the computation system since they have to wait until the entire population is evaluated before starting selection procedures. Steady-state algorithms are often seen as a solution to this problem, since fitness evaluation can be done by multiple threads in an asynchronous way. However, if the algorithm updates its state in a complicated way, the threads will eventually have to wait until this update finishes. State update procedures that are computationally expensive are com","authors_text":"Ilya Yakupov, Maxim Buzdalov","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-14T12:03:25Z","title":"On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05208","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:6df4b4aaba1f051a7760b61d2dbbefbbe54c6c7d0d5e2b67808c7d3b4db8df3d","target":"record","created_at":"2026-05-18T00:18:30Z","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":"679c04f3429c5674575657bd907c6b1933d34062b5ce585c09c6e92d5d828b7f","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-14T12:03:25Z","title_canon_sha256":"2b5beca91a2525ac6e8214f16cf30aebde5cb8bc07afa0dcaebd3c6f0d570374"},"schema_version":"1.0","source":{"id":"1804.05208","kind":"arxiv","version":1}},"canonical_sha256":"efde9ed6df2c5c216a219b62a99c7381fae452fab5be25054f9a13dd56df1145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efde9ed6df2c5c216a219b62a99c7381fae452fab5be25054f9a13dd56df1145","first_computed_at":"2026-05-18T00:18:30.318429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:30.318429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKwIE3t7E6h8WzDqDhY9ILiTZWvEjbxxd54i4rkuUThGKDvXVsBDRkp2jERcQfbHVcKcSweEOm7f7sRFpM6MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:30.318868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6df4b4aaba1f051a7760b61d2dbbefbbe54c6c7d0d5e2b67808c7d3b4db8df3d","sha256:8eefbac051d01a8a3e93a73496e77e25c075b987b3049aae19d7acb65aeb9370"],"state_sha256":"ed41023fad6793d32d13273677133f5050696b46eff382e6ca7e6686fc499009"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldYdyClg3an1KnKt8M/qEfN8F9JLrWtCfcuUCldoKvUUaOk31sd8RGnI7RjtEcyuqT1+ZlV2nly0mRyjiJ7KBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:32:34.106965Z","bundle_sha256":"b43659ed7ea57a3860f84d6393a359805c0ca19861a0ffca1134986b2ff332e1"}}