{"as_of":"2026-08-18T08:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f3bd1d2efa3ff25eed468cba8e099f4b1a7124d252876aa4d3c0b84ff9d08b5","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-18T06:34:40.430872+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-15T17:34:46.898154Z","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:b85bb5f3d94e540a8dcf1ae95dee976fa1659df8b879c89f217198768c855761","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-15T17:34:46.898154Z","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:e7774779930d968f3844f81c1b75800e81740dc8ec7a25382d1df251b831f15c","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-15T17:34:46.898154Z","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:0eddc9fbacf6bf5ad03d395e0570472cfd4c51e226733af0d2601596aa94fd55","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-15T17:34:46.898154Z","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:334b0aed7a45534ca162c84095dfc3c6827f788669d0b71a460d2c8e9c1d9b04","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-15T17:34:46.898154Z","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:4a34bf25f4ca087eb820d60a3417f8beff85905a337b0b1d270117cfda35244a","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-15T17:34:46.898154Z","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:5dbd63ce802fdb1fec92de55f065641c6dc08a3fa727ff614be3f172ea3649a2","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-15T17:34:46.898154Z","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:5d7c94ad876e131f0a9fd8015abb61c1ec07c409df5a8c8d0bc44405f5571fd5","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-15T17:34:46.898154Z","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:c8f939767b4a371a295ab8b386b3a226ecb54b2e2bb31ce234c29f505db2db6a","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-15T17:34:46.898154Z","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:aabe9b41ed8a0f3d5f565210da47d3ea380b36c820ecfe3fc0a82f4367245da6","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-15T17:34:46.898154Z","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:422666d90dba729e61fc4ca0ad9c9c36dfeee16edeeb7d0aca5a6e792dea12d0","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-15T17:34:46.898154Z","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:bba48a692bb48322c5e574ddd8c273bf68f2459b03c2e7d3a13a5aa00b7f909a","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-15T17:34:46.898154Z","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:0ece5f6db0f88544626b91219d5cf0d192eb5389a3399400086400ed0eee08fc","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-15T17:34:46.898154Z","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:57d40b0fca97f6d97998f9a117a4591ca29043470a8922a393d9da24113301f0","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-15T17:34:46.898154Z","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:1c545d014653d86b108d8da19cb33d2cf4e7700529e11d7c9209b6507b179e32","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-15T17:34:46.898154Z","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:1991bbf0dd349c4e01b6b88d71bb25e403d40e283ac98d5f493e7c0abb45c5e1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:99dde38b3de977ae62fbc591490e79c4863ec262953eca5b05d0dd026877d2d7","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:1297883949189162facb2ccbb3372d2aaa917b48608d268da1f47dd22609a0a0","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:f2f558532d893625a51986b8ab634ab4f1a94b5c644155eeeaa73ddaf846ec37","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-15T17:34:46.898154Z","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:046048d40968344cd5caba650d431c609514af9b81baa0b46bb302242f64ab24","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:89852cb560dadfe9ea0856fd4488103500619a25fbd1bec186b3baf884d847b8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:9093925e1cfc4b454a8e438c89956f3317f923ae316e0826f8adeed5f9b4351e","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-15T17:34:46.898154Z","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:7a7618fdc91f732b2a157d4a882c21aefbccd002bc14db560ab48029faf5ce27","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-15T17:34:46.898154Z","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:691cae50a3b47614c01f0ad1f4eb821f9213a0138230379b04baf5ffa7fef906","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-15T17:34:46.898154Z","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:18ae65b45cc51ff2e56069f499d1919c901c58262efe00c1c811888c712b7ad2","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-15T17:34:46.898154Z","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:c792c8937ca41a37de6bf1699641d7e5b310faed6f7d238dd03bf2d29ecca449","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-15T17:34:46.898154Z","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:ed6e2bc505a87faeb008548550e585a6b6517d629c51f5f938a0c982fbef4aaf","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-15T17:34:46.898154Z","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:eff41e9ce523fd40264cd9b620c9d149798088ee35ff30a6d2884c49859ed48c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:17c1517686ef3790535b549fdd5bec6ab21d16e4c4abbca6c6252ce3fda98eda","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:5e9a53aa6644f2f27c8ecd6e5a3dc3dcf4363ebbba2b24e714ff1e6e8ef5bba1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:8ccff4e4b760dd7c428326419e29d71d3ed889692620226ae2efc27cdcf0ebf7","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-15T17:34:46.898154Z","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:9f67ca481fbdb639d5598efd127505cd12305ad9bd8cc58119f64d3c02ee6463","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-15T17:34:46.898154Z","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:2c69692bacd3b2dfd4292d6aeab1af53bbb2e117504be94e7295c8a411418932","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-15T17:34:46.898154Z","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:44b3a721335c3bd5d9130cc36abb5ee183ca1654b0a7c4c5e6bc599d37304d11","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:686d2748bfaa7bee52e7090453177acdc41ff89cbf001162ef07ddd8dfcc77a9","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-15T17:34:46.898154Z","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:6a5876cb2d1614fad03a0f38a16c05af061222d5790be91f0a99e1a9812f55cb","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-15T17:34:46.898154Z","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:afb100dcf8102cfbb1b6a1fe18eb4e118c75c93acc4152d83ffe2d14c92f8c7e","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-15T17:34:46.898154Z","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:31da052436cc7229b0e899663e2e2f2fc2c2dc377efdb9cf9ab3490ef4f141ad","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-15T17:34:46.898154Z","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:b949e00a179ed06e86327579c7c74cc335be99f546031b883677825045daca7e","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:d9882feb2d4d53da6a4c658a429117027d4e3c7d63fe6183569d1a040978db98","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-15T17:34:46.898154Z","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:1d55ecf4202dc3b0132b0406960551c258725a96c0c3bc5c28aca8c418d874c0","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:16981479b39b4145eaa048f61d1f893d221a6b7343c916688e6544e77dbb0c90","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-15T17:34:46.898154Z","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:bcea78dc66c42d0a26cf59516e0b6f7bf5cc2d5ee1fc53bec1b28aaa41442e2d","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-15T17:34:46.898154Z","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:cd6cdcdff49d2a725032f556c4b2bdddff8579a15a2a19e8ae46829a804bc16a","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-15T17:34:46.898154Z","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:31da5518d598f523edd7d48c83b758eb735ee14e8e922de6712d3e6ced0d2b87","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-15T17:34:46.898154Z","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:40b2c82777828439e51a00f00262ef73094d40499b296ffa2768d3a1bb840aa2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T10:48:28.778817Z","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-15T17:34:46.898154Z","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:175e88de01eaa640fad15068ec849f7266ad92b8011fc503db14a481dbbda0ab","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-15T17:34:46.898154Z","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:75b10e39bdd38df86e2369054968746257075a71c54feda600ad23c21e195d23","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:c908dd8d5e8b0ef94bdd6cc719fc34ac67de078efdb8ccbbbfa567f98ba76aee","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-15T17:34:46.898154Z","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:35dc1f6b4b75b6ff988bfac9003ba9bd0e76636f62bc4a8ddb9252ad5732e292","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-15T17:34:46.898154Z","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:0dbad1087558004e90e30a08d0e231fc24b6880e8f19d59f3df639a51d10257c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:b12099e27c9d558585436baa27d2d8dd7df760e349eebcbedcbc0b8423a3d1ee","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-15T17:34:46.898154Z","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:ba3bd29046ff5e2c002a76c1ca7a6508d4a39bc82825159e6e420cad490b91b3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:18d2c082a5b54180bd86e1c0d4c45e5560c4229864fd69b2684a080d3b329cfc","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-15T17:34:46.898154Z","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:2472e37b188ec89decd41cdc70e03920a53b2b82c172dcc2a6b122d0c302ce06","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:45:23.473324Z","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-15T17:34:46.898154Z","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:64323745103159391566036df345247152405185e7ceb32f7069b0c14edd7ccf","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-15T00:14:42.111590Z","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-15T17:34:46.898154Z","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:0f263ece1dc789d5834e07da58869892774e766658571509beffe43bdfe97bc7","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-16T17:18:53.906813Z","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-15T17:34:46.898154Z","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:00b686b43d36c4020c25574d5a3e5521d1e6d35ec457754261cdc0eca4e1412e","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-15T17:34:46.898154Z","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:4a13be759ad88a1d470ef208eb8da6069c5499f2adc3908d46160888019f5467","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:a3b0efe22f599b22bbc72f010852229ccce6e720a2832226b139c136e8f12c18","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-15T17:34:46.898154Z","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:b0c183f150a0d8d85e4787a18dcc55a4a038128969166a930e77dfbfb308f5e6","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-15T17:34:46.898154Z","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:b671ba7e72a5f4ec50bba3d19d7c57ffe1683bd362f8dbf5141bbda7401b138c","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-15T17:34:46.898154Z","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:72828882d0b90c53f87d516ea1b1d040698a4887d10271db5b2ce9a4dfafc4c3","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-15T17:34:46.898154Z","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:3d11b2d9d45d26ba1fc5e8515a3d3cd4d1ddcde77ae35810c07f8cbfa160448c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:c1767d46a2b294ea2ad5fd1337c5fae211bf00e5777ebedd50407c7f110f5a32","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-15T17:34:46.898154Z","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:fa13d1e57082d57b54010d27384b2bb83aebbf9481ff79ed47a223f527b990b2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:3c1d13a2929915a33d8d6472000200b8374748df9f58892fbf7802d6466de46b","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:6e543aff5378261789b81481ed5f32b2109c1707a93a01c86d21d11dba4da88d","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:98de8d12d9d3dbf669463b5b43f7d6dcdac5fc6fe3abc766baae2dda46e42e05","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-15T17:34:46.898154Z","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:950eb193ad16672710aacbdfeb787122b87769828f08e0c486f1bdb40dbf3ec6","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:43:44.589730Z","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-15T17:34:46.898154Z","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:1be9db1bb22023a612491d44a7d11fc84aeb14ca8fca3232ebf6d40e27fc7280","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-15T17:34:46.898154Z","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:ba0de9999ebb1ba81dd021749c02f77a323f2d813d22fd47b400f9f1cd69a645","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-15T17:34:46.898154Z","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:513e92e33ace727b0cb01ddebb97694424aeebea18321e24ad382acce584e264","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:0304f54eba28d8024c29d27d3eb40936d21a62c7faef125aec2524c1ec48eb31","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-15T17:34:46.898154Z","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:63c45ee57e698429f50e69c614a0ec0b0539efc89fda55f15dda825525678e85","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-15T17:34:46.898154Z","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:8b35f8b76288365cba85e8da4bcb4e30760b29190b821d9e3feef65f5e71d664","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-15T17:34:46.898154Z","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:022fbf1acf77f38e4e115032f1e05590a79fe424f0622fa092979cafdcf770da","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:17adb3c27515aee9bbd7b87d973e409f69f88cee1cc0ec1ade3d62f8f4ebc2b1","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-15T17:34:46.898154Z","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:7005eb358074bb6e5957d421ce7f5ae7e87567909959c5c4b24b683c74ab074f","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:ac65b56f7d3203d6e7143c921467d9da0b407c52e8e99abe856d1b873bebef44","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:348c9d90cfa08bc4df203ab90e138f05252af22f157339f2e1294ad8c0df4546","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-15T17:34:46.898154Z","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:6467616bcd0203d160c1bcf01da4edddaf28d00fa61fbd66b51e1fb7e0701524","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:0537d68232bff4137a6729f9a5bb453613b10393807051738003b0c9ae005d2c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:f64320ede451fa16fab0901c4ec92102fb62ff1a192509a4ffdc343653147878","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-15T17:34:46.898154Z","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:5b532f09174afba8513a839f4715d451d14c308f172268b86e503ac39d1de220","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-15T17:34:46.898154Z","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:6ab6375534bbd6f438866e4768d0dc74f485eec77332655df88d3147a43a8e46","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:0200b075169e2ef741b2ce76bfba1d564f70d413b5f6a62e451bbffb98acb490","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:41e68ff7f3bd17b7d4362c317ee0f04a352a5d292251264c4d5e27d21f98c674","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:9e2e040747406fe140a3ebffd432c216ac119fb023e30125b68517cc7e983241","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:2099d1a05af86df028042c456144fe2bef392fb95f1831823cb9e3432642d85d","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-15T17:34:46.898154Z","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:fcf0a28b52beef1508eb7dbfd784e6ce6cb6034073932b93935263c3b060b49d","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-15T17:34:46.898154Z","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:60ab04351752446129199a1f19dbd2555984ef41dca602b0019e110cd6738b32","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:b4b2ea917c58d8ac5204d7eb3149f93a8cb92a4a2e2da1640fd0486c8471ed25","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:23027e235cb9457a12105f53cf0fec6184432aa7d4c256c632bf6376755b0d3c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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:567d6e1031d05f33e28338b7484bc1414ebdd73012861114e313eb700c37aeaa","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T17:34:46.898154Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 94 of 94 outbound references and 0 inbound Pith citation observations for arXiv:2508.05673."}