{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q6BSAMDFZOE3A6KQAGDGFF2KZB","short_pith_number":"pith:Q6BSAMDF","canonical_record":{"source":{"id":"1904.09103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-19T07:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"de54d7ecff3731a224ff2de16a1a7b67cb840dc226c4e6ac8aaae2c414520690","abstract_canon_sha256":"b4ee544dd1560d0552ce11873e1f8fa77500589d8d70f89a732828f1fc141e6a"},"schema_version":"1.0"},"canonical_sha256":"8783203065cb89b07950018662974ac856de38996211438c284aa70c06325532","source":{"kind":"arxiv","id":"1904.09103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09103","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09103v1","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09103","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"Q6BSAMDFZOE3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"Q6BSAMDFZOE3A6KQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"Q6BSAMDF","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q6BSAMDFZOE3A6KQAGDGFF2KZB","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-19T07:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"de54d7ecff3731a224ff2de16a1a7b67cb840dc226c4e6ac8aaae2c414520690","abstract_canon_sha256":"b4ee544dd1560d0552ce11873e1f8fa77500589d8d70f89a732828f1fc141e6a"},"schema_version":"1.0"},"canonical_sha256":"8783203065cb89b07950018662974ac856de38996211438c284aa70c06325532","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:08.343415Z","signature_b64":"TW7yLMY+fo5oQwXajuv32fyN3bgL6tykMpzesMsjQsv8TJj2GBlaiJbi/7DyBYQcYC63SCFtsjXXro5sByX9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8783203065cb89b07950018662974ac856de38996211438c284aa70c06325532","last_reissued_at":"2026-05-17T23:48:08.342787Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:08.342787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09103","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:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVuxRNftxwlKeAyUQR0fHSVXM7/Rj6aM0UkVvxRwqt57qPHZWGM1THMj1waxqFak40occZiA8MJL2z1InQUgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:30.234716Z"},"content_sha256":"de0db22e072a926f3a5c4069e74c8951533cd35b5e22b2b7997581c307c758f5","schema_version":"1.0","event_id":"sha256:de0db22e072a926f3a5c4069e74c8951533cd35b5e22b2b7997581c307c758f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q6BSAMDFZOE3A6KQAGDGFF2KZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Epistasis-based Basis Estimation Method for Simplifying the Problem Space of an Evolutionary Search in Binary Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Junghwan Lee, Yong-Hyuk Kim","submitted_at":"2019-04-19T07:36:50Z","abstract_excerpt":"An evolutionary search space can be smoothly transformed via a suitable change of basis; however, it can be difficult to determine an appropriate basis. In this paper, a method is proposed to select an optimum basis can be used to simplify an evolutionary search space in a binary encoding scheme. The basis search method is based on a genetic algorithm and the fitness evaluation is based on the epistasis, which is an indicator of the complexity of a genetic algorithm. Two tests were conducted to validate the proposed method when applied to two different evolutionary search problems. The first s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09103","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:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/6gA8Rz3Wj9kv2H74ma5iMNjBFbzJuDfcPNbaXIweTsEc7dgdoWPL2CrjRV5vQbd8Wy5jS/DyF08I6Dx9jfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:30.235369Z"},"content_sha256":"0ddf6ec0cd6bf98a6b7c0280f251840d804daf22baf451fb075be919e32a376e","schema_version":"1.0","event_id":"sha256:0ddf6ec0cd6bf98a6b7c0280f251840d804daf22baf451fb075be919e32a376e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB/bundle.json","state_url":"https://pith.science/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB/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-05-27T08:53:30Z","links":{"resolver":"https://pith.science/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB","bundle":"https://pith.science/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB/bundle.json","state":"https://pith.science/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6BSAMDFZOE3A6KQAGDGFF2KZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q6BSAMDFZOE3A6KQAGDGFF2KZB","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":"b4ee544dd1560d0552ce11873e1f8fa77500589d8d70f89a732828f1fc141e6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-19T07:36:50Z","title_canon_sha256":"de54d7ecff3731a224ff2de16a1a7b67cb840dc226c4e6ac8aaae2c414520690"},"schema_version":"1.0","source":{"id":"1904.09103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09103","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09103v1","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09103","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"Q6BSAMDFZOE3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"Q6BSAMDFZOE3A6KQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"Q6BSAMDF","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:0ddf6ec0cd6bf98a6b7c0280f251840d804daf22baf451fb075be919e32a376e","target":"graph","created_at":"2026-05-17T23:48:08Z","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":"An evolutionary search space can be smoothly transformed via a suitable change of basis; however, it can be difficult to determine an appropriate basis. In this paper, a method is proposed to select an optimum basis can be used to simplify an evolutionary search space in a binary encoding scheme. The basis search method is based on a genetic algorithm and the fitness evaluation is based on the epistasis, which is an indicator of the complexity of a genetic algorithm. Two tests were conducted to validate the proposed method when applied to two different evolutionary search problems. The first s","authors_text":"Junghwan Lee, Yong-Hyuk Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-19T07:36:50Z","title":"Epistasis-based Basis Estimation Method for Simplifying the Problem Space of an Evolutionary Search in Binary Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09103","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:de0db22e072a926f3a5c4069e74c8951533cd35b5e22b2b7997581c307c758f5","target":"record","created_at":"2026-05-17T23:48:08Z","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":"b4ee544dd1560d0552ce11873e1f8fa77500589d8d70f89a732828f1fc141e6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-19T07:36:50Z","title_canon_sha256":"de54d7ecff3731a224ff2de16a1a7b67cb840dc226c4e6ac8aaae2c414520690"},"schema_version":"1.0","source":{"id":"1904.09103","kind":"arxiv","version":1}},"canonical_sha256":"8783203065cb89b07950018662974ac856de38996211438c284aa70c06325532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8783203065cb89b07950018662974ac856de38996211438c284aa70c06325532","first_computed_at":"2026-05-17T23:48:08.342787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:08.342787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TW7yLMY+fo5oQwXajuv32fyN3bgL6tykMpzesMsjQsv8TJj2GBlaiJbi/7DyBYQcYC63SCFtsjXXro5sByX9BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:08.343415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de0db22e072a926f3a5c4069e74c8951533cd35b5e22b2b7997581c307c758f5","sha256:0ddf6ec0cd6bf98a6b7c0280f251840d804daf22baf451fb075be919e32a376e"],"state_sha256":"e17076814ed94b57ecc3fe5d7ff1ef9ff50694207f468d65dc850335d780a624"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+dNm4ckyJNpdI7Q3bkOm17Imc4IRksx8eqwfq/F8DqqeVx+zmxOAQX6TkyMvwsdr3tuLxWRtbovnBCC1CcbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:53:30.238448Z","bundle_sha256":"8369546edefb77c2f9920d4fb2d7386d09a478ab7b3771b3085af05b5c832339"}}