{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IXD7OKBRSULYXCMA5O677EM2E3","short_pith_number":"pith:IXD7OKBR","schema_version":"1.0","canonical_sha256":"45c7f7283195178b8980ebbdff919a26e46dc4e28742ab6e2216fbd08a5b93fa","source":{"kind":"arxiv","id":"2204.10532","version":1},"attestation_state":"computed","paper":{"title":"End-to-end symbolic regression with transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Charton, Guillaume Lample, Pierre-Alexandre Kamienny, St\\'ephane d'Ascoli","submitted_at":"2022-04-22T06:55:43Z","abstract_excerpt":"Symbolic regression, the task of predicting the mathematical expression of a function from the observation of its values, is a difficult task which usually involves a two-step procedure: predicting the \"skeleton\" of the expression up to the choice of numerical constants, then fitting the constants by optimizing a non-convex loss function. The dominant approach is genetic programming, which evolves candidates by iterating this subroutine a large number of times. Neural networks have recently been tasked to predict the correct skeleton in a single try, but remain much less powerful. In this pape"},"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":"2204.10532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-22T06:55:43Z","cross_cats_sorted":[],"title_canon_sha256":"cf5cc1aa64cb137c619a0c4c6d9011a91176d8d57f3bef4f16ccc7d279d72458","abstract_canon_sha256":"166fb3875a559ee2b1806de5af87ad89d62a538351b3716f9196ef6562116f2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:58.152787Z","signature_b64":"xNepFqF1vbpa2SgdRjAZ2uAoBUQM8quqso3d4E5v7tcvV6hT5Xafvg/N6vc1BKjOhzLXk6T4MAj+p2wPobMuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45c7f7283195178b8980ebbdff919a26e46dc4e28742ab6e2216fbd08a5b93fa","last_reissued_at":"2026-07-05T04:16:58.152293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:58.152293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end symbolic regression with transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Charton, Guillaume Lample, Pierre-Alexandre Kamienny, St\\'ephane d'Ascoli","submitted_at":"2022-04-22T06:55:43Z","abstract_excerpt":"Symbolic regression, the task of predicting the mathematical expression of a function from the observation of its values, is a difficult task which usually involves a two-step procedure: predicting the \"skeleton\" of the expression up to the choice of numerical constants, then fitting the constants by optimizing a non-convex loss function. The dominant approach is genetic programming, which evolves candidates by iterating this subroutine a large number of times. Neural networks have recently been tasked to predict the correct skeleton in a single try, but remain much less powerful. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.10532","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/2204.10532/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":"2204.10532","created_at":"2026-07-05T04:16:58.152361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.10532v1","created_at":"2026-07-05T04:16:58.152361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.10532","created_at":"2026-07-05T04:16:58.152361+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXD7OKBRSULY","created_at":"2026-07-05T04:16:58.152361+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXD7OKBRSULYXCMA","created_at":"2026-07-05T04:16:58.152361+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXD7OKBR","created_at":"2026-07-05T04:16:58.152361+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16724","citing_title":"Discovering interpretable low-dimensional dynamics using maximum entropy","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3","json":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3.json","graph_json":"https://pith.science/api/pith-number/IXD7OKBRSULYXCMA5O677EM2E3/graph.json","events_json":"https://pith.science/api/pith-number/IXD7OKBRSULYXCMA5O677EM2E3/events.json","paper":"https://pith.science/paper/IXD7OKBR"},"agent_actions":{"view_html":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3","download_json":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3.json","view_paper":"https://pith.science/paper/IXD7OKBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.10532&json=true","fetch_graph":"https://pith.science/api/pith-number/IXD7OKBRSULYXCMA5O677EM2E3/graph.json","fetch_events":"https://pith.science/api/pith-number/IXD7OKBRSULYXCMA5O677EM2E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3/action/storage_attestation","attest_author":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3/action/author_attestation","sign_citation":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3/action/citation_signature","submit_replication":"https://pith.science/pith/IXD7OKBRSULYXCMA5O677EM2E3/action/replication_record"}},"created_at":"2026-07-05T04:16:58.152361+00:00","updated_at":"2026-07-05T04:16:58.152361+00:00"}