{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WW7GCEXHW6GY57X2UKGVJMD33N","short_pith_number":"pith:WW7GCEXH","schema_version":"1.0","canonical_sha256":"b5be6112e7b78d8efefaa28d54b07bdb4349a322d8333e91e25e849a6d8e3a58","source":{"kind":"arxiv","id":"2504.20256","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Hard Thresholding for Sparse Model Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.DS","math.NA"],"primary_cat":"math.OC","authors_text":"Derek W. Jollie, Scott G. McCalla","submitted_at":"2025-04-28T21:01:07Z","abstract_excerpt":"Many model selection algorithms rely on sparse dictionary learning to provide interpretable and physics-based governing equations. The optimization algorithms typically use a hard thresholding process to enforce sparse activations in the model coefficients by removing library elements from consideration. By introducing an annealing scheme that reactivates a fraction of the removed terms with a cooling schedule, we are able to improve the performance of these sparse learning algorithms. We concentrate on two approaches to the optimization, SINDy, and an alternative using hard thresholding pursu"},"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":"2504.20256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-28T21:01:07Z","cross_cats_sorted":["cs.LG","cs.NA","math.DS","math.NA"],"title_canon_sha256":"a7bbb5f92a7606b687cf40a77e8466ec28812716c311cc4721821dbf7101a623","abstract_canon_sha256":"0626260dea9c4e7e460f22bf79bdf1212ca1f5c519d0d49675269a8d6cc2974f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:39.261919Z","signature_b64":"MMD7RqaQP6oYNzQnl4C0kSgRLCZi+0CQk9vvglwMEyXUSKvthZYw8aisBGVsy6mECZlsDjPIXukUdJSPgnF8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5be6112e7b78d8efefaa28d54b07bdb4349a322d8333e91e25e849a6d8e3a58","last_reissued_at":"2026-07-05T10:55:39.261512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:39.261512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Hard Thresholding for Sparse Model Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.DS","math.NA"],"primary_cat":"math.OC","authors_text":"Derek W. Jollie, Scott G. McCalla","submitted_at":"2025-04-28T21:01:07Z","abstract_excerpt":"Many model selection algorithms rely on sparse dictionary learning to provide interpretable and physics-based governing equations. The optimization algorithms typically use a hard thresholding process to enforce sparse activations in the model coefficients by removing library elements from consideration. By introducing an annealing scheme that reactivates a fraction of the removed terms with a cooling schedule, we are able to improve the performance of these sparse learning algorithms. We concentrate on two approaches to the optimization, SINDy, and an alternative using hard thresholding pursu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20256","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/2504.20256/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":"2504.20256","created_at":"2026-07-05T10:55:39.261573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.20256v1","created_at":"2026-07-05T10:55:39.261573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20256","created_at":"2026-07-05T10:55:39.261573+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW7GCEXHW6GY","created_at":"2026-07-05T10:55:39.261573+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW7GCEXHW6GY57X2","created_at":"2026-07-05T10:55:39.261573+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW7GCEXH","created_at":"2026-07-05T10:55:39.261573+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/WW7GCEXHW6GY57X2UKGVJMD33N","json":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N.json","graph_json":"https://pith.science/api/pith-number/WW7GCEXHW6GY57X2UKGVJMD33N/graph.json","events_json":"https://pith.science/api/pith-number/WW7GCEXHW6GY57X2UKGVJMD33N/events.json","paper":"https://pith.science/paper/WW7GCEXH"},"agent_actions":{"view_html":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N","download_json":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N.json","view_paper":"https://pith.science/paper/WW7GCEXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.20256&json=true","fetch_graph":"https://pith.science/api/pith-number/WW7GCEXHW6GY57X2UKGVJMD33N/graph.json","fetch_events":"https://pith.science/api/pith-number/WW7GCEXHW6GY57X2UKGVJMD33N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/action/storage_attestation","attest_author":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/action/author_attestation","sign_citation":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/action/citation_signature","submit_replication":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/action/replication_record"}},"created_at":"2026-07-05T10:55:39.261573+00:00","updated_at":"2026-07-05T10:55:39.261573+00:00"}