{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UJKB2UCDA3X5CERMZIB76L7WZ3","short_pith_number":"pith:UJKB2UCD","canonical_record":{"source":{"id":"1810.07913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-18T06:21:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"88aeb97f77f75e45444e408054903109a1e76c405d1919c7c419fa08fe7fcee3","abstract_canon_sha256":"61d377466e6e544ee5ac2e5b81b9a880a3bdabf8e674ac0bc5630d7d2dbc675b"},"schema_version":"1.0"},"canonical_sha256":"a2541d504306efd1122cca03ff2ff6cecec7a38beadc9c0bb554d20e1dbde287","source":{"kind":"arxiv","id":"1810.07913","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07913","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07913v2","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07913","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"UJKB2UCDA3X5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UJKB2UCDA3X5CERM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UJKB2UCD","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UJKB2UCDA3X5CERMZIB76L7WZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-18T06:21:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"88aeb97f77f75e45444e408054903109a1e76c405d1919c7c419fa08fe7fcee3","abstract_canon_sha256":"61d377466e6e544ee5ac2e5b81b9a880a3bdabf8e674ac0bc5630d7d2dbc675b"},"schema_version":"1.0"},"canonical_sha256":"a2541d504306efd1122cca03ff2ff6cecec7a38beadc9c0bb554d20e1dbde287","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:40.082882Z","signature_b64":"77Jx77u9VQEGHmO5MX6rpo+0gDswoHINhpus+JEyHvsCsTk5k7jdbVj7NZkI/BL5//TNJtGMlZljjq6gERqkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2541d504306efd1122cca03ff2ff6cecec7a38beadc9c0bb554d20e1dbde287","last_reissued_at":"2026-05-17T23:48:40.082441Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:40.082441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07913","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-05-17T23:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9A/iTdgrmuRri8WtABATVFcHuG6/tisc/f7dIoTMNB9HGT3PyM+4hHQUbiF8vTgH/cU+Y9ggqkxPsvUlXcbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:24:47.507656Z"},"content_sha256":"d172ceb219875c8e032c026668efaa37023b39484f7fb25bef01d1186a329404","schema_version":"1.0","event_id":"sha256:d172ceb219875c8e032c026668efaa37023b39484f7fb25bef01d1186a329404"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UJKB2UCDA3X5CERMZIB76L7WZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Sparse Reduced Rank Regression in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniela Witten, Kean Ming Tan, Qiang Sun","submitted_at":"2018-10-18T06:21:52Z","abstract_excerpt":"We propose robust sparse reduced rank regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained non-convex optimization problem, which is then solved using the alternating direction method of multipliers algorithm. We establish non-asymptotic estimation error bounds under both Frobenius and nuclear norms in the high-dimensional setting. This is a major contribution over existing results in reduced rank regression, which mainly focus on rank selection and prediction con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07913","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":""},"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-17T23:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkl6tUN+UkygMVOqJCApL7JUyP9QWj6ITijkMTqWBXCrlX1a1Kj/H8zAMZNLUraWhWRPSd6FFQXyfE57wXTfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:24:47.508346Z"},"content_sha256":"e434312b422020c31968d18cb0d9fbc7f5f7f95a9c3bf763aeb715ce4ff58360","schema_version":"1.0","event_id":"sha256:e434312b422020c31968d18cb0d9fbc7f5f7f95a9c3bf763aeb715ce4ff58360"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJKB2UCDA3X5CERMZIB76L7WZ3/bundle.json","state_url":"https://pith.science/pith/UJKB2UCDA3X5CERMZIB76L7WZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJKB2UCDA3X5CERMZIB76L7WZ3/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-22T14:24:47Z","links":{"resolver":"https://pith.science/pith/UJKB2UCDA3X5CERMZIB76L7WZ3","bundle":"https://pith.science/pith/UJKB2UCDA3X5CERMZIB76L7WZ3/bundle.json","state":"https://pith.science/pith/UJKB2UCDA3X5CERMZIB76L7WZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJKB2UCDA3X5CERMZIB76L7WZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UJKB2UCDA3X5CERMZIB76L7WZ3","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":"61d377466e6e544ee5ac2e5b81b9a880a3bdabf8e674ac0bc5630d7d2dbc675b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-18T06:21:52Z","title_canon_sha256":"88aeb97f77f75e45444e408054903109a1e76c405d1919c7c419fa08fe7fcee3"},"schema_version":"1.0","source":{"id":"1810.07913","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07913","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07913v2","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07913","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"UJKB2UCDA3X5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UJKB2UCDA3X5CERM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UJKB2UCD","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:e434312b422020c31968d18cb0d9fbc7f5f7f95a9c3bf763aeb715ce4ff58360","target":"graph","created_at":"2026-05-17T23:48:40Z","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":"We propose robust sparse reduced rank regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained non-convex optimization problem, which is then solved using the alternating direction method of multipliers algorithm. We establish non-asymptotic estimation error bounds under both Frobenius and nuclear norms in the high-dimensional setting. This is a major contribution over existing results in reduced rank regression, which mainly focus on rank selection and prediction con","authors_text":"Daniela Witten, Kean Ming Tan, Qiang Sun","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-18T06:21:52Z","title":"Robust Sparse Reduced Rank Regression in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07913","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:d172ceb219875c8e032c026668efaa37023b39484f7fb25bef01d1186a329404","target":"record","created_at":"2026-05-17T23:48:40Z","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":"61d377466e6e544ee5ac2e5b81b9a880a3bdabf8e674ac0bc5630d7d2dbc675b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-18T06:21:52Z","title_canon_sha256":"88aeb97f77f75e45444e408054903109a1e76c405d1919c7c419fa08fe7fcee3"},"schema_version":"1.0","source":{"id":"1810.07913","kind":"arxiv","version":2}},"canonical_sha256":"a2541d504306efd1122cca03ff2ff6cecec7a38beadc9c0bb554d20e1dbde287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2541d504306efd1122cca03ff2ff6cecec7a38beadc9c0bb554d20e1dbde287","first_computed_at":"2026-05-17T23:48:40.082441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:40.082441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77Jx77u9VQEGHmO5MX6rpo+0gDswoHINhpus+JEyHvsCsTk5k7jdbVj7NZkI/BL5//TNJtGMlZljjq6gERqkBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:40.082882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07913","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d172ceb219875c8e032c026668efaa37023b39484f7fb25bef01d1186a329404","sha256:e434312b422020c31968d18cb0d9fbc7f5f7f95a9c3bf763aeb715ce4ff58360"],"state_sha256":"074daa093b34369c2a4a5469acfd804949fbafdaf4da69eb7e358fa0c49b42e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsSC60VrMVPoPO9RPSYV9RH2YsPHvXkvN2x31TYBqGdkP+zz29/qmIJVZIYazsHZSoQNWo5s73qN2tweOwX9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T14:24:47.511822Z","bundle_sha256":"f2620eac93f40fc0f9894db712d742a87537d29eee6f5e6d93b07c496694a22b"}}