{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5TA2GKSFQR3HOHNXHARW4Q3NII","short_pith_number":"pith:5TA2GKSF","schema_version":"1.0","canonical_sha256":"ecc1a32a458476771db738236e436d422d3a25c9f038462c631c1fc973c20415","source":{"kind":"arxiv","id":"2504.18943","version":1},"attestation_state":"computed","paper":{"title":"GPU accelerated program synthesis: Enumerate semantics, not syntax!","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.PL","authors_text":"Martin Berger, Mojtaba Valizadeh, Nathana\\\"el Fijalkow","submitted_at":"2025-04-26T15:06:37Z","abstract_excerpt":"Program synthesis is an umbrella term for generating programs and logical formulae from specifications. With the remarkable performance improvements that GPUs enable for deep learning, a natural question arose: can we also implement a search-based program synthesiser on GPUs to achieve similar performance improvements? In this article we discuss our insights on this question, based on recent works~. The goal is to build a synthesiser running on GPUs which takes as input positive and negative example traces and returns a logical formula accepting the positive and rejecting the negative traces. "},"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":"2504.18943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-04-26T15:06:37Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"700b1c22f8ccadcb582837b2f33ae39715930d9c9a74ca3c38338c9baac045bc","abstract_canon_sha256":"ef919df9233f2a2e043ff1d80e84c7c622ccc00973642dd057c611f2f74d8d98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:49.194127Z","signature_b64":"ud3crPCfDo1aocr8wUPgGK/9RaVpDjMav6dvASZacxnAEtiMi9gK29j7rO23YAb5JLDC8B5zf0zF8A9c7KgjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc1a32a458476771db738236e436d422d3a25c9f038462c631c1fc973c20415","last_reissued_at":"2026-07-05T10:54:49.193634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:49.193634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU accelerated program synthesis: Enumerate semantics, not syntax!","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.PL","authors_text":"Martin Berger, Mojtaba Valizadeh, Nathana\\\"el Fijalkow","submitted_at":"2025-04-26T15:06:37Z","abstract_excerpt":"Program synthesis is an umbrella term for generating programs and logical formulae from specifications. With the remarkable performance improvements that GPUs enable for deep learning, a natural question arose: can we also implement a search-based program synthesiser on GPUs to achieve similar performance improvements? In this article we discuss our insights on this question, based on recent works~. The goal is to build a synthesiser running on GPUs which takes as input positive and negative example traces and returns a logical formula accepting the positive and rejecting the negative traces. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18943","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/2504.18943/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":"2504.18943","created_at":"2026-07-05T10:54:49.193699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.18943v1","created_at":"2026-07-05T10:54:49.193699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18943","created_at":"2026-07-05T10:54:49.193699+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TA2GKSFQR3H","created_at":"2026-07-05T10:54:49.193699+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TA2GKSFQR3HOHNX","created_at":"2026-07-05T10:54:49.193699+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TA2GKSF","created_at":"2026-07-05T10:54:49.193699+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/5TA2GKSFQR3HOHNXHARW4Q3NII","json":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII.json","graph_json":"https://pith.science/api/pith-number/5TA2GKSFQR3HOHNXHARW4Q3NII/graph.json","events_json":"https://pith.science/api/pith-number/5TA2GKSFQR3HOHNXHARW4Q3NII/events.json","paper":"https://pith.science/paper/5TA2GKSF"},"agent_actions":{"view_html":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII","download_json":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII.json","view_paper":"https://pith.science/paper/5TA2GKSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.18943&json=true","fetch_graph":"https://pith.science/api/pith-number/5TA2GKSFQR3HOHNXHARW4Q3NII/graph.json","fetch_events":"https://pith.science/api/pith-number/5TA2GKSFQR3HOHNXHARW4Q3NII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII/action/storage_attestation","attest_author":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII/action/author_attestation","sign_citation":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII/action/citation_signature","submit_replication":"https://pith.science/pith/5TA2GKSFQR3HOHNXHARW4Q3NII/action/replication_record"}},"created_at":"2026-07-05T10:54:49.193699+00:00","updated_at":"2026-07-05T10:54:49.193699+00:00"}