{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2JXFVIJ3HZY6JZQ3K3SLUUACB5","short_pith_number":"pith:2JXFVIJ3","schema_version":"1.0","canonical_sha256":"d26e5aa13b3e71e4e61b56e4ba50020f719ee22a5420d91ac21ad793ab4326e3","source":{"kind":"arxiv","id":"1206.3522","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.3522","created_at":"2026-05-18T03:53:29.989745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3522v1","created_at":"2026-05-18T03:53:29.989745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3522","created_at":"2026-05-18T03:53:29.989745+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JXFVIJ3HZY6","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JXFVIJ3HZY6JZQ3","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JXFVIJ3","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5","json":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5.json","graph_json":"https://pith.science/api/pith-number/2JXFVIJ3HZY6JZQ3K3SLUUACB5/graph.json","events_json":"https://pith.science/api/pith-number/2JXFVIJ3HZY6JZQ3K3SLUUACB5/events.json","paper":"https://pith.science/paper/2JXFVIJ3"},"agent_actions":{"view_html":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5","download_json":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5.json","view_paper":"https://pith.science/paper/2JXFVIJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3522&json=true","fetch_graph":"https://pith.science/api/pith-number/2JXFVIJ3HZY6JZQ3K3SLUUACB5/graph.json","fetch_events":"https://pith.science/api/pith-number/2JXFVIJ3HZY6JZQ3K3SLUUACB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/action/storage_attestation","attest_author":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/action/author_attestation","sign_citation":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/action/citation_signature","submit_replication":"https://pith.science/pith/2JXFVIJ3HZY6JZQ3K3SLUUACB5/action/replication_record"}},"created_at":"2026-05-18T03:53:29.989745+00:00","updated_at":"2026-05-18T03:53:29.989745+00:00"}