{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DO5R7AVYF66GODWRQCZGHGXNHL","short_pith_number":"pith:DO5R7AVY","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"},"canonical_sha256":"1bbb1f82b82fbc670ed180b2639aed3af7bf588fb896e2f030f89c74a3c194d7","source":{"kind":"arxiv","id":"1905.12192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12192","created_at":"2026-05-17T23:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12192v1","created_at":"2026-05-17T23:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12192","created_at":"2026-05-17T23:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"DO5R7AVYF66G","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DO5R7AVYF66GODWR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DO5R7AVY","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DO5R7AVYF66GODWRQCZGHGXNHL","target":"record","payload":{"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"},"canonical_sha256":"1bbb1f82b82fbc670ed180b2639aed3af7bf588fb896e2f030f89c74a3c194d7","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"},"source_kind":"arxiv","source_id":"1905.12192","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-17T23:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzigma+5JDDxWs+pxdt+GuBAP8VaKYP/aBJexEzi5brJK+SkEXnjkWunTd86pI0cLdKjnKHKJ42U0qovadUBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:45:10.766358Z"},"content_sha256":"4a54d6ce0e037619b75b553955566426b197cf2b97768ebb42cc03813e0c42fe","schema_version":"1.0","event_id":"sha256:4a54d6ce0e037619b75b553955566426b197cf2b97768ebb42cc03813e0c42fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DO5R7AVYF66GODWRQCZGHGXNHL","target":"graph","payload":{"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"},"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-17T23:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjUWHo1hMFNmTQQtM2xHtCSIhpj0QtG9V2A5UUg1nFdODxKaVdcUsQ2ZItiA+8YjcpSGY+PtDUT6vrCWClSfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:45:10.766714Z"},"content_sha256":"fb2c9e581e2fe0269a53463670ab127dc829a3c9044f579049d4fbbc3d61eaa2","schema_version":"1.0","event_id":"sha256:fb2c9e581e2fe0269a53463670ab127dc829a3c9044f579049d4fbbc3d61eaa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/bundle.json","state_url":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO5R7AVYF66GODWRQCZGHGXNHL/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-01T18:45:10Z","links":{"resolver":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL","bundle":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/bundle.json","state":"https://pith.science/pith/DO5R7AVYF66GODWRQCZGHGXNHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO5R7AVYF66GODWRQCZGHGXNHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DO5R7AVYF66GODWRQCZGHGXNHL","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":"d8f8e7ac6981ac0b8d9bd207d405bd2bd046e4d5568c95a83a987cae9a762ebe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T03:11:19Z","title_canon_sha256":"e671081fe25808030fa8c68bd2ff704dcd90ba8507c428c7a90768d6917ec9a2"},"schema_version":"1.0","source":{"id":"1905.12192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12192","created_at":"2026-05-17T23:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12192v1","created_at":"2026-05-17T23:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12192","created_at":"2026-05-17T23:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"DO5R7AVYF66G","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DO5R7AVYF66GODWR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DO5R7AVY","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:fb2c9e581e2fe0269a53463670ab127dc829a3c9044f579049d4fbbc3d61eaa2","target":"graph","created_at":"2026-05-17T23:44:46Z","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":"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 ","authors_text":"An Chen, Wenhua Guo, Yaochu Jin, Yongsheng Liang, Zhigang Ren, Zuren Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T03:11:19Z","title":"A Fast Differential Grouping Algorithm for Large Scale Black-Box Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12192","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:4a54d6ce0e037619b75b553955566426b197cf2b97768ebb42cc03813e0c42fe","target":"record","created_at":"2026-05-17T23:44:46Z","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":"d8f8e7ac6981ac0b8d9bd207d405bd2bd046e4d5568c95a83a987cae9a762ebe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T03:11:19Z","title_canon_sha256":"e671081fe25808030fa8c68bd2ff704dcd90ba8507c428c7a90768d6917ec9a2"},"schema_version":"1.0","source":{"id":"1905.12192","kind":"arxiv","version":1}},"canonical_sha256":"1bbb1f82b82fbc670ed180b2639aed3af7bf588fb896e2f030f89c74a3c194d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bbb1f82b82fbc670ed180b2639aed3af7bf588fb896e2f030f89c74a3c194d7","first_computed_at":"2026-05-17T23:44:46.846954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:46.846954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0zWGV+KtSL/Qi0edUYaFzGiE2eT+XX/y52Sqks/GJyOyavAi6ukpFT5DP53PtWBUrNcV5HlX3zJalukted+CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:46.847503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a54d6ce0e037619b75b553955566426b197cf2b97768ebb42cc03813e0c42fe","sha256:fb2c9e581e2fe0269a53463670ab127dc829a3c9044f579049d4fbbc3d61eaa2"],"state_sha256":"0d8ce0b9d310ea505b5b2a9ff0beee8c411d3382b31a6ed7e57638773961f7a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21r6jKXh2PYnA05BBjvbwLWGsPlnUsdhhaRIhjP1CxBFPMouqmFVR0JVtGBInBTrKMLMnKJ2njTGeD9IvfOZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:45:10.769980Z","bundle_sha256":"b108ae802b977ac363c83e154accacdb9d333ccbec21d84251a5f2518a76424a"}}