{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D2SDVRJRBAC5NLFO2W5UHNOZV5","short_pith_number":"pith:D2SDVRJR","schema_version":"1.0","canonical_sha256":"1ea43ac5310805d6acaed5bb43b5d9af7270edfb405fadea4d9aa809b241d476","source":{"kind":"arxiv","id":"2403.18348","version":1},"attestation_state":"computed","paper":{"title":"Sequential Recommendation with Latent Relations based on Large Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Mingchen Cai, Min Zhang, Peijie Sun, Qingyao Ai, Shenghao Yang, Weizhi Ma, Yiqun Liu","submitted_at":"2024-03-27T08:39:42Z","abstract_excerpt":"Sequential recommender systems predict items that may interest users by modeling their preferences based on historical interactions. Traditional sequential recommendation methods rely on capturing implicit collaborative filtering signals among items. Recent relation-aware sequential recommendation models have achieved promising performance by explicitly incorporating item relations into the modeling of user historical sequences, where most relations are extracted from knowledge graphs. However, existing methods rely on manually predefined relations and suffer the sparsity issue, limiting the g"},"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":"2403.18348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-03-27T08:39:42Z","cross_cats_sorted":[],"title_canon_sha256":"1a0b72084b813da8e9e1053b9c6dce5ac8a79d78fa1ae8080199dc5bcf761e80","abstract_canon_sha256":"d14db6c686cb428e76b325b1226447bd3dd3c57b02aee5fab6639ac8c02b254b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:21.463434Z","signature_b64":"ao7Z7yr76mLlAnhmNPnY8Uzht3McyAOSsmKt1Chw4az/Qw3BD5xPljCrxTryGQBRzeRWZYr93FZI7AcscbPrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea43ac5310805d6acaed5bb43b5d9af7270edfb405fadea4d9aa809b241d476","last_reissued_at":"2026-07-05T08:01:21.463074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:21.463074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Recommendation with Latent Relations based on Large Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Mingchen Cai, Min Zhang, Peijie Sun, Qingyao Ai, Shenghao Yang, Weizhi Ma, Yiqun Liu","submitted_at":"2024-03-27T08:39:42Z","abstract_excerpt":"Sequential recommender systems predict items that may interest users by modeling their preferences based on historical interactions. Traditional sequential recommendation methods rely on capturing implicit collaborative filtering signals among items. Recent relation-aware sequential recommendation models have achieved promising performance by explicitly incorporating item relations into the modeling of user historical sequences, where most relations are extracted from knowledge graphs. However, existing methods rely on manually predefined relations and suffer the sparsity issue, limiting the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18348","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/2403.18348/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":"2403.18348","created_at":"2026-07-05T08:01:21.463135+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18348v1","created_at":"2026-07-05T08:01:21.463135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18348","created_at":"2026-07-05T08:01:21.463135+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2SDVRJRBAC5","created_at":"2026-07-05T08:01:21.463135+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2SDVRJRBAC5NLFO","created_at":"2026-07-05T08:01:21.463135+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2SDVRJR","created_at":"2026-07-05T08:01:21.463135+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13021","citing_title":"C-TLSAN: Content-Enhanced Time-Aware Long- and Short-Term Attention Network for Personalized Recommendation","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5","json":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5.json","graph_json":"https://pith.science/api/pith-number/D2SDVRJRBAC5NLFO2W5UHNOZV5/graph.json","events_json":"https://pith.science/api/pith-number/D2SDVRJRBAC5NLFO2W5UHNOZV5/events.json","paper":"https://pith.science/paper/D2SDVRJR"},"agent_actions":{"view_html":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5","download_json":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5.json","view_paper":"https://pith.science/paper/D2SDVRJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18348&json=true","fetch_graph":"https://pith.science/api/pith-number/D2SDVRJRBAC5NLFO2W5UHNOZV5/graph.json","fetch_events":"https://pith.science/api/pith-number/D2SDVRJRBAC5NLFO2W5UHNOZV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5/action/storage_attestation","attest_author":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5/action/author_attestation","sign_citation":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5/action/citation_signature","submit_replication":"https://pith.science/pith/D2SDVRJRBAC5NLFO2W5UHNOZV5/action/replication_record"}},"created_at":"2026-07-05T08:01:21.463135+00:00","updated_at":"2026-07-05T08:01:21.463135+00:00"}