{"as_of":"2026-08-16T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7204ef5a91ce56f6ce44abec7fb3b788be8dd8c365a4e3f0c7855c0fa7b0e88","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:57:48.748152Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2506.09454/citation-record","integrity":"/paper/2506.09454/integrity","json":"/paper/2506.09454/citation-record.json","paper":"/paper/2506.09454"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:57:49.759905Z","title":"Backpropagation and stochastic gradient descent method","venue":null,"work_id":"f9c1158c-3bee-4354-b6a2-7982c2027305","year":1993},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.435659Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:c7aafa9e97607be8ae4327f373da3412244ef0f69c1e789bb8d2c447477d6ca5","observation_id":"3160ebea-8b0f-4aa7-ac1f-ada4390a1565","resolution":{"observed_at":"2026-08-07T04:57:49.764639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.440904Z","title":"Neural network learning: Theoretical foundations, volume 9","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.440904Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:75debe1070d84b6999e98d536681ba39947416f38e32265c5c4ab9ffbec0af7d","observation_id":"e10bd0c8-d454-41ac-a689-7e483a0a1856","resolution":{"observed_at":"2026-08-07T04:57:48.440904Z","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-07T04:57:49.735361Z","title":"H-consistency bounds for surrogate loss minimizers","venue":null,"work_id":"b47d7a1d-2dd0-4ac8-b497-0d5cd7bbdb8f","year":2022},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.445421Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:930e4781b9d72921ff21c6c0d238a6929f3fb16cc4de0112c9fc9213ed1090e4","observation_id":"cde224f4-4125-49cd-b32f-387839f9eb33","resolution":{"observed_at":"2026-08-07T04:57:49.740194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.451244Z","title":"Multi-class h -consistency bounds","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.451244Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:8211644ceff0b0f1546b2192d646f99710be2a53d5feb42f39316ffcdbdfdec5","observation_id":"c73d4359-e00b-4721-b4e0-06ba10386b87","resolution":{"observed_at":"2026-08-07T04:57:48.451244Z","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-07T04:57:48.455685Z","title":"Convexity, classification, and risk bounds","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.455685Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:273e772b78f8a8b275c07392528403d41a368fe655b8f92e45d8e246c28b20a8","observation_id":"c7bb3c6d-9b1e-4ed2-9006-44ac5562d16a","resolution":{"observed_at":"2026-08-07T04:57:48.455685Z","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-07T04:57:49.700316Z","title":"A generic coordinate descent framework for learning from implicit feedback","venue":null,"work_id":"b0a9b8dd-027a-4d21-861c-ce498b2c55c8","year":2017},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.460331Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:be0928d196c94034a88cc9156e6d64b77eece6bec1576608690b8d388d16627a","observation_id":"3582cf2b-31f6-4980-b712-717665ef16ee","resolution":{"observed_at":"2026-08-07T04:57:49.705552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.684759Z","title":"Adaptive importance sampling to accelerate training of a neural probabilistic language model","venue":null,"work_id":"729b600b-67dc-41fc-9062-ba9203140d9a","year":2008},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.466636Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:d9dbcb3e94dd1c3de0a3eddeeb05ef79b68b64bbfe5f685f9f977e31e835ac69","observation_id":"cfd45e77-f07c-45c5-ae39-34a737eaf8b0","resolution":{"observed_at":"2026-08-07T04:57:49.689956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.670015Z","title":"Optimization methods for large-scale machine learning","venue":null,"work_id":"853ca1f7-abbf-4369-87b5-e47398e77ba8","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.471020Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:a086dbec8187958ef9698edc4cc70724500d51e031b7fa325964b046c8c9e831","observation_id":"98eb8d7f-8c0c-42e8-8b1e-c5865bfe736e","resolution":{"observed_at":"2026-08-07T04:57:49.674613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.654450Z","title":"An alternative cross entropy loss for learning-to-rank","venue":null,"work_id":"3caecfe4-330f-440b-95c3-42232c18f519","year":2021},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.475496Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:debf01b5f151c314d78c7cb0f21f6572706ffc9509cea2e699cbfaba9fce2973","observation_id":"02eca49b-e72c-4654-844a-90f1be2a709c","resolution":{"observed_at":"2026-08-07T04:57:49.659582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.639943Z","title":"An analysis of the softmax cross entropy loss for learning-to-rank with binary relevance","venue":null,"work_id":"0002f772-114c-4ddb-9c13-98c6db25bad6","year":2019},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.480474Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:ed80ec7df57e9afe5552f91b8ae410705be44c40ed75e9e7c9bc203c0de597b9","observation_id":"1c4de5bc-d7ad-4d78-87ca-d45c10d737c5","resolution":{"observed_at":"2026-08-07T04:57:49.644520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.625533Z","title":null,"venue":null,"work_id":"2c38fd71-465a-44dc-baf6-50488ef6702f","year":2010},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.484868Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:5305e0a65d7db326fa03b5544739646f23cc26caca948a4472c4fe854618fc86","observation_id":"67d0b50e-f454-4b70-89ac-306fae0d6fdb","resolution":{"observed_at":"2026-08-07T04:57:49.630139Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.610491Z","title":"Efficient neural matrix factorization without sampling for recommendation","venue":null,"work_id":"ce297f20-97af-402a-a89a-bed74a84ae86","year":2020},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.490128Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:e309c10af536d11336161ba95071a8d94ddb91a9b467f8677f8932a6766c4be6","observation_id":"27571e37-225b-429d-bfae-9c94f00ae1c8","resolution":{"observed_at":"2026-08-07T04:57:49.614965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.596131Z","title":"Revisiting negative sampling vs","venue":null,"work_id":"0e937056-a4d1-4378-9c01-448bb2784ad5","year":2023},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.494388Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:ee17d0204ce3e2295ac304134a82b5ca83f5d19d914f2f4bc438768b09b2fd37","observation_id":"24127b06-2b6a-4765-a8b8-21b693748aa6","resolution":{"observed_at":"2026-08-07T04:57:49.600970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.582051Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":"d8a2d5f5-f632-4934-b216-84c77b98447e","year":2020},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.499278Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:4be30a4435d4983647e6ca6a933a126c5fee37d4e3e002dbf3f40db0b3788f3d","observation_id":"7bb4d9ab-8c3a-4db2-9121-b0100096553f","resolution":{"observed_at":"2026-08-07T04:57:49.586831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.568305Z","title":"Learning a similarity metric discriminatively, with application to face verification","venue":null,"work_id":"9ed432ac-64ba-4fd8-a3f3-6edfdf81bc54","year":2005},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.503703Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:546d9c4c7945b047e7d733a20c4e5889b56f895f449acce093dfc408f1812698","observation_id":"9b611527-ba73-4c3d-80f4-bbd4f6bd591b","resolution":{"observed_at":"2026-08-07T04:57:49.572907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.554110Z","title":"Subset ranking using regression","venue":null,"work_id":"0ff54d11-d2a7-4c83-a361-d0df36a518f8","year":2006},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.507955Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:1119de4352f0a38b6fa57a366e1c757c42dda20d7dba739b388587b737720b0c","observation_id":"939bae9b-e9f3-46a7-97c1-aafef3629ec0","resolution":{"observed_at":"2026-08-07T04:57:49.558898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.540359Z","title":"Deep neural networks for youtube recommendations","venue":null,"work_id":"aa0b5639-16a4-4004-bb4d-685037209441","year":2016},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.512811Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:a6949b57186f75d681258c0bc228877cf1dfb39b060bfd6ef41e2ad8f9ad6632","observation_id":"9625d872-a865-4fdb-8397-f013e7b97722","resolution":{"observed_at":"2026-08-07T04:57:49.544845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.526068Z","title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","venue":null,"work_id":"06b45019-6cfe-44f2-9719-094a3e9a8e32","year":2014},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.516976Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:a2055c8b0fa8d388e0c7354cdef3d5395539aa5ec2a8384ad6fde9d1e9b612b9","observation_id":"04e87692-ff7d-4ebd-ab33-38d66461f79e","resolution":{"observed_at":"2026-08-07T04:57:49.530727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.512621Z","title":"Inexact newton methods","venue":null,"work_id":"faea5378-b4e8-4634-b4af-b52fa867e2ed","year":1982},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.521396Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:c00b27829a67b9eafa854f99f49eb5af0c49baa4c2ee724adce311e53bb3bf39","observation_id":"76f6fa71-dbce-4ec7-9ec4-c14b5f318332","resolution":{"observed_at":"2026-08-07T04:57:49.516897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.498429Z","title":"Simcse: Simple contrastive learning of sentence embeddings","venue":null,"work_id":"ae9e288a-36ca-4897-a46b-b99493b4b617","year":2021},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.526285Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:53c318ccdbac7939565d7bd142901b1890e118b38341f84ecd7533d3b6df2315","observation_id":"d714b942-c998-453f-98ab-102a4c8064a4","resolution":{"observed_at":"2026-08-07T04:57:49.502950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.484060Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming","venue":null,"work_id":"b466b104-fe8f-4436-9e22-3dc22bc223cc","year":2013},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.530663Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:7fe7b77f004c366ee6a48e04cd439a36bbc22c4aa650d6e72ad18cc6c8f3287b","observation_id":"66f88946-54f7-4521-a504-659967a9e2ad","resolution":{"observed_at":"2026-08-07T04:57:49.488711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.467967Z","title":"Noise-contrastive estimation: A new estimation principle for unnormalized statistical models","venue":null,"work_id":"06a2b2ae-46d4-443f-977e-5a4a1ba721fb","year":2010},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.536522Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:72e19227a30847f0c8971e9e414d1d96621495b5c9ae44b883fd21719e1a88d6","observation_id":"b9747256-cc9c-42f7-9df1-47408f34306a","resolution":{"observed_at":"2026-08-07T04:57:49.473480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.452660Z","title":"Neural collaborative filtering","venue":null,"work_id":"bdd8aa06-57b3-4efd-8cc0-3b38b9b24ba4","year":2017},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.540796Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:ec3ff0555aec35618cb39a8bce670f4e70fde97f60805abc40c8c4dbcac2819a","observation_id":"52b8a3cd-3095-4ee4-8d66-f1f701a81fc1","resolution":{"observed_at":"2026-08-07T04:57:49.457266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.437380Z","title":"Collaborative filtering for implicit feedback datasets","venue":null,"work_id":"1a427803-b115-4869-b119-326be1244376","year":2008},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.544858Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:7358e2d725d9461ffb9ffbcaabb6afd427e3715830c2408f2e9d2871c0a7958c","observation_id":"dbc573b1-4a72-4494-a7b7-8bf6ee818b41","resolution":{"observed_at":"2026-08-07T04:57:49.442250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.419092Z","title":"Cooperative retriever and ranker in deep recommenders","venue":null,"work_id":"549879f6-ce4d-4510-aee7-332e67637ee5","year":2023},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.549387Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:eed8a36a688f8eed647b1de293ffdda5146f80054f5387f562c7980d4995c188","observation_id":"03ae01ae-65cd-4698-b41e-0cd2c56ae6d8","resolution":{"observed_at":"2026-08-07T04:57:49.424692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.403438Z","title":null,"venue":null,"work_id":"fdb19a77-2fad-47dc-aec4-2192eccb7b5e","year":2004},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.553641Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:48365ca9320c82153a374e2c2076873c92d2af6c3d6f927b40856449687c2194","observation_id":"45a41acb-dee5-4570-a1e0-4133f8b19ef8","resolution":{"observed_at":"2026-08-07T04:57:49.407849Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.388759Z","title":"Non-convex optimization for machine learning","venue":null,"work_id":"2c6fa5fe-dfd0-4b16-b000-5c405f5073b9","year":2017},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.558325Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:77a3e4df323589d371affabc1a45d407c145ad5e278a26e4c991c2a3c9311a8a","observation_id":"c17ed38a-45e3-40fd-99de-d96a2db38cf6","resolution":{"observed_at":"2026-08-07T04:57:49.393523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.374253Z","title":"Accelerating stochastic gradient descent using predictive variance reduction","venue":null,"work_id":"fb79d36e-ba45-44ad-9382-d4fe3363717e","year":2013},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.562968Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:06823c761974a310327ceecb1b48094a735c1a89ea50da6af152eea027fdd0f2","observation_id":"2fe96b6a-535c-4c0f-87c5-284a012dadd7","resolution":{"observed_at":"2026-08-07T04:57:49.378792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.359372Z","title":"Self-attentive sequential recommendation","venue":null,"work_id":"a5a6a3f7-0175-421a-b3b9-ebe7652f3488","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.567999Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:7d97a7af475f499f918042044bc2f1f1c221c7e0e40d30ba4fefb02f72c31b1a","observation_id":"c33585c2-2a32-4fc7-81bf-dd9ffecab00e","resolution":{"observed_at":"2026-08-07T04:57:49.363953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","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-07T04:57:48.572174Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.572174Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:554bf3aed29949492aace06adb298f679481f9da863f68ad88eedf5c5c4573b5","observation_id":"b60b0683-d348-43d1-add1-d569b58bf176","resolution":{"observed_at":"2026-08-07T04:57:48.572174Z","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-07T04:57:49.344245Z","title":"Factorization meets the neighborhood: a multifaceted collaborative filtering model","venue":null,"work_id":"5e02e2d7-b21c-46f7-89c9-ea1a913ec14c","year":2008},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.576478Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:bc92ea9f7576f937939dcd224e787f9e8e9f7568cdef9f631c971def773acb45","observation_id":"350c3f2c-d307-4d56-aade-335be60c8b82","resolution":{"observed_at":"2026-08-07T04:57:49.349283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.580623Z","title":"Matrix factorization techniques for recommender systems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.580623Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:3e3a20fb51627532e7d9527e49e3a3bae7ee95c4e4f72e88cebe9309b503f9bc","observation_id":"8970608b-5480-45b4-b07b-6db21ca078dc","resolution":{"observed_at":"2026-08-07T04:57:48.580623Z","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-07T04:57:49.318752Z","title":"Efficient training on very large corpora via gramian estimation","venue":null,"work_id":"3ccad3a2-570b-44e0-9aae-982903f0563f","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.584756Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:98f8cde944ff30db56fecb5db84ce52c37480bf2ba6093deb6fd2cd3f6a49557","observation_id":"2367f0d0-8261-4861-9163-adf94bd635ab","resolution":{"observed_at":"2026-08-07T04:57:49.323545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.301628Z","title":"Symmetric metric learning with adaptive margin for recommendation","venue":null,"work_id":"92c1d4ea-64f1-4288-b97d-7b8a0a724517","year":2020},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.588944Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:968caa636daf80f59e86072bea78291fc4e96ab3e1271db08cb38d38021ba237","observation_id":"f3776451-64c2-4ade-8322-01f026453468","resolution":{"observed_at":"2026-08-07T04:57:49.306816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.285564Z","title":"Geomf: joint geographical modeling and matrix factorization for point-of-interest recommendation","venue":null,"work_id":"772f5c5f-0d72-4899-9967-efb431641cef","year":2014},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.593196Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:eae534174e37cd021a800097830614e266362d3b2b9ee0994f8b2568f93143c5","observation_id":"1c56f34f-824e-4dba-96b8-5cdde1ab44c3","resolution":{"observed_at":"2026-08-07T04:57:49.290634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.270829Z","title":"Recstudio: Towards a highly-modularized recommender system","venue":null,"work_id":"4f375b30-fb1c-4ba0-bff1-6a5f008fc8cf","year":2023},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.597682Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:138020b0379c153657d3d9487cc71fe1c62908137fb75733e29845f95073a8e1","observation_id":"95df80e9-315f-44dd-9911-15254cc93dec","resolution":{"observed_at":"2026-08-07T04:57:49.275471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.253894Z","title":"Variational autoencoders for collaborative filtering","venue":null,"work_id":"61ca3330-4fa1-4844-a417-068677d945c6","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.601798Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:bf450c1a8b33e069f37acb996a8827523d563925ea0cd6a7478283552d2839d9","observation_id":"e8e70786-9961-4ec0-a77d-48f767d42c78","resolution":{"observed_at":"2026-08-07T04:57:49.259234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.238964Z","title":"Consistency versus realizable h-consistency for multiclass classification","venue":null,"work_id":"99279968-c873-4a47-a892-17a89f9f3f9a","year":2013},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.606368Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:afc7b0fc1f5d80bbadf2aed4c6dd8d27eb101da31cc0fcb1bf718cd8fb12fd8d","observation_id":"70f453b8-44d6-4568-8444-60abe961e5f6","resolution":{"observed_at":"2026-08-07T04:57:49.243582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.224183Z","title":"Support and centrality: Learning weights for knowledge graph embedding models","venue":null,"work_id":"e9e271fb-bdf9-43f8-a18b-b34442237979","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.610946Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:5b9a1a474673232f2541cecf944248de1a7e5de1a34c93196fd090af603d9b8a","observation_id":"ef30345b-4d93-4bd3-af60-79ad5fe98d0d","resolution":{"observed_at":"2026-08-07T04:57:49.229160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.615246Z","title":"From softmax to sparsemax: A sparse model of attention and multi-label classification","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.615246Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:5de60b3f26cd60c0b9b19eeceed89e3b12658db19fdd6d93ea0e4ec463eb8426","observation_id":"bb17965d-713e-4744-852a-531cf8f4ae48","resolution":{"observed_at":"2026-08-07T04:57:48.615246Z","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-07T04:57:49.200372Z","title":"Multilabel reductions: what is my loss optimising? Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":"f7446b79-3862-4da4-938b-f92d74bb9cf5","year":2019},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.619676Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:0998086ce5fb3bf9fa9ffbf0316a1fbaf19fbf3bd4ff3f574f503222bdac7077","observation_id":"12e2bb4e-5cf4-4154-b5e8-9f0972d51584","resolution":{"observed_at":"2026-08-07T04:57:49.205300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.183868Z","title":"Distributed representations of words and phrases and their compositionality","venue":null,"work_id":"14582b5d-8fbd-4d08-a848-425a701aad16","year":2013},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.623852Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:96fe7d5a826e69c7fd129e979ec4698f458c546de22d67dd416474015ef89365","observation_id":"f533cee1-d961-4335-a09c-cc60841b5d12","resolution":{"observed_at":"2026-08-07T04:57:49.189331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.169355Z","title":"Learning-efficient yet generalizable collaborative filtering for item recommendation","venue":null,"work_id":"dfd2cbe0-8d56-42ba-aee9-30c11b58742e","year":2024},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.628846Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:0f568f1ee021e6ea7902ef46e9488be4bdd87c5fe832832a0148bb11c321a589","observation_id":"036deacc-f139-44d7-b373-3c0dd593dc02","resolution":{"observed_at":"2026-08-07T04:57:49.173832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.154924Z","title":"On ndcg consistency of listwise ranking methods","venue":null,"work_id":"588ceb82-2d24-4343-827d-dd9d079c42f6","year":2011},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.634108Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:23977ab328f3643cb572adab657aa5db27b1092dff2860810b7730313642c675","observation_id":"50ba1791-2fb1-4ad3-abd5-7d89bf862c02","resolution":{"observed_at":"2026-08-07T04:57:49.159468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.140667Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks with contrastive loss","venue":null,"work_id":"b93fa4a5-4be8-4942-947a-ce07a05fef8a","year":2019},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.638760Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:29999071df3e7230313bd006a73b66177870bade76df7303c28b5d3db6102e5f","observation_id":"e908128f-3b94-4555-87d2-235581acfdf4","resolution":{"observed_at":"2026-08-07T04:57:49.145412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.127186Z","title":"Item recommendation from implicit feedback","venue":null,"work_id":"f542a624-aca4-421a-9949-69905d542415","year":2021},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.643570Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:415dd1c107150433e162eaa35b3ec69d4ac410ff836cdcff04c1a5605447af55","observation_id":"e7e6e5a9-8983-4d7e-b4b1-f3dcb0d9bfd9","resolution":{"observed_at":"2026-08-07T04:57:49.131460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.113425Z","title":"Improving pairwise learning for item recommendation from implicit feedback","venue":null,"work_id":"e7d59e09-8e90-446e-9b96-34510f81d1e6","year":2014},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.648385Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:a43d6bd371f7aed6c840b39d7b21cdb8e6389f6be4736f187d482e9a345d3955","observation_id":"79732c2e-5846-4954-8bbf-e46ca9f79cb4","resolution":{"observed_at":"2026-08-07T04:57:49.118263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2618","last_updated":"2012-05-09T18:25:09Z","snapshot_observed_at":"2026-08-15T03:23:25.220336Z","submitted_at":"2012-05-09T18:25:09Z","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2618","snapshot_observed_at":"2026-08-07T04:57:48.654171Z","title":"Bpr: Bayesian personalized ranking from implicit feedback","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.654171Z"},"links":{"cited_paper":"/paper/1205.2618","citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:0c17357c69a1c29f056d8d3dd62e0a171fed2d2673f9c229f5e5437b458cba28","observation_id":"45c533a9-fbf1-4161-aa0a-0c068326dffb","resolution":{"observed_at":"2026-08-07T04:57:48.654171Z","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-07T04:57:49.098434Z","title":"Revisiting the performance of ials on item recommendation benchmarks","venue":null,"work_id":"983d1dcb-fcb8-496c-8c98-c5097854d006","year":2022},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.659552Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:2d9ecbd151799295a6d35194b8f78a4ae852952a3c7deb6fefd503e82d1681d1","observation_id":"7bfa7bb4-e6b1-4006-9e7c-04d86012460b","resolution":{"observed_at":"2026-08-07T04:57:49.102985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.084264Z","title":"Facenet: A unified embedding for face recognition and clustering","venue":null,"work_id":"3f1830bb-1a0f-44a0-8195-cf811ce6ceb9","year":2015},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.664413Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:fc42f194322a27e4fac5d9f96dc400412e57844684504da204cc9f3010676056","observation_id":"034a9f82-7bca-4c53-be7d-c69d17555e18","resolution":{"observed_at":"2026-08-07T04:57:49.088731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.070599Z","title":"Bridgland","venue":null,"work_id":"9a3b0e08-7493-4486-9865-f0940aac8ffd","year":2020},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.669732Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:6b1069ce75b39b883782e9b1e6d58d97ff6cb599eb2927fa40f5d827845d20fe","observation_id":"fef56c95-6042-48ab-921a-9241bb1e2a81","resolution":{"observed_at":"2026-08-07T04:57:49.074912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.055437Z","title":"Learning semantic representations using convolutional neural networks for web search","venue":null,"work_id":"5c249f89-daca-45d1-b7e0-722b533f0be7","year":2014},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.674608Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:3c451bd2934b6730ab038fbd0e7dfd6da4eb6a4e493d70d0b5f9d6ba13b10c58","observation_id":"800e9820-177d-4c4b-8410-a0c7d8f5ed5a","resolution":{"observed_at":"2026-08-07T04:57:49.060352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.041189Z","title":"Generalization error bounds for collaborative prediction with low-rank matrices","venue":null,"work_id":"c41a94d1-823c-4566-b5ff-93f3b9aec5b6","year":2004},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.679460Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:9c8641e9bd3a5c521acdfd5f3ffec4d003ec662602bd9a809220d5f4b4b569d8","observation_id":"2ce3b229-7e33-4532-b12e-6b8b7efecfc7","resolution":{"observed_at":"2026-08-07T04:57:49.045660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.026165Z","title":"Bert4rec: Sequential recommendation with bidirectional encoder representations from transformer","venue":null,"work_id":"cf6de9f9-7d24-426f-9bc8-8dfaeae6608f","year":2019},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.684188Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:9c8d60c3ca0a9ae681dc9e9efc019c2a03bea26115fac2543cabf8745e05ac5e","observation_id":"9b2c7e39-2f84-421b-842d-e56e2c1eb86b","resolution":{"observed_at":"2026-08-07T04:57:49.030772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:49.011722Z","title":"Alternating least squares for personalized ranking","venue":null,"work_id":"f892bfd6-f82c-46f0-a265-53e759c38d69","year":2012},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.688960Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:dea0ecd28a5afcededcc17a8e673a1e4734293cdf4e482717280eabbbca6bec0","observation_id":"cfd828f5-0f0c-429a-84e7-6fd7f6bf0f2d","resolution":{"observed_at":"2026-08-07T04:57:49.016395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.996738Z","title":"On the consistency of multiclass classification methods","venue":null,"work_id":"0a8c4640-b362-4a23-b505-fd76ce5f832a","year":2007},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.693612Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:37ceee71183e77db3391ac0743e973022d6f7391de4558aa59c7aaebd70faa6a","observation_id":"c4962b81-b45c-4078-99f2-6a14f3ee0b40","resolution":{"observed_at":"2026-08-07T04:57:49.001681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.981470Z","title":"Learning fine-grained image similarity with deep ranking","venue":null,"work_id":"499fe2ed-018c-41c0-9a2a-056babae4352","year":2014},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.698959Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:b8254272cd3cf96d6ff3270908e9518a96b7eab729c12e4f99ec31649f38f293","observation_id":"0fa5b2c5-3f51-48a6-bd42-bd0b02239b7a","resolution":{"observed_at":"2026-08-07T04:57:48.986724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.963421Z","title":"Wsabie: Scaling up to large vocabulary image annotation","venue":null,"work_id":"410eefec-2005-465a-a374-e2655c2746bd","year":2011},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.704494Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:fe4457e862e698b882505a42c24ac1d40b4a29b8b4b7097762b5cbf090e07e98","observation_id":"35279c48-8871-4ad7-8e27-cd676676e507","resolution":{"observed_at":"2026-08-07T04:57:48.969418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.02327","last_updated":"2023-12-19T13:06:54Z","snapshot_observed_at":"2026-08-16T17:29:48.496661Z","submitted_at":"2022-01-07T04:55:45Z","title":"On the Effectiveness of Sampled Softmax Loss for Item Recommendation","version":2},"cited_work":{"arxiv_id":"2201.02327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.02327","snapshot_observed_at":"2026-08-07T04:57:48.795710Z","title":"On the Effectiveness of Sampled Softmax Loss for Item Recommendation","venue":"cs.IR","work_id":"457a5b1e-b5f9-4285-aff5-57ca1fbb8441","year":2022},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.709334Z"},"links":{"cited_paper":"/paper/2201.02327","citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:95778f523c10923a17d78ee9bfed785ed8147327c06f45a1f1c817f9ae8cc78f","observation_id":"eb545d1a-9bb4-4bfb-956f-68e674841780","resolution":{"observed_at":"2026-08-07T04:57:48.804669Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.947817Z","title":"A no-regret generalization of hierarchical softmax to extreme multi-label classification","venue":null,"work_id":"63b98dfd-f3c3-4c94-9f5f-2a2f5bac7190","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.714628Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:17f8f2f6155d6b01931448adeba8dd70f9b5db754ed874cf8a2e59bb66ce402d","observation_id":"c0737551-eb9c-4997-9b7c-d16f146db804","resolution":{"observed_at":"2026-08-07T04:57:48.952560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.932239Z","title":"Batch is not heavy: Learning word representations from all samples","venue":null,"work_id":"099e545a-6e09-4331-be9e-2b8f94772ff8","year":2018},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.719330Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:b85d8b29c1320d92561ab33f6fa767a184498cb7165c133c3a95eea8e4a0f179","observation_id":"036f96ec-a480-4ce9-b1ca-d8e8a97e36d2","resolution":{"observed_at":"2026-08-07T04:57:48.937574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.915631Z","title":"On the consistency of top-k surrogate losses","venue":null,"work_id":"572b549a-41c9-4833-8375-35c47bf5e09f","year":2020},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.724251Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:598838f62501bcf5e03ed46fbb9d5f42ba4e06277466b7f8998fc070f05d6557","observation_id":"6e55c27a-6ee6-420b-b30d-f0ffe8b4a212","resolution":{"observed_at":"2026-08-07T04:57:48.920603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.900384Z","title":"Sampling-bias-corrected neural modeling for large corpus item recommendations","venue":null,"work_id":"d52978c1-9a86-41f3-a2d1-dfa9669e7160","year":2019},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.730642Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:40c6c88d794beceb6f87038e94d6a12bfcdac1f9dbc20e36c0e695e474899386","observation_id":"17228924-a864-4575-bbb6-9ac765556d0f","resolution":{"observed_at":"2026-08-07T04:57:48.905222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.885275Z","title":"Statistical behavior and consistency of classification methods based on convex risk minimization","venue":null,"work_id":"b3a2ec01-b7fe-4051-817c-4a71bf108152","year":2004},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.736549Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:a18d1dbe6c02ace9c5a512fa0c3bc6d5fa3da54ff3f0e5e7145fc025a4ada824","observation_id":"da42db03-c37a-4aa4-91a8-d5a192d05bab","resolution":{"observed_at":"2026-08-07T04:57:48.890328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.869256Z","title":"Optimizing top-n collaborative filtering via dynamic negative item sampling","venue":null,"work_id":"6d930c50-11f0-428e-84c4-1b4517d3940a","year":2013},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.742573Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:00d81e160436f62a9e446fae0c59ad69de21f0b149a562fb33ab1dcd13b180f2","observation_id":"f22ebfbe-ff60-41c5-bd34-f7c40b0bcb2d","resolution":{"observed_at":"2026-08-07T04:57:48.874129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:57:48.852462Z","title":"Learning explicit user interest boundary for recommendation","venue":null,"work_id":"e6a49293-6536-42ed-84db-323d02920846","year":2022},"citing_paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T04:57:48.748152Z"},"links":{"citing_paper":"/paper/2506.09454"},"observation_digest":"sha256:b0b5b1bf3ddd434755ed2afbdea36a1709d197d6ec23936913081dd3fea2f768","observation_id":"2f2be40e-2cb7-4ade-aca5-3e1a26e5154a","resolution":{"observed_at":"2026-08-07T04:57:48.858389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.09454","last_updated":"2025-06-11T06:59:17Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:45:26.635301Z","submitted_at":"2025-06-11T06:59:17Z","title":"NDCG-Consistent Softmax Approximation with Accelerated Convergence"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":56},"total_outbound_references":66},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2506.09454."}