{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TU4JNGP4ETEGYCAYMIDHGLTD5A","short_pith_number":"pith:TU4JNGP4","schema_version":"1.0","canonical_sha256":"9d389699fc24c86c08186206732e63e80858dea12172576967ec0cd08a1c208c","source":{"kind":"arxiv","id":"2412.17328","version":1},"attestation_state":"computed","paper":{"title":"Low Rank Convex Clustering For Matrix-Valued Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Meixia Lin, Yangjing Zhang","submitted_at":"2024-12-23T06:38:34Z","abstract_excerpt":"Common clustering methods, such as $k$-means and convex clustering, group similar vector-valued observations into clusters. However, with the increasing prevalence of matrix-valued observations, which often exhibit low rank characteristics, there is a growing need for specialized clustering techniques for these data types. In this paper, we propose a low rank convex clustering model tailored for matrix-valued observations. Our approach extends the convex clustering model originally designed for vector-valued data to classify matrix-valued observations. Additionally, it serves as a convex relax"},"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.17328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-23T06:38:34Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"13268dd84c739a64d4adc001eb3594e21d57dc6010c62d2634400e1f5af031a5","abstract_canon_sha256":"a002ba5bfdece5d47477e3d52835a42a238cc1034166b56eb0e2c119cd728feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:20.946117Z","signature_b64":"wqvRiJPhO3FWxlMOWFYkGFROFULuH0I+ncX0Os9cKzsoRIjZfOnNmXn6R1sWK5dgknfJxKTkEhlCESu4A9moBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d389699fc24c86c08186206732e63e80858dea12172576967ec0cd08a1c208c","last_reissued_at":"2026-07-05T09:53:20.945755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:20.945755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Convex Clustering For Matrix-Valued Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Meixia Lin, Yangjing Zhang","submitted_at":"2024-12-23T06:38:34Z","abstract_excerpt":"Common clustering methods, such as $k$-means and convex clustering, group similar vector-valued observations into clusters. However, with the increasing prevalence of matrix-valued observations, which often exhibit low rank characteristics, there is a growing need for specialized clustering techniques for these data types. In this paper, we propose a low rank convex clustering model tailored for matrix-valued observations. Our approach extends the convex clustering model originally designed for vector-valued data to classify matrix-valued observations. Additionally, it serves as a convex relax"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17328","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.17328/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.17328","created_at":"2026-07-05T09:53:20.945826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17328v1","created_at":"2026-07-05T09:53:20.945826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17328","created_at":"2026-07-05T09:53:20.945826+00:00"},{"alias_kind":"pith_short_12","alias_value":"TU4JNGP4ETEG","created_at":"2026-07-05T09:53:20.945826+00:00"},{"alias_kind":"pith_short_16","alias_value":"TU4JNGP4ETEGYCAY","created_at":"2026-07-05T09:53:20.945826+00:00"},{"alias_kind":"pith_short_8","alias_value":"TU4JNGP4","created_at":"2026-07-05T09:53:20.945826+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/TU4JNGP4ETEGYCAYMIDHGLTD5A","json":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A.json","graph_json":"https://pith.science/api/pith-number/TU4JNGP4ETEGYCAYMIDHGLTD5A/graph.json","events_json":"https://pith.science/api/pith-number/TU4JNGP4ETEGYCAYMIDHGLTD5A/events.json","paper":"https://pith.science/paper/TU4JNGP4"},"agent_actions":{"view_html":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A","download_json":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A.json","view_paper":"https://pith.science/paper/TU4JNGP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17328&json=true","fetch_graph":"https://pith.science/api/pith-number/TU4JNGP4ETEGYCAYMIDHGLTD5A/graph.json","fetch_events":"https://pith.science/api/pith-number/TU4JNGP4ETEGYCAYMIDHGLTD5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A/action/storage_attestation","attest_author":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A/action/author_attestation","sign_citation":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A/action/citation_signature","submit_replication":"https://pith.science/pith/TU4JNGP4ETEGYCAYMIDHGLTD5A/action/replication_record"}},"created_at":"2026-07-05T09:53:20.945826+00:00","updated_at":"2026-07-05T09:53:20.945826+00:00"}