{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E4EE3BBSYNCIZ3LGVC3MLO6WZ6","short_pith_number":"pith:E4EE3BBS","schema_version":"1.0","canonical_sha256":"27084d8432c3448ced66a8b6c5bbd6cf9df82413db98d974c1a37a91c6c85559","source":{"kind":"arxiv","id":"1203.4160","version":1},"attestation_state":"computed","paper":{"title":"A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Mehmet A. Donmez, Nargiz Kalantarova, Suleyman S. Kozat","submitted_at":"2012-03-19T16:50:16Z","abstract_excerpt":"In this correspondence, we introduce a minimax regret criteria to the least squares problems with bounded data uncertainties and solve it using semi-definite programming. We investigate a robust minimax least squares approach that minimizes a worst case difference regret. The regret is defined as the difference between a squared data error and the smallest attainable squared data error of a least squares estimator. We then propose a robust regularized least squares approach to the regularized least squares problem under data uncertainties by using a similar framework. We show that both unstruc"},"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":"1203.4160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T16:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"8fb9acdcd5ffa51c6f591db7932f3d2854f0bfcb0ab8e55d0a039ee64fd46484","abstract_canon_sha256":"8921cf01fa0773d9136c1360de16bc4cd567b078daad6ca402981531b73e59ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:48.177770Z","signature_b64":"7Fmpc/M01UMZo7wP+QZ4gpGaadScCxh1/wnq/IcUHINKy8p7FzCEfywSMimuygerl1sk23KEAxNm+5I1C2vsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27084d8432c3448ced66a8b6c5bbd6cf9df82413db98d974c1a37a91c6c85559","last_reissued_at":"2026-05-18T03:59:48.177296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:48.177296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Mehmet A. Donmez, Nargiz Kalantarova, Suleyman S. Kozat","submitted_at":"2012-03-19T16:50:16Z","abstract_excerpt":"In this correspondence, we introduce a minimax regret criteria to the least squares problems with bounded data uncertainties and solve it using semi-definite programming. We investigate a robust minimax least squares approach that minimizes a worst case difference regret. The regret is defined as the difference between a squared data error and the smallest attainable squared data error of a least squares estimator. We then propose a robust regularized least squares approach to the regularized least squares problem under data uncertainties by using a similar framework. We show that both unstruc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4160","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":"1203.4160","created_at":"2026-05-18T03:59:48.177387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4160v1","created_at":"2026-05-18T03:59:48.177387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4160","created_at":"2026-05-18T03:59:48.177387+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4EE3BBSYNCI","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4EE3BBSYNCIZ3LG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4EE3BBS","created_at":"2026-05-18T12:27:04.183437+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/E4EE3BBSYNCIZ3LGVC3MLO6WZ6","json":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6.json","graph_json":"https://pith.science/api/pith-number/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/graph.json","events_json":"https://pith.science/api/pith-number/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/events.json","paper":"https://pith.science/paper/E4EE3BBS"},"agent_actions":{"view_html":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6","download_json":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6.json","view_paper":"https://pith.science/paper/E4EE3BBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4160&json=true","fetch_graph":"https://pith.science/api/pith-number/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/action/storage_attestation","attest_author":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/action/author_attestation","sign_citation":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/action/citation_signature","submit_replication":"https://pith.science/pith/E4EE3BBSYNCIZ3LGVC3MLO6WZ6/action/replication_record"}},"created_at":"2026-05-18T03:59:48.177387+00:00","updated_at":"2026-05-18T03:59:48.177387+00:00"}