{"as_of":"2026-08-17T18:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82d02a418eef24cc5377a0dff1bc7a1052aef03ee430b54fee228025e231e9e2","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:10:59.996360Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2608.12569/citation-record","integrity":"/paper/2608.12569/integrity","json":"/paper/2608.12569/citation-record.json","paper":"/paper/2608.12569"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:59.768651Z","title":"Proceedings of the 2020 conference on empirical methods in natural language processing (EMNLP) , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.768651Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:7be20bcb1f9bac4d073837554977c0b32758b81365a30567271a30e4e5c6afa7","observation_id":"4b4fe3c4-4a0f-4c19-a285-f08165573d29","resolution":{"observed_at":"2026-08-16T00:10:59.768651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00808","last_updated":"2020-10-20T22:17:19Z","snapshot_observed_at":"2026-08-13T17:48:59.734798Z","submitted_at":"2020-07-01T23:15:56Z","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.00808","snapshot_observed_at":"2026-08-16T00:10:59.775170Z","title":"arXiv preprint arXiv:2007.00808 , year=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.775170Z"},"links":{"cited_paper":"/paper/2007.00808","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:4146eec50af27243bc214a1acf02622fa1f690dc2b606214b342b47fd44ad043","observation_id":"59ea4ae2-4762-4194-9102-edebfbbbea2b","resolution":{"observed_at":"2026-08-16T00:10:59.775170Z","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-16T00:10:59.780278Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.780278Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:8b5bce9264223b5a519bdb589b151709bb99acfd899dc73f31d993cc63d4b8dc","observation_id":"0bd68f05-8411-4753-9245-ca2eeea265f5","resolution":{"observed_at":"2026-08-16T00:10:59.780278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-12T23:25:05.204139Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-16T00:10:59.784643Z","title":"arXiv preprint arXiv:1901.04085 , year=","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.784643Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:85eb619b9fb0a445dd8a0cc64942151cce0f9847703371e956247890bbe7f7bc","observation_id":"8341e16e-92b9-48cb-bc14-ea7a160ad16e","resolution":{"observed_at":"2026-08-16T00:10:59.784643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.27295","last_updated":"2026-05-26T17:07:55Z","snapshot_observed_at":"2026-08-11T07:23:28.822202Z","submitted_at":"2026-05-26T17:07:55Z","title":"Gemini Embedding 2: A Native Multimodal Embedding Model from Gemini","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.27295","snapshot_observed_at":"2026-08-16T00:10:59.788835Z","title":"arXiv preprint arXiv:2605.27295 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.788835Z"},"links":{"cited_paper":"/paper/2605.27295","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:50275f689fb809c8ab494a2e9eaf2770d469883d1f5837b4398284bb85198e06","observation_id":"72f778ab-71e6-497e-ba38-346124691fe4","resolution":{"observed_at":"2026-08-16T00:10:59.788835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.20354","last_updated":"2025-11-01T23:38:27Z","snapshot_observed_at":"2026-08-14T12:38:29.847254Z","submitted_at":"2025-09-24T17:56:51Z","title":"EmbeddingGemma: Powerful and Lightweight Text Representations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.20354","snapshot_observed_at":"2026-08-16T00:10:59.793126Z","title":"arXiv preprint arXiv:2509.20354 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.793126Z"},"links":{"cited_paper":"/paper/2509.20354","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:6ae8830114aaeaf34403f76d7ae58c97e35f537e7cb560fde9d7222b78bd6017","observation_id":"56b927a8-43f8-49b8-a966-969341692c93","resolution":{"observed_at":"2026-08-16T00:10:59.793126Z","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-16T00:10:59.797493Z","title":"Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.797493Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:7eb992e03950832b39336b0dd16362219ce32071865f6687d86077161c8a2dca","observation_id":"c4abdc58-d843-4d60-9b4f-a1f092770313","resolution":{"observed_at":"2026-08-16T00:10:59.797493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10634","last_updated":"2022-10-12T20:51:49Z","snapshot_observed_at":"2026-08-16T16:24:41.125951Z","submitted_at":"2022-10-12T20:51:49Z","title":"RankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10634","snapshot_observed_at":"2026-08-16T00:10:59.801703Z","title":"arXiv preprint arXiv:2210.10634 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.801703Z"},"links":{"cited_paper":"/paper/2210.10634","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:b1a07249f2e300b552d541d6134a8b2d3ea430ae2195b34d676dfd856a049072","observation_id":"b6988f93-8f8d-492a-b47f-ab9f4c9a9a5b","resolution":{"observed_at":"2026-08-16T00:10:59.801703Z","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-16T00:11:00.736244Z","title":"Findings of the Association for Computational Linguistics: ACL 2022 , pages=","venue":null,"work_id":"f0039ec0-01ec-4094-b75a-bcfec7a3ccb8","year":2022},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.806468Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:d682c1f9b54921ad8a497d671ccd51612c404b6559c6ebe3a1e81bf560fd71cd","observation_id":"e266161d-0771-4669-9f9e-b334bb316ffb","resolution":{"observed_at":"2026-08-16T00:11:00.744389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03281","last_updated":"2023-08-07T03:52:59Z","snapshot_observed_at":"2026-08-14T21:56:20.223557Z","submitted_at":"2023-08-07T03:52:59Z","title":"Towards General Text Embeddings with Multi-stage Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03281","snapshot_observed_at":"2026-08-16T00:10:59.810591Z","title":"arXiv preprint arXiv:2308.03281 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.810591Z"},"links":{"cited_paper":"/paper/2308.03281","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:89276bb4fe391e8cd6c3181790f222f6cc29eb3530430588fd0b0525fa69d806","observation_id":"3872c939-bd09-4378-b13a-9c2d229f4956","resolution":{"observed_at":"2026-08-16T00:10:59.810591Z","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-16T00:10:59.815179Z","title":"Proceedings of the 47th international ACM SIGIR conference on research and development in information retrieval , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.815179Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:a193803b19af77f50d72d0f1528de815c59a820cbdc34a6f2a9a32c0836d50a0","observation_id":"35fc911f-6d29-4693-b764-09e7ee6ce657","resolution":{"observed_at":"2026-08-16T00:10:59.815179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-08-17T07:57:12.232097Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-16T00:10:59.819263Z","title":"arXiv preprint arXiv:2506.05176 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.819263Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:431914f86a8a3abfdcc623b4197c3137e340334ed3f06ec5f9fa3a4552dd0ce2","observation_id":"7ff4ebbd-11df-4520-86db-27d753941ed2","resolution":{"observed_at":"2026-08-16T00:10:59.819263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07891","last_updated":"2025-03-10T22:16:45Z","snapshot_observed_at":"2026-08-17T08:48:49.792564Z","submitted_at":"2025-03-10T22:16:45Z","title":"Gemini Embedding: Generalizable Embeddings from Gemini","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07891","snapshot_observed_at":"2026-08-16T00:10:59.823364Z","title":"arXiv preprint arXiv:2503.07891 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.823364Z"},"links":{"cited_paper":"/paper/2503.07891","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:1bba6b1f617ea0fb3ec222d090df65f0f4d5242f8f88366b9c9a3ca0848730b5","observation_id":"e65e1a7c-9ba5-401d-a532-9b1c52ccf9c3","resolution":{"observed_at":"2026-08-16T00:10:59.823364Z","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-16T00:11:00.715074Z","title":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management , pages=","venue":null,"work_id":"72a985e8-8b34-44c8-b401-a6df7a42ce66","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.827660Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:4e8f387a273fd27c5cfdaad118f63dfe3df137aefc97e7899f75b402e32e6880","observation_id":"679a4e62-34f3-4528-933e-0303740dc102","resolution":{"observed_at":"2026-08-16T00:11:00.720020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:11:00.702347Z","title":"Findings of the Association for Computational Linguistics: ACL 2023 , pages=","venue":null,"work_id":"43396476-97dd-4f15-8335-a54450f016f9","year":2023},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.831450Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:6b08c80207ecbf9baa511b33c7764837d1fce424d943536a351c949082f0577d","observation_id":"7b5f5b87-fba1-4fa1-ad74-8614719dca47","resolution":{"observed_at":"2026-08-16T00:11:00.706187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11744","last_updated":"2024-05-28T17:12:02Z","snapshot_observed_at":"2026-08-16T15:31:40.099176Z","submitted_at":"2023-05-19T15:30:33Z","title":"ReFIT: Relevance Feedback from a Reranker during Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11744","snapshot_observed_at":"2026-08-16T00:10:59.837303Z","title":"arXiv preprint arXiv:2305.11744 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.837303Z"},"links":{"cited_paper":"/paper/2305.11744","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:bca92269ac29982d205ffd0cd53b54111fd9ca486e0e0038ada4a644ea8f7dfe","observation_id":"745a608a-ae6f-47f3-bee3-b622da5db662","resolution":{"observed_at":"2026-08-16T00:10:59.837303Z","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-16T00:11:00.690067Z","title":"Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval , pages=","venue":null,"work_id":"1ead3738-ce10-4203-8a69-ff7d0f3d6d54","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.843319Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:2ef3827b8a2e1ebb656bb003f3573e7af5e4447f244674beadfa3a3ff3725c0d","observation_id":"1a1111dd-d442-4a59-8209-b09623c12431","resolution":{"observed_at":"2026-08-16T00:11:00.694027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.05038","last_updated":"2026-04-06T22:22:13Z","snapshot_observed_at":"2026-07-06T22:31:49.574184Z","submitted_at":"2025-10-06T17:12:53Z","title":"Guided Query Refinement: Multimodal Hybrid Retrieval with Test-Time Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.05038","snapshot_observed_at":"2026-08-16T00:10:59.849331Z","title":"arXiv preprint arXiv:2510.05038 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.849331Z"},"links":{"cited_paper":"/paper/2510.05038","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:251a2ba668b3a9f1d70c971d5049bcd8bf645b9b7ec187c0581b95eaf47e62c8","observation_id":"35448955-3291-4db4-af59-689f0cad7e8c","resolution":{"observed_at":"2026-08-16T00:10:59.849331Z","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-16T00:11:00.675798Z","title":"Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval , pages=","venue":null,"work_id":"aa0e6bd6-7bba-444a-b73d-ff91909c356c","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.855191Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:ffb99753fd106f7e4455bca20b4932c4a6d6544dc40be4eb50217d7942be66cc","observation_id":"532f8864-1f3e-47e3-9c14-1bbc4bc1ba3d","resolution":{"observed_at":"2026-08-16T00:11:00.680284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:11:00.662351Z","title":"Machine Intelligence Research , volume=","venue":null,"work_id":"d0ecf306-2411-48e2-a66d-aaedc03608f2","year":2024},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.861806Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:6888fb385b6d6f73fd2b7cd02256e40fd71ab8060c711758298ef9d830249465","observation_id":"e4078d9f-2f24-45aa-acb3-513d968efe98","resolution":{"observed_at":"2026-08-16T00:11:00.666935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:11:00.644462Z","title":"Artificial Intelligence and Statistics , pages=","venue":null,"work_id":"80852f3d-03a3-482c-89f3-1ac1b42f48c6","year":2016},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.866535Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:e163792d02a71199e4cc5febb6d2d7817e97053a4a512145c20270688e148168","observation_id":"5033030c-d821-46eb-abd0-d86a7eb0fe5e","resolution":{"observed_at":"2026-08-16T00:11:00.649834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:11:00.626626Z","title":"Proceedings of the tenth ACM international conference on web search and data mining , pages=","venue":null,"work_id":"45062967-d43c-4c09-a045-f917938cc4e4","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.871532Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:82ed4ae2f7d5367c9d5d0ba214a1f4e281a7cb40f07695d6869348c6d1842cff","observation_id":"87cd8d59-85b9-4230-b537-be0773ef2a59","resolution":{"observed_at":"2026-08-16T00:11:00.632884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-08-10T11:59:11.481480Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-16T00:10:59.876753Z","title":"arXiv preprint arXiv:2305.05176 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.876753Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:9cfebf8bd482c1b8ad2694180c582ba7f85ed319052b81da26fbd8bce63a5e74","observation_id":"72551742-e839-4ed4-b8d5-c6a9493ff2b6","resolution":{"observed_at":"2026-08-16T00:10:59.876753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02155","last_updated":"2022-03-04T07:04:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-03-04T07:04:42Z","title":"Training language models to follow instructions with human feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02155","snapshot_observed_at":"2026-08-16T00:10:59.880636Z","title":"arXiv preprint arXiv:2203.02155 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.880636Z"},"links":{"cited_paper":"/paper/2203.02155","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:7bd1acb25d957a6be1d48f31d1c5aac6570a0f12b28d9463a9eb0ecf169f6ce2","observation_id":"b2fdeb34-deaf-4fcd-923d-0aeb0a85b32d","resolution":{"observed_at":"2026-08-16T00:10:59.880636Z","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-16T00:10:59.885272Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.885272Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:d5fa5e8732792351d4de83e4cb2c7480f31e874ed6d2a3fbfc5cf55bc3d6a451","observation_id":"f0ccfc33-aa16-41c0-b41a-404ea4e81b37","resolution":{"observed_at":"2026-08-16T00:10:59.885272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-16T00:10:59.889121Z","title":"arXiv preprint arXiv:1707.06347 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.889121Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:faec7161b4a4eb4e16140f7d69d2cc71dd2a7cec048a3f1fdb68fff304dd86f8","observation_id":"d977bf98-517f-4a68-912a-ddc979514cfb","resolution":{"observed_at":"2026-08-16T00:10:59.889121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-16T00:10:59.893224Z","title":"arXiv preprint arXiv:2402.03300 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.893224Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:ed4646d42cf5363f5c993a0f201c3d8d1a5e32e030f736e0d0f756606addaaaf","observation_id":"947f4b2d-fa6e-4014-8bac-e7e60c898c83","resolution":{"observed_at":"2026-08-16T00:10:59.893224Z","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-16T00:10:59.897955Z","title":"arXiv preprint arXiv:2511.13885 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.897955Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:d3cd7dd3f3fbb9872da8d8b5b63ed08f87b6591e3108f186e657d04bfbc1c507","observation_id":"d3f10040-1e23-43a6-8caa-13cd82a1bf55","resolution":{"observed_at":"2026-08-16T00:10:59.897955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-16T00:10:59.902057Z","title":"arXiv preprint arXiv:2501.12948 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.902057Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:15589ee46ada452171a84e195b7d0ac690ce706086d3ea28cf4bda7ce0a2dc11","observation_id":"7fd0ef6d-ea4a-416c-905f-21d18773a25a","resolution":{"observed_at":"2026-08-16T00:10:59.902057Z","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-16T00:10:59.906147Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.906147Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:5c7eab50090b305bdd17a48d40848682dd45010db0c545fcb2210accec6398f0","observation_id":"480c1a1d-e094-42ce-91c8-1a5c7ccc18a7","resolution":{"observed_at":"2026-08-16T00:10:59.906147Z","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-16T00:11:00.588226Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"4af58034-4022-44c4-ad1d-6de734128aa4","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.910358Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:e925250a17dcc1721cc0c98c6df74b6e47ee8003b8a41cb90a449aae270b6c7d","observation_id":"3ac2e0b0-93e9-44f8-96f7-2625218af846","resolution":{"observed_at":"2026-08-16T00:11:00.593651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-16T00:10:59.914435Z","title":"arXiv preprint arXiv:2408.03314 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.914435Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:9cdcbec04dca8e0efa93f860f971feca888396153953b93cf419cad75a40abbd","observation_id":"74877b15-8436-403b-bf59-03e3266a6155","resolution":{"observed_at":"2026-08-16T00:10:59.914435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-08-16T18:00:58.008096Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-16T00:10:59.919822Z","title":"arXiv preprint arXiv:1503.02531 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.919822Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:1d91d09667a2b041c55980889733eb872a704a09ffa96a763fea69edb21f5ea6","observation_id":"9a071589-53a8-454d-bd7f-f4b409ad7221","resolution":{"observed_at":"2026-08-16T00:10:59.919822Z","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-16T00:10:59.924910Z","title":"Journal of the Royal Statistical Society Series C: Applied Statistics , volume=","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.924910Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:f8acd967ce57b5bd9549de4eae8d8b8c6f866b83d5da8bf20f7693e3e9feaa81","observation_id":"1e52b9bc-0f0b-475a-934b-961aec425de2","resolution":{"observed_at":"2026-08-16T00:10:59.924910Z","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-16T00:10:59.928965Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.928965Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:4aed1a62fcec3cf1c7d95c68aa08b444d4b14ba044aafb8bd5abc649593c1acb","observation_id":"e2d72730-5196-4870-9cec-8e2b3e65fec1","resolution":{"observed_at":"2026-08-16T00:10:59.928965Z","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-16T00:10:59.933123Z","title":"Proceedings of the 24th international conference on Machine learning , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.933123Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:af4aef04195644a62eccf1c9284cb5d0db58e2f7a64830c25c701a160e5e32e3","observation_id":"f1322203-cd78-4182-b6c3-b4d30b861e56","resolution":{"observed_at":"2026-08-16T00:10:59.933123Z","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-16T00:10:59.937575Z","title":"Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.937575Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:14920f2269de9c134a6793d4cb195b705d4de003e9e842689a88e160ade77b2a","observation_id":"67f81af3-8766-447e-9b92-dc33ba9997d4","resolution":{"observed_at":"2026-08-16T00:10:59.937575Z","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-16T00:11:00.534749Z","title":"NeurIPS 2023 Foundation Models for Decision Making Workshop , year=","venue":null,"work_id":"f202084d-f4cb-412c-b53d-9ee1acb8d399","year":2023},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.941599Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:71a153e692b7e8a97df29f807aa3db589675ead2f98e8db14e79437a65e9d819","observation_id":"60c23a1e-d3f9-4627-bddb-d51208d6f076","resolution":{"observed_at":"2026-08-16T00:11:00.539388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:11:00.520026Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"2e80f34e-edb2-46c7-8887-55818a584f7c","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.945872Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:6da85805548a1b4023fb21ec904fb9214ab2a1f5f9f8386c88245d797dd5c204","observation_id":"78013691-bc6b-469a-9d2e-3bd91ce5470a","resolution":{"observed_at":"2026-08-16T00:11:00.524467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:11:00.503425Z","title":"2004 , publisher=","venue":null,"work_id":"9fe10cb5-26a3-40c2-801b-97ec36d5a73b","year":2004},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.950376Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:636217a4edb81f36d913d4baa6f3062a7cc606ce181a326f685c8f9c929b32d9","observation_id":"caae6d2b-81d8-4ec2-9b60-fd55ae3c03e5","resolution":{"observed_at":"2026-08-16T00:11:00.510115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:10:59.955527Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.955527Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:f208c49a0017c20145c77d025c6db5c46b6c68299df5db91c7b8853bac3a078b","observation_id":"8f79e998-03d6-41d0-84e5-7fd168bb050a","resolution":{"observed_at":"2026-08-16T00:10:59.955527Z","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-16T00:11:00.477086Z","title":"Proceedings of the 2017 conference on empirical methods in natural language processing , pages=","venue":null,"work_id":"d704590a-8f95-425e-8c55-4a5a8652701b","year":2017},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.960853Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:95248d7706aefab8f9e5f161d005d653d5d3f2c987d6f25feeaada1063f81923","observation_id":"1e6e1921-780f-4afe-8748-8a40710a0b58","resolution":{"observed_at":"2026-08-16T00:11:00.482152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07830","last_updated":"2018-03-02T16:02:24Z","snapshot_observed_at":"2026-08-14T20:59:02.159535Z","submitted_at":"2017-05-22T16:19:21Z","title":"Ask the Right Questions: Active Question Reformulation with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07830","snapshot_observed_at":"2026-08-16T00:10:59.966000Z","title":"arXiv preprint arXiv:1705.07830 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.966000Z"},"links":{"cited_paper":"/paper/1705.07830","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:7cbcdef81f6a01ed368d4121f9054ddb31426c9ba3dc97e74c5e7f3dc82a516f","observation_id":"ff474d86-406d-4892-8faf-fd6175ba6d7a","resolution":{"observed_at":"2026-08-16T00:10:59.966000Z","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-16T00:11:00.461194Z","title":"Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining , pages=","venue":null,"work_id":"df1e3fc4-5c13-40f5-a017-ed1aacdc297c","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.970540Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:9ca7350368ca535de7efe8148ca8bb48f69f5b2e063bba433ff5b25b6a43b2a5","observation_id":"3136c5ff-c0a1-419c-ba09-f51cdb865d70","resolution":{"observed_at":"2026-08-16T00:11:00.466007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:10:59.974552Z","title":"SIAM review , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.974552Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:33abf0bb9dac8e24da15070d310a42dcd9703bc066547e7ce66cf65fc386e2e0","observation_id":"99b1ff93-5215-4751-8970-542bdea69f52","resolution":{"observed_at":"2026-08-16T00:10:59.974552Z","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-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-16T00:10:59.978849Z","title":"arXiv preprint arXiv:1412.6980 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.978849Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:a2715aeca89bf96b311feed76925d22d56b8c25e2b1d5090ffe4f18b4c216498","observation_id":"d1c38763-cd90-4679-9a45-1967efb7f2f9","resolution":{"observed_at":"2026-08-16T00:10:59.978849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.08877","last_updated":"2021-12-14T06:19:33Z","snapshot_observed_at":"2026-08-16T18:02:11.360736Z","submitted_at":"2021-08-19T18:58:02Z","title":"Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.08877","snapshot_observed_at":"2026-08-16T00:10:59.983824Z","title":"arXiv preprint arXiv:2108.08877 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.983824Z"},"links":{"cited_paper":"/paper/2108.08877","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:cd3fa31e90ebaf3c58afa3a2a6da4bc3305e1466779a6524e58bd5d6cca4f395","observation_id":"79d4293e-b5e2-4960-82f6-432041fdbefa","resolution":{"observed_at":"2026-08-16T00:10:59.983824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07316","last_updated":"2023-03-19T13:37:01Z","snapshot_observed_at":"2026-08-17T06:54:11.300249Z","submitted_at":"2022-10-13T19:42:08Z","title":"MTEB: Massive Text Embedding Benchmark","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07316","snapshot_observed_at":"2026-08-16T00:10:59.988164Z","title":"arXiv preprint arXiv:2210.07316 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.988164Z"},"links":{"cited_paper":"/paper/2210.07316","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:163a4daa599651fd5d2f92feaedac41905d595a8f6aaedc7e1e655846cdcdd6b","observation_id":"56b0b6c4-2179-448a-9fab-651f91948537","resolution":{"observed_at":"2026-08-16T00:10:59.988164Z","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-16T00:11:00.432998Z","title":"Forty-third International Conference on Machine Learning , year=","venue":null,"work_id":"4711b2b2-b3ab-4949-9422-131ebefea39c","year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.992426Z"},"links":{"citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:6dd112486ddcda91c58d264bf50e95631fc4711c5ba6f7df31e40150cfc1288f","observation_id":"0833a5b0-da25-47e4-bca7-3cd9bdbd26cd","resolution":{"observed_at":"2026-08-16T00:11:00.439785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.05726","last_updated":"2026-05-07T06:18:11Z","snapshot_observed_at":"2026-08-17T17:18:46.255790Z","submitted_at":"2026-05-07T06:18:11Z","title":"SkillRet: A Large-Scale Benchmark for Skill Retrieval in LLM Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.05726","snapshot_observed_at":"2026-08-16T00:10:59.996360Z","title":"arXiv preprint arXiv:2605.05726 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:59.996360Z"},"links":{"cited_paper":"/paper/2605.05726","citing_paper":"/paper/2608.12569"},"observation_digest":"sha256:c82ff0bfe528db94de6a35f9759752faf8b87f7df566f9546182ecd9acce8489","observation_id":"467693a7-c02d-44ae-90ef-0495177027b1","resolution":{"observed_at":"2026-08-16T00:10:59.996360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12569","last_updated":"2026-08-12T20:24:57Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T23:10:35.682488Z","submitted_at":"2026-08-12T20:24:57Z","title":"Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":50},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2608.12569."}