{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5RFNYHFTF6LZG35CX6KMOKBR7O","short_pith_number":"pith:5RFNYHFT","schema_version":"1.0","canonical_sha256":"ec4adc1cb32f97936fa2bf94c72831fbb47a66d0fe45da3de646a9f5bf91766d","source":{"kind":"arxiv","id":"2204.10851","version":3},"attestation_state":"computed","paper":{"title":"Exploiting Session Information in BERT-based Session-aware Sequential Recommendation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jinseok Seol, Sang-goo Lee, Youngrok Ko","submitted_at":"2022-04-22T17:58:10Z","abstract_excerpt":"In recommendation systems, utilizing the user interaction history as sequential information has resulted in great performance improvement. However, in many online services, user interactions are commonly grouped by sessions that presumably share preferences, which requires a different approach from ordinary sequence representation techniques. To this end, sequence representation models with a hierarchical structure or various viewpoints have been developed but with a rather complex network structure. In this paper, we propose three methods to improve recommendation performance by exploiting se"},"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":"2204.10851","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2022-04-22T17:58:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"07298e9c9ad7f3a6db6b7c3c4fc94c0cfb94cc89263a763e23078ad4d12e04bc","abstract_canon_sha256":"7864d18b9c64767882813ee5d00608b8536474525bad00914b00d55e1808fd65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:48.573848Z","signature_b64":"NJ35xq+cKxtgAEWRzT65y3XVGMjZp/6czg04Ey7QVFwtkji88LIIKslCXjQXkK9ePW0wjnt1UkghsKzoJ7FsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec4adc1cb32f97936fa2bf94c72831fbb47a66d0fe45da3de646a9f5bf91766d","last_reissued_at":"2026-07-05T04:24:48.573426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:48.573426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Session Information in BERT-based Session-aware Sequential Recommendation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jinseok Seol, Sang-goo Lee, Youngrok Ko","submitted_at":"2022-04-22T17:58:10Z","abstract_excerpt":"In recommendation systems, utilizing the user interaction history as sequential information has resulted in great performance improvement. However, in many online services, user interactions are commonly grouped by sessions that presumably share preferences, which requires a different approach from ordinary sequence representation techniques. To this end, sequence representation models with a hierarchical structure or various viewpoints have been developed but with a rather complex network structure. In this paper, we propose three methods to improve recommendation performance by exploiting se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.10851","kind":"arxiv","version":3},"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/2204.10851/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":"2204.10851","created_at":"2026-07-05T04:24:48.573482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.10851v3","created_at":"2026-07-05T04:24:48.573482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.10851","created_at":"2026-07-05T04:24:48.573482+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RFNYHFTF6LZ","created_at":"2026-07-05T04:24:48.573482+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RFNYHFTF6LZG35C","created_at":"2026-07-05T04:24:48.573482+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RFNYHFT","created_at":"2026-07-05T04:24:48.573482+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.23209","citing_title":"Not Just What, But When: Integrating Irregular Intervals to LLM for Sequential Recommendation","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O","json":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O.json","graph_json":"https://pith.science/api/pith-number/5RFNYHFTF6LZG35CX6KMOKBR7O/graph.json","events_json":"https://pith.science/api/pith-number/5RFNYHFTF6LZG35CX6KMOKBR7O/events.json","paper":"https://pith.science/paper/5RFNYHFT"},"agent_actions":{"view_html":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O","download_json":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O.json","view_paper":"https://pith.science/paper/5RFNYHFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.10851&json=true","fetch_graph":"https://pith.science/api/pith-number/5RFNYHFTF6LZG35CX6KMOKBR7O/graph.json","fetch_events":"https://pith.science/api/pith-number/5RFNYHFTF6LZG35CX6KMOKBR7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O/action/storage_attestation","attest_author":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O/action/author_attestation","sign_citation":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O/action/citation_signature","submit_replication":"https://pith.science/pith/5RFNYHFTF6LZG35CX6KMOKBR7O/action/replication_record"}},"created_at":"2026-07-05T04:24:48.573482+00:00","updated_at":"2026-07-05T04:24:48.573482+00:00"}