{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NDS7YHNCDFDMUYGK45VHGV4HDC","short_pith_number":"pith:NDS7YHNC","canonical_record":{"source":{"id":"1811.04465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-11T19:54:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"92d2ecad336743154b4cbec31c6e6a82cd02c919b9f57761312a5d8175ae45f0","abstract_canon_sha256":"b7851201cf01828fcd1fb8f9985cd0ea1c3ee55d0bcc7f8e275c00f5bc42602f"},"schema_version":"1.0"},"canonical_sha256":"68e5fc1da21946ca60cae76a73578718821397abc225e0a5438b67b638a65731","source":{"kind":"arxiv","id":"1811.04465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04465","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04465v2","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04465","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"NDS7YHNCDFDM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDS7YHNCDFDMUYGK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDS7YHNC","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NDS7YHNCDFDMUYGK45VHGV4HDC","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-11T19:54:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"92d2ecad336743154b4cbec31c6e6a82cd02c919b9f57761312a5d8175ae45f0","abstract_canon_sha256":"b7851201cf01828fcd1fb8f9985cd0ea1c3ee55d0bcc7f8e275c00f5bc42602f"},"schema_version":"1.0"},"canonical_sha256":"68e5fc1da21946ca60cae76a73578718821397abc225e0a5438b67b638a65731","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:19.166330Z","signature_b64":"an5yFo/JhsYFPop6yl5uJPddODsMO9qbhJVVvsXqoJumz3We73FVxEjOAnOAtvlVKZPnswOdKmkBIypP/adeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e5fc1da21946ca60cae76a73578718821397abc225e0a5438b67b638a65731","last_reissued_at":"2026-05-17T23:46:19.165572Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:19.165572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04465","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-05-17T23:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2S2rQ8DYgUUY7ed2VEA9+wbTKGluxREe3xHx8zPvuWo1XWU9A5iF+U/PiVgmE//c92FOwz9ksT7J9JFPxRcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:27:31.092010Z"},"content_sha256":"22cebca5adfb2624aadac37966bf05f53f721de9c53bae29ba31f644e42cc7f2","schema_version":"1.0","event_id":"sha256:22cebca5adfb2624aadac37966bf05f53f721de9c53bae29ba31f644e42cc7f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NDS7YHNCDFDMUYGK45VHGV4HDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity Analysis of Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Andrei Lissovoi, Pietro S. Oliveto","submitted_at":"2018-11-11T19:54:28Z","abstract_excerpt":"Genetic programming (GP) is an evolutionary computation technique to solve problems in an automated, domain-independent way. Rather than identifying the optimum of a function as in more traditional evolutionary optimization, the aim of GP is to evolve computer programs with a given functionality. While many GP applications have produced human competitive results, the theoretical understanding of what problem characteristics and algorithm properties allow GP to be effective is comparatively limited. Compared with traditional evolutionary algorithms for function optimization, GP applications are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04465","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":""},"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:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seyncsTaK1Fv3msMA/j20VRpwZO4wkDI3xLqgPhCiIb2wE1Ab057pnA+Go5n0KMDm0UdYH5PUF5a5leyapPTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:27:31.092651Z"},"content_sha256":"fa917bb362ff2e27c044eca33e41b3ec971a993ffb372e7a0bb043af2a54fce3","schema_version":"1.0","event_id":"sha256:fa917bb362ff2e27c044eca33e41b3ec971a993ffb372e7a0bb043af2a54fce3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDS7YHNCDFDMUYGK45VHGV4HDC/bundle.json","state_url":"https://pith.science/pith/NDS7YHNCDFDMUYGK45VHGV4HDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDS7YHNCDFDMUYGK45VHGV4HDC/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-02T20:27:31Z","links":{"resolver":"https://pith.science/pith/NDS7YHNCDFDMUYGK45VHGV4HDC","bundle":"https://pith.science/pith/NDS7YHNCDFDMUYGK45VHGV4HDC/bundle.json","state":"https://pith.science/pith/NDS7YHNCDFDMUYGK45VHGV4HDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDS7YHNCDFDMUYGK45VHGV4HDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NDS7YHNCDFDMUYGK45VHGV4HDC","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":"b7851201cf01828fcd1fb8f9985cd0ea1c3ee55d0bcc7f8e275c00f5bc42602f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-11T19:54:28Z","title_canon_sha256":"92d2ecad336743154b4cbec31c6e6a82cd02c919b9f57761312a5d8175ae45f0"},"schema_version":"1.0","source":{"id":"1811.04465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04465","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04465v2","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04465","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"NDS7YHNCDFDM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDS7YHNCDFDMUYGK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDS7YHNC","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:fa917bb362ff2e27c044eca33e41b3ec971a993ffb372e7a0bb043af2a54fce3","target":"graph","created_at":"2026-05-17T23:46:19Z","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":"Genetic programming (GP) is an evolutionary computation technique to solve problems in an automated, domain-independent way. Rather than identifying the optimum of a function as in more traditional evolutionary optimization, the aim of GP is to evolve computer programs with a given functionality. While many GP applications have produced human competitive results, the theoretical understanding of what problem characteristics and algorithm properties allow GP to be effective is comparatively limited. Compared with traditional evolutionary algorithms for function optimization, GP applications are","authors_text":"Andrei Lissovoi, Pietro S. Oliveto","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-11T19:54:28Z","title":"Computational Complexity Analysis of Genetic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04465","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:22cebca5adfb2624aadac37966bf05f53f721de9c53bae29ba31f644e42cc7f2","target":"record","created_at":"2026-05-17T23:46:19Z","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":"b7851201cf01828fcd1fb8f9985cd0ea1c3ee55d0bcc7f8e275c00f5bc42602f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-11T19:54:28Z","title_canon_sha256":"92d2ecad336743154b4cbec31c6e6a82cd02c919b9f57761312a5d8175ae45f0"},"schema_version":"1.0","source":{"id":"1811.04465","kind":"arxiv","version":2}},"canonical_sha256":"68e5fc1da21946ca60cae76a73578718821397abc225e0a5438b67b638a65731","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68e5fc1da21946ca60cae76a73578718821397abc225e0a5438b67b638a65731","first_computed_at":"2026-05-17T23:46:19.165572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:19.165572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"an5yFo/JhsYFPop6yl5uJPddODsMO9qbhJVVvsXqoJumz3We73FVxEjOAnOAtvlVKZPnswOdKmkBIypP/adeDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:19.166330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22cebca5adfb2624aadac37966bf05f53f721de9c53bae29ba31f644e42cc7f2","sha256:fa917bb362ff2e27c044eca33e41b3ec971a993ffb372e7a0bb043af2a54fce3"],"state_sha256":"3acb10edc8c7facda72ee24aebef15cf861e5cec16a80e2269377f9fdb1f7b46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6BpYWxnHFohyoNcSjfEAyXn3IKhrPaD0E+qKHCuitq2RTV2xwHa/BboxcfWDvFReo/AHMiIF/TaQ1MQysikDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:27:31.095349Z","bundle_sha256":"fa56fecd2edd5a28ca4afa7622ef3827b3f122a928cbc673f8b327129c82a598"}}