{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JRFVBGIICR2INOCP2X7OHQUONU","short_pith_number":"pith:JRFVBGII","schema_version":"1.0","canonical_sha256":"4c4b509908147486b84fd5fee3c28e6d3fdbb6f7fdf53e0d33a16bfa8c4cf382","source":{"kind":"arxiv","id":"1809.05998","version":1},"attestation_state":"computed","paper":{"title":"Incomplete Multi-view Clustering via Graph Regularized Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jie Wen, Yong Xu, Zheng Zhang, Zuofeng Zhong","submitted_at":"2018-09-17T02:46:48Z","abstract_excerpt":"Clustering with incomplete views is a challenge in multi-view clustering. In this paper, we provide a novel and simple method to address this issue. Specifically, the proposed method simultaneously exploits the local information of each view and the complementary information among views to learn the common latent representation for all samples, which can greatly improve the compactness and discriminability of the obtained representation. Compared with the conventional graph embedding methods, the proposed method does not introduce any extra regularization term and corresponding penalty paramet"},"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":"1809.05998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-09-17T02:46:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"920c6749a7d55d69e5bf36bab9559c1d78d86a7cc100cc53538cf8fe5fbae897","abstract_canon_sha256":"1bed9c0f5c637a2f7f793552d18c8852932fb89e7e88b999a452e449a7f8af19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.901353Z","signature_b64":"DYNdfF91jskrCrycMvT56p71WZAeA0vK3d2YSv07vXVCA6MI6xOH35OYoqNMxwKkDU5XjOjQbW2DkxH+Bi/FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c4b509908147486b84fd5fee3c28e6d3fdbb6f7fdf53e0d33a16bfa8c4cf382","last_reissued_at":"2026-05-18T00:05:35.900924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.900924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incomplete Multi-view Clustering via Graph Regularized Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jie Wen, Yong Xu, Zheng Zhang, Zuofeng Zhong","submitted_at":"2018-09-17T02:46:48Z","abstract_excerpt":"Clustering with incomplete views is a challenge in multi-view clustering. In this paper, we provide a novel and simple method to address this issue. Specifically, the proposed method simultaneously exploits the local information of each view and the complementary information among views to learn the common latent representation for all samples, which can greatly improve the compactness and discriminability of the obtained representation. Compared with the conventional graph embedding methods, the proposed method does not introduce any extra regularization term and corresponding penalty paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05998","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":"1809.05998","created_at":"2026-05-18T00:05:35.900989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05998v1","created_at":"2026-05-18T00:05:35.900989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05998","created_at":"2026-05-18T00:05:35.900989+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRFVBGIICR2I","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRFVBGIICR2INOCP","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRFVBGII","created_at":"2026-05-18T12:32:31.084164+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/JRFVBGIICR2INOCP2X7OHQUONU","json":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU.json","graph_json":"https://pith.science/api/pith-number/JRFVBGIICR2INOCP2X7OHQUONU/graph.json","events_json":"https://pith.science/api/pith-number/JRFVBGIICR2INOCP2X7OHQUONU/events.json","paper":"https://pith.science/paper/JRFVBGII"},"agent_actions":{"view_html":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU","download_json":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU.json","view_paper":"https://pith.science/paper/JRFVBGII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05998&json=true","fetch_graph":"https://pith.science/api/pith-number/JRFVBGIICR2INOCP2X7OHQUONU/graph.json","fetch_events":"https://pith.science/api/pith-number/JRFVBGIICR2INOCP2X7OHQUONU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU/action/storage_attestation","attest_author":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU/action/author_attestation","sign_citation":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU/action/citation_signature","submit_replication":"https://pith.science/pith/JRFVBGIICR2INOCP2X7OHQUONU/action/replication_record"}},"created_at":"2026-05-18T00:05:35.900989+00:00","updated_at":"2026-05-18T00:05:35.900989+00:00"}