{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ASNKDKHBGCFSHF5I35VFZFDAOI","short_pith_number":"pith:ASNKDKHB","schema_version":"1.0","canonical_sha256":"049aa1a8e1308b2397a8df6a5c9460720c83ab8a068d6ed15429d46f00388642","source":{"kind":"arxiv","id":"2405.14268","version":1},"attestation_state":"computed","paper":{"title":"Multi-Representation Genetic Programming: A Case Study on Tree-based and Linear Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Fangfang Zhang, Mengjie Zhang, Wolfgang Banzhaf, Yi Mei, Zhixing Huang","submitted_at":"2024-05-23T07:47:06Z","abstract_excerpt":"Existing genetic programming (GP) methods are typically designed based on a certain representation, such as tree-based or linear representations. These representations show various pros and cons in different domains. However, due to the complicated relationships among representation and fitness landscapes of GP, it is hard to intuitively determine which GP representation is the most suitable for solving a certain problem. Evolving programs (or models) with multiple representations simultaneously can alternatively search on different fitness landscapes since representations are highly related t"},"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":"2405.14268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-05-23T07:47:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"328c7cd9c4f4691ad3949111946e191b1676b47099a5444f8a6d8e01795620d3","abstract_canon_sha256":"c394e09f3f7e28c0a026daaa8c92e66881f8a174910b02a2b5bc2606c033ad46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:32.172762Z","signature_b64":"mmRkgvh/TUuReZk9BEcJ45GDUE4d58VppX82n6TicdoXJSDV+X7dNc6e507FtkDIgapJ79oUfKqwDWiSvFieBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"049aa1a8e1308b2397a8df6a5c9460720c83ab8a068d6ed15429d46f00388642","last_reissued_at":"2026-07-05T11:11:32.172204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:32.172204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Representation Genetic Programming: A Case Study on Tree-based and Linear Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Fangfang Zhang, Mengjie Zhang, Wolfgang Banzhaf, Yi Mei, Zhixing Huang","submitted_at":"2024-05-23T07:47:06Z","abstract_excerpt":"Existing genetic programming (GP) methods are typically designed based on a certain representation, such as tree-based or linear representations. These representations show various pros and cons in different domains. However, due to the complicated relationships among representation and fitness landscapes of GP, it is hard to intuitively determine which GP representation is the most suitable for solving a certain problem. Evolving programs (or models) with multiple representations simultaneously can alternatively search on different fitness landscapes since representations are highly related t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14268","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.14268/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.14268","created_at":"2026-07-05T11:11:32.172278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14268v1","created_at":"2026-07-05T11:11:32.172278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14268","created_at":"2026-07-05T11:11:32.172278+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASNKDKHBGCFS","created_at":"2026-07-05T11:11:32.172278+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASNKDKHBGCFSHF5I","created_at":"2026-07-05T11:11:32.172278+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASNKDKHB","created_at":"2026-07-05T11:11:32.172278+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/ASNKDKHBGCFSHF5I35VFZFDAOI","json":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI.json","graph_json":"https://pith.science/api/pith-number/ASNKDKHBGCFSHF5I35VFZFDAOI/graph.json","events_json":"https://pith.science/api/pith-number/ASNKDKHBGCFSHF5I35VFZFDAOI/events.json","paper":"https://pith.science/paper/ASNKDKHB"},"agent_actions":{"view_html":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI","download_json":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI.json","view_paper":"https://pith.science/paper/ASNKDKHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14268&json=true","fetch_graph":"https://pith.science/api/pith-number/ASNKDKHBGCFSHF5I35VFZFDAOI/graph.json","fetch_events":"https://pith.science/api/pith-number/ASNKDKHBGCFSHF5I35VFZFDAOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI/action/storage_attestation","attest_author":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI/action/author_attestation","sign_citation":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI/action/citation_signature","submit_replication":"https://pith.science/pith/ASNKDKHBGCFSHF5I35VFZFDAOI/action/replication_record"}},"created_at":"2026-07-05T11:11:32.172278+00:00","updated_at":"2026-07-05T11:11:32.172278+00:00"}