{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UY4MEGM3COJHNWTSQD2KPPESUQ","short_pith_number":"pith:UY4MEGM3","canonical_record":{"source":{"id":"2409.17730","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-26T11:00:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0603c1e77f660162ad59ac4ac4313e1f929cdd19584ab49a1c9646cc75d72df0","abstract_canon_sha256":"8e2ebc2d9219922ae05952d4918107b1c1d27007e823d3ee6e0b70a1b153a342"},"schema_version":"1.0"},"canonical_sha256":"a638c2199b139276da7280f4a7bc92a40bfebe593ee1765ee698345516c4a9e8","source":{"kind":"arxiv","id":"2409.17730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.17730","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"2409.17730v1","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17730","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"UY4MEGM3COJH","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"pith_short_16","alias_value":"UY4MEGM3COJHNWTS","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"pith_short_8","alias_value":"UY4MEGM3","created_at":"2026-07-05T11:54:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UY4MEGM3COJHNWTSQD2KPPESUQ","target":"record","payload":{"canonical_record":{"source":{"id":"2409.17730","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-26T11:00:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0603c1e77f660162ad59ac4ac4313e1f929cdd19584ab49a1c9646cc75d72df0","abstract_canon_sha256":"8e2ebc2d9219922ae05952d4918107b1c1d27007e823d3ee6e0b70a1b153a342"},"schema_version":"1.0"},"canonical_sha256":"a638c2199b139276da7280f4a7bc92a40bfebe593ee1765ee698345516c4a9e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:41.788162Z","signature_b64":"YSP1/gO6wIQNLhzZkYHNiUIpjTrCiz11Aiggjnud9vPP4a342oGPl0ns5B/FQRuv9EC7UjTA9pzlkp+0vkBxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a638c2199b139276da7280f4a7bc92a40bfebe593ee1765ee698345516c4a9e8","last_reissued_at":"2026-07-05T11:54:41.787662Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:41.787662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.17730","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dZqwyVlcACxry43es9JT3UVUE/erDgwiEvO8iYHjxTlkDMwlUhXW4Z0E3FZv8o6Q6PuZxsu5dPanjKLaab4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:32:30.104822Z"},"content_sha256":"cf1859c1797c108bb4939a2fd0452059874b0b5ea3a0f08b8675120d5ef44774","schema_version":"1.0","event_id":"sha256:cf1859c1797c108bb4939a2fd0452059874b0b5ea3a0f08b8675120d5ef44774"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UY4MEGM3COJHNWTSQD2KPPESUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autoregressive Generation Strategies for Top-K Sequential Recommendations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Alexey Vasilev, Anna Volodkevich, Anton Klenitskiy, Danil Gusak","submitted_at":"2024-09-26T11:00:19Z","abstract_excerpt":"The goal of modern sequential recommender systems is often formulated in terms of next-item prediction. In this paper, we explore the applicability of generative transformer-based models for the Top-K sequential recommendation task, where the goal is to predict items a user is likely to interact with in the \"near future\".\n  We explore commonly used autoregressive generation strategies, including greedy decoding, beam search, and temperature sampling, to evaluate their performance for the Top-K sequential recommendation task. In addition, we propose novel Reciprocal Rank Aggregation (RRA) and R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17730","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/2409.17730/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDbUJeqoOuOw/HaKa5+1uF7Afv8giW92uVcu2DAGcxxXnOuUkqtD71EdjhvETUwS5vQubOAQEQCDfLRIQ76cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:32:30.105359Z"},"content_sha256":"8d51fe7f0f646a21bdd68bb8c083ab9910581ee5909603ae65100f822842a9a1","schema_version":"1.0","event_id":"sha256:8d51fe7f0f646a21bdd68bb8c083ab9910581ee5909603ae65100f822842a9a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UY4MEGM3COJHNWTSQD2KPPESUQ/bundle.json","state_url":"https://pith.science/pith/UY4MEGM3COJHNWTSQD2KPPESUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UY4MEGM3COJHNWTSQD2KPPESUQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T07:32:30Z","links":{"resolver":"https://pith.science/pith/UY4MEGM3COJHNWTSQD2KPPESUQ","bundle":"https://pith.science/pith/UY4MEGM3COJHNWTSQD2KPPESUQ/bundle.json","state":"https://pith.science/pith/UY4MEGM3COJHNWTSQD2KPPESUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UY4MEGM3COJHNWTSQD2KPPESUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UY4MEGM3COJHNWTSQD2KPPESUQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8e2ebc2d9219922ae05952d4918107b1c1d27007e823d3ee6e0b70a1b153a342","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-26T11:00:19Z","title_canon_sha256":"0603c1e77f660162ad59ac4ac4313e1f929cdd19584ab49a1c9646cc75d72df0"},"schema_version":"1.0","source":{"id":"2409.17730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.17730","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"2409.17730v1","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17730","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"UY4MEGM3COJH","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"pith_short_16","alias_value":"UY4MEGM3COJHNWTS","created_at":"2026-07-05T11:54:41Z"},{"alias_kind":"pith_short_8","alias_value":"UY4MEGM3","created_at":"2026-07-05T11:54:41Z"}],"graph_snapshots":[{"event_id":"sha256:8d51fe7f0f646a21bdd68bb8c083ab9910581ee5909603ae65100f822842a9a1","target":"graph","created_at":"2026-07-05T11:54:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.17730/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of modern sequential recommender systems is often formulated in terms of next-item prediction. In this paper, we explore the applicability of generative transformer-based models for the Top-K sequential recommendation task, where the goal is to predict items a user is likely to interact with in the \"near future\".\n  We explore commonly used autoregressive generation strategies, including greedy decoding, beam search, and temperature sampling, to evaluate their performance for the Top-K sequential recommendation task. In addition, we propose novel Reciprocal Rank Aggregation (RRA) and R","authors_text":"Alexey Vasilev, Anna Volodkevich, Anton Klenitskiy, Danil Gusak","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-26T11:00:19Z","title":"Autoregressive Generation Strategies for Top-K Sequential Recommendations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17730","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf1859c1797c108bb4939a2fd0452059874b0b5ea3a0f08b8675120d5ef44774","target":"record","created_at":"2026-07-05T11:54:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8e2ebc2d9219922ae05952d4918107b1c1d27007e823d3ee6e0b70a1b153a342","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-26T11:00:19Z","title_canon_sha256":"0603c1e77f660162ad59ac4ac4313e1f929cdd19584ab49a1c9646cc75d72df0"},"schema_version":"1.0","source":{"id":"2409.17730","kind":"arxiv","version":1}},"canonical_sha256":"a638c2199b139276da7280f4a7bc92a40bfebe593ee1765ee698345516c4a9e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a638c2199b139276da7280f4a7bc92a40bfebe593ee1765ee698345516c4a9e8","first_computed_at":"2026-07-05T11:54:41.787662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:41.787662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YSP1/gO6wIQNLhzZkYHNiUIpjTrCiz11Aiggjnud9vPP4a342oGPl0ns5B/FQRuv9EC7UjTA9pzlkp+0vkBxBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:41.788162Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.17730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf1859c1797c108bb4939a2fd0452059874b0b5ea3a0f08b8675120d5ef44774","sha256:8d51fe7f0f646a21bdd68bb8c083ab9910581ee5909603ae65100f822842a9a1"],"state_sha256":"b748423d7753f5e3f6d6f1ec0de30b53cb8f37700781d1e98ba0543f0730bae5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObFtrGjHHW7Aqwy0Cylr+Nkn5rhDu73xwu4BiCWMh+NMeadH836YIFAGkHdShSFrEqRdhPlhkxtjNF0chNXOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:32:30.110500Z","bundle_sha256":"3e97ca9268938469878e31136d8c3182897f65bd1e9bc5e664ff49f78d158333"}}