{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C2LLQI6JTPN7IC2DAZYYIOISNK","short_pith_number":"pith:C2LLQI6J","canonical_record":{"source":{"id":"1812.06303","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-15T15:07:55Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b79bb57a456dc38942ac76678eae8df1c29ba53a9d134cf06a5dca65ae239945","abstract_canon_sha256":"30f87e77143325cfae12d0666592c27178d2f4c45947d416f075f975eef8eec4"},"schema_version":"1.0"},"canonical_sha256":"1696b823c99bdbf40b4306718439126aa454f6920cf3f521ea74169c2dc02a7a","source":{"kind":"arxiv","id":"1812.06303","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06303","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06303v2","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06303","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"C2LLQI6JTPN7","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"C2LLQI6JTPN7IC2D","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"C2LLQI6J","created_at":"2026-07-05T00:04:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C2LLQI6JTPN7IC2DAZYYIOISNK","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06303","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-15T15:07:55Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b79bb57a456dc38942ac76678eae8df1c29ba53a9d134cf06a5dca65ae239945","abstract_canon_sha256":"30f87e77143325cfae12d0666592c27178d2f4c45947d416f075f975eef8eec4"},"schema_version":"1.0"},"canonical_sha256":"1696b823c99bdbf40b4306718439126aa454f6920cf3f521ea74169c2dc02a7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:39.072813Z","signature_b64":"bWoKZjYRWPG2onNt9JwK1OwQ1bTMRUDm5iHzBhi0JsYKokMAVYj/GaFEMzXTv3IdR6ZLqhIw5voTZ7mlQfhwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1696b823c99bdbf40b4306718439126aa454f6920cf3f521ea74169c2dc02a7a","last_reissued_at":"2026-07-05T00:04:39.072197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:39.072197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06303","source_version":2,"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-07-05T00:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDdWKPTlcTkz4GI/czFU2BIZriqmTyOQ/T/bnVCve1axOXUQ/uZAav02IvQYr//80s3Ra0SvRtOA1NGwRv2kCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:54:56.155271Z"},"content_sha256":"6205ca71eb3d38807155968675c9758c30dd1043847eb7137efabb6bc9432152","schema_version":"1.0","event_id":"sha256:6205ca71eb3d38807155968675c9758c30dd1043847eb7137efabb6bc9432152"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C2LLQI6JTPN7IC2DAZYYIOISNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Tasking Genetic Algorithm (MTGA) for Fuzzy System Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Dongrui Wu, Xianfeng Tan","submitted_at":"2018-12-15T15:07:55Z","abstract_excerpt":"Multi-task learning uses auxiliary data or knowledge from relevant tasks to facilitate the learning in a new task. Multi-task optimization applies multi-task learning to optimization to study how to effectively and efficiently tackle multiple optimization problems simultaneously. Evolutionary multi-tasking, or multi-factorial optimization, is an emerging subfield of multi-task optimization, which integrates evolutionary computation and multi-task learning. This paper proposes a novel and easy-to-implement multi-tasking genetic algorithm (MTGA), which copes well with significantly different opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06303","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/1812.06303/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"},"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-07-05T00:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/USf28RQ/I2X9KCfkPIw/Fu2YqELftnALa6aRgC+4tPejHltCEyk0rgz5sArWw60cU03LzrxzXEMYqHiJUyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:54:56.155655Z"},"content_sha256":"d47728cf46f0cc93746546a788d26de7f0806fa57f4ff45e1c9ec71c6d0592e9","schema_version":"1.0","event_id":"sha256:d47728cf46f0cc93746546a788d26de7f0806fa57f4ff45e1c9ec71c6d0592e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2LLQI6JTPN7IC2DAZYYIOISNK/bundle.json","state_url":"https://pith.science/pith/C2LLQI6JTPN7IC2DAZYYIOISNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2LLQI6JTPN7IC2DAZYYIOISNK/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-07-07T11:54:56Z","links":{"resolver":"https://pith.science/pith/C2LLQI6JTPN7IC2DAZYYIOISNK","bundle":"https://pith.science/pith/C2LLQI6JTPN7IC2DAZYYIOISNK/bundle.json","state":"https://pith.science/pith/C2LLQI6JTPN7IC2DAZYYIOISNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2LLQI6JTPN7IC2DAZYYIOISNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C2LLQI6JTPN7IC2DAZYYIOISNK","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":"30f87e77143325cfae12d0666592c27178d2f4c45947d416f075f975eef8eec4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-15T15:07:55Z","title_canon_sha256":"b79bb57a456dc38942ac76678eae8df1c29ba53a9d134cf06a5dca65ae239945"},"schema_version":"1.0","source":{"id":"1812.06303","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06303","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06303v2","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06303","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"C2LLQI6JTPN7","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"C2LLQI6JTPN7IC2D","created_at":"2026-07-05T00:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"C2LLQI6J","created_at":"2026-07-05T00:04:39Z"}],"graph_snapshots":[{"event_id":"sha256:d47728cf46f0cc93746546a788d26de7f0806fa57f4ff45e1c9ec71c6d0592e9","target":"graph","created_at":"2026-07-05T00:04:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1812.06303/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-task learning uses auxiliary data or knowledge from relevant tasks to facilitate the learning in a new task. Multi-task optimization applies multi-task learning to optimization to study how to effectively and efficiently tackle multiple optimization problems simultaneously. Evolutionary multi-tasking, or multi-factorial optimization, is an emerging subfield of multi-task optimization, which integrates evolutionary computation and multi-task learning. This paper proposes a novel and easy-to-implement multi-tasking genetic algorithm (MTGA), which copes well with significantly different opt","authors_text":"Dongrui Wu, Xianfeng Tan","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-15T15:07:55Z","title":"Multi-Tasking Genetic Algorithm (MTGA) for Fuzzy System Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06303","kind":"arxiv","version":2},"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:6205ca71eb3d38807155968675c9758c30dd1043847eb7137efabb6bc9432152","target":"record","created_at":"2026-07-05T00:04:39Z","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":"30f87e77143325cfae12d0666592c27178d2f4c45947d416f075f975eef8eec4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-15T15:07:55Z","title_canon_sha256":"b79bb57a456dc38942ac76678eae8df1c29ba53a9d134cf06a5dca65ae239945"},"schema_version":"1.0","source":{"id":"1812.06303","kind":"arxiv","version":2}},"canonical_sha256":"1696b823c99bdbf40b4306718439126aa454f6920cf3f521ea74169c2dc02a7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1696b823c99bdbf40b4306718439126aa454f6920cf3f521ea74169c2dc02a7a","first_computed_at":"2026-07-05T00:04:39.072197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:39.072197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bWoKZjYRWPG2onNt9JwK1OwQ1bTMRUDm5iHzBhi0JsYKokMAVYj/GaFEMzXTv3IdR6ZLqhIw5voTZ7mlQfhwDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:39.072813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06303","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6205ca71eb3d38807155968675c9758c30dd1043847eb7137efabb6bc9432152","sha256:d47728cf46f0cc93746546a788d26de7f0806fa57f4ff45e1c9ec71c6d0592e9"],"state_sha256":"cfb0bcfcfb9a6059f13085fcc2441367e60f454e5929763d5a36224a2b30dee9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8+u4SbCaSx9TUv8rnJKK0l2QQDarTXGZoqfxJ1cqDEslnhVTAfMAbszpShqEQ9VsLCkJEeFedoGC9q3OS5NCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:54:56.157649Z","bundle_sha256":"b78bc7b874292dc11e60c3d5c67b231a32958e049c86d64e7913c6cfa38aa996"}}