{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FR3N7V2GE6BXNVQLEZ5WPL4NWL","short_pith_number":"pith:FR3N7V2G","schema_version":"1.0","canonical_sha256":"2c76dfd746278376d60b267b67af8db2d935f395bd2db01a9a0894ac5c7c5f7f","source":{"kind":"arxiv","id":"2509.19710","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Bani K. Mallick, Debdeep Pati, Pritam Dey, Somjit Roy","submitted_at":"2025-09-24T02:42:25Z","abstract_excerpt":"Symbolic regression has emerged as a powerful tool for artificial intelligence-driven scientific discovery by learning interpretable analytical expressions that reveal governing relationships directly from data. Existing methods, however, often rely on heuristic search, struggle to balance predictive accuracy with expression complexity in noisy settings, and offer limited characterization of symbolic uncertainty. Probabilistic approaches that address these challenges in a unified manner remain underexplored. We introduce a probabilistic symbolic regression framework that represents mathematica"},"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":"2509.19710","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-09-24T02:42:25Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ebed787510b5f6d0aa177f4c30df6e4337650e45979a91f77e435c7196ae2d1d","abstract_canon_sha256":"1b8281460ecd2a61fa695f8f0adf1caedaedcf87e6cbd89bc6cd5548e7e115e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T00:21:32.400007Z","signature_b64":"5t/1j4RZNH36eYUR+OEwdfzcJWPNNWtNAh+l6SsMqyKElnMZe1gNRh6ZRmtlrd1May5DwxKdirzRUdETp+eGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c76dfd746278376d60b267b67af8db2d935f395bd2db01a9a0894ac5c7c5f7f","last_reissued_at":"2026-07-28T00:21:32.399081Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T00:21:32.399081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Bani K. Mallick, Debdeep Pati, Pritam Dey, Somjit Roy","submitted_at":"2025-09-24T02:42:25Z","abstract_excerpt":"Symbolic regression has emerged as a powerful tool for artificial intelligence-driven scientific discovery by learning interpretable analytical expressions that reveal governing relationships directly from data. Existing methods, however, often rely on heuristic search, struggle to balance predictive accuracy with expression complexity in noisy settings, and offer limited characterization of symbolic uncertainty. Probabilistic approaches that address these challenges in a unified manner remain underexplored. We introduce a probabilistic symbolic regression framework that represents mathematica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.19710","kind":"arxiv","version":2},"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/2509.19710/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":"2509.19710","created_at":"2026-07-28T00:21:32.399519+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.19710v2","created_at":"2026-07-28T00:21:32.399519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.19710","created_at":"2026-07-28T00:21:32.399519+00:00"},{"alias_kind":"pith_short_12","alias_value":"FR3N7V2GE6BX","created_at":"2026-07-28T00:21:32.399519+00:00"},{"alias_kind":"pith_short_16","alias_value":"FR3N7V2GE6BXNVQL","created_at":"2026-07-28T00:21:32.399519+00:00"},{"alias_kind":"pith_short_8","alias_value":"FR3N7V2G","created_at":"2026-07-28T00:21:32.399519+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.06567","citing_title":"Are you sure? A Comprehensive and Comprehensible Survey of Uncertainty Quantification in Symbolic Regression","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL","json":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL.json","graph_json":"https://pith.science/api/pith-number/FR3N7V2GE6BXNVQLEZ5WPL4NWL/graph.json","events_json":"https://pith.science/api/pith-number/FR3N7V2GE6BXNVQLEZ5WPL4NWL/events.json","paper":"https://pith.science/paper/FR3N7V2G"},"agent_actions":{"view_html":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL","download_json":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL.json","view_paper":"https://pith.science/paper/FR3N7V2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.19710&json=true","fetch_graph":"https://pith.science/api/pith-number/FR3N7V2GE6BXNVQLEZ5WPL4NWL/graph.json","fetch_events":"https://pith.science/api/pith-number/FR3N7V2GE6BXNVQLEZ5WPL4NWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL/action/storage_attestation","attest_author":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL/action/author_attestation","sign_citation":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL/action/citation_signature","submit_replication":"https://pith.science/pith/FR3N7V2GE6BXNVQLEZ5WPL4NWL/action/replication_record"}},"created_at":"2026-07-28T00:21:32.399519+00:00","updated_at":"2026-07-28T00:21:32.399519+00:00"}