{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NM7SAJOTMAOEVQCV37ZH5O5SLW","short_pith_number":"pith:NM7SAJOT","schema_version":"1.0","canonical_sha256":"6b3f2025d3601c4ac055dff27ebbb25dac1b78a6dbf9882ee01e6a77822af9cf","source":{"kind":"arxiv","id":"2309.12858","version":1},"attestation_state":"computed","paper":{"title":"Diffusion Augmentation for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Fan Yan, Feng Tian, Huifeng Guo, Qidong Liu, Ruiming Tang, Xiangyu Zhao, Zhaocheng Du","submitted_at":"2023-09-22T13:31:34Z","abstract_excerpt":"Sequential recommendation (SRS) has become the technical foundation in many applications recently, which aims to recommend the next item based on the user's historical interactions. However, sequential recommendation often faces the problem of data sparsity, which widely exists in recommender systems. Besides, most users only interact with a few items, but existing SRS models often underperform these users. Such a problem, named the long-tail user problem, is still to be resolved. Data augmentation is a distinct way to alleviate these two problems, but they often need fabricated training strat"},"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":"2309.12858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-09-22T13:31:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b4ea0932ab3b02dbdbefa51da4979709b4b2e82302908f0d90ba7b6ae9a7059a","abstract_canon_sha256":"2174911f92bb07e2ce3105c8417a07e05649213aeeb6eec669e63458ecafa33a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:18.629943Z","signature_b64":"Stf7RED3+bPUdu89U++wCff060EWViWByITYbzUYGSlxpf3so7+9EIWFSBQQdUFQ4OV6jg7CCQ/M40k4YjyWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b3f2025d3601c4ac055dff27ebbb25dac1b78a6dbf9882ee01e6a77822af9cf","last_reissued_at":"2026-07-05T06:53:18.629532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:18.629532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion Augmentation for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Fan Yan, Feng Tian, Huifeng Guo, Qidong Liu, Ruiming Tang, Xiangyu Zhao, Zhaocheng Du","submitted_at":"2023-09-22T13:31:34Z","abstract_excerpt":"Sequential recommendation (SRS) has become the technical foundation in many applications recently, which aims to recommend the next item based on the user's historical interactions. However, sequential recommendation often faces the problem of data sparsity, which widely exists in recommender systems. Besides, most users only interact with a few items, but existing SRS models often underperform these users. Such a problem, named the long-tail user problem, is still to be resolved. Data augmentation is a distinct way to alleviate these two problems, but they often need fabricated training strat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12858","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/2309.12858/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":"2309.12858","created_at":"2026-07-05T06:53:18.629589+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.12858v1","created_at":"2026-07-05T06:53:18.629589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12858","created_at":"2026-07-05T06:53:18.629589+00:00"},{"alias_kind":"pith_short_12","alias_value":"NM7SAJOTMAOE","created_at":"2026-07-05T06:53:18.629589+00:00"},{"alias_kind":"pith_short_16","alias_value":"NM7SAJOTMAOEVQCV","created_at":"2026-07-05T06:53:18.629589+00:00"},{"alias_kind":"pith_short_8","alias_value":"NM7SAJOT","created_at":"2026-07-05T06:53:18.629589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08960","citing_title":"A Comprehensive Survey on Imbalanced Data Learning","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW","json":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW.json","graph_json":"https://pith.science/api/pith-number/NM7SAJOTMAOEVQCV37ZH5O5SLW/graph.json","events_json":"https://pith.science/api/pith-number/NM7SAJOTMAOEVQCV37ZH5O5SLW/events.json","paper":"https://pith.science/paper/NM7SAJOT"},"agent_actions":{"view_html":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW","download_json":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW.json","view_paper":"https://pith.science/paper/NM7SAJOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.12858&json=true","fetch_graph":"https://pith.science/api/pith-number/NM7SAJOTMAOEVQCV37ZH5O5SLW/graph.json","fetch_events":"https://pith.science/api/pith-number/NM7SAJOTMAOEVQCV37ZH5O5SLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW/action/storage_attestation","attest_author":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW/action/author_attestation","sign_citation":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW/action/citation_signature","submit_replication":"https://pith.science/pith/NM7SAJOTMAOEVQCV37ZH5O5SLW/action/replication_record"}},"created_at":"2026-07-05T06:53:18.629589+00:00","updated_at":"2026-07-05T06:53:18.629589+00:00"}