{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WW7GCEXHW6GY57X2UKGVJMD33N","short_pith_number":"pith:WW7GCEXH","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"},"canonical_sha256":"b5be6112e7b78d8efefaa28d54b07bdb4349a322d8333e91e25e849a6d8e3a58","source":{"kind":"arxiv","id":"2504.20256","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20256","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20256v1","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20256","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"WW7GCEXHW6GY","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"pith_short_16","alias_value":"WW7GCEXHW6GY57X2","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"pith_short_8","alias_value":"WW7GCEXH","created_at":"2026-07-05T10:55:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WW7GCEXHW6GY57X2UKGVJMD33N","target":"record","payload":{"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"},"canonical_sha256":"b5be6112e7b78d8efefaa28d54b07bdb4349a322d8333e91e25e849a6d8e3a58","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"},"source_kind":"arxiv","source_id":"2504.20256","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwrBbjOBcPQCHFUB1Uz9PAOtj4Igk9pKmDbDnEKLIkiAIFdwIxRWGIEyaWvRwnhpW3LlitemTeunAdrUnpR5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T07:34:56.941997Z"},"content_sha256":"30a6cb005a22e6494e671c385762e302f2af470af92173013485c6f87b87d5f1","schema_version":"1.0","event_id":"sha256:30a6cb005a22e6494e671c385762e302f2af470af92173013485c6f87b87d5f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WW7GCEXHW6GY57X2UKGVJMD33N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ChsP9/ejGnoRa2T3RwMC0/JEd4XuVdJ1P8ykDAEJVE6ZWMpnFINNAbAqdzNAQaWrGP37YLhhZ0PrnOgMv09GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T07:34:56.942558Z"},"content_sha256":"38311b768c32a78c1e3e40acf9a1764659e36ebc5fe8bf4df798929b1e89cc6c","schema_version":"1.0","event_id":"sha256:38311b768c32a78c1e3e40acf9a1764659e36ebc5fe8bf4df798929b1e89cc6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/bundle.json","state_url":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WW7GCEXHW6GY57X2UKGVJMD33N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T07:34:56Z","links":{"resolver":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N","bundle":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/bundle.json","state":"https://pith.science/pith/WW7GCEXHW6GY57X2UKGVJMD33N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WW7GCEXHW6GY57X2UKGVJMD33N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WW7GCEXHW6GY57X2UKGVJMD33N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0626260dea9c4e7e460f22bf79bdf1212ca1f5c519d0d49675269a8d6cc2974f","cross_cats_sorted":["cs.LG","cs.NA","math.DS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-28T21:01:07Z","title_canon_sha256":"a7bbb5f92a7606b687cf40a77e8466ec28812716c311cc4721821dbf7101a623"},"schema_version":"1.0","source":{"id":"2504.20256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20256","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20256v1","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20256","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"WW7GCEXHW6GY","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"pith_short_16","alias_value":"WW7GCEXHW6GY57X2","created_at":"2026-07-05T10:55:39Z"},{"alias_kind":"pith_short_8","alias_value":"WW7GCEXH","created_at":"2026-07-05T10:55:39Z"}],"graph_snapshots":[{"event_id":"sha256:38311b768c32a78c1e3e40acf9a1764659e36ebc5fe8bf4df798929b1e89cc6c","target":"graph","created_at":"2026-07-05T10:55:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.20256/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Derek W. Jollie, Scott G. McCalla","cross_cats":["cs.LG","cs.NA","math.DS","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-28T21:01:07Z","title":"Optimizing Hard Thresholding for Sparse Model Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20256","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:30a6cb005a22e6494e671c385762e302f2af470af92173013485c6f87b87d5f1","target":"record","created_at":"2026-07-05T10:55:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0626260dea9c4e7e460f22bf79bdf1212ca1f5c519d0d49675269a8d6cc2974f","cross_cats_sorted":["cs.LG","cs.NA","math.DS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-28T21:01:07Z","title_canon_sha256":"a7bbb5f92a7606b687cf40a77e8466ec28812716c311cc4721821dbf7101a623"},"schema_version":"1.0","source":{"id":"2504.20256","kind":"arxiv","version":1}},"canonical_sha256":"b5be6112e7b78d8efefaa28d54b07bdb4349a322d8333e91e25e849a6d8e3a58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5be6112e7b78d8efefaa28d54b07bdb4349a322d8333e91e25e849a6d8e3a58","first_computed_at":"2026-07-05T10:55:39.261512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:39.261512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMD7RqaQP6oYNzQnl4C0kSgRLCZi+0CQk9vvglwMEyXUSKvthZYw8aisBGVsy6mECZlsDjPIXukUdJSPgnF8Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:39.261919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.20256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30a6cb005a22e6494e671c385762e302f2af470af92173013485c6f87b87d5f1","sha256:38311b768c32a78c1e3e40acf9a1764659e36ebc5fe8bf4df798929b1e89cc6c"],"state_sha256":"c02568015e0c93585058b961a32e60a254be5daeddad1c077a777f7a67858258"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7c3VHIqUW874L1PHEdQ1B1Y4lSR4wPOERAk0irBBcbl7BT+lOxas5yiRKgNtN2PmyiAbFX0iAAy9t1p4zedBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T07:34:56.948210Z","bundle_sha256":"5e63c455109cb70eb36da389a9749ee52d25a027a930f4cce0d9f17dabbc4283"}}