{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AAW4MXHEJRAD3AOX44NTGRRXFK","short_pith_number":"pith:AAW4MXHE","schema_version":"1.0","canonical_sha256":"002dc65ce44c403d81d7e71b3346372ab3e1c235f79f5de496c1fec14cf16e39","source":{"kind":"arxiv","id":"2410.23300","version":3},"attestation_state":"computed","paper":{"title":"Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Danai Koutra, Donald Loveland, Mingxuan Ju, Neil Shah, Tong Zhao, Xinyi Wu","submitted_at":"2024-10-15T21:54:13Z","abstract_excerpt":"Collaborative Filtering (CF) methods dominate real-world recommender systems given their ability to learn high-quality, sparse ID-embedding tables that effectively capture user preferences. These tables scale linearly with the number of users and items, and are trained to ensure high similarity between embeddings of interacted user-item pairs, while maintaining low similarity for non-interacted pairs. Despite their high performance, encouraging dispersion for non-interacted pairs necessitates expensive regularization (e.g., negative sampling), hurting runtime and scalability. Existing research"},"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":"2410.23300","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-10-15T21:54:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2e796e70ed32c4d1cf78f5998e53b74f1a20af991e77f3411a084574879ba843","abstract_canon_sha256":"823a1238afae1a861c4ae725c16a775a0945b9c235890cf608a8cf58f7814b3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:37.076834Z","signature_b64":"HNkEtcnAhHQ5nVTYLGV2lkxl/nQTNRhzlwq6YMb7Ii5CLi3hJDpaGrGeIt4mikHB25VRbejscfbFLq31ot8+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"002dc65ce44c403d81d7e71b3346372ab3e1c235f79f5de496c1fec14cf16e39","last_reissued_at":"2026-07-05T12:02:37.076233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:37.076233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Danai Koutra, Donald Loveland, Mingxuan Ju, Neil Shah, Tong Zhao, Xinyi Wu","submitted_at":"2024-10-15T21:54:13Z","abstract_excerpt":"Collaborative Filtering (CF) methods dominate real-world recommender systems given their ability to learn high-quality, sparse ID-embedding tables that effectively capture user preferences. These tables scale linearly with the number of users and items, and are trained to ensure high similarity between embeddings of interacted user-item pairs, while maintaining low similarity for non-interacted pairs. Despite their high performance, encouraging dispersion for non-interacted pairs necessitates expensive regularization (e.g., negative sampling), hurting runtime and scalability. Existing research"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23300","kind":"arxiv","version":3},"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/2410.23300/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":"2410.23300","created_at":"2026-07-05T12:02:37.076296+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23300v3","created_at":"2026-07-05T12:02:37.076296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23300","created_at":"2026-07-05T12:02:37.076296+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAW4MXHEJRAD","created_at":"2026-07-05T12:02:37.076296+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAW4MXHEJRAD3AOX","created_at":"2026-07-05T12:02:37.076296+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAW4MXHE","created_at":"2026-07-05T12:02:37.076296+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/AAW4MXHEJRAD3AOX44NTGRRXFK","json":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK.json","graph_json":"https://pith.science/api/pith-number/AAW4MXHEJRAD3AOX44NTGRRXFK/graph.json","events_json":"https://pith.science/api/pith-number/AAW4MXHEJRAD3AOX44NTGRRXFK/events.json","paper":"https://pith.science/paper/AAW4MXHE"},"agent_actions":{"view_html":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK","download_json":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK.json","view_paper":"https://pith.science/paper/AAW4MXHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23300&json=true","fetch_graph":"https://pith.science/api/pith-number/AAW4MXHEJRAD3AOX44NTGRRXFK/graph.json","fetch_events":"https://pith.science/api/pith-number/AAW4MXHEJRAD3AOX44NTGRRXFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK/action/storage_attestation","attest_author":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK/action/author_attestation","sign_citation":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK/action/citation_signature","submit_replication":"https://pith.science/pith/AAW4MXHEJRAD3AOX44NTGRRXFK/action/replication_record"}},"created_at":"2026-07-05T12:02:37.076296+00:00","updated_at":"2026-07-05T12:02:37.076296+00:00"}