{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TOZZN4UVDBJ3D6QV4ZBCYUBQYF","short_pith_number":"pith:TOZZN4UV","schema_version":"1.0","canonical_sha256":"9bb396f2951853b1fa15e6422c5030c176424e66f0d2a8b2605441b46c88c7c1","source":{"kind":"arxiv","id":"1605.08201","version":2},"attestation_state":"computed","paper":{"title":"Towards optimal nonlinearities for sparse recovery using higher-order statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"S{\\l}awomir Sta\\'nczak, Steffen Limmer","submitted_at":"2016-05-26T09:17:05Z","abstract_excerpt":"We consider machine learning techniques to develop low-latency approximate solutions to a class of inverse problems. More precisely, we use a probabilistic approach for the problem of recovering sparse stochastic signals that are members of the $\\ell_p$-balls. In this context, we analyze the Bayesian mean-square-error (MSE) for two types of estimators: (i) a linear estimator and (ii) a structured estimator composed of a linear operator followed by a Cartesian product of univariate nonlinear mappings. By construction, the complexity of the proposed nonlinear estimator is comparable to that of i"},"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":"1605.08201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-26T09:17:05Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"7b1897921cc0d70581192f5c34ed56416acd2558b86b7b895a7b04b57603405b","abstract_canon_sha256":"d0c21edf8646eda4acac1a2c93b27f30b9c70f0deb3b8702e25b98ccf890d439"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:20.618075Z","signature_b64":"5nO/jgYXVk1Yr7e7AdFJ3hCn8CS2IoKQ8AWZfmcQ0U1CuDLMiOficpDRHs8ASOpoZH6fIPBqmEuDdILfTro0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bb396f2951853b1fa15e6422c5030c176424e66f0d2a8b2605441b46c88c7c1","last_reissued_at":"2026-05-18T01:06:20.617338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:20.617338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards optimal nonlinearities for sparse recovery using higher-order statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"S{\\l}awomir Sta\\'nczak, Steffen Limmer","submitted_at":"2016-05-26T09:17:05Z","abstract_excerpt":"We consider machine learning techniques to develop low-latency approximate solutions to a class of inverse problems. More precisely, we use a probabilistic approach for the problem of recovering sparse stochastic signals that are members of the $\\ell_p$-balls. In this context, we analyze the Bayesian mean-square-error (MSE) for two types of estimators: (i) a linear estimator and (ii) a structured estimator composed of a linear operator followed by a Cartesian product of univariate nonlinear mappings. By construction, the complexity of the proposed nonlinear estimator is comparable to that of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08201","kind":"arxiv","version":2},"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":"1605.08201","created_at":"2026-05-18T01:06:20.617454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08201v2","created_at":"2026-05-18T01:06:20.617454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08201","created_at":"2026-05-18T01:06:20.617454+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOZZN4UVDBJ3","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOZZN4UVDBJ3D6QV","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOZZN4UV","created_at":"2026-05-18T12:30:46.583412+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/TOZZN4UVDBJ3D6QV4ZBCYUBQYF","json":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF.json","graph_json":"https://pith.science/api/pith-number/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/graph.json","events_json":"https://pith.science/api/pith-number/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/events.json","paper":"https://pith.science/paper/TOZZN4UV"},"agent_actions":{"view_html":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF","download_json":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF.json","view_paper":"https://pith.science/paper/TOZZN4UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08201&json=true","fetch_graph":"https://pith.science/api/pith-number/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/graph.json","fetch_events":"https://pith.science/api/pith-number/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/action/storage_attestation","attest_author":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/action/author_attestation","sign_citation":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/action/citation_signature","submit_replication":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/action/replication_record"}},"created_at":"2026-05-18T01:06:20.617454+00:00","updated_at":"2026-05-18T01:06:20.617454+00:00"}