{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MDDWX236M2OZJ473VX3VYROP6W","short_pith_number":"pith:MDDWX236","schema_version":"1.0","canonical_sha256":"60c76beb7e669d94f3fbadf75c45cff58fb2786c195e7ee13b0f32ac80259e7e","source":{"kind":"arxiv","id":"1801.01807","version":1},"attestation_state":"computed","paper":{"title":"A Greedy Search Tree Heuristic for Symbolic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fabricio Olivetti de Franca","submitted_at":"2018-01-04T18:30:38Z","abstract_excerpt":"Symbolic Regression tries to find a mathematical expression that describes the relationship of a set of explanatory variables to a measured variable. The main objective is to find a model that minimizes the error and, optionally, that also minimizes the expression size. A smaller expression can be seen as an interpretable model considered a reliable decision model. This is often performed with Genetic Programming which represents their solution as expression trees. The shortcoming of this algorithm lies on this representation that defines a rugged search space and contains expressions of any s"},"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":"1801.01807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-04T18:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"1311fc7e1e32c37087bb6df4c5ddfa3339c9285f1295d4d2be5c66130b9d660b","abstract_canon_sha256":"ea6aa41f6af556a83943e7504995fa419de9c861d2c611abfd47dd4af27c621c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:38.967628Z","signature_b64":"Gq+vTduyLHDDsW4Pq2XIfDHGNkYGzTQtHC5id2djuO+OdhnY63fEi6lLwArzAm7TeZlC3VfsiVCZy0qY3Y3yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60c76beb7e669d94f3fbadf75c45cff58fb2786c195e7ee13b0f32ac80259e7e","last_reissued_at":"2026-05-18T00:22:38.967263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:38.967263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Greedy Search Tree Heuristic for Symbolic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fabricio Olivetti de Franca","submitted_at":"2018-01-04T18:30:38Z","abstract_excerpt":"Symbolic Regression tries to find a mathematical expression that describes the relationship of a set of explanatory variables to a measured variable. The main objective is to find a model that minimizes the error and, optionally, that also minimizes the expression size. A smaller expression can be seen as an interpretable model considered a reliable decision model. This is often performed with Genetic Programming which represents their solution as expression trees. The shortcoming of this algorithm lies on this representation that defines a rugged search space and contains expressions of any s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01807","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":""},"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":"1801.01807","created_at":"2026-05-18T00:22:38.967321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01807v1","created_at":"2026-05-18T00:22:38.967321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01807","created_at":"2026-05-18T00:22:38.967321+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDDWX236M2OZ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDDWX236M2OZJ473","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDDWX236","created_at":"2026-05-18T12:32:37.024351+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/MDDWX236M2OZJ473VX3VYROP6W","json":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W.json","graph_json":"https://pith.science/api/pith-number/MDDWX236M2OZJ473VX3VYROP6W/graph.json","events_json":"https://pith.science/api/pith-number/MDDWX236M2OZJ473VX3VYROP6W/events.json","paper":"https://pith.science/paper/MDDWX236"},"agent_actions":{"view_html":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W","download_json":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W.json","view_paper":"https://pith.science/paper/MDDWX236","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01807&json=true","fetch_graph":"https://pith.science/api/pith-number/MDDWX236M2OZJ473VX3VYROP6W/graph.json","fetch_events":"https://pith.science/api/pith-number/MDDWX236M2OZJ473VX3VYROP6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W/action/storage_attestation","attest_author":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W/action/author_attestation","sign_citation":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W/action/citation_signature","submit_replication":"https://pith.science/pith/MDDWX236M2OZJ473VX3VYROP6W/action/replication_record"}},"created_at":"2026-05-18T00:22:38.967321+00:00","updated_at":"2026-05-18T00:22:38.967321+00:00"}