{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KLXWX253ZEOQUJMBBRLO45226O","short_pith_number":"pith:KLXWX253","schema_version":"1.0","canonical_sha256":"52ef6bebbbc91d0a25810c56ee775af3af952dc1621283c08c32f24074984189","source":{"kind":"arxiv","id":"1607.02858","version":1},"attestation_state":"computed","paper":{"title":"Incremental Factorization Machines for Persistently Cold-starting Online Item Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Takuya Kitazawa","submitted_at":"2016-07-11T08:37:42Z","abstract_excerpt":"Real-world item recommenders commonly suffer from a persistent cold-start problem which is caused by dynamically changing users and items. In order to overcome the problem, several context-aware recommendation techniques have been recently proposed. In terms of both feasibility and performance, factorization machine (FM) is one of the most promising methods as generalization of the conventional matrix factorization techniques. However, since online algorithms are suitable for dynamic data, the static FMs are still inadequate. Thus, this paper proposes incremental FMs (iFMs), a general online f"},"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":"1607.02858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T08:37:42Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"9248c6d488d7e996398a2d90b2581129db27c972743d03ce74d35a94a099834c","abstract_canon_sha256":"47427bb0505b8da64e9436a86e56b126e3b0da7f3c46ccd8e1389cc54ca180a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:14.527596Z","signature_b64":"G8yxBs+20enV/OYrdDxIwNpSj74RaYI6gYJ+IZ5I31+ADU0ZQPhBK18P3upoCPr1w5HMFXzf5+kfdZny4XDUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52ef6bebbbc91d0a25810c56ee775af3af952dc1621283c08c32f24074984189","last_reissued_at":"2026-05-18T01:11:14.526995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:14.526995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Factorization Machines for Persistently Cold-starting Online Item Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Takuya Kitazawa","submitted_at":"2016-07-11T08:37:42Z","abstract_excerpt":"Real-world item recommenders commonly suffer from a persistent cold-start problem which is caused by dynamically changing users and items. In order to overcome the problem, several context-aware recommendation techniques have been recently proposed. In terms of both feasibility and performance, factorization machine (FM) is one of the most promising methods as generalization of the conventional matrix factorization techniques. However, since online algorithms are suitable for dynamic data, the static FMs are still inadequate. Thus, this paper proposes incremental FMs (iFMs), a general online f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02858","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":"1607.02858","created_at":"2026-05-18T01:11:14.527090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02858v1","created_at":"2026-05-18T01:11:14.527090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02858","created_at":"2026-05-18T01:11:14.527090+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLXWX253ZEOQ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLXWX253ZEOQUJMB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLXWX253","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07319","citing_title":"MEGG: Replay via Maximally Extreme GGscore in Incremental Learning for Neural Recommendation Models","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O","json":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O.json","graph_json":"https://pith.science/api/pith-number/KLXWX253ZEOQUJMBBRLO45226O/graph.json","events_json":"https://pith.science/api/pith-number/KLXWX253ZEOQUJMBBRLO45226O/events.json","paper":"https://pith.science/paper/KLXWX253"},"agent_actions":{"view_html":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O","download_json":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O.json","view_paper":"https://pith.science/paper/KLXWX253","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02858&json=true","fetch_graph":"https://pith.science/api/pith-number/KLXWX253ZEOQUJMBBRLO45226O/graph.json","fetch_events":"https://pith.science/api/pith-number/KLXWX253ZEOQUJMBBRLO45226O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O/action/storage_attestation","attest_author":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O/action/author_attestation","sign_citation":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O/action/citation_signature","submit_replication":"https://pith.science/pith/KLXWX253ZEOQUJMBBRLO45226O/action/replication_record"}},"created_at":"2026-05-18T01:11:14.527090+00:00","updated_at":"2026-05-18T01:11:14.527090+00:00"}