{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DXIVVHOCF75KFNVHPIESLE775D","short_pith_number":"pith:DXIVVHOC","schema_version":"1.0","canonical_sha256":"1dd15a9dc22ffaa2b6a77a092593ffe8dbd0ea5cdb82c3096222cffbda614d96","source":{"kind":"arxiv","id":"2509.04264","version":2},"attestation_state":"computed","paper":{"title":"On computing sparse universal solvers for key problems in statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ananias Sousa Machado, Jon Lee, Marcia Fampa","submitted_at":"2025-09-04T14:42:13Z","abstract_excerpt":"We give sparsity results and present algorithms for calculating minimum (vector) 1-norm universal solvers connected to least-squares problems. In particular, besides universal least-squares solvers, we consider minimum-rank universal least-squares solvers, and simultaneous universal minimum-norm/least-squares solvers. For all of these, we present and compare several new alternative linear-programming formulations and very effective proximal-point algorithms. Overall, we found that our new Douglas-Rachford splitting algorithms for these problems performed best."},"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":"2509.04264","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T14:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"c1e2c162d28dd4c80c5ba417e1c4e91a061fb45e864a1d6b66829e3ea07896b4","abstract_canon_sha256":"650ec8519a03e11ab9a4632602e1a019b0e127f789c1f1147accfae93bb7e9ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:31.017148Z","signature_b64":"IObp4wVoENrmVr3qjx/urSzCdZap1/+sl0REoX6k1UPMs4VH8wcnpdiRaNtc1NMD7rET+oaaoTa2rEXboamCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd15a9dc22ffaa2b6a77a092593ffe8dbd0ea5cdb82c3096222cffbda614d96","last_reissued_at":"2026-06-19T16:10:31.016675Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:31.016675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On computing sparse universal solvers for key problems in statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ananias Sousa Machado, Jon Lee, Marcia Fampa","submitted_at":"2025-09-04T14:42:13Z","abstract_excerpt":"We give sparsity results and present algorithms for calculating minimum (vector) 1-norm universal solvers connected to least-squares problems. In particular, besides universal least-squares solvers, we consider minimum-rank universal least-squares solvers, and simultaneous universal minimum-norm/least-squares solvers. For all of these, we present and compare several new alternative linear-programming formulations and very effective proximal-point algorithms. Overall, we found that our new Douglas-Rachford splitting algorithms for these problems performed best."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04264","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/2509.04264/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":"2509.04264","created_at":"2026-06-19T16:10:31.016733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04264v2","created_at":"2026-06-19T16:10:31.016733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04264","created_at":"2026-06-19T16:10:31.016733+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXIVVHOCF75K","created_at":"2026-06-19T16:10:31.016733+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXIVVHOCF75KFNVH","created_at":"2026-06-19T16:10:31.016733+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXIVVHOC","created_at":"2026-06-19T16:10:31.016733+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/DXIVVHOCF75KFNVHPIESLE775D","json":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D.json","graph_json":"https://pith.science/api/pith-number/DXIVVHOCF75KFNVHPIESLE775D/graph.json","events_json":"https://pith.science/api/pith-number/DXIVVHOCF75KFNVHPIESLE775D/events.json","paper":"https://pith.science/paper/DXIVVHOC"},"agent_actions":{"view_html":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D","download_json":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D.json","view_paper":"https://pith.science/paper/DXIVVHOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04264&json=true","fetch_graph":"https://pith.science/api/pith-number/DXIVVHOCF75KFNVHPIESLE775D/graph.json","fetch_events":"https://pith.science/api/pith-number/DXIVVHOCF75KFNVHPIESLE775D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/action/storage_attestation","attest_author":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/action/author_attestation","sign_citation":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/action/citation_signature","submit_replication":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/action/replication_record"}},"created_at":"2026-06-19T16:10:31.016733+00:00","updated_at":"2026-06-19T16:10:31.016733+00:00"}