{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2JXFVIJ3HZY6JZQ3K3SLUUACB5","short_pith_number":"pith:2JXFVIJ3","canonical_record":{"source":{"id":"1206.3522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-06-15T17:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"ccaa549aa418cbb89076f58b6944d99e3fa3451bbe972edf816931fb7a234ef9","abstract_canon_sha256":"a75672003ebfaaf9123b5c3b47afad00edfd7745559201a6d2dba100d7707680"},"schema_version":"1.0"},"canonical_sha256":"d26e5aa13b3e71e4e61b56e4ba50020f719ee22a5420d91ac21ad793ab4326e3","source":{"kind":"arxiv","id":"1206.3522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3522","created_at":"2026-05-18T03:53:29Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3522v1","created_at":"2026-05-18T03:53:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3522","created_at":"2026-05-18T03:53:29Z"},{"alias_kind":"pith_short_12","alias_value":"2JXFVIJ3HZY6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2JXFVIJ3HZY6JZQ3","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2JXFVIJ3","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2JXFVIJ3HZY6JZQ3K3SLUUACB5","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-06-15T17:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"ccaa549aa418cbb89076f58b6944d99e3fa3451bbe972edf816931fb7a234ef9","abstract_canon_sha256":"a75672003ebfaaf9123b5c3b47afad00edfd7745559201a6d2dba100d7707680"},"schema_version":"1.0"},"canonical_sha256":"d26e5aa13b3e71e4e61b56e4ba50020f719ee22a5420d91ac21ad793ab4326e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:29.990360Z","signature_b64":"36Pc9aRIcMjTV/w5Fv459chBAXGamyPZYZqdaGeLLsuryo1YObgAXGN/0SeNgSHPK/9t6F5YzS6D1QxVdnWKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d26e5aa13b3e71e4e61b56e4ba50020f719ee22a5420d91ac21ad793ab4326e3","last_reissued_at":"2026-05-18T03:53:29.989652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:29.989652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3522","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-18T03:53:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJMsJSZfJ+HJOgCc35m2eKl7N0HQAZE2PAt/lefTu0Myds4cYwRdx48wDRK0p2f6SLbcm4xQFC/2n+Zgs4HhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:20:19.585023Z"},"content_sha256":"6ac36e9b549e45755530e48765a9784bead55e07735d4ba537144b1ee5401615","schema_version":"1.0","event_id":"sha256:6ac36e9b549e45755530e48765a9784bead55e07735d4ba537144b1ee5401615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2JXFVIJ3HZY6JZQ3K3SLUUACB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt, J\\\"org L\\\"assig","submitted_at":"2012-06-15T17:28:51Z","abstract_excerpt":"We present a new method for analyzing the running time of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel running time. This allows to rigorously estimate the speedup gained by parallelization. Tailored results are given for common migration topologies: ring graphs, torus graphs, hypercubes, and the complete graph. Example applications for pseudo-Boolean optimization show that our method is easy to apply and that it gives powerful results. In our examples the possible speedup increases wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3522","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-18T03:53:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUcW59RvO87yx/xsra+Ez7npOPzBgDhadABMGlAMQw9J4p6R49LN2cdbGrIYnqEkOUmuDSwM2PXeOlXqaGXXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:20:19.585611Z"},"content_sha256":"190bd3e7e533f75c8ef326838c4205d08d4968008db1007b70dd7ff71679693b","schema_version":"1.0","event_id":"sha256:190bd3e7e533f75c8ef326838c4205d08d4968008db1007b70dd7ff71679693b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/bundle.json","state_url":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/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-28T19:20:19Z","links":{"resolver":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5","bundle":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/bundle.json","state":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2JXFVIJ3HZY6JZQ3K3SLUUACB5","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":"a75672003ebfaaf9123b5c3b47afad00edfd7745559201a6d2dba100d7707680","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-06-15T17:28:51Z","title_canon_sha256":"ccaa549aa418cbb89076f58b6944d99e3fa3451bbe972edf816931fb7a234ef9"},"schema_version":"1.0","source":{"id":"1206.3522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3522","created_at":"2026-05-18T03:53:29Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3522v1","created_at":"2026-05-18T03:53:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3522","created_at":"2026-05-18T03:53:29Z"},{"alias_kind":"pith_short_12","alias_value":"2JXFVIJ3HZY6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2JXFVIJ3HZY6JZQ3","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2JXFVIJ3","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:190bd3e7e533f75c8ef326838c4205d08d4968008db1007b70dd7ff71679693b","target":"graph","created_at":"2026-05-18T03:53:29Z","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":"We present a new method for analyzing the running time of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel running time. This allows to rigorously estimate the speedup gained by parallelization. Tailored results are given for common migration topologies: ring graphs, torus graphs, hypercubes, and the complete graph. Example applications for pseudo-Boolean optimization show that our method is easy to apply and that it gives powerful results. In our examples the possible speedup increases wi","authors_text":"Dirk Sudholt, J\\\"org L\\\"assig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-06-15T17:28:51Z","title":"General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3522","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:6ac36e9b549e45755530e48765a9784bead55e07735d4ba537144b1ee5401615","target":"record","created_at":"2026-05-18T03:53:29Z","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":"a75672003ebfaaf9123b5c3b47afad00edfd7745559201a6d2dba100d7707680","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-06-15T17:28:51Z","title_canon_sha256":"ccaa549aa418cbb89076f58b6944d99e3fa3451bbe972edf816931fb7a234ef9"},"schema_version":"1.0","source":{"id":"1206.3522","kind":"arxiv","version":1}},"canonical_sha256":"d26e5aa13b3e71e4e61b56e4ba50020f719ee22a5420d91ac21ad793ab4326e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d26e5aa13b3e71e4e61b56e4ba50020f719ee22a5420d91ac21ad793ab4326e3","first_computed_at":"2026-05-18T03:53:29.989652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:29.989652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36Pc9aRIcMjTV/w5Fv459chBAXGamyPZYZqdaGeLLsuryo1YObgAXGN/0SeNgSHPK/9t6F5YzS6D1QxVdnWKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:29.990360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac36e9b549e45755530e48765a9784bead55e07735d4ba537144b1ee5401615","sha256:190bd3e7e533f75c8ef326838c4205d08d4968008db1007b70dd7ff71679693b"],"state_sha256":"8fcdf41def64a922f863f27e3904e06e444e6b981b8de34cf29621580d02558c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdxdQSBhSsJBiNOVofMH33gGhe2M9VyowbKw26kMryYEGooe8VkQota0IitGM1TEov5ihXg5+nd0n+ynuqCYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:20:19.588908Z","bundle_sha256":"06ce79eb9f918b253aee9d7bcbfed0bc24b64ae91b3e3b95cdae9aecd6f5c586"}}