{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XKB276ZB53VBUCBH5OMUTCEZBR","short_pith_number":"pith:XKB276ZB","schema_version":"1.0","canonical_sha256":"ba83affb21eeea1a0827eb994988990c7fb7e42e8d5935008b6ab467f5d9d173","source":{"kind":"arxiv","id":"1902.06522","version":1},"attestation_state":"computed","paper":{"title":"Designing recurrent neural networks by unfolding an l1-l1 minimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hung Duy Le, Huynh Van Luong, Nikos Deligiannis","submitted_at":"2019-02-18T11:34:51Z","abstract_excerpt":"We propose a new deep recurrent neural network (RNN) architecture for sequential signal reconstruction. Our network is designed by unfolding the iterations of the proximal gradient method that solves the l1-l1 minimization problem. As such, our network leverages by design that signals have a sparse representation and that the difference between consecutive signal representations is also sparse. We evaluate the proposed model in the task of reconstructing video frames from compressive measurements and show that it outperforms several state-of-the-art RNN models."},"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":"1902.06522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-18T11:34:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d135603557fea0e9ef0bea639c9f5c9fb36930a7e18883746b04f79df4ecefa1","abstract_canon_sha256":"b0e4497d4847b318d5949a267fb8b6bf9ae8ac97b5556f3f8c64ea065202c6cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.217109Z","signature_b64":"W7zof0dkvvfLoivsDZ8Dd/ja5l1VaOHy5p3LQ5i2nzhMkvCnBj5gArrpThPO09192nMiBg+QJ583aseF1GA1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba83affb21eeea1a0827eb994988990c7fb7e42e8d5935008b6ab467f5d9d173","last_reissued_at":"2026-05-17T23:53:45.216427Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.216427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing recurrent neural networks by unfolding an l1-l1 minimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hung Duy Le, Huynh Van Luong, Nikos Deligiannis","submitted_at":"2019-02-18T11:34:51Z","abstract_excerpt":"We propose a new deep recurrent neural network (RNN) architecture for sequential signal reconstruction. Our network is designed by unfolding the iterations of the proximal gradient method that solves the l1-l1 minimization problem. As such, our network leverages by design that signals have a sparse representation and that the difference between consecutive signal representations is also sparse. We evaluate the proposed model in the task of reconstructing video frames from compressive measurements and show that it outperforms several state-of-the-art RNN models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06522","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":"1902.06522","created_at":"2026-05-17T23:53:45.216542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06522v1","created_at":"2026-05-17T23:53:45.216542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06522","created_at":"2026-05-17T23:53:45.216542+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKB276ZB53VB","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKB276ZB53VBUCBH","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKB276ZB","created_at":"2026-05-18T12:33:33.725879+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/XKB276ZB53VBUCBH5OMUTCEZBR","json":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR.json","graph_json":"https://pith.science/api/pith-number/XKB276ZB53VBUCBH5OMUTCEZBR/graph.json","events_json":"https://pith.science/api/pith-number/XKB276ZB53VBUCBH5OMUTCEZBR/events.json","paper":"https://pith.science/paper/XKB276ZB"},"agent_actions":{"view_html":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR","download_json":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR.json","view_paper":"https://pith.science/paper/XKB276ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06522&json=true","fetch_graph":"https://pith.science/api/pith-number/XKB276ZB53VBUCBH5OMUTCEZBR/graph.json","fetch_events":"https://pith.science/api/pith-number/XKB276ZB53VBUCBH5OMUTCEZBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR/action/storage_attestation","attest_author":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR/action/author_attestation","sign_citation":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR/action/citation_signature","submit_replication":"https://pith.science/pith/XKB276ZB53VBUCBH5OMUTCEZBR/action/replication_record"}},"created_at":"2026-05-17T23:53:45.216542+00:00","updated_at":"2026-05-17T23:53:45.216542+00:00"}