{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XKLFQD3726L2RUPKB2HABXUJEN","short_pith_number":"pith:XKLFQD37","schema_version":"1.0","canonical_sha256":"ba96580f7fd797a8d1ea0e8e00de892369456517dc35a420a6c4170d35a433d8","source":{"kind":"arxiv","id":"1109.2271","version":3},"attestation_state":"computed","paper":{"title":"Feature-Based Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Qiuxia Lu, Tianqi Chen, Weinan Zhang, Yong Yu, Zhao Zheng","submitted_at":"2011-09-11T01:10:06Z","abstract_excerpt":"Recommender system has been more and more popular and widely used in many applications recently. The increasing information available, not only in quantities but also in types, leads to a big challenge for recommender system that how to leverage these rich information to get a better performance. Most traditional approaches try to design a specific model for each scenario, which demands great efforts in developing and modifying models. In this technical report, we describe our implementation of feature-based matrix factorization. This model is an abstract of many variants of matrix factorizati"},"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":"1109.2271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-11T01:10:06Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"6171f76f0ad18bb7be0753744d0b84ba130a1696756c371b41595b93aa780492","abstract_canon_sha256":"76d27143f79f22508620f9122e9da5c6f6ecd4b5bfab294fecca27a19689d20e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:38.326835Z","signature_b64":"W4ryR4gyeq2YjTZIZvIIEOh9IRN3I3lc86FMLj22NoJxW0oaloxVRu1xj8lIYUUIbgiLqookfMh1Bc2CM/NmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba96580f7fd797a8d1ea0e8e00de892369456517dc35a420a6c4170d35a433d8","last_reissued_at":"2026-05-18T04:05:38.326428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:38.326428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature-Based Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Qiuxia Lu, Tianqi Chen, Weinan Zhang, Yong Yu, Zhao Zheng","submitted_at":"2011-09-11T01:10:06Z","abstract_excerpt":"Recommender system has been more and more popular and widely used in many applications recently. The increasing information available, not only in quantities but also in types, leads to a big challenge for recommender system that how to leverage these rich information to get a better performance. Most traditional approaches try to design a specific model for each scenario, which demands great efforts in developing and modifying models. In this technical report, we describe our implementation of feature-based matrix factorization. This model is an abstract of many variants of matrix factorizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2271","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":""},"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":"1109.2271","created_at":"2026-05-18T04:05:38.326497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2271v3","created_at":"2026-05-18T04:05:38.326497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2271","created_at":"2026-05-18T04:05:38.326497+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKLFQD3726L2","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKLFQD3726L2RUPK","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKLFQD37","created_at":"2026-05-18T12:26:47.523578+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/XKLFQD3726L2RUPKB2HABXUJEN","json":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN.json","graph_json":"https://pith.science/api/pith-number/XKLFQD3726L2RUPKB2HABXUJEN/graph.json","events_json":"https://pith.science/api/pith-number/XKLFQD3726L2RUPKB2HABXUJEN/events.json","paper":"https://pith.science/paper/XKLFQD37"},"agent_actions":{"view_html":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN","download_json":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN.json","view_paper":"https://pith.science/paper/XKLFQD37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2271&json=true","fetch_graph":"https://pith.science/api/pith-number/XKLFQD3726L2RUPKB2HABXUJEN/graph.json","fetch_events":"https://pith.science/api/pith-number/XKLFQD3726L2RUPKB2HABXUJEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN/action/storage_attestation","attest_author":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN/action/author_attestation","sign_citation":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN/action/citation_signature","submit_replication":"https://pith.science/pith/XKLFQD3726L2RUPKB2HABXUJEN/action/replication_record"}},"created_at":"2026-05-18T04:05:38.326497+00:00","updated_at":"2026-05-18T04:05:38.326497+00:00"}