{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GLAUT52BALU4OHW5MEGA4KBMWT","short_pith_number":"pith:GLAUT52B","schema_version":"1.0","canonical_sha256":"32c149f74102e9c71edd610c0e282cb4d25226cb9a066fed44d32fbef070bac7","source":{"kind":"arxiv","id":"2503.10569","version":2},"attestation_state":"computed","paper":{"title":"Low-Rank Matrix Regression via Least-Angle Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SP"],"primary_cat":"eess.SY","authors_text":"Matthias A. M\\\"uller, Mingzhou Yin","submitted_at":"2025-03-13T17:21:11Z","abstract_excerpt":"Low-rank matrix regression is a fundamental problem in data science with various applications in systems and control. Nuclear norm regularization has been widely applied to solve this problem due to its convexity. However, it suffers from high computational complexity and the inability to directly specify the rank. This work introduces a novel framework for low-rank matrix regression that addresses both unstructured and Hankel matrices. By decomposing the low-rank matrix into rank-1 bases, the problem is reformulated as an infinite-dimensional sparse learning problem. The least-angle regressio"},"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":"2503.10569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-03-13T17:21:11Z","cross_cats_sorted":["cs.SY","eess.SP"],"title_canon_sha256":"e8d002400c1170ba9fbdb6e2180cbdb3fe7f643771db4b2e3348f3f1d705b4fa","abstract_canon_sha256":"588f1af9ea480deea7f63de96a3a0ddaf737a9a07caa03aa43eb21afd8ff5bc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:55.242241Z","signature_b64":"akVaci/Lt7o+ffUXLIHApHoP5BNXlfb8le68mbaWXOZrJ+9g/9R+NgXyFo2foHpMOwxb/VOCMWRyk4ev+iZ7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32c149f74102e9c71edd610c0e282cb4d25226cb9a066fed44d32fbef070bac7","last_reissued_at":"2026-07-05T11:14:55.241804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:55.241804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Matrix Regression via Least-Angle Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SP"],"primary_cat":"eess.SY","authors_text":"Matthias A. M\\\"uller, Mingzhou Yin","submitted_at":"2025-03-13T17:21:11Z","abstract_excerpt":"Low-rank matrix regression is a fundamental problem in data science with various applications in systems and control. Nuclear norm regularization has been widely applied to solve this problem due to its convexity. However, it suffers from high computational complexity and the inability to directly specify the rank. This work introduces a novel framework for low-rank matrix regression that addresses both unstructured and Hankel matrices. By decomposing the low-rank matrix into rank-1 bases, the problem is reformulated as an infinite-dimensional sparse learning problem. The least-angle regressio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10569","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/2503.10569/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":"2503.10569","created_at":"2026-07-05T11:14:55.241868+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10569v2","created_at":"2026-07-05T11:14:55.241868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10569","created_at":"2026-07-05T11:14:55.241868+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLAUT52BALU4","created_at":"2026-07-05T11:14:55.241868+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLAUT52BALU4OHW5","created_at":"2026-07-05T11:14:55.241868+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLAUT52B","created_at":"2026-07-05T11:14:55.241868+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/GLAUT52BALU4OHW5MEGA4KBMWT","json":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT.json","graph_json":"https://pith.science/api/pith-number/GLAUT52BALU4OHW5MEGA4KBMWT/graph.json","events_json":"https://pith.science/api/pith-number/GLAUT52BALU4OHW5MEGA4KBMWT/events.json","paper":"https://pith.science/paper/GLAUT52B"},"agent_actions":{"view_html":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT","download_json":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT.json","view_paper":"https://pith.science/paper/GLAUT52B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10569&json=true","fetch_graph":"https://pith.science/api/pith-number/GLAUT52BALU4OHW5MEGA4KBMWT/graph.json","fetch_events":"https://pith.science/api/pith-number/GLAUT52BALU4OHW5MEGA4KBMWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT/action/storage_attestation","attest_author":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT/action/author_attestation","sign_citation":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT/action/citation_signature","submit_replication":"https://pith.science/pith/GLAUT52BALU4OHW5MEGA4KBMWT/action/replication_record"}},"created_at":"2026-07-05T11:14:55.241868+00:00","updated_at":"2026-07-05T11:14:55.241868+00:00"}