{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HOHCZUVES3WPXRT6EITYGJ7YGY","short_pith_number":"pith:HOHCZUVE","schema_version":"1.0","canonical_sha256":"3b8e2cd2a496ecfbc67e22278327f8362b47982699d1dbace3b951f0f499ff85","source":{"kind":"arxiv","id":"2303.13091","version":1},"attestation_state":"computed","paper":{"title":"Limits of Predictability in Top-N Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.IR","authors_text":"Bin Guo, En Xu, Lina Yao, Ying Zhang, Zhiwen Yu","submitted_at":"2023-03-23T08:11:42Z","abstract_excerpt":"Top-N recommendation aims to recommend each consumer a small set of N items from a large collection of items, and its accuracy is one of the most common indexes to evaluate the performance of a recommendation system. While a large number of algorithms are proposed to push the Top-N accuracy by learning the user preference from their history purchase data, a predictability question is naturally raised - whether there is an upper limit of such Top-N accuracy. This work investigates such predictability by studying the degree of regularity from a specific set of user behavior data. Quantifying the"},"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":"2303.13091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-03-23T08:11:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7451b78febd5e1fd355786e3510301f4d79b52870093193e91efe4050a648a2a","abstract_canon_sha256":"9a5e61c45313ef21b29cccff76dcdb93cd986cb103c5b4ec5cef87608013ebaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:53:58.137589Z","signature_b64":"EE0tc+2ZZF0lx4cZeNgZCuKb6SjgHqH9uRPG525hruwveVlhgg1GmOQN50s0NJzAev10caFFPzJ1MHcaAmdxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8e2cd2a496ecfbc67e22278327f8362b47982699d1dbace3b951f0f499ff85","last_reissued_at":"2026-07-05T05:53:58.137187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:53:58.137187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limits of Predictability in Top-N Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.IR","authors_text":"Bin Guo, En Xu, Lina Yao, Ying Zhang, Zhiwen Yu","submitted_at":"2023-03-23T08:11:42Z","abstract_excerpt":"Top-N recommendation aims to recommend each consumer a small set of N items from a large collection of items, and its accuracy is one of the most common indexes to evaluate the performance of a recommendation system. While a large number of algorithms are proposed to push the Top-N accuracy by learning the user preference from their history purchase data, a predictability question is naturally raised - whether there is an upper limit of such Top-N accuracy. This work investigates such predictability by studying the degree of regularity from a specific set of user behavior data. Quantifying the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.13091","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/2303.13091/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":"2303.13091","created_at":"2026-07-05T05:53:58.137244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.13091v1","created_at":"2026-07-05T05:53:58.137244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.13091","created_at":"2026-07-05T05:53:58.137244+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOHCZUVES3WP","created_at":"2026-07-05T05:53:58.137244+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOHCZUVES3WPXRT6","created_at":"2026-07-05T05:53:58.137244+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOHCZUVE","created_at":"2026-07-05T05:53:58.137244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY","json":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY.json","graph_json":"https://pith.science/api/pith-number/HOHCZUVES3WPXRT6EITYGJ7YGY/graph.json","events_json":"https://pith.science/api/pith-number/HOHCZUVES3WPXRT6EITYGJ7YGY/events.json","paper":"https://pith.science/paper/HOHCZUVE"},"agent_actions":{"view_html":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY","download_json":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY.json","view_paper":"https://pith.science/paper/HOHCZUVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.13091&json=true","fetch_graph":"https://pith.science/api/pith-number/HOHCZUVES3WPXRT6EITYGJ7YGY/graph.json","fetch_events":"https://pith.science/api/pith-number/HOHCZUVES3WPXRT6EITYGJ7YGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY/action/storage_attestation","attest_author":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY/action/author_attestation","sign_citation":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY/action/citation_signature","submit_replication":"https://pith.science/pith/HOHCZUVES3WPXRT6EITYGJ7YGY/action/replication_record"}},"created_at":"2026-07-05T05:53:58.137244+00:00","updated_at":"2026-07-05T05:53:58.137244+00:00"}