{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TYPV7VIHUAIPE6N3NNXFQLU26D","short_pith_number":"pith:TYPV7VIH","schema_version":"1.0","canonical_sha256":"9e1f5fd507a010f279bb6b6e582e9af0dff5b422bf2faa6fa43f5f2919f87786","source":{"kind":"arxiv","id":"2605.20300","version":1},"attestation_state":"computed","paper":{"title":"Robust Subspace-Constrained Quadratic Models for Low-Dimensional Structure Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Xiaohui Li, Zheng Zhai","submitted_at":"2026-05-19T12:35:13Z","abstract_excerpt":"In this paper, we propose a robust subspace-constrained quadratic model (SCQM) for learning low-dimensional structure from high-dimensional data. Building upon the subspace-constrained quadratic matrix factorization (SQMF) framework, the proposed model accommodates a broad class of noise distributions, including generalized Gaussian and radial Laplace models. This generalization enables reliable performance under both heavy-tailed and light-tailed noise, thereby substantially enhancing robustness across diverse data regimes. To efficiently address the resulting nonconvex optimization problem, "},"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":"2605.20300","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T12:35:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6735e9dcaa6d1195e746c06a2f1ba187ff697ab796f8123696cf5e3e75e103f4","abstract_canon_sha256":"eab6454d184682c386c25c969bc676a2b091a52f1ac76802da074b89932822d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T00:04:24.468905Z","signature_b64":"9tIv+Kwjtxl1nU78rMOPn/vQM6M+9PSb4OgogsTUMDEGwPWWlIiisEhOnQH7ZetxiUDb1UOEcXT3QqwlpNYYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e1f5fd507a010f279bb6b6e582e9af0dff5b422bf2faa6fa43f5f2919f87786","last_reissued_at":"2026-05-21T00:04:24.468475Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T00:04:24.468475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Subspace-Constrained Quadratic Models for Low-Dimensional Structure Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Xiaohui Li, Zheng Zhai","submitted_at":"2026-05-19T12:35:13Z","abstract_excerpt":"In this paper, we propose a robust subspace-constrained quadratic model (SCQM) for learning low-dimensional structure from high-dimensional data. Building upon the subspace-constrained quadratic matrix factorization (SQMF) framework, the proposed model accommodates a broad class of noise distributions, including generalized Gaussian and radial Laplace models. This generalization enables reliable performance under both heavy-tailed and light-tailed noise, thereby substantially enhancing robustness across diverse data regimes. To efficiently address the resulting nonconvex optimization problem, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20300","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/2605.20300/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":"2605.20300","created_at":"2026-05-21T00:04:24.468535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20300v1","created_at":"2026-05-21T00:04:24.468535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20300","created_at":"2026-05-21T00:04:24.468535+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYPV7VIHUAIP","created_at":"2026-05-21T00:04:24.468535+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYPV7VIHUAIPE6N3","created_at":"2026-05-21T00:04:24.468535+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYPV7VIH","created_at":"2026-05-21T00:04:24.468535+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/TYPV7VIHUAIPE6N3NNXFQLU26D","json":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D.json","graph_json":"https://pith.science/api/pith-number/TYPV7VIHUAIPE6N3NNXFQLU26D/graph.json","events_json":"https://pith.science/api/pith-number/TYPV7VIHUAIPE6N3NNXFQLU26D/events.json","paper":"https://pith.science/paper/TYPV7VIH"},"agent_actions":{"view_html":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D","download_json":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D.json","view_paper":"https://pith.science/paper/TYPV7VIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20300&json=true","fetch_graph":"https://pith.science/api/pith-number/TYPV7VIHUAIPE6N3NNXFQLU26D/graph.json","fetch_events":"https://pith.science/api/pith-number/TYPV7VIHUAIPE6N3NNXFQLU26D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D/action/storage_attestation","attest_author":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D/action/author_attestation","sign_citation":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D/action/citation_signature","submit_replication":"https://pith.science/pith/TYPV7VIHUAIPE6N3NNXFQLU26D/action/replication_record"}},"created_at":"2026-05-21T00:04:24.468535+00:00","updated_at":"2026-05-21T00:04:24.468535+00:00"}