{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XR4NEBJ7PEF64G3GVDBYSEYUXG","short_pith_number":"pith:XR4NEBJ7","schema_version":"1.0","canonical_sha256":"bc78d2053f790bee1b66a8c3891314b99f650748e097462606596f7fc7a7874e","source":{"kind":"arxiv","id":"1608.03686","version":1},"attestation_state":"computed","paper":{"title":"Scalable Interpretable Multi-Response Regression via SEED","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jinchi Lv, Mohammad Taha Bahadori, Yan Liu, Zemin Zheng","submitted_at":"2016-08-12T06:19:02Z","abstract_excerpt":"Sparse reduced-rank regression is an important tool to uncover meaningful dependence structure between large numbers of predictors and responses in many big data applications such as genome-wide association studies and social media analysis. Despite the recent theoretical and algorithmic advances, scalable estimation of sparse reduced-rank regression remains largely unexplored. In this paper, we suggest a scalable procedure called sequential estimation with eigen-decomposition (SEED) which needs only a single top-$r$ singular value decomposition to find the optimal low-rank and sparse matrix b"},"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":"1608.03686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-12T06:19:02Z","cross_cats_sorted":[],"title_canon_sha256":"c6d022d35695e5cecdc3052ee2cea1a5b96891bf8ac53bea58afe7439bb05ca7","abstract_canon_sha256":"d8faa66f9b1c17eeb21ac2392559ac18beace7862c239d2f8260ec0e8785a955"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.081123Z","signature_b64":"DNkhOdwYe5sh+RLjkWBUgHo7MHpQlQTIb8gp8HlilnzZrIoaQatuuJohoXFW3LWfiqoeIFusc8T0fHWJp8DBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc78d2053f790bee1b66a8c3891314b99f650748e097462606596f7fc7a7874e","last_reissued_at":"2026-05-18T01:09:12.080616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.080616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Interpretable Multi-Response Regression via SEED","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jinchi Lv, Mohammad Taha Bahadori, Yan Liu, Zemin Zheng","submitted_at":"2016-08-12T06:19:02Z","abstract_excerpt":"Sparse reduced-rank regression is an important tool to uncover meaningful dependence structure between large numbers of predictors and responses in many big data applications such as genome-wide association studies and social media analysis. Despite the recent theoretical and algorithmic advances, scalable estimation of sparse reduced-rank regression remains largely unexplored. In this paper, we suggest a scalable procedure called sequential estimation with eigen-decomposition (SEED) which needs only a single top-$r$ singular value decomposition to find the optimal low-rank and sparse matrix b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03686","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1608.03686","created_at":"2026-05-18T01:09:12.080702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03686v1","created_at":"2026-05-18T01:09:12.080702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03686","created_at":"2026-05-18T01:09:12.080702+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR4NEBJ7PEF6","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR4NEBJ7PEF64G3G","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR4NEBJ7","created_at":"2026-05-18T12:30:51.357362+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/XR4NEBJ7PEF64G3GVDBYSEYUXG","json":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG.json","graph_json":"https://pith.science/api/pith-number/XR4NEBJ7PEF64G3GVDBYSEYUXG/graph.json","events_json":"https://pith.science/api/pith-number/XR4NEBJ7PEF64G3GVDBYSEYUXG/events.json","paper":"https://pith.science/paper/XR4NEBJ7"},"agent_actions":{"view_html":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG","download_json":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG.json","view_paper":"https://pith.science/paper/XR4NEBJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03686&json=true","fetch_graph":"https://pith.science/api/pith-number/XR4NEBJ7PEF64G3GVDBYSEYUXG/graph.json","fetch_events":"https://pith.science/api/pith-number/XR4NEBJ7PEF64G3GVDBYSEYUXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG/action/storage_attestation","attest_author":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG/action/author_attestation","sign_citation":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG/action/citation_signature","submit_replication":"https://pith.science/pith/XR4NEBJ7PEF64G3GVDBYSEYUXG/action/replication_record"}},"created_at":"2026-05-18T01:09:12.080702+00:00","updated_at":"2026-05-18T01:09:12.080702+00:00"}