{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DO5R7AVYF66GODWRQCZGHGXNHL","short_pith_number":"pith:DO5R7AVY","schema_version":"1.0","canonical_sha256":"1bbb1f82b82fbc670ed180b2639aed3af7bf588fb896e2f030f89c74a3c194d7","source":{"kind":"arxiv","id":"1905.12192","version":1},"attestation_state":"computed","paper":{"title":"A Fast Differential Grouping Algorithm for Large Scale Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"An Chen, Wenhua Guo, Yaochu Jin, Yongsheng Liang, Zhigang Ren, Zuren Feng","submitted_at":"2019-05-29T03:11:19Z","abstract_excerpt":"Decomposition plays a significant role in cooperative co-evolution which shows great potential in large scale black-box optimization. However, current popular decomposition algorithms generally require to sample and evaluate a large number of solutions for interdependency detection, which is very time-consuming. To address this issue, this study proposes a new decomposition algorithm named fast differential grouping (FDG). FDG first identifies the type of an instance by detecting the interdependencies of a few pairs of variable subsets selected according to certain rules, and thus can rapidly "},"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":"1905.12192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T03:11:19Z","cross_cats_sorted":[],"title_canon_sha256":"e671081fe25808030fa8c68bd2ff704dcd90ba8507c428c7a90768d6917ec9a2","abstract_canon_sha256":"d8f8e7ac6981ac0b8d9bd207d405bd2bd046e4d5568c95a83a987cae9a762ebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:46.847503Z","signature_b64":"Y0zWGV+KtSL/Qi0edUYaFzGiE2eT+XX/y52Sqks/GJyOyavAi6ukpFT5DP53PtWBUrNcV5HlX3zJalukted+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bbb1f82b82fbc670ed180b2639aed3af7bf588fb896e2f030f89c74a3c194d7","last_reissued_at":"2026-05-17T23:44:46.846954Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:46.846954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Differential Grouping Algorithm for Large Scale Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"An Chen, Wenhua Guo, Yaochu Jin, Yongsheng Liang, Zhigang Ren, Zuren Feng","submitted_at":"2019-05-29T03:11:19Z","abstract_excerpt":"Decomposition plays a significant role in cooperative co-evolution which shows great potential in large scale black-box optimization. However, current popular decomposition algorithms generally require to sample and evaluate a large number of solutions for interdependency detection, which is very time-consuming. To address this issue, this study proposes a new decomposition algorithm named fast differential grouping (FDG). FDG first identifies the type of an instance by detecting the interdependencies of a few pairs of variable subsets selected according to certain rules, and thus can rapidly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12192","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":"1905.12192","created_at":"2026-05-17T23:44:46.847036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12192v1","created_at":"2026-05-17T23:44:46.847036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12192","created_at":"2026-05-17T23:44:46.847036+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO5R7AVYF66G","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO5R7AVYF66GODWR","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO5R7AVY","created_at":"2026-05-18T12:33:15.570797+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/DO5R7AVYF66GODWRQCZGHGXNHL","json":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL.json","graph_json":"https://pith.science/api/pith-number/DO5R7AVYF66GODWRQCZGHGXNHL/graph.json","events_json":"https://pith.science/api/pith-number/DO5R7AVYF66GODWRQCZGHGXNHL/events.json","paper":"https://pith.science/paper/DO5R7AVY"},"agent_actions":{"view_html":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL","download_json":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL.json","view_paper":"https://pith.science/paper/DO5R7AVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12192&json=true","fetch_graph":"https://pith.science/api/pith-number/DO5R7AVYF66GODWRQCZGHGXNHL/graph.json","fetch_events":"https://pith.science/api/pith-number/DO5R7AVYF66GODWRQCZGHGXNHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/action/storage_attestation","attest_author":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/action/author_attestation","sign_citation":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/action/citation_signature","submit_replication":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/action/replication_record"}},"created_at":"2026-05-17T23:44:46.847036+00:00","updated_at":"2026-05-17T23:44:46.847036+00:00"}