{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ULDMF5KXFG2GRSQUU4JNAC3IDS","short_pith_number":"pith:ULDMF5KX","canonical_record":{"source":{"id":"1307.5519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-21T11:29:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a5db195a168ddf91fe714bbf5d8ab8853c6974add79d582142c1fdfcedd23c1b","abstract_canon_sha256":"e3e5d626cafe4c8145e17dd033f641dba0cfc7641b85fbf49d2a8365fc16736b"},"schema_version":"1.0"},"canonical_sha256":"a2c6c2f55729b468ca14a712d00b681cadd8f3b5c1408c2b0c77cb893c4c2b38","source":{"kind":"arxiv","id":"1307.5519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5519","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5519v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5519","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"ULDMF5KXFG2G","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULDMF5KXFG2GRSQU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULDMF5KX","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ULDMF5KXFG2GRSQUU4JNAC3IDS","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-21T11:29:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a5db195a168ddf91fe714bbf5d8ab8853c6974add79d582142c1fdfcedd23c1b","abstract_canon_sha256":"e3e5d626cafe4c8145e17dd033f641dba0cfc7641b85fbf49d2a8365fc16736b"},"schema_version":"1.0"},"canonical_sha256":"a2c6c2f55729b468ca14a712d00b681cadd8f3b5c1408c2b0c77cb893c4c2b38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.432295Z","signature_b64":"gaOMMB/QfPEfHUQKd7j8fRDD6PkWtORrJYiChWB1YSmlS+XfzBBnhmwiV1d+AyagHJyOD2GNxK0nJulNVb+NAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c6c2f55729b468ca14a712d00b681cadd8f3b5c1408c2b0c77cb893c4c2b38","last_reissued_at":"2026-05-18T03:17:55.431636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.431636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5519","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-18T03:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vg+o0cBfGJGWUEvPL6MVdVs80N8+y6S8YeyEkMVpKiAi0M5GFiYvOi8G9wpJ325/McVALA7XtqSNnx/8psKwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:16:04.402426Z"},"content_sha256":"6a16a8401ce89c9467d8e62fa90bb69b550e7220f3a0a2988338465736322ace","schema_version":"1.0","event_id":"sha256:6a16a8401ce89c9467d8e62fa90bb69b550e7220f3a0a2988338465736322ace"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ULDMF5KXFG2GRSQUU4JNAC3IDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Recombination in Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Anton V. Eremeev, Julia V. Kovalenko","submitted_at":"2013-07-21T11:29:16Z","abstract_excerpt":"This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5519","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-18T03:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUPZiCp9DsUJVEXVo91pY7lgrdeZAXLStDH0Mx/0I48yT9ces1/h8qzwoEYUwumiJ0wfIcrYlNdJlcJkf+suBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:16:04.402779Z"},"content_sha256":"0d0333281fce59e89c616867f54b981192f6741837b654b1fbff7ef95d4a2909","schema_version":"1.0","event_id":"sha256:0d0333281fce59e89c616867f54b981192f6741837b654b1fbff7ef95d4a2909"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS/bundle.json","state_url":"https://pith.science/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS/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-30T19:16:04Z","links":{"resolver":"https://pith.science/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS","bundle":"https://pith.science/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS/bundle.json","state":"https://pith.science/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULDMF5KXFG2GRSQUU4JNAC3IDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ULDMF5KXFG2GRSQUU4JNAC3IDS","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":"e3e5d626cafe4c8145e17dd033f641dba0cfc7641b85fbf49d2a8365fc16736b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-21T11:29:16Z","title_canon_sha256":"a5db195a168ddf91fe714bbf5d8ab8853c6974add79d582142c1fdfcedd23c1b"},"schema_version":"1.0","source":{"id":"1307.5519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5519","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5519v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5519","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"ULDMF5KXFG2G","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULDMF5KXFG2GRSQU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULDMF5KX","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:0d0333281fce59e89c616867f54b981192f6741837b654b1fbff7ef95d4a2909","target":"graph","created_at":"2026-05-18T03:17:55Z","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":"This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results.","authors_text":"Anton V. Eremeev, Julia V. Kovalenko","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-21T11:29:16Z","title":"Optimal Recombination in Genetic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5519","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:6a16a8401ce89c9467d8e62fa90bb69b550e7220f3a0a2988338465736322ace","target":"record","created_at":"2026-05-18T03:17:55Z","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":"e3e5d626cafe4c8145e17dd033f641dba0cfc7641b85fbf49d2a8365fc16736b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-21T11:29:16Z","title_canon_sha256":"a5db195a168ddf91fe714bbf5d8ab8853c6974add79d582142c1fdfcedd23c1b"},"schema_version":"1.0","source":{"id":"1307.5519","kind":"arxiv","version":1}},"canonical_sha256":"a2c6c2f55729b468ca14a712d00b681cadd8f3b5c1408c2b0c77cb893c4c2b38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2c6c2f55729b468ca14a712d00b681cadd8f3b5c1408c2b0c77cb893c4c2b38","first_computed_at":"2026-05-18T03:17:55.431636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:55.431636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gaOMMB/QfPEfHUQKd7j8fRDD6PkWtORrJYiChWB1YSmlS+XfzBBnhmwiV1d+AyagHJyOD2GNxK0nJulNVb+NAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:55.432295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a16a8401ce89c9467d8e62fa90bb69b550e7220f3a0a2988338465736322ace","sha256:0d0333281fce59e89c616867f54b981192f6741837b654b1fbff7ef95d4a2909"],"state_sha256":"5b143bc974bf7c559a24faa4efbd142728b03b895c2b6d1bc04db55f7f127318"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4UdZSqWyBVex0jB0+jAeBfNrWwK6+2jIgk9WjRoT77IMw7p99uYVxjkqoqXX4rsqbqKY+gKQ838TfhYS2mrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:16:04.404779Z","bundle_sha256":"8b72c420351f6d202f29820a21a06a9c142de39b091bd12a54a6a1d8657c8681"}}