{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F7JG33U2TYDFCCTTHEEL72JMLK","short_pith_number":"pith:F7JG33U2","schema_version":"1.0","canonical_sha256":"2fd26dee9a9e06510a733908bfe92c5a9e61969f3c9d2e8f7cc27a6ee8216dee","source":{"kind":"arxiv","id":"2310.05537","version":4},"attestation_state":"computed","paper":{"title":"ParFam -- (Neural Guided) Symbolic Regression Based on Continuous Global Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Gitta Kutyniok, Hillary Hauger, Katharina Bieker, Philipp Scholl","submitted_at":"2023-10-09T09:01:25Z","abstract_excerpt":"The problem of symbolic regression (SR) arises in many different applications, such as identifying physical laws or deriving mathematical equations describing the behavior of financial markets from given data. Various methods exist to address the problem of SR, often based on genetic programming. However, these methods are usually complicated and involve various hyperparameters. In this paper, we present our new approach ParFam that utilizes parametric families of suitable symbolic functions to translate the discrete symbolic regression problem into a continuous one, resulting in a more straig"},"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":"2310.05537","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-10-09T09:01:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cbad110f4b946aa9e38a96040ed2790022f5d41c49d3afa42a2b597f430e7ff1","abstract_canon_sha256":"b4e087fa671888d5cf2ea5ba8d3cabe31892a0c82e29fc6bb1fa1557546f7961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:58.187294Z","signature_b64":"WST5drNbZiyH5zvhZPWbkXms2gK4D9JZMIniU1fpSFSfRvsF171kCghP/vpUWVMtBGq41sSJ8cJLCl9Co+RcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fd26dee9a9e06510a733908bfe92c5a9e61969f3c9d2e8f7cc27a6ee8216dee","last_reissued_at":"2026-07-05T10:58:58.186790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:58.186790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ParFam -- (Neural Guided) Symbolic Regression Based on Continuous Global Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Gitta Kutyniok, Hillary Hauger, Katharina Bieker, Philipp Scholl","submitted_at":"2023-10-09T09:01:25Z","abstract_excerpt":"The problem of symbolic regression (SR) arises in many different applications, such as identifying physical laws or deriving mathematical equations describing the behavior of financial markets from given data. Various methods exist to address the problem of SR, often based on genetic programming. However, these methods are usually complicated and involve various hyperparameters. In this paper, we present our new approach ParFam that utilizes parametric families of suitable symbolic functions to translate the discrete symbolic regression problem into a continuous one, resulting in a more straig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.05537","kind":"arxiv","version":4},"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/2310.05537/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":"2310.05537","created_at":"2026-07-05T10:58:58.186850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.05537v4","created_at":"2026-07-05T10:58:58.186850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05537","created_at":"2026-07-05T10:58:58.186850+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7JG33U2TYDF","created_at":"2026-07-05T10:58:58.186850+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7JG33U2TYDFCCTT","created_at":"2026-07-05T10:58:58.186850+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7JG33U2","created_at":"2026-07-05T10:58:58.186850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19672","citing_title":"$\\mathcal{C}^1$-approximation with rational functions and rational neural networks","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK","json":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK.json","graph_json":"https://pith.science/api/pith-number/F7JG33U2TYDFCCTTHEEL72JMLK/graph.json","events_json":"https://pith.science/api/pith-number/F7JG33U2TYDFCCTTHEEL72JMLK/events.json","paper":"https://pith.science/paper/F7JG33U2"},"agent_actions":{"view_html":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK","download_json":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK.json","view_paper":"https://pith.science/paper/F7JG33U2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/F7JG33U2TYDFCCTTHEEL72JMLK/graph.json","fetch_events":"https://pith.science/api/pith-number/F7JG33U2TYDFCCTTHEEL72JMLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK/action/storage_attestation","attest_author":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK/action/author_attestation","sign_citation":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK/action/citation_signature","submit_replication":"https://pith.science/pith/F7JG33U2TYDFCCTTHEEL72JMLK/action/replication_record"}},"created_at":"2026-07-05T10:58:58.186850+00:00","updated_at":"2026-07-05T10:58:58.186850+00:00"}