{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RLISZNZTXRLZITBLYTSVIU2ABM","short_pith_number":"pith:RLISZNZT","schema_version":"1.0","canonical_sha256":"8ad12cb733bc57944c2bc4e55453400b3da6c8877cc0b064d8091b73129cec87","source":{"kind":"arxiv","id":"2203.02607","version":3},"attestation_state":"computed","paper":{"title":"An SDP Relaxation for the Sparse Integer Least Squares Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Alberto Del Pia, Dekun Zhou","submitted_at":"2022-03-04T23:21:38Z","abstract_excerpt":"In this paper, we study the \\emph{sparse integer least squares problem} (SILS), an NP-hard variant of least squares with sparse $\\{0, \\pm 1\\}$-vectors. We propose an $\\ell_1$-based SDP relaxation, and a randomized algorithm for SILS, which computes feasible solutions with high probability with an asymptotic approximation ratio $1/T^2$ as long as the sparsity constant $\\sigma \\ll T$. Our algorithm handles large-scale problems, delivering high-quality approximate solutions for dimensions up to $d = 10,000$. The proposed randomized algorithm applies broadly to binary quadratic programs with a car"},"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":"2203.02607","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-04T23:21:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bc82a84f365009d404debd9dcc0785608b4125fc0767c88bac4d8bccae4a20f4","abstract_canon_sha256":"024f5772bee8b612b511a3f0b6f10b99cd11eae82f19ded3128a7dea058c8f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:01.025838Z","signature_b64":"49mOaOsypyUyVQ3CJh2DJFCAsyO0qdgAzCzdLpReDru0eTwoHyGvqXIRf6eBFegCrqpGeLMXEq51LsV9yblPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad12cb733bc57944c2bc4e55453400b3da6c8877cc0b064d8091b73129cec87","last_reissued_at":"2026-05-20T00:02:01.024964Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:01.024964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An SDP Relaxation for the Sparse Integer Least Squares Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Alberto Del Pia, Dekun Zhou","submitted_at":"2022-03-04T23:21:38Z","abstract_excerpt":"In this paper, we study the \\emph{sparse integer least squares problem} (SILS), an NP-hard variant of least squares with sparse $\\{0, \\pm 1\\}$-vectors. We propose an $\\ell_1$-based SDP relaxation, and a randomized algorithm for SILS, which computes feasible solutions with high probability with an asymptotic approximation ratio $1/T^2$ as long as the sparsity constant $\\sigma \\ll T$. Our algorithm handles large-scale problems, delivering high-quality approximate solutions for dimensions up to $d = 10,000$. The proposed randomized algorithm applies broadly to binary quadratic programs with a car"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02607","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.02607/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":"2203.02607","created_at":"2026-05-20T00:02:01.025110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.02607v3","created_at":"2026-05-20T00:02:01.025110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02607","created_at":"2026-05-20T00:02:01.025110+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLISZNZTXRLZ","created_at":"2026-05-20T00:02:01.025110+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLISZNZTXRLZITBL","created_at":"2026-05-20T00:02:01.025110+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLISZNZT","created_at":"2026-05-20T00:02:01.025110+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/RLISZNZTXRLZITBLYTSVIU2ABM","json":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM.json","graph_json":"https://pith.science/api/pith-number/RLISZNZTXRLZITBLYTSVIU2ABM/graph.json","events_json":"https://pith.science/api/pith-number/RLISZNZTXRLZITBLYTSVIU2ABM/events.json","paper":"https://pith.science/paper/RLISZNZT"},"agent_actions":{"view_html":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM","download_json":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM.json","view_paper":"https://pith.science/paper/RLISZNZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.02607&json=true","fetch_graph":"https://pith.science/api/pith-number/RLISZNZTXRLZITBLYTSVIU2ABM/graph.json","fetch_events":"https://pith.science/api/pith-number/RLISZNZTXRLZITBLYTSVIU2ABM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM/action/storage_attestation","attest_author":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM/action/author_attestation","sign_citation":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM/action/citation_signature","submit_replication":"https://pith.science/pith/RLISZNZTXRLZITBLYTSVIU2ABM/action/replication_record"}},"created_at":"2026-05-20T00:02:01.025110+00:00","updated_at":"2026-05-20T00:02:01.025110+00:00"}