{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KY4JB7KQQUSBZPUNOXOQ2XWY7L","short_pith_number":"pith:KY4JB7KQ","schema_version":"1.0","canonical_sha256":"563890fd5085241cbe8d75dd0d5ed8facc00bc612e90dac11fb45a14f23ac97e","source":{"kind":"arxiv","id":"1903.11936","version":2},"attestation_state":"computed","paper":{"title":"Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andrei Lissovoi, Benjamin Doerr, Pietro S. Oliveto","submitted_at":"2019-03-28T13:08:47Z","abstract_excerpt":"Recently it has been proved that simple GP systems can efficiently evolve the conjunction of $n$ variables if they are equipped with the minimal required components. In this paper, we make a considerable step forward by analysing the behaviour and performance of the GP system for evolving a Boolean function with unknown components, i.e., the function may consist of both conjunctions and disjunctions. We rigorously prove that if the target function is the conjunction of $n$ variables, then the RLS-GP using the complete truth table to evaluate program quality evolves the exact target function in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.11936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-28T13:08:47Z","cross_cats_sorted":[],"title_canon_sha256":"54c1858cee906beab6d407ee8164ce34c12d98aff66a99b0f98e4246f8cedc5f","abstract_canon_sha256":"f0dd1ccd9966b2941a191991c4595b0a47f7c770cf7b1ba40418adf5ce0b077f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.011708Z","signature_b64":"xXlV3dYGvtRcEbAVfO8oNjTlin/b471Y45dK6JsfMJQgKnmBQTTjl/+GaHYYaFoTEmlHaDOAoR+SGxO6zDVtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"563890fd5085241cbe8d75dd0d5ed8facc00bc612e90dac11fb45a14f23ac97e","last_reissued_at":"2026-05-17T23:47:12.011303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.011303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andrei Lissovoi, Benjamin Doerr, Pietro S. Oliveto","submitted_at":"2019-03-28T13:08:47Z","abstract_excerpt":"Recently it has been proved that simple GP systems can efficiently evolve the conjunction of $n$ variables if they are equipped with the minimal required components. In this paper, we make a considerable step forward by analysing the behaviour and performance of the GP system for evolving a Boolean function with unknown components, i.e., the function may consist of both conjunctions and disjunctions. We rigorously prove that if the target function is the conjunction of $n$ variables, then the RLS-GP using the complete truth table to evaluate program quality evolves the exact target function in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11936","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.11936","created_at":"2026-05-17T23:47:12.011385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11936v2","created_at":"2026-05-17T23:47:12.011385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11936","created_at":"2026-05-17T23:47:12.011385+00:00"},{"alias_kind":"pith_short_12","alias_value":"KY4JB7KQQUSB","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KY4JB7KQQUSBZPUN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KY4JB7KQ","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L","json":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L.json","graph_json":"https://pith.science/api/pith-number/KY4JB7KQQUSBZPUNOXOQ2XWY7L/graph.json","events_json":"https://pith.science/api/pith-number/KY4JB7KQQUSBZPUNOXOQ2XWY7L/events.json","paper":"https://pith.science/paper/KY4JB7KQ"},"agent_actions":{"view_html":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L","download_json":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L.json","view_paper":"https://pith.science/paper/KY4JB7KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11936&json=true","fetch_graph":"https://pith.science/api/pith-number/KY4JB7KQQUSBZPUNOXOQ2XWY7L/graph.json","fetch_events":"https://pith.science/api/pith-number/KY4JB7KQQUSBZPUNOXOQ2XWY7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L/action/storage_attestation","attest_author":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L/action/author_attestation","sign_citation":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L/action/citation_signature","submit_replication":"https://pith.science/pith/KY4JB7KQQUSBZPUNOXOQ2XWY7L/action/replication_record"}},"created_at":"2026-05-17T23:47:12.011385+00:00","updated_at":"2026-05-17T23:47:12.011385+00:00"}