{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7WZNKW6SBR6PHCHQZAQP7SSGCP","short_pith_number":"pith:7WZNKW6S","schema_version":"1.0","canonical_sha256":"fdb2d55bd20c7cf388f0c820ffca4613fe48c8e332eaf74af52e3f2a62138440","source":{"kind":"arxiv","id":"1705.07290","version":1},"attestation_state":"computed","paper":{"title":"Deep Sparse Coding Using Optimized Linear Expansion of Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandra Sekhar Seelamantula, Debabrata Mahapatra, Subhadip Mukherjee","submitted_at":"2017-05-20T11:14:39Z","abstract_excerpt":"We address the problem of reconstructing sparse signals from noisy and compressive measurements using a feed-forward deep neural network (DNN) with an architecture motivated by the iterative shrinkage-thresholding algorithm (ISTA). We maintain the weights and biases of the network links as prescribed by ISTA and model the nonlinear activation function using a linear expansion of thresholds (LET), which has been very successful in image denoising and deconvolution. The optimal set of coefficients of the parametrized activation is learned over a training dataset containing measurement-sparse sig"},"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":"1705.07290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-20T11:14:39Z","cross_cats_sorted":[],"title_canon_sha256":"bdd46368a01d601aa407eef409b26a2fda901fd178ada9a25d2652ef548660b0","abstract_canon_sha256":"8e99dd851e5672ff9672aada4f7cf886377f8d6a0cfbd409a245526a32d9743b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.044522Z","signature_b64":"spEkntIUbZmhAIkfdFgvTiOuOitvFuorhbhq8V6kqGbaUE4BWcOczVqZYoOdISEgv+WYUfi6HiCnVhpuZt0rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdb2d55bd20c7cf388f0c820ffca4613fe48c8e332eaf74af52e3f2a62138440","last_reissued_at":"2026-05-18T00:44:06.043982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.043982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Sparse Coding Using Optimized Linear Expansion of Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandra Sekhar Seelamantula, Debabrata Mahapatra, Subhadip Mukherjee","submitted_at":"2017-05-20T11:14:39Z","abstract_excerpt":"We address the problem of reconstructing sparse signals from noisy and compressive measurements using a feed-forward deep neural network (DNN) with an architecture motivated by the iterative shrinkage-thresholding algorithm (ISTA). We maintain the weights and biases of the network links as prescribed by ISTA and model the nonlinear activation function using a linear expansion of thresholds (LET), which has been very successful in image denoising and deconvolution. The optimal set of coefficients of the parametrized activation is learned over a training dataset containing measurement-sparse sig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07290","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.07290","created_at":"2026-05-18T00:44:06.044070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07290v1","created_at":"2026-05-18T00:44:06.044070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07290","created_at":"2026-05-18T00:44:06.044070+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WZNKW6SBR6P","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WZNKW6SBR6PHCHQ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WZNKW6S","created_at":"2026-05-18T12:31:05.417338+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/7WZNKW6SBR6PHCHQZAQP7SSGCP","json":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP.json","graph_json":"https://pith.science/api/pith-number/7WZNKW6SBR6PHCHQZAQP7SSGCP/graph.json","events_json":"https://pith.science/api/pith-number/7WZNKW6SBR6PHCHQZAQP7SSGCP/events.json","paper":"https://pith.science/paper/7WZNKW6S"},"agent_actions":{"view_html":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP","download_json":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP.json","view_paper":"https://pith.science/paper/7WZNKW6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07290&json=true","fetch_graph":"https://pith.science/api/pith-number/7WZNKW6SBR6PHCHQZAQP7SSGCP/graph.json","fetch_events":"https://pith.science/api/pith-number/7WZNKW6SBR6PHCHQZAQP7SSGCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP/action/storage_attestation","attest_author":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP/action/author_attestation","sign_citation":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP/action/citation_signature","submit_replication":"https://pith.science/pith/7WZNKW6SBR6PHCHQZAQP7SSGCP/action/replication_record"}},"created_at":"2026-05-18T00:44:06.044070+00:00","updated_at":"2026-05-18T00:44:06.044070+00:00"}