{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LN52ONBUAGI2NPPMLS3QT6DLP3","short_pith_number":"pith:LN52ONBU","schema_version":"1.0","canonical_sha256":"5b7ba734340191a6bdec5cb709f86b7eeccd8a2ccf03c59ab4d434b32205a79e","source":{"kind":"arxiv","id":"2504.14565","version":1},"attestation_state":"computed","paper":{"title":"Matrix Factorization with Dynamic Multi-view Clustering for Recommender System","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Hongxia Xu, Jian Wu, Ke Liu, Shangde Gao, Yichao Fu","submitted_at":"2025-04-20T10:47:21Z","abstract_excerpt":"Matrix factorization (MF), a cornerstone of recommender systems, decomposes user-item interaction matrices into latent representations. Traditional MF approaches, however, employ a two-stage, non-end-to-end paradigm, sequentially performing recommendation and clustering, resulting in prohibitive computational costs for large-scale applications like e-commerce and IoT, where billions of users interact with trillions of items. To address this, we propose Matrix Factorization with Dynamic Multi-view Clustering (MFDMC), a unified framework that balances efficient end-to-end training with comprehen"},"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":"2504.14565","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-04-20T10:47:21Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"8f3ce0fa6635606edb30c745a76e062710a7427dc2d04a16c2e95fa3990b10a8","abstract_canon_sha256":"c169103bf7e5cab73d492c34034128a02095c913ec9368a039bd30fb47869949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:46.149050Z","signature_b64":"gHPJG4MhG38RbOTr617ljL6VHJalB4CHUaqAj3FmoNiBq2K367q6C9mntgs205Sq3yB7xiIFbXnrncp+Cu4kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b7ba734340191a6bdec5cb709f86b7eeccd8a2ccf03c59ab4d434b32205a79e","last_reissued_at":"2026-07-05T10:51:46.148554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:46.148554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Factorization with Dynamic Multi-view Clustering for Recommender System","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Hongxia Xu, Jian Wu, Ke Liu, Shangde Gao, Yichao Fu","submitted_at":"2025-04-20T10:47:21Z","abstract_excerpt":"Matrix factorization (MF), a cornerstone of recommender systems, decomposes user-item interaction matrices into latent representations. Traditional MF approaches, however, employ a two-stage, non-end-to-end paradigm, sequentially performing recommendation and clustering, resulting in prohibitive computational costs for large-scale applications like e-commerce and IoT, where billions of users interact with trillions of items. To address this, we propose Matrix Factorization with Dynamic Multi-view Clustering (MFDMC), a unified framework that balances efficient end-to-end training with comprehen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14565","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/2504.14565/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":"2504.14565","created_at":"2026-07-05T10:51:46.148622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.14565v1","created_at":"2026-07-05T10:51:46.148622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14565","created_at":"2026-07-05T10:51:46.148622+00:00"},{"alias_kind":"pith_short_12","alias_value":"LN52ONBUAGI2","created_at":"2026-07-05T10:51:46.148622+00:00"},{"alias_kind":"pith_short_16","alias_value":"LN52ONBUAGI2NPPM","created_at":"2026-07-05T10:51:46.148622+00:00"},{"alias_kind":"pith_short_8","alias_value":"LN52ONBU","created_at":"2026-07-05T10:51:46.148622+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/LN52ONBUAGI2NPPMLS3QT6DLP3","json":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3.json","graph_json":"https://pith.science/api/pith-number/LN52ONBUAGI2NPPMLS3QT6DLP3/graph.json","events_json":"https://pith.science/api/pith-number/LN52ONBUAGI2NPPMLS3QT6DLP3/events.json","paper":"https://pith.science/paper/LN52ONBU"},"agent_actions":{"view_html":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3","download_json":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3.json","view_paper":"https://pith.science/paper/LN52ONBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.14565&json=true","fetch_graph":"https://pith.science/api/pith-number/LN52ONBUAGI2NPPMLS3QT6DLP3/graph.json","fetch_events":"https://pith.science/api/pith-number/LN52ONBUAGI2NPPMLS3QT6DLP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3/action/storage_attestation","attest_author":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3/action/author_attestation","sign_citation":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3/action/citation_signature","submit_replication":"https://pith.science/pith/LN52ONBUAGI2NPPMLS3QT6DLP3/action/replication_record"}},"created_at":"2026-07-05T10:51:46.148622+00:00","updated_at":"2026-07-05T10:51:46.148622+00:00"}