{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SXKJAGLRXJAADUYM5RZSQDZATT","short_pith_number":"pith:SXKJAGLR","schema_version":"1.0","canonical_sha256":"95d4901971ba4001d30cec73280f209ccbdba3dc387f8c6afd36fec7e51d1f32","source":{"kind":"arxiv","id":"2109.14233","version":2},"attestation_state":"computed","paper":{"title":"A Next Basket Recommendation Reality Check","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Maarten de Rijke, Ming Li, Mozhdeh Ariannezhad, Sami Jullien","submitted_at":"2021-09-29T07:14:22Z","abstract_excerpt":"The goal of a next basket recommendation (NBR) system is to recommend items for the next basket for a user, based on the sequence of their prior baskets. Recently, a number of methods with complex modules have been proposed that claim state-of-the-art performance. They rarely look into the predicted basket and just provide intuitive reasons for the observed improvements, e.g., better representation, capturing intentions or relations, etc. We provide a novel angle on the evaluation of next basket recommendation methods, centered on the distinction between repetition and exploration: the next ba"},"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":"2109.14233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-09-29T07:14:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1ee52f2071b4820bc4d65bee85594d2d5c9ef338d7fe105312d4ea0120c21ee9","abstract_canon_sha256":"e32242a6731491d1d5e8d215ae4d631d41b1f2895dd4ebea169bcb95f2e5347d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:26.951818Z","signature_b64":"3ubWABfwAzxgceZOffukacbQhPvz6DS0Fwr5RfHcGE5x6cenAGWjPDFeXb0aHSLC+2/6ivOvThSyJVB21Z/jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d4901971ba4001d30cec73280f209ccbdba3dc387f8c6afd36fec7e51d1f32","last_reissued_at":"2026-07-05T05:49:26.951380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:26.951380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Next Basket Recommendation Reality Check","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Maarten de Rijke, Ming Li, Mozhdeh Ariannezhad, Sami Jullien","submitted_at":"2021-09-29T07:14:22Z","abstract_excerpt":"The goal of a next basket recommendation (NBR) system is to recommend items for the next basket for a user, based on the sequence of their prior baskets. Recently, a number of methods with complex modules have been proposed that claim state-of-the-art performance. They rarely look into the predicted basket and just provide intuitive reasons for the observed improvements, e.g., better representation, capturing intentions or relations, etc. We provide a novel angle on the evaluation of next basket recommendation methods, centered on the distinction between repetition and exploration: the next ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.14233","kind":"arxiv","version":2},"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/2109.14233/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":"2109.14233","created_at":"2026-07-05T05:49:26.951447+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.14233v2","created_at":"2026-07-05T05:49:26.951447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.14233","created_at":"2026-07-05T05:49:26.951447+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXKJAGLRXJAA","created_at":"2026-07-05T05:49:26.951447+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXKJAGLRXJAADUYM","created_at":"2026-07-05T05:49:26.951447+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXKJAGLR","created_at":"2026-07-05T05:49:26.951447+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.17065","citing_title":"Special curves and Hamiltonian systems from polynomial eigenfunctions of an elliptic operator","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT","json":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT.json","graph_json":"https://pith.science/api/pith-number/SXKJAGLRXJAADUYM5RZSQDZATT/graph.json","events_json":"https://pith.science/api/pith-number/SXKJAGLRXJAADUYM5RZSQDZATT/events.json","paper":"https://pith.science/paper/SXKJAGLR"},"agent_actions":{"view_html":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT","download_json":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT.json","view_paper":"https://pith.science/paper/SXKJAGLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.14233&json=true","fetch_graph":"https://pith.science/api/pith-number/SXKJAGLRXJAADUYM5RZSQDZATT/graph.json","fetch_events":"https://pith.science/api/pith-number/SXKJAGLRXJAADUYM5RZSQDZATT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT/action/storage_attestation","attest_author":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT/action/author_attestation","sign_citation":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT/action/citation_signature","submit_replication":"https://pith.science/pith/SXKJAGLRXJAADUYM5RZSQDZATT/action/replication_record"}},"created_at":"2026-07-05T05:49:26.951447+00:00","updated_at":"2026-07-05T05:49:26.951447+00:00"}