{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QUKCVKRU7LAK7BDBOBKH7CQJM5","short_pith_number":"pith:QUKCVKRU","canonical_record":{"source":{"id":"1903.01894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-22T08:12:34Z","cross_cats_sorted":[],"title_canon_sha256":"6ea78bcec7cc588720b3055a882891a1eaf6520d5d6030c9c530b35b95268f4a","abstract_canon_sha256":"e8536fa63f46cce91da4bac4bcd6adcbbcd26accf7f160c119602ddb1784035b"},"schema_version":"1.0"},"canonical_sha256":"85142aaa34fac0af846170547f8a0967708e3c47bbbc233e88604ce0f3a5790b","source":{"kind":"arxiv","id":"1903.01894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01894","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01894v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01894","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"QUKCVKRU7LAK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUKCVKRU7LAK7BDB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUKCVKRU","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QUKCVKRU7LAK7BDBOBKH7CQJM5","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-22T08:12:34Z","cross_cats_sorted":[],"title_canon_sha256":"6ea78bcec7cc588720b3055a882891a1eaf6520d5d6030c9c530b35b95268f4a","abstract_canon_sha256":"e8536fa63f46cce91da4bac4bcd6adcbbcd26accf7f160c119602ddb1784035b"},"schema_version":"1.0"},"canonical_sha256":"85142aaa34fac0af846170547f8a0967708e3c47bbbc233e88604ce0f3a5790b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.485857Z","signature_b64":"l/eioQQGFjhQ3AyR8ARN0CwcNsR4EZ/JhENPFtvW1SzMmURmxez+Ur2qP9hgjwxVy9lRb8ZOpHCWLeEjiiEaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85142aaa34fac0af846170547f8a0967708e3c47bbbc233e88604ce0f3a5790b","last_reissued_at":"2026-05-17T23:51:59.485494Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.485494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01894","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:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkYxMZ/RAJHuLiWksi1Bn9HhxI1swJEcN7nlXMQewwibSPQZH7iGwFiufO3Zl2fGaCGq6tuYB/WkFtZ4/sFnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:33:03.853221Z"},"content_sha256":"626f42776ceb8486b3a80b7817ea5c3277affbe23aa9d2a2082d75d776a8a660","schema_version":"1.0","event_id":"sha256:626f42776ceb8486b3a80b7817ea5c3277affbe23aa9d2a2082d75d776a8a660"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QUKCVKRU7LAK7BDBOBKH7CQJM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boundary Evolution Algorithm for SAT-NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Chaodong Fan, Haibing Fu, Huigui Rong, Yingjie Zhang, Ze'an Tian, Zhaoyang Ai","submitted_at":"2018-12-22T08:12:34Z","abstract_excerpt":"A boundary evolution Algorithm (BEA) is proposed by simultaneously taking into account the bottom and the high-level crossover and mutation, ie., the boundary of the hierarchical genetic algorithm. Operators and optimal individuals based on optional annealing are designed. Based on the numerous versions of genetic algorithm, the boundary evolution approach with crossover and mutation has been tested on the SAT problem and compared with two competing methods: a traditional genetic algorithm and another traditional hierarchical genetic algorithm, and among some others. The results of the compara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01894","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:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwSD8fhQPZB49801RK+SL/VgsF8blmbm40bUs8VX7soVu9HfhSvgo6DvpOPWE6Wxe+WMk7MpU10sRTfqrARHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:33:03.853631Z"},"content_sha256":"f1b8493a3dd1783908dce90e81a14567e7a431606a4380e713121e63c938f962","schema_version":"1.0","event_id":"sha256:f1b8493a3dd1783908dce90e81a14567e7a431606a4380e713121e63c938f962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5/bundle.json","state_url":"https://pith.science/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5/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-08T06:33:03Z","links":{"resolver":"https://pith.science/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5","bundle":"https://pith.science/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5/bundle.json","state":"https://pith.science/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUKCVKRU7LAK7BDBOBKH7CQJM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QUKCVKRU7LAK7BDBOBKH7CQJM5","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":"e8536fa63f46cce91da4bac4bcd6adcbbcd26accf7f160c119602ddb1784035b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-22T08:12:34Z","title_canon_sha256":"6ea78bcec7cc588720b3055a882891a1eaf6520d5d6030c9c530b35b95268f4a"},"schema_version":"1.0","source":{"id":"1903.01894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01894","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01894v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01894","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"QUKCVKRU7LAK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUKCVKRU7LAK7BDB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUKCVKRU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:f1b8493a3dd1783908dce90e81a14567e7a431606a4380e713121e63c938f962","target":"graph","created_at":"2026-05-17T23:51:59Z","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":"A boundary evolution Algorithm (BEA) is proposed by simultaneously taking into account the bottom and the high-level crossover and mutation, ie., the boundary of the hierarchical genetic algorithm. Operators and optimal individuals based on optional annealing are designed. Based on the numerous versions of genetic algorithm, the boundary evolution approach with crossover and mutation has been tested on the SAT problem and compared with two competing methods: a traditional genetic algorithm and another traditional hierarchical genetic algorithm, and among some others. The results of the compara","authors_text":"Chaodong Fan, Haibing Fu, Huigui Rong, Yingjie Zhang, Ze'an Tian, Zhaoyang Ai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-22T08:12:34Z","title":"Boundary Evolution Algorithm for SAT-NP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01894","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:626f42776ceb8486b3a80b7817ea5c3277affbe23aa9d2a2082d75d776a8a660","target":"record","created_at":"2026-05-17T23:51:59Z","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":"e8536fa63f46cce91da4bac4bcd6adcbbcd26accf7f160c119602ddb1784035b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-22T08:12:34Z","title_canon_sha256":"6ea78bcec7cc588720b3055a882891a1eaf6520d5d6030c9c530b35b95268f4a"},"schema_version":"1.0","source":{"id":"1903.01894","kind":"arxiv","version":1}},"canonical_sha256":"85142aaa34fac0af846170547f8a0967708e3c47bbbc233e88604ce0f3a5790b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85142aaa34fac0af846170547f8a0967708e3c47bbbc233e88604ce0f3a5790b","first_computed_at":"2026-05-17T23:51:59.485494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:59.485494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/eioQQGFjhQ3AyR8ARN0CwcNsR4EZ/JhENPFtvW1SzMmURmxez+Ur2qP9hgjwxVy9lRb8ZOpHCWLeEjiiEaBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:59.485857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:626f42776ceb8486b3a80b7817ea5c3277affbe23aa9d2a2082d75d776a8a660","sha256:f1b8493a3dd1783908dce90e81a14567e7a431606a4380e713121e63c938f962"],"state_sha256":"1a6b4675f03a81e26db92c72fcc78fdfae196ceb720aa132d502fdddd1980cc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJSDwRoBy30AofXssUoGMFyPEOfk9TwmiLsqv+uY3wtygvuQhJivJ2pF8J24m1slAP8RY11cjtQIuJ1MBMaoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:33:03.855918Z","bundle_sha256":"3bc86b50d53ad356c4d23a8741f74e685e36383cab8bdbb20fe73dc7e5f8e42d"}}