{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:P5XKZIHE4E4G4NW7EASUELFECQ","short_pith_number":"pith:P5XKZIHE","schema_version":"1.0","canonical_sha256":"7f6eaca0e4e1386e36df2025422ca4140bfc2a08ea24ef1f696845125d626125","source":{"kind":"arxiv","id":"2208.00593","version":1},"attestation_state":"computed","paper":{"title":"Long Short-Term Preference Modeling for Continuous-Time Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Hao Fu, Hao Xu, Huixuan Chi, Mengdi Zhang, Mengya Liu, Qinfen Hao, Wei Wu, Yuji Yang","submitted_at":"2022-08-01T03:44:55Z","abstract_excerpt":"Modeling the evolution of user preference is essential in recommender systems. Recently, dynamic graph-based methods have been studied and achieved SOTA for recommendation, majority of which focus on user's stable long-term preference. However, in real-world scenario, user's short-term preference evolves over time dynamically. Although there exists sequential methods that attempt to capture it, how to model the evolution of short-term preference with dynamic graph-based methods has not been well-addressed yet. In particular: 1) existing methods do not explicitly encode and capture the evolutio"},"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":"2208.00593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-08-01T03:44:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"85bd696410ed27d718212106cf084f259b1ff136ca51e2bddecdcba531d250a7","abstract_canon_sha256":"402ddbe020a91a651cbb48188286d0e5d1ad819ff9cccc545f027360964c442c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:45:02.349762Z","signature_b64":"1ZnISJaoKJX+ePkHC0DV25MbWoetzWzxaM5+3e5Cb4w7MS9hKJ1AF+fGBoAlR5bUK8vjqbrma77bzLpCDVGeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6eaca0e4e1386e36df2025422ca4140bfc2a08ea24ef1f696845125d626125","last_reissued_at":"2026-07-05T04:45:02.349264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:45:02.349264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long Short-Term Preference Modeling for Continuous-Time Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Hao Fu, Hao Xu, Huixuan Chi, Mengdi Zhang, Mengya Liu, Qinfen Hao, Wei Wu, Yuji Yang","submitted_at":"2022-08-01T03:44:55Z","abstract_excerpt":"Modeling the evolution of user preference is essential in recommender systems. Recently, dynamic graph-based methods have been studied and achieved SOTA for recommendation, majority of which focus on user's stable long-term preference. However, in real-world scenario, user's short-term preference evolves over time dynamically. Although there exists sequential methods that attempt to capture it, how to model the evolution of short-term preference with dynamic graph-based methods has not been well-addressed yet. In particular: 1) existing methods do not explicitly encode and capture the evolutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00593","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/2208.00593/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":"2208.00593","created_at":"2026-07-05T04:45:02.349322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.00593v1","created_at":"2026-07-05T04:45:02.349322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00593","created_at":"2026-07-05T04:45:02.349322+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5XKZIHE4E4G","created_at":"2026-07-05T04:45:02.349322+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5XKZIHE4E4G4NW7","created_at":"2026-07-05T04:45:02.349322+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5XKZIHE","created_at":"2026-07-05T04:45:02.349322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17707","citing_title":"Do Generative Recommenders Deepen the Information Cocoon? A Closed-Loop Simulation with LLM-powered User Simulators","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ","json":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ.json","graph_json":"https://pith.science/api/pith-number/P5XKZIHE4E4G4NW7EASUELFECQ/graph.json","events_json":"https://pith.science/api/pith-number/P5XKZIHE4E4G4NW7EASUELFECQ/events.json","paper":"https://pith.science/paper/P5XKZIHE"},"agent_actions":{"view_html":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ","download_json":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ.json","view_paper":"https://pith.science/paper/P5XKZIHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.00593&json=true","fetch_graph":"https://pith.science/api/pith-number/P5XKZIHE4E4G4NW7EASUELFECQ/graph.json","fetch_events":"https://pith.science/api/pith-number/P5XKZIHE4E4G4NW7EASUELFECQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ/action/storage_attestation","attest_author":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ/action/author_attestation","sign_citation":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ/action/citation_signature","submit_replication":"https://pith.science/pith/P5XKZIHE4E4G4NW7EASUELFECQ/action/replication_record"}},"created_at":"2026-07-05T04:45:02.349322+00:00","updated_at":"2026-07-05T04:45:02.349322+00:00"}