{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PPJX5UMT4DDXU3AOCYUJHA3VJM","short_pith_number":"pith:PPJX5UMT","schema_version":"1.0","canonical_sha256":"7bd37ed193e0c77a6c0e16289383754b1ea9ddab0805089abebebca8c709ff93","source":{"kind":"arxiv","id":"2508.05673","version":1},"attestation_state":"computed","paper":{"title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Can Wang, Chun Chen, Jiawei Chen, Peng Wu, Shengjia Zhang, Weiqin Yang, Yan Feng, Yuegang Sun","submitted_at":"2025-08-04T17:50:02Z","abstract_excerpt":"In the realm of recommender systems (RS), Top-$K$ ranking metrics such as NDCG@$K$ are the gold standard for evaluating recommendation performance. However, during the training of recommendation models, optimizing NDCG@$K$ poses significant challenges due to its inherent discontinuous nature and the intricate Top-$K$ truncation. Recent efforts to optimize NDCG@$K$ have either overlooked the Top-$K$ truncation or suffered from high computational costs and training instability. To overcome these limitations, we propose SoftmaxLoss@$K$ (SL@$K$), a novel recommendation loss tailored for NDCG@$K$ o"},"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":"2508.05673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-08-04T17:50:02Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d00456d9afb3d9d7cf8a01a219b1f67a10f0834c137332c33b4ff6a52ba07ac6","abstract_canon_sha256":"5342e3014a9dea05d643fb401b0f2074581cab9793ff33951a99f5a7f33584de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:41.229546Z","signature_b64":"Kqgyui3hFQSOHl5zcr2T+1M/29qgXnh0lJSB1DQfAW2pxaSFdfVbn7JAftHYHsRKcVewn3WirmBs2wNFkGDlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd37ed193e0c77a6c0e16289383754b1ea9ddab0805089abebebca8c709ff93","last_reissued_at":"2026-07-05T11:50:41.228864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:41.228864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Can Wang, Chun Chen, Jiawei Chen, Peng Wu, Shengjia Zhang, Weiqin Yang, Yan Feng, Yuegang Sun","submitted_at":"2025-08-04T17:50:02Z","abstract_excerpt":"In the realm of recommender systems (RS), Top-$K$ ranking metrics such as NDCG@$K$ are the gold standard for evaluating recommendation performance. However, during the training of recommendation models, optimizing NDCG@$K$ poses significant challenges due to its inherent discontinuous nature and the intricate Top-$K$ truncation. Recent efforts to optimize NDCG@$K$ have either overlooked the Top-$K$ truncation or suffered from high computational costs and training instability. To overcome these limitations, we propose SoftmaxLoss@$K$ (SL@$K$), a novel recommendation loss tailored for NDCG@$K$ o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05673","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/2508.05673/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":"2508.05673","created_at":"2026-07-05T11:50:41.228949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05673v1","created_at":"2026-07-05T11:50:41.228949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05673","created_at":"2026-07-05T11:50:41.228949+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPJX5UMT4DDX","created_at":"2026-07-05T11:50:41.228949+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPJX5UMT4DDXU3AO","created_at":"2026-07-05T11:50:41.228949+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPJX5UMT","created_at":"2026-07-05T11:50:41.228949+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/PPJX5UMT4DDXU3AOCYUJHA3VJM","json":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM.json","graph_json":"https://pith.science/api/pith-number/PPJX5UMT4DDXU3AOCYUJHA3VJM/graph.json","events_json":"https://pith.science/api/pith-number/PPJX5UMT4DDXU3AOCYUJHA3VJM/events.json","paper":"https://pith.science/paper/PPJX5UMT"},"agent_actions":{"view_html":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM","download_json":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM.json","view_paper":"https://pith.science/paper/PPJX5UMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05673&json=true","fetch_graph":"https://pith.science/api/pith-number/PPJX5UMT4DDXU3AOCYUJHA3VJM/graph.json","fetch_events":"https://pith.science/api/pith-number/PPJX5UMT4DDXU3AOCYUJHA3VJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM/action/storage_attestation","attest_author":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM/action/author_attestation","sign_citation":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM/action/citation_signature","submit_replication":"https://pith.science/pith/PPJX5UMT4DDXU3AOCYUJHA3VJM/action/replication_record"}},"created_at":"2026-07-05T11:50:41.228949+00:00","updated_at":"2026-07-05T11:50:41.228949+00:00"}