{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VKPQ5X2LPLA5TYRVM4CWEHRDXP","short_pith_number":"pith:VKPQ5X2L","schema_version":"1.0","canonical_sha256":"aa9f0edf4b7ac1d9e2356705621e23bbeb66123a6d264933b5151e949272bf96","source":{"kind":"arxiv","id":"1702.02217","version":2},"attestation_state":"computed","paper":{"title":"Multitask Evolution with Cartesian Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Eric O. Scott, Kenneth A. De Jong","submitted_at":"2017-02-07T22:20:43Z","abstract_excerpt":"We introduce a genetic programming method for solving multiple Boolean circuit synthesis tasks simultaneously. This allows us to solve a set of elementary logic functions twice as easily as with a direct, single-task approach."},"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":"1702.02217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-07T22:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"7b00cf51e5010b88024be0915c1749bc70ed94889ddab9c0b214b9a8134ae8bb","abstract_canon_sha256":"11552e699b44e92e5d4d66ab2789e893c0995a03e70246b04413976f90e139d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.957240Z","signature_b64":"Z9bht9WqFw84H59Qz5X6Z92jD24csBfEcOyT+AdvmKO+blL+mvvyZl8K604ODMZ9t7tdYfMUAlLRwLbh0YjsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9f0edf4b7ac1d9e2356705621e23bbeb66123a6d264933b5151e949272bf96","last_reissued_at":"2026-05-18T00:45:53.956706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.956706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multitask Evolution with Cartesian Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Eric O. Scott, Kenneth A. De Jong","submitted_at":"2017-02-07T22:20:43Z","abstract_excerpt":"We introduce a genetic programming method for solving multiple Boolean circuit synthesis tasks simultaneously. This allows us to solve a set of elementary logic functions twice as easily as with a direct, single-task approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02217","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":"1702.02217","created_at":"2026-05-18T00:45:53.956797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02217v2","created_at":"2026-05-18T00:45:53.956797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02217","created_at":"2026-05-18T00:45:53.956797+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKPQ5X2LPLA5","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKPQ5X2LPLA5TYRV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKPQ5X2L","created_at":"2026-05-18T12:31:49.984773+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/VKPQ5X2LPLA5TYRVM4CWEHRDXP","json":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP.json","graph_json":"https://pith.science/api/pith-number/VKPQ5X2LPLA5TYRVM4CWEHRDXP/graph.json","events_json":"https://pith.science/api/pith-number/VKPQ5X2LPLA5TYRVM4CWEHRDXP/events.json","paper":"https://pith.science/paper/VKPQ5X2L"},"agent_actions":{"view_html":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP","download_json":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP.json","view_paper":"https://pith.science/paper/VKPQ5X2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02217&json=true","fetch_graph":"https://pith.science/api/pith-number/VKPQ5X2LPLA5TYRVM4CWEHRDXP/graph.json","fetch_events":"https://pith.science/api/pith-number/VKPQ5X2LPLA5TYRVM4CWEHRDXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP/action/storage_attestation","attest_author":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP/action/author_attestation","sign_citation":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP/action/citation_signature","submit_replication":"https://pith.science/pith/VKPQ5X2LPLA5TYRVM4CWEHRDXP/action/replication_record"}},"created_at":"2026-05-18T00:45:53.956797+00:00","updated_at":"2026-05-18T00:45:53.956797+00:00"}