{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7PIZKHR2HZ2DPYCM5SOJINEKUK","short_pith_number":"pith:7PIZKHR2","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"},"canonical_sha256":"fbd1951e3a3e7437e04cec9c94348aa2b7ca97136677810b98a25247e8044407","source":{"kind":"arxiv","id":"1705.02837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02837","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02837v1","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02837","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"7PIZKHR2HZ2D","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7PIZKHR2HZ2DPYCM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7PIZKHR2","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7PIZKHR2HZ2DPYCM5SOJINEKUK","target":"record","payload":{"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"},"canonical_sha256":"fbd1951e3a3e7437e04cec9c94348aa2b7ca97136677810b98a25247e8044407","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"},"source_kind":"arxiv","source_id":"1705.02837","source_version":1,"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-18T00:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKThZZFAatta12LEN13JDPN0Nt5gEblhFaxaNHIMLvnTa7kcGS/Oh+19Zq3fnZbSo2zEYbMmYD6zONrpezOMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:28:15.863432Z"},"content_sha256":"33aeb67cf242a6228565239a75f1b23ee7b258f6c0d60e3f8d0df08eb2a86165","schema_version":"1.0","event_id":"sha256:33aeb67cf242a6228565239a75f1b23ee7b258f6c0d60e3f8d0df08eb2a86165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7PIZKHR2HZ2DPYCM5SOJINEKUK","target":"graph","payload":{"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"},"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-18T00:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bENdXaIOn3qAPYj00tSfaHR1CvgVkFtDW2GbNJwNHnihJvRu1TTAndQIIm9OMh66+Si2cgzXnPA9FAMaY8XQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:28:15.863765Z"},"content_sha256":"31d3f414b44f2ca2ae3bf8c80aa61f3b081728554733d24d25c033e152da6071","schema_version":"1.0","event_id":"sha256:31d3f414b44f2ca2ae3bf8c80aa61f3b081728554733d24d25c033e152da6071"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/bundle.json","state_url":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/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-07-03T13:28:15Z","links":{"resolver":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK","bundle":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/bundle.json","state":"https://pith.science/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PIZKHR2HZ2DPYCM5SOJINEKUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7PIZKHR2HZ2DPYCM5SOJINEKUK","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":"7d9c76553910d949e80085ee9b397a60fd8ceb2134c08f6b653f3da5c4429c40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-08T11:55:56Z","title_canon_sha256":"e326f18dbbd3a113d886dd85e34c26798468c417025e27ddcc2a4684a1062a2e"},"schema_version":"1.0","source":{"id":"1705.02837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02837","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02837v1","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02837","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"7PIZKHR2HZ2D","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7PIZKHR2HZ2DPYCM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7PIZKHR2","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:31d3f414b44f2ca2ae3bf8c80aa61f3b081728554733d24d25c033e152da6071","target":"graph","created_at":"2026-05-18T00:31:19Z","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 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 ","authors_text":"Laurent Bako","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-08T11:55:56Z","title":"On a class of optimization-based robust estimators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02837","kind":"arxiv","version":1},"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:33aeb67cf242a6228565239a75f1b23ee7b258f6c0d60e3f8d0df08eb2a86165","target":"record","created_at":"2026-05-18T00:31:19Z","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":"7d9c76553910d949e80085ee9b397a60fd8ceb2134c08f6b653f3da5c4429c40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-08T11:55:56Z","title_canon_sha256":"e326f18dbbd3a113d886dd85e34c26798468c417025e27ddcc2a4684a1062a2e"},"schema_version":"1.0","source":{"id":"1705.02837","kind":"arxiv","version":1}},"canonical_sha256":"fbd1951e3a3e7437e04cec9c94348aa2b7ca97136677810b98a25247e8044407","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbd1951e3a3e7437e04cec9c94348aa2b7ca97136677810b98a25247e8044407","first_computed_at":"2026-05-18T00:31:19.581123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:19.581123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qccyVQzjdt+DowXGVAQbpegs6JrTC6GF0/x3c0BdNaaJilE2G1H0Cp9N7qhdE3g/h8l7eEkJAX7cM/Guptf0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:19.582155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33aeb67cf242a6228565239a75f1b23ee7b258f6c0d60e3f8d0df08eb2a86165","sha256:31d3f414b44f2ca2ae3bf8c80aa61f3b081728554733d24d25c033e152da6071"],"state_sha256":"35eaea2d36c6e7b8a92798701d94c04f3ca1b1bd9b9be71dc7a97de3cf929449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EXrLZKqeqVnng6tMDUJjtno5QgWYBT/aoDsVMBq8FYkqpYlLY+NAWuWEd57f/rkTdL2Vmo05BqjKVB29JzJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T13:28:15.865600Z","bundle_sha256":"c6ac4de6bff3d6e5dd3ee44e73a7b427c9589b885192a1b7774eda258d04f4a7"}}