{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NEIFFKA4NERHVXUM3PPY3OADBL","short_pith_number":"pith:NEIFFKA4","canonical_record":{"source":{"id":"1609.07386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T14:40:47Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"499fc2378d53c59f93f0f643cf977707259e7655d6a2ac5e05e5f09e1f2f7e5a","abstract_canon_sha256":"80cdbb9a625695a759a506e5e7817cd1bd19dc6ddb57acce1fd4f144254ce328"},"schema_version":"1.0"},"canonical_sha256":"691052a81c69227ade8cdbdf8db8030afbc8ae9f054fd2510f795327795b7e24","source":{"kind":"arxiv","id":"1609.07386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07386","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07386v2","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07386","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"NEIFFKA4NERH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEIFFKA4NERHVXUM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEIFFKA4","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NEIFFKA4NERHVXUM3PPY3OADBL","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T14:40:47Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"499fc2378d53c59f93f0f643cf977707259e7655d6a2ac5e05e5f09e1f2f7e5a","abstract_canon_sha256":"80cdbb9a625695a759a506e5e7817cd1bd19dc6ddb57acce1fd4f144254ce328"},"schema_version":"1.0"},"canonical_sha256":"691052a81c69227ade8cdbdf8db8030afbc8ae9f054fd2510f795327795b7e24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:59.785101Z","signature_b64":"+QXgA/OQOjO4MT6WmEaOVCLgfC6/jnAxy1WjcdiyBJegUCURCiJCwJ22NVbw8Adt77uQgvJcqx/K514JZwpSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691052a81c69227ade8cdbdf8db8030afbc8ae9f054fd2510f795327795b7e24","last_reissued_at":"2026-05-18T01:00:59.784404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:59.784404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07386","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-18T01:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqPQJpzy++v1ormXFF04+TW/tEn5/lJfRwUCbRCblgEJkiUkXmUM7PMLyO6pfR3Oc8yOKWDQN/Y8TXvZbmvxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:29:11.781352Z"},"content_sha256":"5b5bf175daab1f0e34ff70cfb2dc6e0ddac00c145e2f4243f1ff7cf8d62ae83b","schema_version":"1.0","event_id":"sha256:5b5bf175daab1f0e34ff70cfb2dc6e0ddac00c145e2f4243f1ff7cf8d62ae83b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NEIFFKA4NERHVXUM3PPY3OADBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A penalized likelihood method for classification with matrix-valued predictors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Aaron J. Molstad, Adam J. Rothman","submitted_at":"2016-09-23T14:40:47Z","abstract_excerpt":"We propose a penalized likelihood method to fit the linear discriminant analysis model when the predictor is matrix valued. We simultaneously estimate the means and the precision matrix, which we assume has a Kronecker product decomposition. Our penalties encourage pairs of response category mean matrices to have equal entries and also encourage zeros in the precision matrix. To compute our estimators, we use a blockwise coordinate descent algorithm. To update the optimization variables corresponding to response category mean matrices, we use an alternating minimization algorithm that takes ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07386","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-18T01:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64WYOWIC6XMo7qMsKPdDIBLcOcpygDTkJ+7eP8b083GkpFVX81CRsYSOT+clbWW6iLXUM7xqBMfrDD3c/zPRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:29:11.781691Z"},"content_sha256":"4ed1f0dff617b27157cae52f6683148dd727d730c57b53ac2134946f54f1abf4","schema_version":"1.0","event_id":"sha256:4ed1f0dff617b27157cae52f6683148dd727d730c57b53ac2134946f54f1abf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEIFFKA4NERHVXUM3PPY3OADBL/bundle.json","state_url":"https://pith.science/pith/NEIFFKA4NERHVXUM3PPY3OADBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEIFFKA4NERHVXUM3PPY3OADBL/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-25T10:29:11Z","links":{"resolver":"https://pith.science/pith/NEIFFKA4NERHVXUM3PPY3OADBL","bundle":"https://pith.science/pith/NEIFFKA4NERHVXUM3PPY3OADBL/bundle.json","state":"https://pith.science/pith/NEIFFKA4NERHVXUM3PPY3OADBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEIFFKA4NERHVXUM3PPY3OADBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NEIFFKA4NERHVXUM3PPY3OADBL","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":"80cdbb9a625695a759a506e5e7817cd1bd19dc6ddb57acce1fd4f144254ce328","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T14:40:47Z","title_canon_sha256":"499fc2378d53c59f93f0f643cf977707259e7655d6a2ac5e05e5f09e1f2f7e5a"},"schema_version":"1.0","source":{"id":"1609.07386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07386","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07386v2","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07386","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"NEIFFKA4NERH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEIFFKA4NERHVXUM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEIFFKA4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:4ed1f0dff617b27157cae52f6683148dd727d730c57b53ac2134946f54f1abf4","target":"graph","created_at":"2026-05-18T01:00:59Z","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 a penalized likelihood method to fit the linear discriminant analysis model when the predictor is matrix valued. We simultaneously estimate the means and the precision matrix, which we assume has a Kronecker product decomposition. Our penalties encourage pairs of response category mean matrices to have equal entries and also encourage zeros in the precision matrix. To compute our estimators, we use a blockwise coordinate descent algorithm. To update the optimization variables corresponding to response category mean matrices, we use an alternating minimization algorithm that takes ad","authors_text":"Aaron J. Molstad, Adam J. Rothman","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T14:40:47Z","title":"A penalized likelihood method for classification with matrix-valued predictors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07386","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:5b5bf175daab1f0e34ff70cfb2dc6e0ddac00c145e2f4243f1ff7cf8d62ae83b","target":"record","created_at":"2026-05-18T01:00:59Z","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":"80cdbb9a625695a759a506e5e7817cd1bd19dc6ddb57acce1fd4f144254ce328","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T14:40:47Z","title_canon_sha256":"499fc2378d53c59f93f0f643cf977707259e7655d6a2ac5e05e5f09e1f2f7e5a"},"schema_version":"1.0","source":{"id":"1609.07386","kind":"arxiv","version":2}},"canonical_sha256":"691052a81c69227ade8cdbdf8db8030afbc8ae9f054fd2510f795327795b7e24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691052a81c69227ade8cdbdf8db8030afbc8ae9f054fd2510f795327795b7e24","first_computed_at":"2026-05-18T01:00:59.784404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:59.784404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+QXgA/OQOjO4MT6WmEaOVCLgfC6/jnAxy1WjcdiyBJegUCURCiJCwJ22NVbw8Adt77uQgvJcqx/K514JZwpSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:59.785101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b5bf175daab1f0e34ff70cfb2dc6e0ddac00c145e2f4243f1ff7cf8d62ae83b","sha256:4ed1f0dff617b27157cae52f6683148dd727d730c57b53ac2134946f54f1abf4"],"state_sha256":"a04230af56401317d21458e1c8da984aa2f05ba65bab90c6af481e76f0d23c73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAGtEt34tmIeXF6bBFEF1SXM8hDLzFSdQbnJBQ3sGG2WPhPq7uIXSbwvBpr4MmVazZljQ5us7dZFr6EwGZb1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:29:11.783578Z","bundle_sha256":"ba3f8a9f9724467642d1020eef27c33e351c6d49306d4d1b1c3ffbe2741feb32"}}