{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2VZ5WBYRXYVW5J23HOOYSUOFMX","short_pith_number":"pith:2VZ5WBYR","canonical_record":{"source":{"id":"1803.07247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T04:07:02Z","cross_cats_sorted":["cs.LG","q-fin.CP","stat.ME"],"title_canon_sha256":"5f13c85268f0fb3e0d1a81e386b4768a0316caf87a8e5c1e2d87b84ee7354f57","abstract_canon_sha256":"5b7a57aba7e5f8d202dddbc4d19bd39e2d7490763a42ce4e9e7bd7bc200881d5"},"schema_version":"1.0"},"canonical_sha256":"d573db0711be2b6ea75b3b9d8951c565f98795fe5fca7d09ec6c4effd6ec3caf","source":{"kind":"arxiv","id":"1803.07247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07247","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07247v1","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07247","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"pith_short_12","alias_value":"2VZ5WBYRXYVW","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2VZ5WBYRXYVW5J23","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2VZ5WBYR","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2VZ5WBYRXYVW5J23HOOYSUOFMX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T04:07:02Z","cross_cats_sorted":["cs.LG","q-fin.CP","stat.ME"],"title_canon_sha256":"5f13c85268f0fb3e0d1a81e386b4768a0316caf87a8e5c1e2d87b84ee7354f57","abstract_canon_sha256":"5b7a57aba7e5f8d202dddbc4d19bd39e2d7490763a42ce4e9e7bd7bc200881d5"},"schema_version":"1.0"},"canonical_sha256":"d573db0711be2b6ea75b3b9d8951c565f98795fe5fca7d09ec6c4effd6ec3caf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:33.847350Z","signature_b64":"heCNORC9ra6qYFXkOYLh67Xg3/kgOpqYaPF7G5bUxetl7rTB8YLp0BDC1VcS60OHptjQGwl4rQ457xHCqGdhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d573db0711be2b6ea75b3b9d8951c565f98795fe5fca7d09ec6c4effd6ec3caf","last_reissued_at":"2026-05-18T00:20:33.846723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:33.846723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07247","source_version":1,"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-05-18T00:20:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTZ3LNPcrT4U4NnFQe5yFr0cb8w+fPzPXrJLUaIQeGuVGfgxkGml3OgayMGYjriyldMf2DBYd3WLizJktUydCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:46:35.985566Z"},"content_sha256":"86d0045cd881fc906d7d887c804e8d0a5005d3fe33e779538bcca753cc411b65","schema_version":"1.0","event_id":"sha256:86d0045cd881fc906d7d887c804e8d0a5005d3fe33e779538bcca753cc411b65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2VZ5WBYRXYVW5J23HOOYSUOFMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Reduced Rank Regression With Nonconvex Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-fin.CP","stat.ME"],"primary_cat":"stat.ML","authors_text":"Daniel P. Palomar, Ziping Zhao","submitted_at":"2018-03-20T04:07:02Z","abstract_excerpt":"In this paper, the estimation problem for sparse reduced rank regression (SRRR) model is considered. The SRRR model is widely used for dimension reduction and variable selection with applications in signal processing, econometrics, etc. The problem is formulated to minimize the least squares loss with a sparsity-inducing penalty considering an orthogonality constraint. Convex sparsity-inducing functions have been used for SRRR in literature. In this work, a nonconvex function is proposed for better sparsity inducing. An efficient algorithm is developed based on the alternating minimization (or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07247","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"},"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-05-18T00:20:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dY6onds6jGxQBE1Gt3BmQdrTjyl6ZrykQ4fGlL689EEPRYeS8mRlHbD8Zs84dzf+1RRfkfLU/VRRQT2GZoe7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:46:35.985933Z"},"content_sha256":"6f15a8217069f62b0b0aa8c6e539dfd6867aab78719ad84914c4731952b3eb39","schema_version":"1.0","event_id":"sha256:6f15a8217069f62b0b0aa8c6e539dfd6867aab78719ad84914c4731952b3eb39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX/bundle.json","state_url":"https://pith.science/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX/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-05-31T15:46:35Z","links":{"resolver":"https://pith.science/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX","bundle":"https://pith.science/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX/bundle.json","state":"https://pith.science/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VZ5WBYRXYVW5J23HOOYSUOFMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2VZ5WBYRXYVW5J23HOOYSUOFMX","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":"5b7a57aba7e5f8d202dddbc4d19bd39e2d7490763a42ce4e9e7bd7bc200881d5","cross_cats_sorted":["cs.LG","q-fin.CP","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T04:07:02Z","title_canon_sha256":"5f13c85268f0fb3e0d1a81e386b4768a0316caf87a8e5c1e2d87b84ee7354f57"},"schema_version":"1.0","source":{"id":"1803.07247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07247","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07247v1","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07247","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"pith_short_12","alias_value":"2VZ5WBYRXYVW","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2VZ5WBYRXYVW5J23","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2VZ5WBYR","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:6f15a8217069f62b0b0aa8c6e539dfd6867aab78719ad84914c4731952b3eb39","target":"graph","created_at":"2026-05-18T00:20:33Z","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"},"paper":{"abstract_excerpt":"In this paper, the estimation problem for sparse reduced rank regression (SRRR) model is considered. The SRRR model is widely used for dimension reduction and variable selection with applications in signal processing, econometrics, etc. The problem is formulated to minimize the least squares loss with a sparsity-inducing penalty considering an orthogonality constraint. Convex sparsity-inducing functions have been used for SRRR in literature. In this work, a nonconvex function is proposed for better sparsity inducing. An efficient algorithm is developed based on the alternating minimization (or","authors_text":"Daniel P. Palomar, Ziping Zhao","cross_cats":["cs.LG","q-fin.CP","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T04:07:02Z","title":"Sparse Reduced Rank Regression With Nonconvex Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07247","kind":"arxiv","version":1},"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:86d0045cd881fc906d7d887c804e8d0a5005d3fe33e779538bcca753cc411b65","target":"record","created_at":"2026-05-18T00:20:33Z","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":"5b7a57aba7e5f8d202dddbc4d19bd39e2d7490763a42ce4e9e7bd7bc200881d5","cross_cats_sorted":["cs.LG","q-fin.CP","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T04:07:02Z","title_canon_sha256":"5f13c85268f0fb3e0d1a81e386b4768a0316caf87a8e5c1e2d87b84ee7354f57"},"schema_version":"1.0","source":{"id":"1803.07247","kind":"arxiv","version":1}},"canonical_sha256":"d573db0711be2b6ea75b3b9d8951c565f98795fe5fca7d09ec6c4effd6ec3caf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d573db0711be2b6ea75b3b9d8951c565f98795fe5fca7d09ec6c4effd6ec3caf","first_computed_at":"2026-05-18T00:20:33.846723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:33.846723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"heCNORC9ra6qYFXkOYLh67Xg3/kgOpqYaPF7G5bUxetl7rTB8YLp0BDC1VcS60OHptjQGwl4rQ457xHCqGdhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:33.847350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86d0045cd881fc906d7d887c804e8d0a5005d3fe33e779538bcca753cc411b65","sha256:6f15a8217069f62b0b0aa8c6e539dfd6867aab78719ad84914c4731952b3eb39"],"state_sha256":"2edcdd0fb9edfa3dce95e0de4c2de76bbfe03bd10fcbf616b7be5b2844b29c4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFdtA5Fp78NmaeXYJUZPi9MeWKHfBEZK0KUPl6zLeDBU2o0/XJxPLI2MrB/9c/CNDwJzmK0UGmlDMQ6IfHjRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:46:35.988192Z","bundle_sha256":"f24bf32e930002eb1abaacd0ad2b69a9306ff10a7044348ad781709f958d7d9f"}}