{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BZQIFESOOZR6X64K3A72XCZI7E","short_pith_number":"pith:BZQIFESO","schema_version":"1.0","canonical_sha256":"0e6082924e7663ebfb8ad83fab8b28f93c495af9f3f7cb2b7f62fa89960bbd04","source":{"kind":"arxiv","id":"2412.08023","version":1},"attestation_state":"computed","paper":{"title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Can Wu, Defeng Sun, Dong-Hui Li","submitted_at":"2024-12-11T02:05:23Z","abstract_excerpt":"Support matrix machine (SMM) is a successful supervised classification model for matrix-type samples. Unlike support vector machines, it employs low-rank regularization on the regression matrix to effectively capture the intrinsic structure embedded in each input matrix. When solving a large-scale SMM, a major challenge arises from the potential increase in sample size, leading to substantial computational and storage burdens. To address these issues, we design a semismooth Newton-CG (SNCG) based augmented Lagrangian method (ALM) for solving the SMM. The ALM exhibits an asymptotic R-superlinea"},"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":"2412.08023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-11T02:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"f85143c7e19a764a18b545761331ab2984de45e7477776ef6430f39a6204f6b4","abstract_canon_sha256":"dd5cee17f0d16f8747cb77b73c371bc5711a629df36d570dc2a79ad07625390b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:43.217578Z","signature_b64":"x6x2D69dH1V8AmJaN9Fajnd8rMrGyj/GhlHn3p473m+QjzvqlC7te+Lvuq7FbvJ61HmkIen3IHIDa8ky+lppDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6082924e7663ebfb8ad83fab8b28f93c495af9f3f7cb2b7f62fa89960bbd04","last_reissued_at":"2026-07-05T09:47:43.217136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:43.217136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Can Wu, Defeng Sun, Dong-Hui Li","submitted_at":"2024-12-11T02:05:23Z","abstract_excerpt":"Support matrix machine (SMM) is a successful supervised classification model for matrix-type samples. Unlike support vector machines, it employs low-rank regularization on the regression matrix to effectively capture the intrinsic structure embedded in each input matrix. When solving a large-scale SMM, a major challenge arises from the potential increase in sample size, leading to substantial computational and storage burdens. To address these issues, we design a semismooth Newton-CG (SNCG) based augmented Lagrangian method (ALM) for solving the SMM. The ALM exhibits an asymptotic R-superlinea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08023","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.08023/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.08023","created_at":"2026-07-05T09:47:43.217193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08023v1","created_at":"2026-07-05T09:47:43.217193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08023","created_at":"2026-07-05T09:47:43.217193+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZQIFESOOZR6","created_at":"2026-07-05T09:47:43.217193+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZQIFESOOZR6X64K","created_at":"2026-07-05T09:47:43.217193+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZQIFESO","created_at":"2026-07-05T09:47:43.217193+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/BZQIFESOOZR6X64K3A72XCZI7E","json":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E.json","graph_json":"https://pith.science/api/pith-number/BZQIFESOOZR6X64K3A72XCZI7E/graph.json","events_json":"https://pith.science/api/pith-number/BZQIFESOOZR6X64K3A72XCZI7E/events.json","paper":"https://pith.science/paper/BZQIFESO"},"agent_actions":{"view_html":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E","download_json":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E.json","view_paper":"https://pith.science/paper/BZQIFESO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08023&json=true","fetch_graph":"https://pith.science/api/pith-number/BZQIFESOOZR6X64K3A72XCZI7E/graph.json","fetch_events":"https://pith.science/api/pith-number/BZQIFESOOZR6X64K3A72XCZI7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E/action/storage_attestation","attest_author":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E/action/author_attestation","sign_citation":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E/action/citation_signature","submit_replication":"https://pith.science/pith/BZQIFESOOZR6X64K3A72XCZI7E/action/replication_record"}},"created_at":"2026-07-05T09:47:43.217193+00:00","updated_at":"2026-07-05T09:47:43.217193+00:00"}