{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TZ25N4HDIUOITAEX5H7TOQGX5Y","short_pith_number":"pith:TZ25N4HD","canonical_record":{"source":{"id":"1512.04754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-15T12:20:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dcf634f7571307cf44c3e18efe53af26337aa9656c9a86f976692480b84d9153","abstract_canon_sha256":"fba6ec7a268e786c623bb37c42284861406e718e849bffcde0dd5f588cc18420"},"schema_version":"1.0"},"canonical_sha256":"9e75d6f0e3451c898097e9ff3740d7ee137f07c6283e2d26a2f7d04b7dda2271","source":{"kind":"arxiv","id":"1512.04754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04754","created_at":"2026-05-18T01:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04754v1","created_at":"2026-05-18T01:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04754","created_at":"2026-05-18T01:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"TZ25N4HDIUOI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TZ25N4HDIUOITAEX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TZ25N4HD","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TZ25N4HDIUOITAEX5H7TOQGX5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-15T12:20:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dcf634f7571307cf44c3e18efe53af26337aa9656c9a86f976692480b84d9153","abstract_canon_sha256":"fba6ec7a268e786c623bb37c42284861406e718e849bffcde0dd5f588cc18420"},"schema_version":"1.0"},"canonical_sha256":"9e75d6f0e3451c898097e9ff3740d7ee137f07c6283e2d26a2f7d04b7dda2271","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:43.448616Z","signature_b64":"z2Rw936qnXK/dWNy0JfIMjS1FkqGPm+xGCjf5EDsnItyQSw5iCpzLhoImaJ/jKWVoF1G7EnAqFJqa2R3xlyEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e75d6f0e3451c898097e9ff3740d7ee137f07c6283e2d26a2f7d04b7dda2271","last_reissued_at":"2026-05-18T01:15:43.448127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:43.448127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04754","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-05-18T01:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gg3S0ze4yPE+4snvucnMjwFfKZoVno8BTudtpRWgb62Y7GNesoHXyCVVAhSyzD7VmjHRv+NuVkJETnZ5QtNmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:30:20.918831Z"},"content_sha256":"f471a648cc2b133a000ecaae01aeadfbd76d8d4bce2555ac1945d57d18974cc2","schema_version":"1.0","event_id":"sha256:f471a648cc2b133a000ecaae01aeadfbd76d8d4bce2555ac1945d57d18974cc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TZ25N4HDIUOITAEX5H7TOQGX5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning optimal nonlinearities for iterative thresholding algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hassan Mansour, Ulugbek S. Kamilov","submitted_at":"2015-12-15T12:20:17Z","abstract_excerpt":"Iterative shrinkage/thresholding algorithm (ISTA) is a well-studied method for finding sparse solutions to ill-posed inverse problems. In this letter, we present a data-driven scheme for learning optimal thresholding functions for ISTA. The proposed scheme is obtained by relating iterations of ISTA to layers of a simple deep neural network (DNN) and developing a corresponding error backpropagation algorithm that allows to fine-tune the thresholding functions. Simulations on sparse statistical signals illustrate potential gains in estimation quality due to the proposed data adaptive ISTA."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04754","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"},"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-05-18T01:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOCp4fTO/LS9Zl7cQK3V0pl59YxjDc/CcrdkKwnxYJXQkY91ROR8vw6VxTh+dqVQG+P4VC0gMSdiVae8cLVzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:30:20.919192Z"},"content_sha256":"e66b851560549ba965ab6086945280bec4e11693546801ff0bbdb8165dfe1e91","schema_version":"1.0","event_id":"sha256:e66b851560549ba965ab6086945280bec4e11693546801ff0bbdb8165dfe1e91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y/bundle.json","state_url":"https://pith.science/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y/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-06-02T23:30:20Z","links":{"resolver":"https://pith.science/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y","bundle":"https://pith.science/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y/bundle.json","state":"https://pith.science/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZ25N4HDIUOITAEX5H7TOQGX5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TZ25N4HDIUOITAEX5H7TOQGX5Y","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":"fba6ec7a268e786c623bb37c42284861406e718e849bffcde0dd5f588cc18420","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-15T12:20:17Z","title_canon_sha256":"dcf634f7571307cf44c3e18efe53af26337aa9656c9a86f976692480b84d9153"},"schema_version":"1.0","source":{"id":"1512.04754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04754","created_at":"2026-05-18T01:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04754v1","created_at":"2026-05-18T01:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04754","created_at":"2026-05-18T01:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"TZ25N4HDIUOI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TZ25N4HDIUOITAEX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TZ25N4HD","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:e66b851560549ba965ab6086945280bec4e11693546801ff0bbdb8165dfe1e91","target":"graph","created_at":"2026-05-18T01:15:43Z","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"},"paper":{"abstract_excerpt":"Iterative shrinkage/thresholding algorithm (ISTA) is a well-studied method for finding sparse solutions to ill-posed inverse problems. In this letter, we present a data-driven scheme for learning optimal thresholding functions for ISTA. The proposed scheme is obtained by relating iterations of ISTA to layers of a simple deep neural network (DNN) and developing a corresponding error backpropagation algorithm that allows to fine-tune the thresholding functions. Simulations on sparse statistical signals illustrate potential gains in estimation quality due to the proposed data adaptive ISTA.","authors_text":"Hassan Mansour, Ulugbek S. Kamilov","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-15T12:20:17Z","title":"Learning optimal nonlinearities for iterative thresholding algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04754","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:f471a648cc2b133a000ecaae01aeadfbd76d8d4bce2555ac1945d57d18974cc2","target":"record","created_at":"2026-05-18T01:15:43Z","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":"fba6ec7a268e786c623bb37c42284861406e718e849bffcde0dd5f588cc18420","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-15T12:20:17Z","title_canon_sha256":"dcf634f7571307cf44c3e18efe53af26337aa9656c9a86f976692480b84d9153"},"schema_version":"1.0","source":{"id":"1512.04754","kind":"arxiv","version":1}},"canonical_sha256":"9e75d6f0e3451c898097e9ff3740d7ee137f07c6283e2d26a2f7d04b7dda2271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e75d6f0e3451c898097e9ff3740d7ee137f07c6283e2d26a2f7d04b7dda2271","first_computed_at":"2026-05-18T01:15:43.448127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:43.448127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2Rw936qnXK/dWNy0JfIMjS1FkqGPm+xGCjf5EDsnItyQSw5iCpzLhoImaJ/jKWVoF1G7EnAqFJqa2R3xlyEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:43.448616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f471a648cc2b133a000ecaae01aeadfbd76d8d4bce2555ac1945d57d18974cc2","sha256:e66b851560549ba965ab6086945280bec4e11693546801ff0bbdb8165dfe1e91"],"state_sha256":"fa0d70c5af8c9d6bd8c795db6306db6771abad30b4b05b9acc32fe31aae4e034"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1XM3rr0IowTXLgcnMdLkpUcQ0ugzTfSsclIDHAPy0/YOiFz+24tS5/GEdRdXcnMEuZlR2CIkbRwqAKq87dFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:30:20.922488Z","bundle_sha256":"2e20a15ecc3e47dbcc6e13a6b3e9b32c040b0bcbfab7b1e1885b3aed8b2f5045"}}