{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NEDSTLONJU6673SE4YJ24V2QV4","short_pith_number":"pith:NEDSTLON","schema_version":"1.0","canonical_sha256":"690729adcd4d3defee44e613ae5750af25878e001c93774398d5d907645ab304","source":{"kind":"arxiv","id":"2401.02913","version":1},"attestation_state":"computed","paper":{"title":"Plug-in Diffusion Model for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Haokai Ma, Lei Meng, Leyu Lin, Ruobing Xie, Xin Chen, Xu Zhang, Zhanhui Kang","submitted_at":"2024-01-05T17:38:40Z","abstract_excerpt":"Pioneering efforts have verified the effectiveness of the diffusion models in exploring the informative uncertainty for recommendation. Considering the difference between recommendation and image synthesis tasks, existing methods have undertaken tailored refinements to the diffusion and reverse process. However, these approaches typically use the highest-score item in corpus for user interest prediction, leading to the ignorance of the user's generalized preference contained within other items, thereby remaining constrained by the data sparsity issue. To address this issue, this paper presents"},"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":"2401.02913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-01-05T17:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"15b93082ceb1b48fd472bc51c78fafa56cb074c61c24de3dcfaa81272f8e009a","abstract_canon_sha256":"93f7b3fd71d7c04cf9198389bbd26c0dc1a4d88206101f968e4d5a5a835d3e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:40.051450Z","signature_b64":"NN6Hz7kr9teonPeR65x15nwCvTEiMItD7kExRC3S7gjsU1NjAcEQVKfdqdyo/4JS/G8kbfIvFGDZM1uIXt2ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690729adcd4d3defee44e613ae5750af25878e001c93774398d5d907645ab304","last_reissued_at":"2026-07-05T07:30:40.050997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:40.050997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plug-in Diffusion Model for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Haokai Ma, Lei Meng, Leyu Lin, Ruobing Xie, Xin Chen, Xu Zhang, Zhanhui Kang","submitted_at":"2024-01-05T17:38:40Z","abstract_excerpt":"Pioneering efforts have verified the effectiveness of the diffusion models in exploring the informative uncertainty for recommendation. Considering the difference between recommendation and image synthesis tasks, existing methods have undertaken tailored refinements to the diffusion and reverse process. However, these approaches typically use the highest-score item in corpus for user interest prediction, leading to the ignorance of the user's generalized preference contained within other items, thereby remaining constrained by the data sparsity issue. To address this issue, this paper presents"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02913","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/2401.02913/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":"2401.02913","created_at":"2026-07-05T07:30:40.051054+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.02913v1","created_at":"2026-07-05T07:30:40.051054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02913","created_at":"2026-07-05T07:30:40.051054+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEDSTLONJU66","created_at":"2026-07-05T07:30:40.051054+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEDSTLONJU6673SE","created_at":"2026-07-05T07:30:40.051054+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEDSTLON","created_at":"2026-07-05T07:30:40.051054+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16969","citing_title":"LLM4MEA: Data-free Model Extraction Attacks on Sequential Recommenders via Large Language Models","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4","json":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4.json","graph_json":"https://pith.science/api/pith-number/NEDSTLONJU6673SE4YJ24V2QV4/graph.json","events_json":"https://pith.science/api/pith-number/NEDSTLONJU6673SE4YJ24V2QV4/events.json","paper":"https://pith.science/paper/NEDSTLON"},"agent_actions":{"view_html":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4","download_json":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4.json","view_paper":"https://pith.science/paper/NEDSTLON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.02913&json=true","fetch_graph":"https://pith.science/api/pith-number/NEDSTLONJU6673SE4YJ24V2QV4/graph.json","fetch_events":"https://pith.science/api/pith-number/NEDSTLONJU6673SE4YJ24V2QV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4/action/storage_attestation","attest_author":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4/action/author_attestation","sign_citation":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4/action/citation_signature","submit_replication":"https://pith.science/pith/NEDSTLONJU6673SE4YJ24V2QV4/action/replication_record"}},"created_at":"2026-07-05T07:30:40.051054+00:00","updated_at":"2026-07-05T07:30:40.051054+00:00"}