{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TOZZN4UVDBJ3D6QV4ZBCYUBQYF","short_pith_number":"pith:TOZZN4UV","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"},"canonical_sha256":"9bb396f2951853b1fa15e6422c5030c176424e66f0d2a8b2605441b46c88c7c1","source":{"kind":"arxiv","id":"1605.08201","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08201","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08201v2","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08201","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"TOZZN4UVDBJ3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOZZN4UVDBJ3D6QV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOZZN4UV","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TOZZN4UVDBJ3D6QV4ZBCYUBQYF","target":"record","payload":{"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"},"canonical_sha256":"9bb396f2951853b1fa15e6422c5030c176424e66f0d2a8b2605441b46c88c7c1","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"},"source_kind":"arxiv","source_id":"1605.08201","source_version":2,"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhTOZgV1gUQNTzwd86AO1pKj7hq99DJzg882Illq+sh46fTLyFKbHG4wNenrUwS3KeJlpH6AA1jgcl+VxipPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:07:31.669597Z"},"content_sha256":"db72f89fa356c25574d4b29d68338811623fb91cc52164238d2a44d74c3a20a0","schema_version":"1.0","event_id":"sha256:db72f89fa356c25574d4b29d68338811623fb91cc52164238d2a44d74c3a20a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TOZZN4UVDBJ3D6QV4ZBCYUBQYF","target":"graph","payload":{"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"},"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jlh33r96aIryuEYvipOWKSDlzmN5eCN7pvkspDdohG1EPxsE6yS2fToxH5vzq6CLHLMpp4WVyU09bQk3DLZTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:07:31.670077Z"},"content_sha256":"fddcc0400d4c6783691f219f3341b2a62a2dd4b97587c0a399a80947ec47ece1","schema_version":"1.0","event_id":"sha256:fddcc0400d4c6783691f219f3341b2a62a2dd4b97587c0a399a80947ec47ece1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/bundle.json","state_url":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/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-22T22:07:31Z","links":{"resolver":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF","bundle":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/bundle.json","state":"https://pith.science/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOZZN4UVDBJ3D6QV4ZBCYUBQYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TOZZN4UVDBJ3D6QV4ZBCYUBQYF","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":"d0c21edf8646eda4acac1a2c93b27f30b9c70f0deb3b8702e25b98ccf890d439","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-26T09:17:05Z","title_canon_sha256":"7b1897921cc0d70581192f5c34ed56416acd2558b86b7b895a7b04b57603405b"},"schema_version":"1.0","source":{"id":"1605.08201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08201","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08201v2","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08201","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"TOZZN4UVDBJ3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOZZN4UVDBJ3D6QV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOZZN4UV","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:fddcc0400d4c6783691f219f3341b2a62a2dd4b97587c0a399a80947ec47ece1","target":"graph","created_at":"2026-05-18T01:06:20Z","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":"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","authors_text":"S{\\l}awomir Sta\\'nczak, Steffen Limmer","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-26T09:17:05Z","title":"Towards optimal nonlinearities for sparse recovery using higher-order statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08201","kind":"arxiv","version":2},"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:db72f89fa356c25574d4b29d68338811623fb91cc52164238d2a44d74c3a20a0","target":"record","created_at":"2026-05-18T01:06:20Z","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":"d0c21edf8646eda4acac1a2c93b27f30b9c70f0deb3b8702e25b98ccf890d439","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-26T09:17:05Z","title_canon_sha256":"7b1897921cc0d70581192f5c34ed56416acd2558b86b7b895a7b04b57603405b"},"schema_version":"1.0","source":{"id":"1605.08201","kind":"arxiv","version":2}},"canonical_sha256":"9bb396f2951853b1fa15e6422c5030c176424e66f0d2a8b2605441b46c88c7c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bb396f2951853b1fa15e6422c5030c176424e66f0d2a8b2605441b46c88c7c1","first_computed_at":"2026-05-18T01:06:20.617338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:20.617338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5nO/jgYXVk1Yr7e7AdFJ3hCn8CS2IoKQ8AWZfmcQ0U1CuDLMiOficpDRHs8ASOpoZH6fIPBqmEuDdILfTro0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:20.618075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db72f89fa356c25574d4b29d68338811623fb91cc52164238d2a44d74c3a20a0","sha256:fddcc0400d4c6783691f219f3341b2a62a2dd4b97587c0a399a80947ec47ece1"],"state_sha256":"96191916b1d2b1b679e07718762bee6f75c2d3680103f09e33f7a4c8781d046f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbi4qL92K39b+23uMya+VZKeWXZdpDeOieP52AgvCeZ/uxSpZiuRKR/PjCE7H+wqHdgYlBOdLf4IkkqU7+TwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:07:31.672736Z","bundle_sha256":"9f903f4511c950870a745024b99718e8c2ad9770701cfc5ebfcd850b595e7542"}}