{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NI7CSWWHBRWEL64PTBK4EED4EK","short_pith_number":"pith:NI7CSWWH","schema_version":"1.0","canonical_sha256":"6a3e295ac70c6c45fb8f9855c2107c22af353a7c50e540e184d42e53f72536e7","source":{"kind":"arxiv","id":"2507.13033","version":1},"attestation_state":"computed","paper":{"title":"(Exhaustive) Symbolic Regression and model selection by minimum description length","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["astro-ph.CO","astro-ph.GA","cs.LG"],"primary_cat":"astro-ph.IM","authors_text":"Harry Desmond","submitted_at":"2025-07-17T12:04:15Z","abstract_excerpt":"Symbolic regression is the machine learning method for learning functions from data. After a brief overview of the symbolic regression landscape, I will describe the two main challenges that traditional algorithms face: they have an unknown (and likely significant) probability of failing to find any given good function, and they suffer from ambiguity and poorly-justified assumptions in their function-selection procedure. To address these I propose an exhaustive search and model selection by the minimum description length principle, which allows accuracy and complexity to be directly traded off"},"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":"2507.13033","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"astro-ph.IM","submitted_at":"2025-07-17T12:04:15Z","cross_cats_sorted":["astro-ph.CO","astro-ph.GA","cs.LG"],"title_canon_sha256":"be02c07ad7c7043b1e2553c12b507f8cd51db4fb4295c43b5df2a4363a51fa80","abstract_canon_sha256":"b5e9efe36d0325c5ff654105b747b8e98eecec17a9a6776a03a0f703304eee16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:53.445056Z","signature_b64":"iUdKsjP9MlsLxf9f1Gzrs0ftl73zHGd7TTMTE37UfDV8brop22gnur5CDDzMw6ELojDpONkHrSYR6Un9G0JHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3e295ac70c6c45fb8f9855c2107c22af353a7c50e540e184d42e53f72536e7","last_reissued_at":"2026-07-05T11:38:53.444591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:53.444591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Exhaustive) Symbolic Regression and model selection by minimum description length","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["astro-ph.CO","astro-ph.GA","cs.LG"],"primary_cat":"astro-ph.IM","authors_text":"Harry Desmond","submitted_at":"2025-07-17T12:04:15Z","abstract_excerpt":"Symbolic regression is the machine learning method for learning functions from data. After a brief overview of the symbolic regression landscape, I will describe the two main challenges that traditional algorithms face: they have an unknown (and likely significant) probability of failing to find any given good function, and they suffer from ambiguity and poorly-justified assumptions in their function-selection procedure. To address these I propose an exhaustive search and model selection by the minimum description length principle, which allows accuracy and complexity to be directly traded off"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13033","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/2507.13033/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":"2507.13033","created_at":"2026-07-05T11:38:53.444647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13033v1","created_at":"2026-07-05T11:38:53.444647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13033","created_at":"2026-07-05T11:38:53.444647+00:00"},{"alias_kind":"pith_short_12","alias_value":"NI7CSWWHBRWE","created_at":"2026-07-05T11:38:53.444647+00:00"},{"alias_kind":"pith_short_16","alias_value":"NI7CSWWHBRWEL64P","created_at":"2026-07-05T11:38:53.444647+00:00"},{"alias_kind":"pith_short_8","alias_value":"NI7CSWWH","created_at":"2026-07-05T11:38:53.444647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17951","citing_title":"Data-Driven Discovery of a Simple Phantom-Crossing Dark Energy Parametrization","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05822","citing_title":"Model-independent constraints on generalized FLRW consistency relations with bootstrap-based symbolic regression","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23236","citing_title":"The functional form of galaxy and halo luminosity and mass functions","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK","json":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK.json","graph_json":"https://pith.science/api/pith-number/NI7CSWWHBRWEL64PTBK4EED4EK/graph.json","events_json":"https://pith.science/api/pith-number/NI7CSWWHBRWEL64PTBK4EED4EK/events.json","paper":"https://pith.science/paper/NI7CSWWH"},"agent_actions":{"view_html":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK","download_json":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK.json","view_paper":"https://pith.science/paper/NI7CSWWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13033&json=true","fetch_graph":"https://pith.science/api/pith-number/NI7CSWWHBRWEL64PTBK4EED4EK/graph.json","fetch_events":"https://pith.science/api/pith-number/NI7CSWWHBRWEL64PTBK4EED4EK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK/action/storage_attestation","attest_author":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK/action/author_attestation","sign_citation":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK/action/citation_signature","submit_replication":"https://pith.science/pith/NI7CSWWHBRWEL64PTBK4EED4EK/action/replication_record"}},"created_at":"2026-07-05T11:38:53.444647+00:00","updated_at":"2026-07-05T11:38:53.444647+00:00"}