{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7PIZKHR2HZ2DPYCM5SOJINEKUK","short_pith_number":"pith:7PIZKHR2","schema_version":"1.0","canonical_sha256":"fbd1951e3a3e7437e04cec9c94348aa2b7ca97136677810b98a25247e8044407","source":{"kind":"arxiv","id":"1705.02837","version":1},"attestation_state":"computed","paper":{"title":"On a class of optimization-based robust estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Laurent Bako","submitted_at":"2017-05-08T11:55:56Z","abstract_excerpt":"We consider in this paper the problem of estimating a parameter matrix from observations which are affected by two types of noise components: (i) a sparse noise sequence which, whenever nonzero can have arbitrarily large amplitude (ii) and a dense and bounded noise sequence of \"moderate\" amount. This is termed a robust regression problem. To tackle it, a quite general optimization-based framework is proposed and analyzed. When only the sparse noise is present, a sufficient bound is derived on the number of nonzero elements in the sparse noise sequence that can be accommodated by the estimator "},"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":"1705.02837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-08T11:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"e326f18dbbd3a113d886dd85e34c26798468c417025e27ddcc2a4684a1062a2e","abstract_canon_sha256":"7d9c76553910d949e80085ee9b397a60fd8ceb2134c08f6b653f3da5c4429c40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:19.582155Z","signature_b64":"qccyVQzjdt+DowXGVAQbpegs6JrTC6GF0/x3c0BdNaaJilE2G1H0Cp9N7qhdE3g/h8l7eEkJAX7cM/Guptf0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd1951e3a3e7437e04cec9c94348aa2b7ca97136677810b98a25247e8044407","last_reissued_at":"2026-05-18T00:31:19.581123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:19.581123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a class of optimization-based robust estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Laurent Bako","submitted_at":"2017-05-08T11:55:56Z","abstract_excerpt":"We consider in this paper the problem of estimating a parameter matrix from observations which are affected by two types of noise components: (i) a sparse noise sequence which, whenever nonzero can have arbitrarily large amplitude (ii) and a dense and bounded noise sequence of \"moderate\" amount. This is termed a robust regression problem. To tackle it, a quite general optimization-based framework is proposed and analyzed. When only the sparse noise is present, a sufficient bound is derived on the number of nonzero elements in the sparse noise sequence that can be accommodated by the estimator "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02837","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":"1705.02837","created_at":"2026-05-18T00:31:19.581549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02837v1","created_at":"2026-05-18T00:31:19.581549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02837","created_at":"2026-05-18T00:31:19.581549+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PIZKHR2HZ2D","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PIZKHR2HZ2DPYCM","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PIZKHR2","created_at":"2026-05-18T12:31:05.417338+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/7PIZKHR2HZ2DPYCM5SOJINEKUK","json":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK.json","graph_json":"https://pith.science/api/pith-number/7PIZKHR2HZ2DPYCM5SOJINEKUK/graph.json","events_json":"https://pith.science/api/pith-number/7PIZKHR2HZ2DPYCM5SOJINEKUK/events.json","paper":"https://pith.science/paper/7PIZKHR2"},"agent_actions":{"view_html":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK","download_json":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK.json","view_paper":"https://pith.science/paper/7PIZKHR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02837&json=true","fetch_graph":"https://pith.science/api/pith-number/7PIZKHR2HZ2DPYCM5SOJINEKUK/graph.json","fetch_events":"https://pith.science/api/pith-number/7PIZKHR2HZ2DPYCM5SOJINEKUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/action/storage_attestation","attest_author":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/action/author_attestation","sign_citation":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/action/citation_signature","submit_replication":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/action/replication_record"}},"created_at":"2026-05-18T00:31:19.581549+00:00","updated_at":"2026-05-18T00:31:19.581549+00:00"}