{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OKF66HXR4OD2TJG7NJJQZDMR37","short_pith_number":"pith:OKF66HXR","schema_version":"1.0","canonical_sha256":"728bef1ef1e387a9a4df6a530c8d91dfe5fd10f5d9b594b65ab316c532e0d7a2","source":{"kind":"arxiv","id":"1810.11672","version":2},"attestation_state":"computed","paper":{"title":"Average Convergence Rate of Evolutionary Algorithms II: Continuous Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jun He, Yu Chen","submitted_at":"2018-10-27T16:41:28Z","abstract_excerpt":"The average convergence rate (ACR) measures how fast the approximation error of an evolutionary algorithm converges to zero per generation. It is defined as the geometric average of the reduction rate of the approximation error over consecutive generations. This paper makes a theoretical analysis of the ACR in continuous optimization. The obtained results are summarized as follows. According to the limit property, the ACR is classified into two categories: (1) linear ACR whose limit inferior value is larger than a positive and (2) sublinear ACR whose value converges to zero. Then, it is proven"},"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":"1810.11672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-10-27T16:41:28Z","cross_cats_sorted":[],"title_canon_sha256":"457f1b0be824f01551ef18a17ca3501c1d161638dfe7e206450d45ecb6d32643","abstract_canon_sha256":"dc3ca71dcd7667713af9b30110d45f92b20a0a95ba9cd653f3771fed02f4a99e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:35.152687Z","signature_b64":"hJeVOT36MOVMVpbCE0qV7KLqNvxxGjYzcJciS7kDMJmjOXAlEDmU47LvF1/AbXiI6ZnUDbIXmN+5kD4+WLHoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728bef1ef1e387a9a4df6a530c8d91dfe5fd10f5d9b594b65ab316c532e0d7a2","last_reissued_at":"2026-07-05T02:56:35.152196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:35.152196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Convergence Rate of Evolutionary Algorithms II: Continuous Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jun He, Yu Chen","submitted_at":"2018-10-27T16:41:28Z","abstract_excerpt":"The average convergence rate (ACR) measures how fast the approximation error of an evolutionary algorithm converges to zero per generation. It is defined as the geometric average of the reduction rate of the approximation error over consecutive generations. This paper makes a theoretical analysis of the ACR in continuous optimization. The obtained results are summarized as follows. According to the limit property, the ACR is classified into two categories: (1) linear ACR whose limit inferior value is larger than a positive and (2) sublinear ACR whose value converges to zero. Then, it is proven"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11672","kind":"arxiv","version":2},"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/1810.11672/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.11672","created_at":"2026-07-05T02:56:35.152256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11672v2","created_at":"2026-07-05T02:56:35.152256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11672","created_at":"2026-07-05T02:56:35.152256+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKF66HXR4OD2","created_at":"2026-07-05T02:56:35.152256+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKF66HXR4OD2TJG7","created_at":"2026-07-05T02:56:35.152256+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKF66HXR","created_at":"2026-07-05T02:56:35.152256+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/OKF66HXR4OD2TJG7NJJQZDMR37","json":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37.json","graph_json":"https://pith.science/api/pith-number/OKF66HXR4OD2TJG7NJJQZDMR37/graph.json","events_json":"https://pith.science/api/pith-number/OKF66HXR4OD2TJG7NJJQZDMR37/events.json","paper":"https://pith.science/paper/OKF66HXR"},"agent_actions":{"view_html":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37","download_json":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37.json","view_paper":"https://pith.science/paper/OKF66HXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11672&json=true","fetch_graph":"https://pith.science/api/pith-number/OKF66HXR4OD2TJG7NJJQZDMR37/graph.json","fetch_events":"https://pith.science/api/pith-number/OKF66HXR4OD2TJG7NJJQZDMR37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37/action/storage_attestation","attest_author":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37/action/author_attestation","sign_citation":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37/action/citation_signature","submit_replication":"https://pith.science/pith/OKF66HXR4OD2TJG7NJJQZDMR37/action/replication_record"}},"created_at":"2026-07-05T02:56:35.152256+00:00","updated_at":"2026-07-05T02:56:35.152256+00:00"}