{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4TEC3YFBJU433BIFWJOOZBCWTO","short_pith_number":"pith:4TEC3YFB","schema_version":"1.0","canonical_sha256":"e4c82de0a14d39bd8505b25cec84569b8e05d474b2c31cdc1f94d51ac8473cbc","source":{"kind":"arxiv","id":"2404.13820","version":1},"attestation_state":"computed","paper":{"title":"Prove Symbolic Regression is NP-hard by Symbol Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CC","authors_text":"Bozhou Tian, Jake Luo, Jinglu Song, Jingwen Zhang, Qiang Lu, Zhiguang Wang","submitted_at":"2024-04-22T01:48:58Z","abstract_excerpt":"Symbolic regression (SR) is the task of discovering a symbolic expression that fits a given data set from the space of mathematical expressions. Despite the abundance of research surrounding the SR problem, there's a scarcity of works that confirm its NP-hard nature. Therefore, this paper introduces the concept of a symbol graph as a comprehensive representation of the entire mathematical expression space, effectively illustrating the NP-hard characteristics of the SR problem. Leveraging the symbol graph, we establish a connection between the SR problem and the task of identifying an optimally"},"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":"2404.13820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-22T01:48:58Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"8c8c3efa1421929e349ff0bdca64b94c622956984570db35e22ebbd41049f6b8","abstract_canon_sha256":"c41f6cdab1777b1936d4677429db3b5f8428d81169e801e11043ef2e5a18dcf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:37.844922Z","signature_b64":"GfebDoDbSDYXSn1X2nZdH/2k1b0H9NEjEutwCAqElLXHLNHdlZktqNMiin9ObFBpfa9xXbk/18NfYQnMiIPrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c82de0a14d39bd8505b25cec84569b8e05d474b2c31cdc1f94d51ac8473cbc","last_reissued_at":"2026-07-05T08:10:37.844445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:37.844445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prove Symbolic Regression is NP-hard by Symbol Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CC","authors_text":"Bozhou Tian, Jake Luo, Jinglu Song, Jingwen Zhang, Qiang Lu, Zhiguang Wang","submitted_at":"2024-04-22T01:48:58Z","abstract_excerpt":"Symbolic regression (SR) is the task of discovering a symbolic expression that fits a given data set from the space of mathematical expressions. Despite the abundance of research surrounding the SR problem, there's a scarcity of works that confirm its NP-hard nature. Therefore, this paper introduces the concept of a symbol graph as a comprehensive representation of the entire mathematical expression space, effectively illustrating the NP-hard characteristics of the SR problem. Leveraging the symbol graph, we establish a connection between the SR problem and the task of identifying an optimally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13820","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/2404.13820/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":"2404.13820","created_at":"2026-07-05T08:10:37.844502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13820v1","created_at":"2026-07-05T08:10:37.844502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13820","created_at":"2026-07-05T08:10:37.844502+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TEC3YFBJU43","created_at":"2026-07-05T08:10:37.844502+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TEC3YFBJU433BIF","created_at":"2026-07-05T08:10:37.844502+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TEC3YFB","created_at":"2026-07-05T08:10:37.844502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12704","citing_title":"FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO","json":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO.json","graph_json":"https://pith.science/api/pith-number/4TEC3YFBJU433BIFWJOOZBCWTO/graph.json","events_json":"https://pith.science/api/pith-number/4TEC3YFBJU433BIFWJOOZBCWTO/events.json","paper":"https://pith.science/paper/4TEC3YFB"},"agent_actions":{"view_html":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO","download_json":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO.json","view_paper":"https://pith.science/paper/4TEC3YFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13820&json=true","fetch_graph":"https://pith.science/api/pith-number/4TEC3YFBJU433BIFWJOOZBCWTO/graph.json","fetch_events":"https://pith.science/api/pith-number/4TEC3YFBJU433BIFWJOOZBCWTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO/action/storage_attestation","attest_author":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO/action/author_attestation","sign_citation":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO/action/citation_signature","submit_replication":"https://pith.science/pith/4TEC3YFBJU433BIFWJOOZBCWTO/action/replication_record"}},"created_at":"2026-07-05T08:10:37.844502+00:00","updated_at":"2026-07-05T08:10:37.844502+00:00"}