{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MX5OYUPWFVDEX52Y7N4QDLNNZD","short_pith_number":"pith:MX5OYUPW","schema_version":"1.0","canonical_sha256":"65faec51f62d464bf758fb7901adadc8e81c6b858f6f42b97d0f2d9cb30229a8","source":{"kind":"arxiv","id":"1512.06500","version":1},"attestation_state":"computed","paper":{"title":"Inexact Krylov Subspace Algorithms for Large Matrix Exponential Eigenproblem from Dimensionality Reduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gang Wu, Li-jia Zhang, Meng Yang, Ting-ting Feng","submitted_at":"2015-12-21T05:47:12Z","abstract_excerpt":"Matrix exponential discriminant analysis (EDA) is a generalized discriminant analysis method based on matrix exponential. It can essentially overcome the intrinsic difficulty of small sample size problem that exists in the classical linear discriminant analysis (LDA). However, for data with high dimension, one has to solve a large matrix exponential eigenproblem in this method, and the time complexity is dominated by the computation of exponential of large matrices. In this paper, we propose two inexact Krylov subspace algorithms for solving the large matrix exponential eigenproblem effectivel"},"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":"1512.06500","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2015-12-21T05:47:12Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"cc603fe2efa2acad5d0b8c9ce4c989ea14f5d3c6a93c3832b8ab901d94ed973e","abstract_canon_sha256":"cae83e9bd0c942661fee67b1c690477cca8c61674617d77e65317710740708fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:00.382400Z","signature_b64":"pfIcLmq6Vf/JoULvi4oSgLfyT+mzDhVGZm/rSnmo48Qt1ynFHLKo6wGzt/EUn52TkXRmQUK0bEn8OVfeIXVwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65faec51f62d464bf758fb7901adadc8e81c6b858f6f42b97d0f2d9cb30229a8","last_reissued_at":"2026-05-18T01:24:00.381658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:00.381658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inexact Krylov Subspace Algorithms for Large Matrix Exponential Eigenproblem from Dimensionality Reduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gang Wu, Li-jia Zhang, Meng Yang, Ting-ting Feng","submitted_at":"2015-12-21T05:47:12Z","abstract_excerpt":"Matrix exponential discriminant analysis (EDA) is a generalized discriminant analysis method based on matrix exponential. It can essentially overcome the intrinsic difficulty of small sample size problem that exists in the classical linear discriminant analysis (LDA). However, for data with high dimension, one has to solve a large matrix exponential eigenproblem in this method, and the time complexity is dominated by the computation of exponential of large matrices. In this paper, we propose two inexact Krylov subspace algorithms for solving the large matrix exponential eigenproblem effectivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06500","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":"1512.06500","created_at":"2026-05-18T01:24:00.381784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06500v1","created_at":"2026-05-18T01:24:00.381784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06500","created_at":"2026-05-18T01:24:00.381784+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX5OYUPWFVDE","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX5OYUPWFVDEX52Y","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX5OYUPW","created_at":"2026-05-18T12:29:32.376354+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/MX5OYUPWFVDEX52Y7N4QDLNNZD","json":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD.json","graph_json":"https://pith.science/api/pith-number/MX5OYUPWFVDEX52Y7N4QDLNNZD/graph.json","events_json":"https://pith.science/api/pith-number/MX5OYUPWFVDEX52Y7N4QDLNNZD/events.json","paper":"https://pith.science/paper/MX5OYUPW"},"agent_actions":{"view_html":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD","download_json":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD.json","view_paper":"https://pith.science/paper/MX5OYUPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06500&json=true","fetch_graph":"https://pith.science/api/pith-number/MX5OYUPWFVDEX52Y7N4QDLNNZD/graph.json","fetch_events":"https://pith.science/api/pith-number/MX5OYUPWFVDEX52Y7N4QDLNNZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD/action/storage_attestation","attest_author":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD/action/author_attestation","sign_citation":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD/action/citation_signature","submit_replication":"https://pith.science/pith/MX5OYUPWFVDEX52Y7N4QDLNNZD/action/replication_record"}},"created_at":"2026-05-18T01:24:00.381784+00:00","updated_at":"2026-05-18T01:24:00.381784+00:00"}