{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DXIVVHOCF75KFNVHPIESLE775D","short_pith_number":"pith:DXIVVHOC","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"},"canonical_sha256":"1dd15a9dc22ffaa2b6a77a092593ffe8dbd0ea5cdb82c3096222cffbda614d96","source":{"kind":"arxiv","id":"2509.04264","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04264","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04264v2","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04264","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"pith_short_12","alias_value":"DXIVVHOCF75K","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"pith_short_16","alias_value":"DXIVVHOCF75KFNVH","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"pith_short_8","alias_value":"DXIVVHOC","created_at":"2026-06-19T16:10:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DXIVVHOCF75KFNVHPIESLE775D","target":"record","payload":{"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"},"canonical_sha256":"1dd15a9dc22ffaa2b6a77a092593ffe8dbd0ea5cdb82c3096222cffbda614d96","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"},"source_kind":"arxiv","source_id":"2509.04264","source_version":2,"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-06-19T16:10:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+CPlCYLTPj3uqpN4OkvoUl40JZESEGoCsaKRkpx25qrqxvs1oytcV8hmjtJ3azSkjd6Dg01f7L0RftvFpgeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:20:04.391734Z"},"content_sha256":"3b118a8b526c207b012ed92880644ca28dc55d6dbd1221918a0c3868bdbb3514","schema_version":"1.0","event_id":"sha256:3b118a8b526c207b012ed92880644ca28dc55d6dbd1221918a0c3868bdbb3514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DXIVVHOCF75KFNVHPIESLE775D","target":"graph","payload":{"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"},"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-06-19T16:10:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ndCaK37rTnmHKSw7KshKLSC8EcsfbC6Hpay6eONdoPcU1r6wAX92gg6KdTiRGtqk3WYrVuMkHPr+J/EIo2yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:20:04.392111Z"},"content_sha256":"4b7ee469561c97d84fa04e009d34da39de86b083a8d113a9e940d71bb446db7c","schema_version":"1.0","event_id":"sha256:4b7ee469561c97d84fa04e009d34da39de86b083a8d113a9e940d71bb446db7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/bundle.json","state_url":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXIVVHOCF75KFNVHPIESLE775D/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-06-26T10:20:04Z","links":{"resolver":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D","bundle":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/bundle.json","state":"https://pith.science/pith/DXIVVHOCF75KFNVHPIESLE775D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXIVVHOCF75KFNVHPIESLE775D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DXIVVHOCF75KFNVHPIESLE775D","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":"650ec8519a03e11ab9a4632602e1a019b0e127f789c1f1147accfae93bb7e9ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T14:42:13Z","title_canon_sha256":"c1e2c162d28dd4c80c5ba417e1c4e91a061fb45e864a1d6b66829e3ea07896b4"},"schema_version":"1.0","source":{"id":"2509.04264","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04264","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04264v2","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04264","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"pith_short_12","alias_value":"DXIVVHOCF75K","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"pith_short_16","alias_value":"DXIVVHOCF75KFNVH","created_at":"2026-06-19T16:10:31Z"},{"alias_kind":"pith_short_8","alias_value":"DXIVVHOC","created_at":"2026-06-19T16:10:31Z"}],"graph_snapshots":[{"event_id":"sha256:4b7ee469561c97d84fa04e009d34da39de86b083a8d113a9e940d71bb446db7c","target":"graph","created_at":"2026-06-19T16:10:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.04264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Ananias Sousa Machado, Jon Lee, Marcia Fampa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T14:42:13Z","title":"On computing sparse universal solvers for key problems in statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04264","kind":"arxiv","version":2},"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:3b118a8b526c207b012ed92880644ca28dc55d6dbd1221918a0c3868bdbb3514","target":"record","created_at":"2026-06-19T16:10:31Z","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":"650ec8519a03e11ab9a4632602e1a019b0e127f789c1f1147accfae93bb7e9ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T14:42:13Z","title_canon_sha256":"c1e2c162d28dd4c80c5ba417e1c4e91a061fb45e864a1d6b66829e3ea07896b4"},"schema_version":"1.0","source":{"id":"2509.04264","kind":"arxiv","version":2}},"canonical_sha256":"1dd15a9dc22ffaa2b6a77a092593ffe8dbd0ea5cdb82c3096222cffbda614d96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dd15a9dc22ffaa2b6a77a092593ffe8dbd0ea5cdb82c3096222cffbda614d96","first_computed_at":"2026-06-19T16:10:31.016675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:31.016675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IObp4wVoENrmVr3qjx/urSzCdZap1/+sl0REoX6k1UPMs4VH8wcnpdiRaNtc1NMD7rET+oaaoTa2rEXboamCDA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:31.017148Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.04264","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b118a8b526c207b012ed92880644ca28dc55d6dbd1221918a0c3868bdbb3514","sha256:4b7ee469561c97d84fa04e009d34da39de86b083a8d113a9e940d71bb446db7c"],"state_sha256":"ecd8bec164783ce3f519ddf60a593972b9c6f730efdd6f0cd8fcaeab98b6cf33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pm0vYEQKISwTrQZ9iR/TQcu8uZsQJIDY5LzXJzFVNUAixbdooGYpqwb9ghCdl11VJ0ueC/ibP6KkW+1WvykTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:20:04.394238Z","bundle_sha256":"c67021ee864247951fe540d45f831b67d460b407003b722d0bb92d3dbc29a160"}}