{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7MOQ2XTZAF33CGYAZYYYGXML4U","short_pith_number":"pith:7MOQ2XTZ","schema_version":"1.0","canonical_sha256":"fb1d0d5e790177b11b00ce31835d8be53533d4e1cd0a8029616e6efbab6e002f","source":{"kind":"arxiv","id":"1602.03436","version":3},"attestation_state":"computed","paper":{"title":"High-Dimensional Estimation of Structured Signals from Non-Linear Observations with General Convex Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Martin Genzel","submitted_at":"2016-02-10T16:35:36Z","abstract_excerpt":"In this paper, we study the issue of estimating a structured signal $x_0 \\in \\mathbb{R}^n$ from non-linear and noisy Gaussian observations. Supposing that $x_0$ is contained in a certain convex subset $K \\subset \\mathbb{R}^n$, we prove that accurate recovery is already feasible if the number of observations exceeds the effective dimension of $K$, which is a common measure for the complexity of signal classes. It will turn out that the possibly unknown non-linearity of our model affects the error rate only by a multiplicative constant. This achievement is based on recent works by Plan and Versh"},"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":"1602.03436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-10T16:35:36Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"c1724846ed34414c8e2b4abdb22b347892dd6ff8504a38052f109e132a9c57f5","abstract_canon_sha256":"3d370eee85194d848fce5afc83b02b8ff9a6a75f641fe6dd4d750c90aa2c755b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:31.144098Z","signature_b64":"cBt9Nuvd2gwwqQJ58Di0Z0WSpjuQ48hHiPIWzmmzqNmZBJAzCWBZtj5uV0LprbeqD5qHXd8QbwLpC9cq1tfUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb1d0d5e790177b11b00ce31835d8be53533d4e1cd0a8029616e6efbab6e002f","last_reissued_at":"2026-05-18T00:50:31.143505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:31.143505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Dimensional Estimation of Structured Signals from Non-Linear Observations with General Convex Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Martin Genzel","submitted_at":"2016-02-10T16:35:36Z","abstract_excerpt":"In this paper, we study the issue of estimating a structured signal $x_0 \\in \\mathbb{R}^n$ from non-linear and noisy Gaussian observations. Supposing that $x_0$ is contained in a certain convex subset $K \\subset \\mathbb{R}^n$, we prove that accurate recovery is already feasible if the number of observations exceeds the effective dimension of $K$, which is a common measure for the complexity of signal classes. It will turn out that the possibly unknown non-linearity of our model affects the error rate only by a multiplicative constant. This achievement is based on recent works by Plan and Versh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03436","kind":"arxiv","version":3},"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":"1602.03436","created_at":"2026-05-18T00:50:31.143616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03436v3","created_at":"2026-05-18T00:50:31.143616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03436","created_at":"2026-05-18T00:50:31.143616+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MOQ2XTZAF33","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MOQ2XTZAF33CGYA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MOQ2XTZ","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04433","citing_title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U","json":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U.json","graph_json":"https://pith.science/api/pith-number/7MOQ2XTZAF33CGYAZYYYGXML4U/graph.json","events_json":"https://pith.science/api/pith-number/7MOQ2XTZAF33CGYAZYYYGXML4U/events.json","paper":"https://pith.science/paper/7MOQ2XTZ"},"agent_actions":{"view_html":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U","download_json":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U.json","view_paper":"https://pith.science/paper/7MOQ2XTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03436&json=true","fetch_graph":"https://pith.science/api/pith-number/7MOQ2XTZAF33CGYAZYYYGXML4U/graph.json","fetch_events":"https://pith.science/api/pith-number/7MOQ2XTZAF33CGYAZYYYGXML4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U/action/storage_attestation","attest_author":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U/action/author_attestation","sign_citation":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U/action/citation_signature","submit_replication":"https://pith.science/pith/7MOQ2XTZAF33CGYAZYYYGXML4U/action/replication_record"}},"created_at":"2026-05-18T00:50:31.143616+00:00","updated_at":"2026-05-18T00:50:31.143616+00:00"}