{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JMPNETZJKWWID7KUAMVGBSNCUJ","short_pith_number":"pith:JMPNETZJ","canonical_record":{"source":{"id":"1411.6231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T12:50:20Z","cross_cats_sorted":[],"title_canon_sha256":"5486e0a96be76bb6e49af2f54bac8bab03d8d5d00672aaead2860f6785c8a061","abstract_canon_sha256":"04914992292bab0a55c76cdc8810709a7da76f32825d09818d510add06f717cc"},"schema_version":"1.0"},"canonical_sha256":"4b1ed24f2955ac81fd54032a60c9a2a241f51aa6b78a35a78fcddc8a43364a9f","source":{"kind":"arxiv","id":"1411.6231","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6231","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6231v3","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6231","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"JMPNETZJKWWI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JMPNETZJKWWID7KU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JMPNETZJ","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JMPNETZJKWWID7KUAMVGBSNCUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T12:50:20Z","cross_cats_sorted":[],"title_canon_sha256":"5486e0a96be76bb6e49af2f54bac8bab03d8d5d00672aaead2860f6785c8a061","abstract_canon_sha256":"04914992292bab0a55c76cdc8810709a7da76f32825d09818d510add06f717cc"},"schema_version":"1.0"},"canonical_sha256":"4b1ed24f2955ac81fd54032a60c9a2a241f51aa6b78a35a78fcddc8a43364a9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:42.003825Z","signature_b64":"jXGmfHhYIL2dCry4zNfgQjRFxeGvVVi72SU/uj49e/aC3Wy6SRqZiAlmwv56NiYOkwUEnF6negbpeCeb1W59Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b1ed24f2955ac81fd54032a60c9a2a241f51aa6b78a35a78fcddc8a43364a9f","last_reissued_at":"2026-05-18T00:40:42.002986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:42.002986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6231","source_version":3,"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:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEeY44JtZpUfz2UHG4werQpdQKr9Of82R35cCPUo+3SIs3rzUmuHyzGiVQ/rSRStzYI68V19JWt1pcjdtuFDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:50:58.226783Z"},"content_sha256":"24b78e426bcb281f5f710018416b340cffc015fbbb1cbfcbc94d6b4078031557","schema_version":"1.0","event_id":"sha256:24b78e426bcb281f5f710018416b340cffc015fbbb1cbfcbc94d6b4078031557"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JMPNETZJKWWID7KUAMVGBSNCUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compound Rank-k Projections for Bilinear Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengqi Zhang, Feiping Nie, Sen Wang, Xiaofang Zhou, Xiaojun Chang, Yi Yang","submitted_at":"2014-11-23T12:50:20Z","abstract_excerpt":"In many real-world applications, data are represented by matrices or high-order tensors. Despite the promising performance, the existing two-dimensional discriminant analysis algorithms employ a single projection model to exploit the discriminant information for projection, making the model less flexible. In this paper, we propose a novel Compound Rank-k Projection (CRP) algorithm for bilinear analysis. CRP deals with matrices directly without transforming them into vectors, and it therefore preserves the correlations within the matrix and decreases the computation complexity. Different from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6231","kind":"arxiv","version":3},"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:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciLTQRA7ykSUuqa1AvvwNczCfsF35aOwxJaAKXxjiftVUPX9pIKCkKzvbOGE77N/voTovYSMIWHkA4gLupeNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:50:58.227468Z"},"content_sha256":"ac6f10d9b0e3d5a6305236d9b4135c4f48275d911fc99fdda93f8b726c5e48f9","schema_version":"1.0","event_id":"sha256:ac6f10d9b0e3d5a6305236d9b4135c4f48275d911fc99fdda93f8b726c5e48f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMPNETZJKWWID7KUAMVGBSNCUJ/bundle.json","state_url":"https://pith.science/pith/JMPNETZJKWWID7KUAMVGBSNCUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMPNETZJKWWID7KUAMVGBSNCUJ/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-26T21:50:58Z","links":{"resolver":"https://pith.science/pith/JMPNETZJKWWID7KUAMVGBSNCUJ","bundle":"https://pith.science/pith/JMPNETZJKWWID7KUAMVGBSNCUJ/bundle.json","state":"https://pith.science/pith/JMPNETZJKWWID7KUAMVGBSNCUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMPNETZJKWWID7KUAMVGBSNCUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JMPNETZJKWWID7KUAMVGBSNCUJ","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":"04914992292bab0a55c76cdc8810709a7da76f32825d09818d510add06f717cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T12:50:20Z","title_canon_sha256":"5486e0a96be76bb6e49af2f54bac8bab03d8d5d00672aaead2860f6785c8a061"},"schema_version":"1.0","source":{"id":"1411.6231","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6231","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6231v3","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6231","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"JMPNETZJKWWI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JMPNETZJKWWID7KU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JMPNETZJ","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:ac6f10d9b0e3d5a6305236d9b4135c4f48275d911fc99fdda93f8b726c5e48f9","target":"graph","created_at":"2026-05-18T00:40:42Z","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 many real-world applications, data are represented by matrices or high-order tensors. Despite the promising performance, the existing two-dimensional discriminant analysis algorithms employ a single projection model to exploit the discriminant information for projection, making the model less flexible. In this paper, we propose a novel Compound Rank-k Projection (CRP) algorithm for bilinear analysis. CRP deals with matrices directly without transforming them into vectors, and it therefore preserves the correlations within the matrix and decreases the computation complexity. Different from t","authors_text":"Chengqi Zhang, Feiping Nie, Sen Wang, Xiaofang Zhou, Xiaojun Chang, Yi Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T12:50:20Z","title":"Compound Rank-k Projections for Bilinear Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6231","kind":"arxiv","version":3},"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:24b78e426bcb281f5f710018416b340cffc015fbbb1cbfcbc94d6b4078031557","target":"record","created_at":"2026-05-18T00:40:42Z","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":"04914992292bab0a55c76cdc8810709a7da76f32825d09818d510add06f717cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T12:50:20Z","title_canon_sha256":"5486e0a96be76bb6e49af2f54bac8bab03d8d5d00672aaead2860f6785c8a061"},"schema_version":"1.0","source":{"id":"1411.6231","kind":"arxiv","version":3}},"canonical_sha256":"4b1ed24f2955ac81fd54032a60c9a2a241f51aa6b78a35a78fcddc8a43364a9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b1ed24f2955ac81fd54032a60c9a2a241f51aa6b78a35a78fcddc8a43364a9f","first_computed_at":"2026-05-18T00:40:42.002986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:42.002986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jXGmfHhYIL2dCry4zNfgQjRFxeGvVVi72SU/uj49e/aC3Wy6SRqZiAlmwv56NiYOkwUEnF6negbpeCeb1W59Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:42.003825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6231","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24b78e426bcb281f5f710018416b340cffc015fbbb1cbfcbc94d6b4078031557","sha256:ac6f10d9b0e3d5a6305236d9b4135c4f48275d911fc99fdda93f8b726c5e48f9"],"state_sha256":"994773fa447db0aafc5d199e834c1592cf89c1584e15f50983cf13d81a319289"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1hoaCjeKyqpaxGHaxnGCmUiak/7AoJcPc9yVIhek8jOy/UtFPUESuNV+MzSp831XM2emRx46bfWoldijobeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:50:58.231586Z","bundle_sha256":"02ea854bb903cc8b6af021b50466bf0b49f6229b07b6dfc0e9305ef100fa1f8c"}}