{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:25VF34Q45LDWQUPI6CNB4TQ3ZT","short_pith_number":"pith:25VF34Q4","schema_version":"1.0","canonical_sha256":"d76a5df21ceac76851e8f09a1e4e1bccd9d78931b303276d3e922eadebd1ce7c","source":{"kind":"arxiv","id":"2605.21055","version":1},"attestation_state":"computed","paper":{"title":"Genetic Programming with Transformer-Based Mutation for Approximate Circuit Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Lukas Sekanina, Ondrej Galeta","submitted_at":"2026-05-20T11:42:10Z","abstract_excerpt":"A recent trend is to leverage machine learning models to improve the evolutionary design and optimization process. We propose a novel transformer-based mutation operator for Cartesian genetic programming (CGP) for the automated design of approximate arithmetic circuits. We introduce a hybrid scheme for CGP in which the proposed mutation operator is switched with the standard mutation operator to prevent stagnation of the circuit approximation process. We also develop a new training scheme for the underlying transformer that utilizes training vectors composed of thousands of CGP chromosomes rep"},"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":"2605.21055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-05-20T11:42:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f3a01d2bb6f9c89275cd5be5feda1dd89a71b337724821b9c5cca161aed0e73e","abstract_canon_sha256":"f8857dbc145951440fd09c489aef14dcfa10b785cbc0361981cc7baec61bf0e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:34.334652Z","signature_b64":"fsRM2ATljhZtNllxtFzcsrDQ6cEGoitDtpTN17+Q7zx9nYC1bee3PBNe0caOpFIwDGWDaeVRFIxiu/3m18qzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d76a5df21ceac76851e8f09a1e4e1bccd9d78931b303276d3e922eadebd1ce7c","last_reissued_at":"2026-05-21T01:05:34.333900Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:34.333900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic Programming with Transformer-Based Mutation for Approximate Circuit Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Lukas Sekanina, Ondrej Galeta","submitted_at":"2026-05-20T11:42:10Z","abstract_excerpt":"A recent trend is to leverage machine learning models to improve the evolutionary design and optimization process. We propose a novel transformer-based mutation operator for Cartesian genetic programming (CGP) for the automated design of approximate arithmetic circuits. We introduce a hybrid scheme for CGP in which the proposed mutation operator is switched with the standard mutation operator to prevent stagnation of the circuit approximation process. We also develop a new training scheme for the underlying transformer that utilizes training vectors composed of thousands of CGP chromosomes rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21055","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/2605.21055/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":"2605.21055","created_at":"2026-05-21T01:05:34.334020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21055v1","created_at":"2026-05-21T01:05:34.334020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21055","created_at":"2026-05-21T01:05:34.334020+00:00"},{"alias_kind":"pith_short_12","alias_value":"25VF34Q45LDW","created_at":"2026-05-21T01:05:34.334020+00:00"},{"alias_kind":"pith_short_16","alias_value":"25VF34Q45LDWQUPI","created_at":"2026-05-21T01:05:34.334020+00:00"},{"alias_kind":"pith_short_8","alias_value":"25VF34Q4","created_at":"2026-05-21T01:05:34.334020+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/25VF34Q45LDWQUPI6CNB4TQ3ZT","json":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT.json","graph_json":"https://pith.science/api/pith-number/25VF34Q45LDWQUPI6CNB4TQ3ZT/graph.json","events_json":"https://pith.science/api/pith-number/25VF34Q45LDWQUPI6CNB4TQ3ZT/events.json","paper":"https://pith.science/paper/25VF34Q4"},"agent_actions":{"view_html":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT","download_json":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT.json","view_paper":"https://pith.science/paper/25VF34Q4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21055&json=true","fetch_graph":"https://pith.science/api/pith-number/25VF34Q45LDWQUPI6CNB4TQ3ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/25VF34Q45LDWQUPI6CNB4TQ3ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT/action/storage_attestation","attest_author":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT/action/author_attestation","sign_citation":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT/action/citation_signature","submit_replication":"https://pith.science/pith/25VF34Q45LDWQUPI6CNB4TQ3ZT/action/replication_record"}},"created_at":"2026-05-21T01:05:34.334020+00:00","updated_at":"2026-05-21T01:05:34.334020+00:00"}