{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2QSUPBTEE26G6U4LGJZ76IDSHB","short_pith_number":"pith:2QSUPBTE","schema_version":"1.0","canonical_sha256":"d42547866426bc6f538b3273ff207238671e393cd519d7c032f807e654cb7017","source":{"kind":"arxiv","id":"2405.09369","version":5},"attestation_state":"computed","paper":{"title":"Diffusion-based Contrastive Learning for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bowei He, Chen Ma, Haolun Wu, Ji Cheng, Ziqiang Cui","submitted_at":"2024-05-15T14:20:37Z","abstract_excerpt":"Contrastive learning has been effectively utilized to enhance the training of sequential recommendation models by leveraging informative self-supervised signals. Most existing approaches generate augmented views of the same user sequence through random augmentation and subsequently maximize their agreement in the representation space. However, these methods often neglect the rationality of the augmented samples. Due to significant uncertainty, random augmentation can disrupt the semantic information and interest evolution patterns inherent in the original user sequences. Moreover, pulling sema"},"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":"2405.09369","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-05-15T14:20:37Z","cross_cats_sorted":[],"title_canon_sha256":"81818f40271611df23b8462b5a153300762f8c453babf3539ae188f9e25d00dd","abstract_canon_sha256":"f3c78aa072a5189269a6cb84b10cbc24d3fad5279a13f87b05f1fb43b5b9f6ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:43.855783Z","signature_b64":"vG13G29YlXEeqigSS28x7UH5BnvB72ljiA++4W/WDOCrI076RIa7Z/dCU6FKe1XbS3bEszCeXBnw/CVWbxpQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42547866426bc6f538b3273ff207238671e393cd519d7c032f807e654cb7017","last_reissued_at":"2026-07-05T10:09:43.855381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:43.855381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion-based Contrastive Learning for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bowei He, Chen Ma, Haolun Wu, Ji Cheng, Ziqiang Cui","submitted_at":"2024-05-15T14:20:37Z","abstract_excerpt":"Contrastive learning has been effectively utilized to enhance the training of sequential recommendation models by leveraging informative self-supervised signals. Most existing approaches generate augmented views of the same user sequence through random augmentation and subsequently maximize their agreement in the representation space. However, these methods often neglect the rationality of the augmented samples. Due to significant uncertainty, random augmentation can disrupt the semantic information and interest evolution patterns inherent in the original user sequences. Moreover, pulling sema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09369","kind":"arxiv","version":5},"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/2405.09369/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":"2405.09369","created_at":"2026-07-05T10:09:43.855442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.09369v5","created_at":"2026-07-05T10:09:43.855442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09369","created_at":"2026-07-05T10:09:43.855442+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QSUPBTEE26G","created_at":"2026-07-05T10:09:43.855442+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QSUPBTEE26G6U4L","created_at":"2026-07-05T10:09:43.855442+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QSUPBTE","created_at":"2026-07-05T10:09:43.855442+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16289","citing_title":"Time to Split: Exploring Data Splitting Strategies for Offline Evaluation of Sequential Recommenders","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB","json":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB.json","graph_json":"https://pith.science/api/pith-number/2QSUPBTEE26G6U4LGJZ76IDSHB/graph.json","events_json":"https://pith.science/api/pith-number/2QSUPBTEE26G6U4LGJZ76IDSHB/events.json","paper":"https://pith.science/paper/2QSUPBTE"},"agent_actions":{"view_html":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB","download_json":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB.json","view_paper":"https://pith.science/paper/2QSUPBTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.09369&json=true","fetch_graph":"https://pith.science/api/pith-number/2QSUPBTEE26G6U4LGJZ76IDSHB/graph.json","fetch_events":"https://pith.science/api/pith-number/2QSUPBTEE26G6U4LGJZ76IDSHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB/action/storage_attestation","attest_author":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB/action/author_attestation","sign_citation":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB/action/citation_signature","submit_replication":"https://pith.science/pith/2QSUPBTEE26G6U4LGJZ76IDSHB/action/replication_record"}},"created_at":"2026-07-05T10:09:43.855442+00:00","updated_at":"2026-07-05T10:09:43.855442+00:00"}