{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5OLKRWXJ7HRFEF3B4NS2W7VWA4","short_pith_number":"pith:5OLKRWXJ","schema_version":"1.0","canonical_sha256":"eb96a8dae9f9e2521761e365ab7eb6071c0f5d81d1e053ffc69cf1fd1a68707b","source":{"kind":"arxiv","id":"2510.11519","version":2},"attestation_state":"computed","paper":{"title":"Robust Least Squares Problems with Binary Uncertain Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojun Chen, Yang Zhou","submitted_at":"2025-10-13T15:24:49Z","abstract_excerpt":"We propose a Binary Robust Least Squares (BRLS) model that encompasses key robust least squares formulations, such as those involving uncertain binary labels and adversarial noise constrained within a hypercube. {To develop algorithms with theoretical guarantees for the BRLS problem, we exploit the structure of the inner binary maximization problem with a convex quadratic objective function. Refined guarantees are obtained when the noise correlations are sign-structured, in which case the inner problem admits sharper submodular or supermodular oracles. For the supermodular linear BRLS problem,"},"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":"2510.11519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-13T15:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"6d6fb2c4b613f2e7ed141bf7d66baa03e6edd8e983ed00cac917ec6211c906d2","abstract_canon_sha256":"a25a22d59ba46e2525358ed94b2b2f20286c6d0aa0f36d7c427dc65d0ccc479d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:11.853637Z","signature_b64":"6jtwy7Jql4uCAO42la6E/EkSTer2A5DsLM5y232je/yrNeZi6A3YUKHXK4O24P0Kdsrx7VaXx7L4FSO5qgHHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb96a8dae9f9e2521761e365ab7eb6071c0f5d81d1e053ffc69cf1fd1a68707b","last_reissued_at":"2026-07-07T02:17:11.852759Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:11.852759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Least Squares Problems with Binary Uncertain Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojun Chen, Yang Zhou","submitted_at":"2025-10-13T15:24:49Z","abstract_excerpt":"We propose a Binary Robust Least Squares (BRLS) model that encompasses key robust least squares formulations, such as those involving uncertain binary labels and adversarial noise constrained within a hypercube. {To develop algorithms with theoretical guarantees for the BRLS problem, we exploit the structure of the inner binary maximization problem with a convex quadratic objective function. Refined guarantees are obtained when the noise correlations are sign-structured, in which case the inner problem admits sharper submodular or supermodular oracles. For the supermodular linear BRLS problem,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.11519","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.11519/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2510.11519","created_at":"2026-07-07T02:17:11.852881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.11519v2","created_at":"2026-07-07T02:17:11.852881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.11519","created_at":"2026-07-07T02:17:11.852881+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OLKRWXJ7HRF","created_at":"2026-07-07T02:17:11.852881+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OLKRWXJ7HRFEF3B","created_at":"2026-07-07T02:17:11.852881+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OLKRWXJ","created_at":"2026-07-07T02:17:11.852881+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/5OLKRWXJ7HRFEF3B4NS2W7VWA4","json":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4.json","graph_json":"https://pith.science/api/pith-number/5OLKRWXJ7HRFEF3B4NS2W7VWA4/graph.json","events_json":"https://pith.science/api/pith-number/5OLKRWXJ7HRFEF3B4NS2W7VWA4/events.json","paper":"https://pith.science/paper/5OLKRWXJ"},"agent_actions":{"view_html":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4","download_json":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4.json","view_paper":"https://pith.science/paper/5OLKRWXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.11519&json=true","fetch_graph":"https://pith.science/api/pith-number/5OLKRWXJ7HRFEF3B4NS2W7VWA4/graph.json","fetch_events":"https://pith.science/api/pith-number/5OLKRWXJ7HRFEF3B4NS2W7VWA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4/action/storage_attestation","attest_author":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4/action/author_attestation","sign_citation":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4/action/citation_signature","submit_replication":"https://pith.science/pith/5OLKRWXJ7HRFEF3B4NS2W7VWA4/action/replication_record"}},"created_at":"2026-07-07T02:17:11.852881+00:00","updated_at":"2026-07-07T02:17:11.852881+00:00"}