{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M2GMXHZOOXI457OA5E4W2DP6OK","short_pith_number":"pith:M2GMXHZO","schema_version":"1.0","canonical_sha256":"668ccb9f2e75d1cefdc0e9396d0dfe729202b8b00827743757bfb59be0260e61","source":{"kind":"arxiv","id":"2105.06211","version":1},"attestation_state":"computed","paper":{"title":"Quantized Proximal Averaging Network for Analysis Sparse Coding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chandra Sekhar Seelamantula, Kartheek Kumar Reddy Nareddy, Mani Madhoolika Bulusu, Praveen Kumar Pokala","submitted_at":"2021-05-13T12:05:35Z","abstract_excerpt":"We solve the analysis sparse coding problem considering a combination of convex and non-convex sparsity promoting penalties. The multi-penalty formulation results in an iterative algorithm involving proximal-averaging. We then unfold the iterative algorithm into a trainable network that facilitates learning the sparsity prior. We also consider quantization of the network weights. Quantization makes neural networks efficient both in terms of memory and computation during inference, and also renders them compatible for low-precision hardware deployment. Our learning algorithm is based on a varia"},"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":"2105.06211","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-13T12:05:35Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a66c2778d565ce5e15fa3067676357594e98128ba510fb28606776ab3c5a65dd","abstract_canon_sha256":"ca61a1312c9f13cdf617c7e67fd9e81f4016898e25f709c90f6cde3c2d1d6c33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:05.248648Z","signature_b64":"hgiCmwhDp4XuDFUQdtVx/WN2Ctueqg4IO+6FxJRDoiojp3MNgcpMiDuL6PWdIJV/J12NiWl/vObrOQfDHNoFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668ccb9f2e75d1cefdc0e9396d0dfe729202b8b00827743757bfb59be0260e61","last_reissued_at":"2026-07-05T02:40:05.248136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:05.248136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantized Proximal Averaging Network for Analysis Sparse Coding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chandra Sekhar Seelamantula, Kartheek Kumar Reddy Nareddy, Mani Madhoolika Bulusu, Praveen Kumar Pokala","submitted_at":"2021-05-13T12:05:35Z","abstract_excerpt":"We solve the analysis sparse coding problem considering a combination of convex and non-convex sparsity promoting penalties. The multi-penalty formulation results in an iterative algorithm involving proximal-averaging. We then unfold the iterative algorithm into a trainable network that facilitates learning the sparsity prior. We also consider quantization of the network weights. Quantization makes neural networks efficient both in terms of memory and computation during inference, and also renders them compatible for low-precision hardware deployment. Our learning algorithm is based on a varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.06211","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/2105.06211/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":"2105.06211","created_at":"2026-07-05T02:40:05.248188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.06211v1","created_at":"2026-07-05T02:40:05.248188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.06211","created_at":"2026-07-05T02:40:05.248188+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2GMXHZOOXI4","created_at":"2026-07-05T02:40:05.248188+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2GMXHZOOXI457OA","created_at":"2026-07-05T02:40:05.248188+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2GMXHZO","created_at":"2026-07-05T02:40:05.248188+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/M2GMXHZOOXI457OA5E4W2DP6OK","json":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK.json","graph_json":"https://pith.science/api/pith-number/M2GMXHZOOXI457OA5E4W2DP6OK/graph.json","events_json":"https://pith.science/api/pith-number/M2GMXHZOOXI457OA5E4W2DP6OK/events.json","paper":"https://pith.science/paper/M2GMXHZO"},"agent_actions":{"view_html":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK","download_json":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK.json","view_paper":"https://pith.science/paper/M2GMXHZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.06211&json=true","fetch_graph":"https://pith.science/api/pith-number/M2GMXHZOOXI457OA5E4W2DP6OK/graph.json","fetch_events":"https://pith.science/api/pith-number/M2GMXHZOOXI457OA5E4W2DP6OK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK/action/storage_attestation","attest_author":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK/action/author_attestation","sign_citation":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK/action/citation_signature","submit_replication":"https://pith.science/pith/M2GMXHZOOXI457OA5E4W2DP6OK/action/replication_record"}},"created_at":"2026-07-05T02:40:05.248188+00:00","updated_at":"2026-07-05T02:40:05.248188+00:00"}