{"as_of":"2026-08-23T04:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31fc9a68db440cef0fcb4e521aff28255670586249cae7b3ee81fb4f96e35d66","coverage":[{"denominator":94,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":94,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:44:55.041535Z","state":"measured"},{"denominator":94,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":94,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.05673/citation-record","integrity":"/paper/2508.05673/integrity","json":"/paper/2508.05673/citation-record.json","paper":"/paper/2508.05673"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.688314Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.688314Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:e21a94f9e6abef91c042b48ed8b47dda9419b521de1125f4ce7de58e6ebf63be","observation_id":"3b9e24e4-e89e-4b98-ad30-5aa6a3671ccb","resolution":{"observed_at":"2026-08-15T17:44:54.688314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.692811Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.692811Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:faae50dfc784e01b5013ca270b0403f76ca3ad431f0d1bf1173f9adb9f69599c","observation_id":"96565ae5-e97b-44ab-b777-75ad90b1982a","resolution":{"observed_at":"2026-08-15T17:44:54.692811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.696607Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.696607Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:14db2ba913b8efe536982509a313edd4a0f50447fb37d8b1df7dc572fe8ab1c4","observation_id":"da53644a-18eb-4bfa-ba21-98796b369d82","resolution":{"observed_at":"2026-08-15T17:44:54.696607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.701108Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.701108Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:c511e8eda000526aa9f8cc6d2fc0f9ce4a867288b9dab763766fc7dc41bc7314","observation_id":"dd20d510-6044-401c-976d-942d9c7c2859","resolution":{"observed_at":"2026-08-15T17:44:54.701108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.705132Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.705132Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:8010f7b2711e5c896caa15a3a79dba25e884dab99afded30f960ff3de74e1333","observation_id":"b5ce1fb9-37d1-4446-b0f7-9f26acd08e4d","resolution":{"observed_at":"2026-08-15T17:44:54.705132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.709559Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.709559Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:d706591f3536bafa9639ed146bcb7916695fea0cecb29fb2314cbe3b6eec6d54","observation_id":"f2d39fed-b573-4dca-9318-3e5ce5300b68","resolution":{"observed_at":"2026-08-15T17:44:54.709559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.717497Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.717497Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:dddfcd88c53099a8dd90dc660743e9d76d9899f9400922c0f408bfc033d10b19","observation_id":"02d21486-9ee6-405c-905f-8bd693a8d39d","resolution":{"observed_at":"2026-08-15T17:44:54.717497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.721326Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.721326Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0f7683f9b0665e8b0eccc1950f1aa90988935ef6d812ac9202249c2443b95551","observation_id":"7e83672d-e9d5-4a71-9162-d186608e1320","resolution":{"observed_at":"2026-08-15T17:44:54.721326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.724973Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.724973Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:57747e7efd33800ac76890bed9ffae7831797e900ce7d37da3b4c36f224f9e6a","observation_id":"71f9ed4f-0ff0-412b-b7e4-f3ff616a5e80","resolution":{"observed_at":"2026-08-15T17:44:54.724973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.728846Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.728846Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:3b780825869214b4d09514e58ebef4e83c71bc581896e97442eb67d6be4b46d7","observation_id":"ef88fc15-0e68-4d52-b97d-6c7b3cacb1e8","resolution":{"observed_at":"2026-08-15T17:44:54.728846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.732660Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.732660Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:e16a36e1016102900182eb416dde19479cc2e4afaa05becbfd36087deb96057f","observation_id":"fe2f47eb-f152-4a92-9726-253e10c3e884","resolution":{"observed_at":"2026-08-15T17:44:54.732660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.736094Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.736094Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:ec7886aa4088b98f3cbcbf1cfc6df25a5eb4bdcc1c1b01faad2bfa12ce586f6f","observation_id":"659d6698-4ac0-4b80-bb3e-d70a155c0c2a","resolution":{"observed_at":"2026-08-15T17:44:54.736094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.740076Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.740076Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:98fd9d261afa39c233aeac53a35c62add8429715b206816bb898a74d8628c965","observation_id":"79648c6a-c9b9-44c6-b1f9-4749d3b4ea77","resolution":{"observed_at":"2026-08-15T17:44:54.740076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.743855Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.743855Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:5e3f936258d766a8d22b88324eb50fac669f9a5a52b0f1b8573798c2d55319ec","observation_id":"3ef85d19-0bc4-4c70-8878-087e06c8c1ca","resolution":{"observed_at":"2026-08-15T17:44:54.743855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.740253Z","title":null,"venue":null,"work_id":"c0f99ec6-2da9-4bf2-98bf-e1bebc494908","year":2020},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.747483Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:352888b8f726ffae6bf3ded795cfd7a92765fea812291e25eab49f807ca7c3ed","observation_id":"062ff82c-bbb6-4c0e-a678-56fca1a05448","resolution":{"observed_at":"2026-08-15T17:44:55.743611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.729998Z","title":null,"venue":null,"work_id":"4c600ca7-55e7-4c62-9a2d-e134173750e1","year":2023},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.750950Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:feca8b9fb4b601222d9084876eaf5281bc8b8477289aac56cc103e7da5b1723c","observation_id":"faa4dcb5-54ea-4f34-b19e-f3192b7b78f4","resolution":{"observed_at":"2026-08-15T17:44:55.733495Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.720180Z","title":null,"venue":null,"work_id":"fc75dac8-1793-4db2-9015-eb329cbbffee","year":2023},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.754484Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:8b191dae7973da26eabe5250879fb2e7e29d4f980bc95c14cb2287058c9aed52","observation_id":"94149a74-d7b3-4853-8785-fd7eb3afac73","resolution":{"observed_at":"2026-08-15T17:44:55.723485Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08850","last_updated":"2019-04-29T07:56:18Z","snapshot_observed_at":"2026-08-14T16:59:01.602246Z","submitted_at":"2019-03-21T07:05:44Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.08850","snapshot_observed_at":"2026-08-15T17:44:54.758240Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.758240Z"},"links":{"cited_paper":"/paper/1903.08850","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:3379c5bfbf99a5532c668f6ea8209cb9e63468ff1936f32b37194ab6793cff2d","observation_id":"47c6eae7-f98e-4e2d-8ce8-d24a8a078c73","resolution":{"observed_at":"2026-08-15T17:44:54.758240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.710013Z","title":null,"venue":null,"work_id":"76b80623-6569-4ab4-9ea4-0f1a87f5f9c8","year":2012},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.762658Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0330f9aba92114196a7d70f3f1844d41ecb7eb83668b11265527781c0eb7e445","observation_id":"bfe0953a-6a3b-4cfb-a3a3-ac79d8c38706","resolution":{"observed_at":"2026-08-15T17:44:55.713275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.699574Z","title":null,"venue":null,"work_id":"55a5ca04-ee03-4ed7-8e83-9b93a87fcefc","year":2007},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.766110Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:485a726751878d43bd0fad5efdd87e1e22b49aa11c4e5b74bdd04defdc8e8d70","observation_id":"f155a270-3e1e-46d1-bef8-21f67f7c0fe1","resolution":{"observed_at":"2026-08-15T17:44:55.703425Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.769417Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.769417Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:dc5967455848f9a1a7ce9ed82b122dab0d3f3b4bf17045bf276ff836596c3de3","observation_id":"43a7463c-23e3-48f6-b594-dac654bd6e06","resolution":{"observed_at":"2026-08-15T17:44:54.769417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.772670Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.772670Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:62e7fb51b6d3f20d3545e18fae8cd804228c8c570c6dcc237c9358fd8038a179","observation_id":"9055a17e-3097-4f3b-a8c5-896290faebe6","resolution":{"observed_at":"2026-08-15T17:44:54.772670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.776836Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.776836Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:04d4b4d85e5577215a8886a81d1ae578e6d926e263654e8c04f2beeec97438c5","observation_id":"a1b71a49-4ffa-4601-8d0c-62305cba5b9c","resolution":{"observed_at":"2026-08-15T17:44:54.776836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.780360Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.780360Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:ad15666a42f0de8b269f17a031edf2d30c68f769a6c94e55ebc9317a22948301","observation_id":"628e469e-2113-470e-aef9-1740b09c48aa","resolution":{"observed_at":"2026-08-15T17:44:54.780360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.783470Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.783470Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:c5769d89586d5f985014995060044576e82dde061e0284c2cbe17998efc6cad3","observation_id":"05c72c9f-09cb-4fbe-b720-86b7a77fc42d","resolution":{"observed_at":"2026-08-15T17:44:54.783470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.790799Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.790799Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:2036cf4d8cf2bafb247c9ebfc30834d548343481f6d3be7c88a961d04c508f15","observation_id":"9d2da361-6839-44f4-91b4-8e781a88b20a","resolution":{"observed_at":"2026-08-15T17:44:54.790799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.652748Z","title":null,"venue":null,"work_id":"12272368-cfe2-414f-9ea6-fd1fb82ec6b2","year":2014},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.795289Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:49c8a4f28883d1049c7ca7c16ce89ff05057b7e6022d7ad0699fd1d20698d64f","observation_id":"fd7a70db-3c44-4ff8-b46a-93d2eb070b16","resolution":{"observed_at":"2026-08-15T17:44:55.656250Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.642204Z","title":null,"venue":null,"work_id":"15c7e6fa-6c87-4ca8-9dce-59df9c27571e","year":2011},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.798870Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:964bf3f7ebc6b8b999814360ae3ec8b9c604ede5c857ffaa85f62a3fb8523d7e","observation_id":"4edae9c0-9683-4b1b-919e-3049d924c7fb","resolution":{"observed_at":"2026-08-15T17:44:55.645994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.631475Z","title":null,"venue":null,"work_id":"211194f7-aabe-498c-8240-79cd7b339519","year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.802301Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:81abcd3899d9b84e4314e99a50c02caa369f3331ed32e6a055e0c397393ae41b","observation_id":"ac840bbd-e2aa-4457-aaab-4f5c5f3f60e2","resolution":{"observed_at":"2026-08-15T17:44:55.635205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.809511Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.809511Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:8e39bf71b2076d8ab999682b417239f9a4ed000db996fefbbdffe54849995f96","observation_id":"d091dcca-7009-41a2-8016-50249e7f6f98","resolution":{"observed_at":"2026-08-15T17:44:54.809511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.813641Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.813641Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:3220b5feae811df5f5d4ddbefc79458191405df6a82c1d08a5ad8c2a360c8541","observation_id":"14074b3a-dace-4793-9b6e-3b677f731355","resolution":{"observed_at":"2026-08-15T17:44:54.813641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.817143Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.817143Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0d26a88f52e7f86387fc0675a2a5d82c947766179a41585c1f4d42f60af6ae7e","observation_id":"092a1820-a1ff-447e-a6cf-dba902035702","resolution":{"observed_at":"2026-08-15T17:44:54.817143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.585788Z","title":null,"venue":null,"work_id":"1537f7a9-ed43-413a-9947-571067bddb46","year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.821071Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7bb0e2d7ccd3918b858768cf0a6966b5c8e79e7e4fc5f4da102cbb0861fc855a","observation_id":"94311929-59c0-41ff-8ffc-0f5ef96f088d","resolution":{"observed_at":"2026-08-15T17:44:55.593622Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.824629Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.824629Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:bc532c654dfa46c05decd8052942140a31f1c517c58c92c5652034fccdbe44da","observation_id":"d0f5f110-3a87-41b4-9b7e-bcb3001bf3a8","resolution":{"observed_at":"2026-08-15T17:44:54.824629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-15T17:44:54.828011Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.828011Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0972032e19942ea7abae581fe608567d51ad12657803bb55d522beb99ab86f2a","observation_id":"4c53f4b8-1de2-496b-a0bf-c2c6280141da","resolution":{"observed_at":"2026-08-15T17:44:54.828011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T17:44:54.831905Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.831905Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:24e1c371c05cbea96625c3ae364766b5f0ad50b1b94c8e012fba8da02e47d63e","observation_id":"81851370-1516-4382-8ece-2dffcc73c1f9","resolution":{"observed_at":"2026-08-15T17:44:54.831905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.835936Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.835936Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7923ae764d465d937c82fdce95a882c302a7df9a933c07011489186a2b1d436b","observation_id":"30326e41-983f-41cf-b150-90f2929028cd","resolution":{"observed_at":"2026-08-15T17:44:54.835936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.562512Z","title":null,"venue":null,"work_id":"5e2122d3-d403-440b-82bc-f3208dcc8b11","year":2005},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.839560Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:e4685cc6b59fe4c289892be0726a96dc2e0666f7be11da64f7c79c04aaf9648c","observation_id":"78e08470-74a8-46d8-b1b3-881f2780796e","resolution":{"observed_at":"2026-08-15T17:44:55.566023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.843092Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.843092Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:794a979f48e7a09332528bdfb1712e9e526cc84c088a89ffa445a1e7410c37cf","observation_id":"42c4faf6-30d2-43bd-8296-a3e8fe874ed6","resolution":{"observed_at":"2026-08-15T17:44:54.843092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.546243Z","title":null,"venue":null,"work_id":"aea108f7-065a-455c-87b2-2436aff37319","year":2020},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.846802Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:37e64fad4238aad0ecaaaaaa425ceeaca2b1d6c6c966d62865f2442e8f5779c8","observation_id":"13d87700-849b-475f-b4ea-d32723da24da","resolution":{"observed_at":"2026-08-15T17:44:55.549706Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.850549Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.850549Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7121f78a9c42e90624c9b54fe4c84e3d694c186e479aadf6ef1b5c320b0b5c8b","observation_id":"2fc68cf6-8ae3-4edd-b8f9-45576b777d3e","resolution":{"observed_at":"2026-08-15T17:44:54.850549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.853931Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.853931Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:5e100221cc321cb47e19b37c4bf9d94c1c87c40b1241e05c271cd91810afb123","observation_id":"807e82fc-7dfa-4327-a656-c16c408783b6","resolution":{"observed_at":"2026-08-15T17:44:54.853931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.857250Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.857250Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:69a3498bff05d3c3e6a41d7ddbec2f09829182dd18e535fa18408ab8777f2312","observation_id":"135191b5-fe0e-4a17-8047-c3b28a33c6ff","resolution":{"observed_at":"2026-08-15T17:44:54.857250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.860749Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.860749Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:13ad5d38231fccfe9819922920f2b2889a7ec1947f3b43df535df362fc2f0737","observation_id":"3d27e969-4b9d-4aae-b5ec-c35e8f065dad","resolution":{"observed_at":"2026-08-15T17:44:54.860749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.513099Z","title":null,"venue":null,"work_id":"ac2a2f8a-d8bc-43ed-8ddf-ed515a29b294","year":1959},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.865250Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:31a86807819d58772217a01f57a3c8901ef8db084268f1b81c3496530b2222c3","observation_id":"5b76c984-86e7-4604-885c-c02e9ab61988","resolution":{"observed_at":"2026-08-15T17:44:55.516681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.00105","last_updated":"2019-08-31T01:50:42Z","snapshot_observed_at":"2026-08-19T08:46:12.233981Z","submitted_at":"2019-08-31T01:50:42Z","title":"Generating Personalized Recipes from Historical User Preferences","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.00105","snapshot_observed_at":"2026-08-15T17:44:54.868996Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.868996Z"},"links":{"cited_paper":"/paper/1909.00105","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:e36262dd3f9fb19d6773b814a0733dd168c3a35d613c42b9aa224e1538f6060a","observation_id":"5b71f408-27e1-479b-8b2d-ab16a0dd10c1","resolution":{"observed_at":"2026-08-15T17:44:54.868996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.503279Z","title":null,"venue":null,"work_id":"8827aa3b-808a-4558-b341-98d0ad5899bc","year":1990},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.873671Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:4b567fdc060d714124ecdf91909e611f69cde1dff77300335d0f2e3ffc2dbe93","observation_id":"c986e8fa-a2c8-41df-8dc4-3141cb287b4c","resolution":{"observed_at":"2026-08-15T17:44:55.506632Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.877638Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.877638Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:9b10628ee663dcf9b29dad946b65a8388e8210d4af5b33c1c99ab26ece263b01","observation_id":"fc76cebd-f942-4ca0-b3e7-6a98f19a804f","resolution":{"observed_at":"2026-08-15T17:44:54.877638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.885734Z","title":null,"venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.885734Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:e24d132d7b46623e10304d219b4ede68f3612158750e6c1c8f2718980f4b442b","observation_id":"b2f4391d-d497-4894-98e0-1c757e31b7c6","resolution":{"observed_at":"2026-08-15T17:44:54.885734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.475792Z","title":null,"venue":null,"work_id":"dede37ce-57ad-439e-94e0-d3caf3c39acc","year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.889352Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:22d44b883b017959db11fc3c64a509080d4c3e3f20fa9fd1bf55e88ba51d0c5f","observation_id":"58e6f942-1686-495d-a3b0-465df930418d","resolution":{"observed_at":"2026-08-15T17:44:55.479017Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-15T17:44:54.892892Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.892892Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:570aff06a926f01df531793e0fee13e2b7adcb040310e9f420cd76262f9f86f2","observation_id":"b4c09052-6b85-4e5f-b66c-84484b6ff690","resolution":{"observed_at":"2026-08-15T17:44:54.892892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.466105Z","title":null,"venue":null,"work_id":"e858d408-16be-47ad-9223-050ba5b64610","year":1962},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.896945Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:6dba738bf9ecb4abac7a1dc17fbdb6b00c10387cae2a463b62846603d1382935","observation_id":"4c2431c5-d4ef-4564-9178-b35abbc208ec","resolution":{"observed_at":"2026-08-15T17:44:55.469360Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.900267Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.900267Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:4d002dbb08c549738039cf8ceb4ac5bd6723eb0c7784cd614ec194e90ee49834","observation_id":"04ecc1c9-7612-4a14-8d8d-0f92ff32ef72","resolution":{"observed_at":"2026-08-15T17:44:54.900267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.449567Z","title":null,"venue":null,"work_id":"607e4c65-9f32-4726-99a4-30aca024d554","year":1975},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.903614Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:41e44bc4c52d48f927ae98d27ae88e63ce0c35d46b2fb5cfd1c0b5c4ae3c9e53","observation_id":"4169f2b9-f6f2-4ff5-aee3-6bc585c80e6b","resolution":{"observed_at":"2026-08-15T17:44:55.453713Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07831","last_updated":"2021-05-22T08:50:53Z","snapshot_observed_at":"2026-08-21T11:52:22.574101Z","submitted_at":"2021-02-15T20:11:42Z","title":"NeuralNDCG: Direct Optimisation of a Ranking Metric via Differentiable Relaxation of Sorting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07831","snapshot_observed_at":"2026-08-15T17:44:54.907524Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.907524Z"},"links":{"cited_paper":"/paper/2102.07831","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:b0843f7b41f22324c4ec8d3aa386af67747fc093d11a729c6b28f01292c698e8","observation_id":"66802fa8-0e95-423c-82e5-c00a2e4ce55f","resolution":{"observed_at":"2026-08-15T17:44:54.907524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1306.2597","last_updated":"2013-06-09T09:58:00Z","snapshot_observed_at":"2026-08-18T21:45:43.197175Z","submitted_at":"2013-06-09T09:58:00Z","title":"Introducing LETOR 4.0 Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.2597","snapshot_observed_at":"2026-08-15T17:44:54.911481Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.911481Z"},"links":{"cited_paper":"/paper/1306.2597","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:ecd85f3f68f62ee606e6c9970c718a11cfd1687ee2a7c2a2d5f258c3878e5a20","observation_id":"9bf07771-bdff-4bf8-9ca1-664ffe57047a","resolution":{"observed_at":"2026-08-15T17:44:54.911481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.12183","last_updated":"2023-02-02T16:37:48Z","snapshot_observed_at":"2026-08-18T11:10:34.159012Z","submitted_at":"2022-02-24T16:37:07Z","title":"Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.12183","snapshot_observed_at":"2026-08-15T17:44:54.914930Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.914930Z"},"links":{"cited_paper":"/paper/2202.12183","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:970f1f9e656d14c1bd748699f91dc08fd79c3056a93c24ec2ef538699de97828","observation_id":"39d6d9bf-e3a7-4d25-a4ab-08bb712fb7ae","resolution":{"observed_at":"2026-08-15T17:44:54.914930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.439196Z","title":null,"venue":null,"work_id":"e21f9f27-43c6-455f-973d-5da89e14dc01","year":2021},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.919194Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:6b6aede0ec25cbc6f97beae57ad07bdb34dda26a55a7b3169bf7932f7f460464","observation_id":"724640f0-c7d2-4ad1-849c-071175efaffe","resolution":{"observed_at":"2026-08-15T17:44:55.442913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.922754Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.922754Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:97e853cd81f565cbcff9f3f7eb99be19053b69c05037aa8f91308682a0eb5db8","observation_id":"2e91793f-02b0-44af-a361-734fc9e9eeb1","resolution":{"observed_at":"2026-08-15T17:44:54.922754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.930375Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.930375Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:52e162db8249974fbc7a4085d3e37a0b9e938b4257ba7e3f7a11a333abe87366","observation_id":"fe445d60-eed6-484e-8b44-7e8be30c35f8","resolution":{"observed_at":"2026-08-15T17:44:54.930375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.937164Z","title":null,"venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.937164Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:d1326ebef4f3aa50ab6b44bad9dd9f346e286fcc46e845e83e4d638c3e75fdb5","observation_id":"3438bdc3-6dcd-4d0d-805a-c0db7ae71c8a","resolution":{"observed_at":"2026-08-15T17:44:54.937164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.940782Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.940782Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:ec0fdf269b8e2808a9dfad1a6f283a56b54f20068ee9691bb6ad8b37cc8e667d","observation_id":"f3f633c5-3564-4d19-8a24-5f8816f2ed8a","resolution":{"observed_at":"2026-08-15T17:44:54.940782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.387793Z","title":null,"venue":null,"work_id":"e06db889-9af8-421f-9ccd-5fd5429f1da4","year":2017},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.944101Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0f7a71505708e333218b6d37a113a5268bc7be31a2f073baf9fdb3fadda0b21c","observation_id":"52e2f967-a264-4c1c-936a-f019e701fc13","resolution":{"observed_at":"2026-08-15T17:44:55.391783Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.947330Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.947330Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:255c5ea7d10c75b75c9b0ce0b90f1a54a0f312f501b3b4e2cc4fcd9af59b1982","observation_id":"3e4b679c-84a4-4057-8ad7-7f572e736d6e","resolution":{"observed_at":"2026-08-15T17:44:54.947330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.370844Z","title":null,"venue":null,"work_id":"44457674-ba90-4b62-9350-478784a3748c","year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.950759Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:50f885d906f21964f5cb10fabf7e4128ba1a7545e3bbf4f2e94763fe43d95e44","observation_id":"ee642fa0-85eb-485d-aef4-4db32744cf26","resolution":{"observed_at":"2026-08-15T17:44:55.374652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.359941Z","title":null,"venue":null,"work_id":"f781aa49-9770-4f39-8b6c-916655a44e73","year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.954936Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:2f393d0248da8d2ab0e1821d5ac43b47caa7d55fce76408e061528ee2444fd76","observation_id":"a567874d-09b2-4d4c-8a01-eafa018c7bea","resolution":{"observed_at":"2026-08-15T17:44:55.363349Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.350011Z","title":null,"venue":null,"work_id":"25872ba5-75be-4df8-b620-1dc08bed6ffe","year":2009},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.958409Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:5395584f428225d6d27e3ea1a8db4e01cf51963edc4bab808708ad3dae281513","observation_id":"f45873bf-2776-42dd-9f39-312cac272a59","resolution":{"observed_at":"2026-08-15T17:44:55.353453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.961646Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.961646Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7d0dd4c15e6fa27315b05f47bed396bd5fc613edf4f3de103f9b982d2f4f5d7b","observation_id":"15664a57-71ba-44d9-a4f5-0eee3f193278","resolution":{"observed_at":"2026-08-15T17:44:54.961646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.334058Z","title":null,"venue":null,"work_id":"9cbd0778-3baa-414b-90cb-55e8bdea35c5","year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.965030Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:2eed898398f729ef90a6a906d393f5dc5d914dc87369826a18247eb102e2b858","observation_id":"053080da-7025-4b91-9d7d-41143523077a","resolution":{"observed_at":"2026-08-15T17:44:55.337325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04178","last_updated":"2025-06-07T03:59:52Z","snapshot_observed_at":"2026-08-20T06:29:53.550190Z","submitted_at":"2025-04-05T13:48:33Z","title":"MSL: Not All Tokens Are What You Need for Tuning LLM as a Recommender","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04178","snapshot_observed_at":"2026-08-15T17:44:54.968721Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.968721Z"},"links":{"cited_paper":"/paper/2504.04178","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:b01c1c35a8a134b4d9d3f4a72375d1dbfc07c0f09dd2a1df583083750869692c","observation_id":"04e15112-3049-4c6c-a8f9-43883705e80b","resolution":{"observed_at":"2026-08-15T17:44:54.968721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08208","last_updated":"2025-06-07T04:28:59Z","snapshot_observed_at":"2026-08-16T13:26:13.828900Z","submitted_at":"2024-08-15T15:18:46Z","title":"LLM4DSR: Leveraging Large Language Model for Denoising Sequential Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08208","snapshot_observed_at":"2026-08-15T17:44:54.972919Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.972919Z"},"links":{"cited_paper":"/paper/2408.08208","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:78fd48a8dbeb9abb8fc66a9d78670f2301f273e1638cbe4286244585ffebdca0","observation_id":"6913af2f-5d8c-4bdf-acab-2543133be540","resolution":{"observed_at":"2026-08-15T17:44:54.972919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.324661Z","title":null,"venue":null,"work_id":"2a6810c1-c255-46b5-ae03-ab760c106f69","year":2017},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.976415Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:2f9f45ce5d99e9cb8249904f148fd75c58d2e43945101ff3334608728cc793e3","observation_id":"f3b5c218-1198-4a4f-9f18-e323ff6e5db3","resolution":{"observed_at":"2026-08-15T17:44:55.327950Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.979974Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.979974Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:e04f2c798283a4b9212c3ddb83f3e0313c71c16de258c5e725123fbd4fabc8c5","observation_id":"5e164af6-8c50-451a-9c43-612c685e1fe7","resolution":{"observed_at":"2026-08-15T17:44:54.979974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.987632Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.987632Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:beebbf7656cddd4063af1e8b2b9d26331392a74a35c1f5625899786574fa6ff7","observation_id":"88e5cd9a-a65b-47c1-83da-740e5c7c7158","resolution":{"observed_at":"2026-08-15T17:44:54.987632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.990942Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.990942Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0c1284f8f6a4dfe5629b4596700c8532866b6f4a40c1d1d6517db26c24de5e62","observation_id":"0be02a23-11a4-4643-b377-cd33cc1cbb9a","resolution":{"observed_at":"2026-08-15T17:44:54.990942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.276395Z","title":null,"venue":null,"work_id":"d8511b3c-09e3-43e4-b754-d895ba89c882","year":2004},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.997841Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:0def759e5c9a0d90ef12be88f47ee0b33642ebf3d61cb7cf16d901a79dbb19ae","observation_id":"a41adfe4-2b82-412c-b373-50ed25843ef2","resolution":{"observed_at":"2026-08-15T17:44:55.279618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.001066Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.001066Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:bfbce8ae770ff61a2774e9e1382efb4ab70084896254afa6f67d6e9ee8920562","observation_id":"0edec06c-2c78-47be-a173-1f5740c757c3","resolution":{"observed_at":"2026-08-15T17:44:55.001066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.260714Z","title":null,"venue":null,"work_id":"fd8ca623-52c4-471e-ab65-08211e276d19","year":2010},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.004799Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7c94672a1ecc9fa388027ae7800e27f24e606d0d61475487e33321592b07a4b1","observation_id":"81519d5f-9680-4159-b27f-6b03f0b663ea","resolution":{"observed_at":"2026-08-15T17:44:55.263967Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.250268Z","title":null,"venue":null,"work_id":"375b1441-e768-4edd-b3c6-eee812765529","year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.009450Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:4587bf4f98683c1627138fe8c3ba6357fd59652d432a44f5410fd8061dc1d3aa","observation_id":"39423d2a-bc0f-4c58-80bd-c49b5098b776","resolution":{"observed_at":"2026-08-15T17:44:55.254060Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.013193Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.013193Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:108b5c28cc166b8a18f8e01fd82fe0eb4e23ecfd33c5357750a55262e5659659","observation_id":"2d415b7a-386f-45ab-bd73-bd9c721a8dd5","resolution":{"observed_at":"2026-08-15T17:44:55.013193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.234100Z","title":null,"venue":null,"work_id":"3142a446-3ea9-4a60-baa1-98dbf6d87d44","year":2008},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.016515Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:789663391a3374dc73f56ceebc6169c0dc1d160f01844d23f5435d086beacf86","observation_id":"05b86df1-ee63-44a9-b101-b163fab7d879","resolution":{"observed_at":"2026-08-15T17:44:55.237619Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00163","last_updated":"2024-10-31T19:11:26Z","snapshot_observed_at":"2026-08-16T13:03:59.601387Z","submitted_at":"2024-10-31T19:11:26Z","title":"PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation","version":1},"cited_work":{"arxiv_id":"2411.00163","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.00163","snapshot_observed_at":"2026-08-15T17:44:55.072564Z","title":"PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation","venue":"cs.LG","work_id":"1bd17d96-7bab-46d3-b270-360584377bb1","year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.019796Z"},"links":{"cited_paper":"/paper/2411.00163","citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:396e2cb26847a550e689e0d23ad79b2a15dbc41433f31443fcc3b325303263e8","observation_id":"e5f3def4-31a2-48e3-bb71-b27896e4b192","resolution":{"observed_at":"2026-08-15T17:44:55.078092Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.023296Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.023296Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:c0e2582105dbc9e09413ba3c3162738965a721af0a43ccfbd8572bf3b85e48fd","observation_id":"0939d747-453c-4f1b-b618-72a959e7adfe","resolution":{"observed_at":"2026-08-15T17:44:55.023296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.026809Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.026809Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7062643b58d9b070d850469da5a236e865c6baa5f2ec664bf29f5b35b6fd6eb3","observation_id":"b730ecb6-8291-4c91-a016-acf4a212d88a","resolution":{"observed_at":"2026-08-15T17:44:55.026809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.212250Z","title":null,"venue":null,"work_id":"6d90d3a4-5e7d-4b2a-83a4-180c3823bc2b","year":2024},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.030192Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:324bdca5058f4a42561da20c02e5cfb411a3e4e8b3c54162dd85f247478248c6","observation_id":"e1f92375-aaaa-41a5-8eee-e496eff64c94","resolution":{"observed_at":"2026-08-15T17:44:55.215522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.201972Z","title":null,"venue":null,"work_id":"e2086c61-9434-476f-aa00-de5868fc638f","year":2019},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.033783Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:18bbb1bcd19ef0e6926da1a31521b220c58e873ce35652542de672c096b2b453","observation_id":"9533a2e2-3fe6-4f38-a1e3-bd56421b782c","resolution":{"observed_at":"2026-08-15T17:44:55.205454Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.191936Z","title":null,"venue":null,"work_id":"45630f94-463d-4c48-be12-e77039341b7c","year":2025},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.038194Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:94ca6e67c0a9042f8105100ca1c011931f358c86052d3bccb13e690b567928dd","observation_id":"52f95252-cde3-4bfa-8241-0640305aac44","resolution":{"observed_at":"2026-08-15T17:44:55.195326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.179934Z","title":"Imp.\" denotes the improvement of SL@𝐾 over LambdaLoss@𝐾, while","venue":null,"work_id":"27564bad-4af3-4621-b11a-40a1a8f2b142","year":2025},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:55.041535Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:2a55962edf613141dc5a12fea87c510b34a82ee7986e68cfdd6ae1e2817c1f79","observation_id":"1c6c2cb5-e9c5-4cde-a283-50924ec56b13","resolution":{"observed_at":"2026-08-15T17:44:55.184719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.933798Z","title":"In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.933798Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7c1a69f26b0102af0726f5b6c21993f4ddd12d402db79f2f951b35ab091570c1","observation_id":"8f30bd22-dba1-466a-962a-c4155d69ffd8","resolution":{"observed_at":"2026-08-15T17:44:54.933798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:54.882010Z","title":"In Proceedings of the 38th international ACM SIGIR conference on research and development in information retrieval","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.882010Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:c3ddd58e2001fe32cb807e2277cbbc609f06c222cce6e6708b014e9216800ed0","observation_id":"4b101dcc-3889-409a-b862-4b7252b8f36e","resolution":{"observed_at":"2026-08-15T17:44:54.882010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.422722Z","title":"In Proceedings of the tenth ACM international conference on web search and data mining","venue":null,"work_id":"1df7dfa8-91a6-4664-b02d-701feac6f696","year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.926460Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:7cefd0a42aac2f0e8c14c102b0d0e18e53f178d7a3746bf2550526eba805c348","observation_id":"696f3ffb-916f-4406-a1b4-012e48eeb8b9","resolution":{"observed_at":"2026-08-15T17:44:55.426189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.286720Z","title":"In Proceedings of the 27th ACM international conference on information and knowledge manage- ment","venue":null,"work_id":"4bcf1a03-3ad4-4455-b5f8-f2895a8a3e47","year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.994417Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:ef93000855d292e7a1f440ca0154b34d17d5deb0bf952c030ecc5d353563e9e9","observation_id":"d01061a4-eeb3-4be6-9e66-2be2bed7efba","resolution":{"observed_at":"2026-08-15T17:44:55.290334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.308341Z","title":"In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval","venue":null,"work_id":"e63ef146-a2df-4745-8281-ab5904dd1811","year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.984053Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:927e2be2a345631ba13c6e40f6a11b7fd9af308bc18cf005737af2efe71f9223","observation_id":"8dc088ef-a198-42e1-aa43-e13d56840722","resolution":{"observed_at":"2026-08-15T17:44:55.311811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:44:55.620191Z","title":"In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","venue":null,"work_id":"3b638766-c266-403f-89e0-6858dc93e4ef","year":null},"citing_paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T17:44:54.805776Z"},"links":{"citing_paper":"/paper/2508.05673"},"observation_digest":"sha256:dfe95005ef3bc5d6dd88b8b662d773193a2f99068aaa20374b4e34b3ac3c936a","observation_id":"dacd60c0-ea30-421c-b72b-4e482e8cf121","resolution":{"observed_at":"2026-08-15T17:44:55.623994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.05673","last_updated":"2025-08-04T17:50:02Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-22T13:24:22.253513Z","submitted_at":"2025-08-04T17:50:02Z","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems"},"reference_resolution":{"displayed":94,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":88,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":94},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 94 of 94 outbound references and 0 inbound Pith citation observations for arXiv:2508.05673."}