{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q6F4JKMQBU6HJRUCJFEQ3XHZPF","short_pith_number":"pith:Q6F4JKMQ","canonical_record":{"source":{"id":"1803.00152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-01T01:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"b60243f0f6c0c84cbd369adc6c54838db1d15a4d00840978fd2a8ac60843e6da","abstract_canon_sha256":"379ad3afb888d6d3144fbe367280f8522f81661328a6bf17aff0a16d7ba7a1d5"},"schema_version":"1.0"},"canonical_sha256":"878bc4a9900d3c74c68249490ddcf9796b585e1b9d5baf5c2bbd0c2cc9bc8d50","source":{"kind":"arxiv","id":"1803.00152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00152","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00152v1","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00152","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"Q6F4JKMQBU6H","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q6F4JKMQBU6HJRUC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q6F4JKMQ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q6F4JKMQBU6HJRUCJFEQ3XHZPF","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-01T01:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"b60243f0f6c0c84cbd369adc6c54838db1d15a4d00840978fd2a8ac60843e6da","abstract_canon_sha256":"379ad3afb888d6d3144fbe367280f8522f81661328a6bf17aff0a16d7ba7a1d5"},"schema_version":"1.0"},"canonical_sha256":"878bc4a9900d3c74c68249490ddcf9796b585e1b9d5baf5c2bbd0c2cc9bc8d50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:13.185620Z","signature_b64":"t4HRIZo/42dbzMsr9slxV0MM8FBdNIR9lR+HMHIjJUMs+IfXBULSKBzZxwfiCuQwL/HgyvALfwoEyh6n+nAmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"878bc4a9900d3c74c68249490ddcf9796b585e1b9d5baf5c2bbd0c2cc9bc8d50","last_reissued_at":"2026-05-18T00:22:13.185062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:13.185062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00152","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-18T00:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJr5dA3rqC6kBO17gka8WOvz15163EEm5IglApEV2UhnMMrqoX92gwhharSu25FIHoinR/b+CpVEY+nMsaZVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:37:28.785557Z"},"content_sha256":"1228a75e7191c3070231a50739b99f6d61626b57dd64b3abfe53ae34f36cb72c","schema_version":"1.0","event_id":"sha256:1228a75e7191c3070231a50739b99f6d61626b57dd64b3abfe53ae34f36cb72c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q6F4JKMQBU6HJRUCJFEQ3XHZPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Global Information Based Adaptive Threshold for Grouping Large Scale Global Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"An Chen, Bei Pang, Yipeng Zhang, Yongsheng Liang, Zhigang Ren","submitted_at":"2018-03-01T01:11:27Z","abstract_excerpt":"By taking the idea of divide-and-conquer, cooperative coevolution (CC) provides a powerful architecture for large scale global optimization (LSGO) problems, but its efficiency relies highly on the decomposition strategy. It has been shown that differential grouping (DG) performs well on decomposing LSGO problems by effectively detecting the interaction among decision variables. However, its decomposition accuracy depends highly on the threshold. To improve the decomposition accuracy of DG, a global information based adaptive threshold setting algorithm (GIAT) is proposed in this paper. On the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00152","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-18T00:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMqmT6/8LpP5xOcQSTniiVISHAVxF5zNa7trUmO2+4eG48BHzd9XwZ4L3FnDZdrPNUwPCqKnReEE1mISIyj5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:37:28.785904Z"},"content_sha256":"f2c751437e6e01ed92330a98b15a3bf3665f4da8b9bd3c3922b405f6416ef84a","schema_version":"1.0","event_id":"sha256:f2c751437e6e01ed92330a98b15a3bf3665f4da8b9bd3c3922b405f6416ef84a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF/bundle.json","state_url":"https://pith.science/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF/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-04T10:37:28Z","links":{"resolver":"https://pith.science/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF","bundle":"https://pith.science/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF/bundle.json","state":"https://pith.science/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6F4JKMQBU6HJRUCJFEQ3XHZPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q6F4JKMQBU6HJRUCJFEQ3XHZPF","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":"379ad3afb888d6d3144fbe367280f8522f81661328a6bf17aff0a16d7ba7a1d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-01T01:11:27Z","title_canon_sha256":"b60243f0f6c0c84cbd369adc6c54838db1d15a4d00840978fd2a8ac60843e6da"},"schema_version":"1.0","source":{"id":"1803.00152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00152","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00152v1","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00152","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"Q6F4JKMQBU6H","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q6F4JKMQBU6HJRUC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q6F4JKMQ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:f2c751437e6e01ed92330a98b15a3bf3665f4da8b9bd3c3922b405f6416ef84a","target":"graph","created_at":"2026-05-18T00:22:13Z","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":"By taking the idea of divide-and-conquer, cooperative coevolution (CC) provides a powerful architecture for large scale global optimization (LSGO) problems, but its efficiency relies highly on the decomposition strategy. It has been shown that differential grouping (DG) performs well on decomposing LSGO problems by effectively detecting the interaction among decision variables. However, its decomposition accuracy depends highly on the threshold. To improve the decomposition accuracy of DG, a global information based adaptive threshold setting algorithm (GIAT) is proposed in this paper. On the ","authors_text":"An Chen, Bei Pang, Yipeng Zhang, Yongsheng Liang, Zhigang Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-01T01:11:27Z","title":"A Global Information Based Adaptive Threshold for Grouping Large Scale Global Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00152","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:1228a75e7191c3070231a50739b99f6d61626b57dd64b3abfe53ae34f36cb72c","target":"record","created_at":"2026-05-18T00:22:13Z","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":"379ad3afb888d6d3144fbe367280f8522f81661328a6bf17aff0a16d7ba7a1d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-01T01:11:27Z","title_canon_sha256":"b60243f0f6c0c84cbd369adc6c54838db1d15a4d00840978fd2a8ac60843e6da"},"schema_version":"1.0","source":{"id":"1803.00152","kind":"arxiv","version":1}},"canonical_sha256":"878bc4a9900d3c74c68249490ddcf9796b585e1b9d5baf5c2bbd0c2cc9bc8d50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"878bc4a9900d3c74c68249490ddcf9796b585e1b9d5baf5c2bbd0c2cc9bc8d50","first_computed_at":"2026-05-18T00:22:13.185062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:13.185062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t4HRIZo/42dbzMsr9slxV0MM8FBdNIR9lR+HMHIjJUMs+IfXBULSKBzZxwfiCuQwL/HgyvALfwoEyh6n+nAmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:13.185620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1228a75e7191c3070231a50739b99f6d61626b57dd64b3abfe53ae34f36cb72c","sha256:f2c751437e6e01ed92330a98b15a3bf3665f4da8b9bd3c3922b405f6416ef84a"],"state_sha256":"36fbe0c64150a225d276d05566c8a85fb0cc1744c488c8dc11ea0fbc84e2f501"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDz0nOzSudKOFv1C1wriKAd+li6Ni7DRBcdnWVjI2T6NOjKA/+tFUXOvTaZv4nf2EF3JG8evtgCm8blZLp4/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:37:28.787888Z","bundle_sha256":"a37acea2bf8304ecdf534528e9e3e38e3489fd8ef1a0c06c45187f96f9a7288f"}}