{"as_of":"2026-08-08T19:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8802086b704f92cded866861ebac0cbe70967080726aae717572d2c16c3f7c93","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:37:00.047687Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T06:59:48.014736Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T07:00:10.326450Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"cited_work":{"arxiv_id":"2508.06781","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.06781","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"BiXSE: Improving dense retrieval via probabilistic graded relevance distillation","venue":null,"work_id":"ed3874d7-755c-45b6-94dd-aef94e02d0b4","year":2025},"citing_paper":{"arxiv_id":"2605.06132","last_updated":"2026-05-14T06:42:45Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:33:57Z","title":"MemReranker: Reasoning-Aware Reranking for Agent Memory Retrieval","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T10:38:09.650561Z"},"links":{"cited_paper":"/paper/2508.06781","citing_paper":"/paper/2605.06132"},"observation_digest":"sha256:0893019f928dfdd35ff16ab4689c048aa754316dc23eab4cbc3e4ddbe25b00a8","observation_id":"d536d0bf-e225-430e-8bfd-7b8c8c960e8a","resolution":{"observed_at":"2026-05-11T19:56:09.521192Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"cited_work":{"arxiv_id":"2508.06781","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.06781","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"BiXSE: Improving dense retrieval via probabilistic graded relevance distillation","venue":null,"work_id":"ed3874d7-755c-45b6-94dd-aef94e02d0b4","year":2025},"citing_paper":{"arxiv_id":"2605.06132","last_updated":"2026-05-14T06:42:45Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:33:57Z","title":"MemReranker: Reasoning-Aware Reranking for Agent Memory Retrieval","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T06:59:48.014736Z"},"links":{"cited_paper":"/paper/2508.06781","citing_paper":"/paper/2605.06132"},"observation_digest":"sha256:5ad74c2b98c2bffd89d61a363cb781d0877f80bac28d19bc9f46cb78c9bab35d","observation_id":"ffb9e471-ac35-4f0c-8eca-2747c0a4dec8","resolution":{"observed_at":"2026-05-15T07:00:10.330136Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06781/citation-record","integrity":"/paper/2508.06781/integrity","json":"/paper/2508.06781/citation-record.json","paper":"/paper/2508.06781"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.09268","last_updated":"2018-10-31T14:46:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-11-28T18:14:11Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09268","snapshot_observed_at":"2026-08-05T22:36:59.828802Z","title":"Ms marco: A human generated machine reading comprehension dataset","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.828802Z"},"links":{"cited_paper":"/paper/1611.09268","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:231fe18f8fe9a8d819e3568245eff73571c9c4c7fd37dae5727f8b2d8a9aeef5","observation_id":"0b04d550-0d09-4304-a50b-bc32f0eaf02e","resolution":{"observed_at":"2026-08-05T22:36:59.828802Z","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-05T22:37:00.398851Z","title":"Results shown for the best-performing configuration per loss type among BGE-trained models","venue":null,"work_id":"5715bd92-7277-4ce1-aca6-e04f873dc6ba","year":2018},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:37:00.047687Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:167f4b2316be1bca0a4d06d5b2f9eb1503e194b86dacfd7b3226cc367721cef7","observation_id":"b360b076-37b9-427d-bb23-60b463fc6e18","resolution":{"observed_at":"2026-08-05T22:37:00.403639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0010.00050","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:37:00.220981Z","title":"Your task is to judge how well the passage answers the query. 0 - Irrelevant, 1 - Perfectly relevant, exact answer. Answer with 0, or 1","venue":null,"work_id":"e44ff47d-b3c2-4176-abe5-0f17b6190b20","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.996684Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:ae264a4caa1f656e315186fbf17b3b1fe0a089c598bf5579eeb891ecb4fd9dfb","observation_id":"eef61a84-e2e0-47db-90a0-7cd2ba1892d1","resolution":{"observed_at":"2026-08-05T22:37:00.229375Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.846148Z","title":"Zhuyun Dai, Vincent Y Zhao, Ji Ma, Yi Luan, Jianmo Ni, Jing Lu, Anton Bakalov, Kelvin Guu, Keith Hall, and Ming-Wei Chang","venue":null,"work_id":"c7842508-d0fd-413f-bb5f-6669f362e783","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.847920Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:7b2866c45fa0fa85996165bd59b0f194b4ae8418ce7e5834a8eacbb702810685","observation_id":"24a426c8-8751-4ad1-bcab-e1a17215aa88","resolution":{"observed_at":"2026-08-05T22:37:00.850520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.488497Z","title":"Retrieve the most relevant passages to the given query","venue":null,"work_id":"03203435-9935-41b1-97ca-3922a5b4683c","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.992432Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:f07461731475d834c11008e2502c79f8d216bf377f731e9d9481042feae00ed3","observation_id":"e79fe366-5c5c-4b18-86ee-48dc1d66999a","resolution":{"observed_at":"2026-08-05T22:37:00.493021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.819038Z","title":"Learning deep representations by mutual information estimation and maximization","venue":null,"work_id":"20a2c7e5-995e-4b87-9f06-6c4c5edb8ec8","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.861290Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:99b2d87845ac65cd52b83ea6367b60db7989571d41afdc6a32607fdf15147b88","observation_id":"833b58ec-fec0-4921-b300-2179274fd34f","resolution":{"observed_at":"2026-08-05T22:37:00.823409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.790371Z","title":"Dense passage retrieval for open-domain question an- swering","venue":null,"work_id":"92399467-c5d1-430a-bab1-1b2804a1656b","year":2020},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.869824Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:e01dd91c12eeab0409075bbc6f6261fbce7c796d60016c05cdb00f7d4f00cb74","observation_id":"c691d895-1633-4b32-b330-4cc426c2bbc9","resolution":{"observed_at":"2026-08-05T22:37:00.794721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17428","last_updated":"2025-02-25T00:35:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-27T17:59:45Z","title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17428","snapshot_observed_at":"2026-08-05T22:36:59.873885Z","title":"Nv-embed: Improved techniques for training llms as generalist embedding models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.873885Z"},"links":{"cited_paper":"/paper/2405.17428","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:7c772a896f186ec1e1f101f57a0016d1f89a1ddb9be49736f06700cc5253e44b","observation_id":"a0638d20-9f68-4e7a-8be9-48cb0444e5a7","resolution":{"observed_at":"2026-08-05T22:36:59.873885Z","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-05T22:37:00.777294Z","title":"Lightblue reranker distillation dataset","venue":null,"work_id":"46f2805a-a9b1-43d8-9696-80752507de3c","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.882939Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:52edf425ca295d62040d11062d4a1a59beb11394db4cf9838040831fbb01ec68","observation_id":"b67f62d4-1db6-49d4-b8af-0c29a7916b5c","resolution":{"observed_at":"2026-08-05T22:37:00.781176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.763574Z","title":"Sadhika Malladi, Kaifeng Lyu, Abhishek Panigrahi, and Sanjeev Arora","venue":null,"work_id":"1a4545f0-7882-463c-a0f6-fec830329e8c","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.886826Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:1b3099d05adc4292f97061430326f21ff9e85c53c739a8160fe0e6e6d152d2d3","observation_id":"cc69a113-e9a4-4c13-aa79-47b676c77eac","resolution":{"observed_at":"2026-08-05T22:37:00.767841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09906","last_updated":"2025-03-03T04:28:49Z","snapshot_observed_at":"2026-07-06T17:30:34.153488Z","submitted_at":"2024-02-15T12:12:19Z","title":"Generative Representational Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09906","snapshot_observed_at":"2026-08-05T22:36:59.890950Z","title":"Generative representational instruction tuning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.890950Z"},"links":{"cited_paper":"/paper/2402.09906","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:2625f59406a237f5df57db2c1ce0f0eaf29519e99df34a6d7072ed7837a0c94f","observation_id":"a31ca482-1692-408a-b221-32dd7f10da5c","resolution":{"observed_at":"2026-08-05T22:36:59.890950Z","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-05T22:37:00.749955Z","title":"Mitigating false-negative contexts in multi- document question answering with retrieval marginalization","venue":null,"work_id":"dd353a64-f0ea-438f-9601-03164ce67e37","year":2021},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.895515Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:b1278b1dcc38d17e35a679906aa0b58cce6dbec59293103b0ab36b603957f86d","observation_id":"36bfb7f9-ed42-4a04-9a5e-9ea896a1ff38","resolution":{"observed_at":"2026-08-05T22:37:00.754249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.735434Z","title":"Large dual encoders are generalizable retrievers","venue":null,"work_id":"0e726484-9d65-4b08-a9f2-a1902c9c1f2a","year":2022},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.899210Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:ea5a2c59f5f4f6bb6e9611f59a5e33abbcc318624ef9494d9baf16217a79f9fa","observation_id":"a8c7de54-cc23-4537-93d0-78fa1ced5144","resolution":{"observed_at":"2026-08-05T22:37:00.739730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.721697Z","title":"RocketQA: An optimized training approach to dense passage retrieval for open-domain question answering","venue":null,"work_id":"885ff06f-6c72-4d9f-a2c5-1192fe533235","year":2021},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.908014Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:038c85e74c0dae8509451b268b51c0b3ba790051268d90ad0869a771effa4c3e","observation_id":"b83e775d-dbee-4ce3-9520-377191cb6732","resolution":{"observed_at":"2026-08-05T22:37:00.725987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.708223Z","title":"SQuAD: 100,000+ questions for machine comprehension of text","venue":null,"work_id":"458940d7-cfd7-47bc-92f3-e42fb741b4d7","year":2016},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.911759Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:d72a5df198a9db4567c4596fdb63b6d7007337cdb0d87d19ad68fccddf20df92","observation_id":"d88e6bc3-44d5-45f3-a7a0-e41444070a7c","resolution":{"observed_at":"2026-08-05T22:37:00.712544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.694930Z","title":"Sentence-BERT: Sentence embeddings using Siamese BERT-networks","venue":null,"work_id":"1e6a1b3b-73e1-4b5e-9413-9c98daa2e8af","year":2019},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.916072Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:5ca77cecadecfe4e05379c335f0f01084a70d829095a04f1aed562c64d7d8cd3","observation_id":"3bee9089-e839-4fe3-a589-17fe0d94e969","resolution":{"observed_at":"2026-08-05T22:37:00.699071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.680773Z","title":"RocketQAv2: A joint training method for dense passage retrieval and passage re-ranking","venue":null,"work_id":"00319a1f-0003-4b7a-8ff0-334418184ac9","year":2021},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.920206Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:8c03aa9fc04cf346c23c8c67cbbbc14539294f8575815029f3eb37020257aa03","observation_id":"90a3ffb5-3ef5-4966-896a-0df54de06265","resolution":{"observed_at":"2026-08-05T22:37:00.685210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.667422Z","title":"The probabilistic relevance framework: Bm25 and beyond","venue":null,"work_id":"236d6a76-dbe6-44c5-a12c-13f5c45636ca","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.923939Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:d10287fe3731ee7de10ab00418f9935f43e104d12b32963853cb38ec02fe5d8b","observation_id":"94862c12-02a0-4871-be1a-65a978100191","resolution":{"observed_at":"2026-08-05T22:37:00.671480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-981-15-5554-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:37:00.108684Z","title":"doi: 10.1007/978-981-15-5554-1","venue":null,"work_id":"523322e9-1e7e-4e1d-8a25-f548e5ff22d5","year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.927912Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:ccaab4ddce8216cddef0a5667ebfd35e45143306361efc889218fad745cc6fdf","observation_id":"5f85ecb9-216f-47b1-b2d1-ad2463eb894a","resolution":{"observed_at":"2026-08-05T22:37:00.115902Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.653166Z","title":"ColBERTv2: Effective and efficient retrieval via lightweight late interaction","venue":null,"work_id":"b6cfc79c-09e9-48dd-9d3d-ed5ad8eb6238","year":2022},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.931774Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:7647df690269b0d388079fbb64046cdc316a9ab905c03aee29172f94b106190a","observation_id":"db2b4b02-d941-4c45-a140-b37af8ef5e53","resolution":{"observed_at":"2026-08-05T22:37:00.657608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15449","last_updated":"2025-09-07T18:50:16Z","snapshot_observed_at":"2026-08-08T06:06:41.534202Z","submitted_at":"2024-02-23T17:25:10Z","title":"Repetition Improves Language Model Embeddings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15449","snapshot_observed_at":"2026-08-05T22:36:59.935632Z","title":"Repetition improves language model embeddings","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.935632Z"},"links":{"cited_paper":"/paper/2402.15449","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:9232b19db3cbf6b1bc06a9d4db3a2d3f9349ccc86659ce0152f28bce8ec401c3","observation_id":"dcbcbedd-2591-45cb-9cc1-22ced9d2bdc5","resolution":{"observed_at":"2026-08-05T22:36:59.935632Z","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-05T22:37:00.640222Z","title":"Smith, Luke Zettlemoyer, and Tao Yu","venue":null,"work_id":"b0dc9a15-0f88-4fa0-aad0-5bc49f6ae263","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.940318Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:cc100f1820fdabcddd61662dbae3053d26b0df96fb3c6662df156fa48f054e85","observation_id":"76f73f82-8458-4db0-9264-1237de72191b","resolution":{"observed_at":"2026-08-05T22:37:00.644353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.626751Z","title":"Is ChatGPT good at search? investigating large language models as re-ranking agents","venue":null,"work_id":"2c116621-13cd-41aa-abd1-38a5c90ad077","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.944197Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:1ce6dee412274c26a50612454639c6bb1ac153767244cfee8c304e88d476e502","observation_id":"f402b592-5f67-44fe-bf4f-a8782c0a7d84","resolution":{"observed_at":"2026-08-05T22:37:00.631366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.612507Z","title":"FEVER: a large-scale dataset for fact extraction and VERification","venue":null,"work_id":"f3b15505-85f1-4a03-94e6-ab02510110e8","year":2018},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.948420Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:e0e21abf85fd729e243f44be58139a5974fd59944193204f9f3f2242cb3c64a3","observation_id":"beaead08-da13-4a72-a356-6a7b1452f399","resolution":{"observed_at":"2026-08-05T22:37:00.617211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-05T22:36:59.952307Z","title":"Text embeddings by weakly-supervised contrastive pre-training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.952307Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:e90547966831ccf2798d1c136c574ce2bd4a18a6dd0f9ef973d5e8ca54b19507","observation_id":"01c46671-498b-4a9e-a658-b34933d2c04b","resolution":{"observed_at":"2026-08-05T22:36:59.952307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00368","last_updated":"2024-05-31T07:22:01Z","snapshot_observed_at":"2026-08-06T17:51:59.068535Z","submitted_at":"2023-12-31T02:13:18Z","title":"Improving Text Embeddings with Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.00368","snapshot_observed_at":"2026-08-05T22:36:59.956512Z","title":"Improving text embeddings with large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.956512Z"},"links":{"cited_paper":"/paper/2401.00368","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:8c386d84a1845ab5c951864f34507f15605538eb107330fa991ad5609ad8c353","observation_id":"4421920f-5bb6-4003-b3f8-d42696ee7531","resolution":{"observed_at":"2026-08-05T22:36:59.956512Z","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-05T22:37:00.599528Z","title":null,"venue":null,"work_id":"9fbe4c9d-871d-4a27-9089-cd7b20db7120","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.960704Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:2349f1d40db83dc8e5436c55f44e7e6c3a7270cc6586def8b8be3c45d55f9296","observation_id":"6433970a-7b68-4600-8fc8-1abde9c04e48","resolution":{"observed_at":"2026-08-05T22:37:00.603711Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.586348Z","title":"Contrastive learning of sentence embeddings from scratch","venue":null,"work_id":"77d0d2c2-49bb-4d9a-b3e7-4049c1d17b3d","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.964621Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:3be0bdd0618f2222760f99b53a25538158d4ee61787dcd650e49a120864614aa","observation_id":"8abbbe1b-d919-4866-9382-b583cc083167","resolution":{"observed_at":"2026-08-05T22:37:00.590509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.572628Z","title":"MIRACL: A Multilingual Retrieval Dataset Covering 18 Diverse Languages","venue":null,"work_id":"489258d1-f1c3-4e5d-9020-04d01f0afb4c","year":2024},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.968418Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:0e578f69d2426e2842727fdd59e12490ffdee88e0cbeac2e1c1b7cff275b35f0","observation_id":"deba85a8-b4d8-4439-8bed-2fb2dde3dea7","resolution":{"observed_at":"2026-08-05T22:37:00.576872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.559231Z","title":"Classical retrieval methods like TF-IDF and BM25 (Robertson & Zaragoza,","venue":null,"work_id":"3f29e1cc-73ef-492e-9616-d2fc3b40c51c","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.972438Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:932d6a3281d64e17554e90018458a8d365062ff3f1260e6fb7057ff0ebbda639","observation_id":"8684a056-a74f-412d-89d5-6b1fe01ccf98","resolution":{"observed_at":"2026-08-05T22:37:00.563430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.531075Z","title":null,"venue":null,"work_id":"49b2fc75-fcd0-470d-91b0-5564c49f7644","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.980370Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:06b5fe57be4e85c16122a06bee6014c0e407c43882555b6594e27ec73aad7bef","observation_id":"1f5417aa-64a3-4e71-8abc-b6758fa131a0","resolution":{"observed_at":"2026-08-05T22:37:00.534992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.517145Z","title":"1” through “5","venue":null,"work_id":"00120563-d28c-45ff-b626-20251ce7030c","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.984208Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:c06b3d925f65a8570d8c4ad20616a3fd4f4bfe28b7bb5b6e03695892137369ca","observation_id":"8386efb4-f5e8-4d26-ba06-651c940c8fd8","resolution":{"observed_at":"2026-08-05T22:37:00.521451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.442747Z","title":"These experiments were carried out on two diverse datasets, LightBlue (multilingual, in- batch only) and BGE-M3 (Chen et al.,","venue":null,"work_id":"ac8eabba-288a-4bfb-8a0a-6f69a7343226","year":2021},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T22:37:00.014151Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:5c0c0a1e4cc5b1a62543dc5d30bbf783dbc381f2fe871c9128e9fa845e4b6620","observation_id":"bc30ac33-5aa4-4439-a097-ff837dbc4064","resolution":{"observed_at":"2026-08-05T22:37:00.447560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.427906Z","title":"For fair comparison, we run hyperparameter search for all methods to tune for learning rates and logit scales, as well as hyperparameters specific to each training loss","venue":null,"work_id":"1a92eeca-4027-419f-8d20-06876b18c545","year":2021},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T22:37:00.024955Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:1fc638902a20571484774651a7df33b87aace80ffdcdaaf052ab0fbd45409e8a","observation_id":"d20feb5c-6ff3-42a6-b8eb-fcf8655d1fa1","resolution":{"observed_at":"2026-08-05T22:37:00.432754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.473461Z","title":null,"venue":null,"work_id":"a59e2d06-624d-4df7-b8e6-3bbbdfa384a3","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-05T22:37:00.001878Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:0e031c0a2bdc9c99cbd34a002e2d730c678d0100be84197aa929082cae181861","observation_id":"a43bde40-d3ae-4475-88e6-a41081dd560e","resolution":{"observed_at":"2026-08-05T22:37:00.478061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.414051Z","title":null,"venue":null,"work_id":"ae549c22-7d35-43cd-b5a9-c2b5254d1b08","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":256,"source":"pdf_text","source_observed_at":"2026-08-05T22:37:00.031556Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:1e2335ed00becf45fcb9c05d331f5c523b1f934806e68eb6314929c330505e44","observation_id":"439f52fd-60ab-4763-93fe-5b6c11ef41f3","resolution":{"observed_at":"2026-08-05T22:37:00.418346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.458158Z","title":null,"venue":null,"work_id":"c4e84eba-1d63-42c4-8806-076e12e09e46","year":2024},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-05T22:37:00.007369Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:d38f1e67869a25b4f9a5f2f026f18e47049866ec41281ceb48749175397cda8f","observation_id":"6be7d0d4-6688-4841-910e-c899e758d70e","resolution":{"observed_at":"2026-08-05T22:37:00.462510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.545054Z","title":"Neural dense retrieval methods address this by embedding texts into dense semantic vector spaces using pre-trained language models (Karpukhin et al., 2020; Xiong et al., 2021)","venue":null,"work_id":"7304f639-cb49-4019-9645-f4d6327e52e3","year":2020},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.976208Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:317a16d2a152be6402f15903ee0bd108a4f649f4241cd3409c488549f21bd3fe","observation_id":"1bf855ea-1c48-4349-83db-b54676ff31d0","resolution":{"observed_at":"2026-08-05T22:37:00.549874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.502483Z","title":"We apply no weight decay","venue":null,"work_id":"c45c2f56-64fe-4200-98f9-f195be07d2cf","year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.988095Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:5ee1aa2d094d95841c081a7e522d956d28b191ba921c50f682ffd5adf90d265a","observation_id":"1bf97bd4-159a-48db-a55a-ebaa22922d84","resolution":{"observed_at":"2026-08-05T22:37:00.506668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15831","last_updated":"2025-02-07T15:17:18Z","snapshot_observed_at":"2026-08-06T10:11:12.752175Z","submitted_at":"2024-07-22T17:50:31Z","title":"NV-Retriever: Improving text embedding models with effective hard-negative mining","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15831","snapshot_observed_at":"2026-08-05T22:36:59.852304Z","title":"Gabriel de Souza P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.852304Z"},"links":{"cited_paper":"/paper/2407.15831","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:f7f7cf1d4cbd3782a80f6c7808f0dff89ac94d457cad5bb2c6179712757ebab4","observation_id":"981f691a-cd2b-4384-99b3-32be92be1f31","resolution":{"observed_at":"2026-08-05T22:36:59.852304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05961","last_updated":"2024-08-21T22:46:05Z","snapshot_observed_at":"2026-08-08T03:53:14.177644Z","submitted_at":"2024-04-09T02:51:05Z","title":"LLM2Vec: Large Language Models Are Secretly Powerful Text Encoders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05961","snapshot_observed_at":"2026-08-05T22:36:59.833869Z","title":"Llm2vec: Large language models are secretly powerful text encoders","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.833869Z"},"links":{"cited_paper":"/paper/2404.05961","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:f6bf3933b0696b173e623db2caf0e9699a9741767b47069f40153ca3e89f8e26","observation_id":"d5b2bb0b-a9d4-493f-965c-4defdf5ed287","resolution":{"observed_at":"2026-08-05T22:36:59.833869Z","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-05T22:37:00.832737Z","title":"SimCSE: Simple contrastive learning of sentence embeddings","venue":null,"work_id":"d6b2f3ed-436d-4b85-87e7-f5932da5ef4b","year":2021},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.856822Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:c9534e06cd9f57d98d558e0f877298985b460d3718cec82d13fa72327421d05c","observation_id":"2e77627b-4235-4c5b-a8f9-812b083b2c10","resolution":{"observed_at":"2026-08-05T22:37:00.836993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.805605Z","title":"PairDistill: Pairwise relevance distillation for dense retrieval","venue":null,"work_id":"3c85d43d-04d3-4a2d-90c8-8fe5b3c6e521","year":2024},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.865819Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:4e1cabac13e28196400298a7d5b3703f5b1b1a0c234a88a47152c96590989cba","observation_id":"61adbe76-3621-4c4a-ad29-9e8f1d7c3be7","resolution":{"observed_at":"2026-08-05T22:37:00.809835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-05T22:36:59.903117Z","title":"Representation learning with contrastive predictive coding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.903117Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:35306a7a7cbc73d41d146609e53c2ff84d2f86f00d9fe7563730d7bbd2d97ae1","observation_id":"106eccc2-1e4d-4b27-93c4-57d9e6da6713","resolution":{"observed_at":"2026-08-05T22:36:59.903117Z","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-05T22:37:00.860109Z","title":"Rahmani, Daniel Campos, Jimmy Lin, Ellen M","venue":null,"work_id":"95c6b49e-511f-4006-8f44-dcadf5841660","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.843171Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:265bbbbfe28dce3bb4a78d14a89a3c0142f89ad1f16ffe8c16e8019aacc276ac","observation_id":"4f6af325-5e7f-4fa2-ab16-4516f24b759b","resolution":{"observed_at":"2026-08-05T22:37:00.864342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T22:37:00.873635Z","title":"Improving con- trastive learning of sentence embeddings from AI feedback","venue":null,"work_id":"82dfb044-e4e7-450d-b7de-c1f7c1799ee1","year":2023},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.838706Z"},"links":{"citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:aea4e7e8349d8b43f234233ca75c5ba3dd0299f499b6a133b61b16267be1c76b","observation_id":"d504c6d6-fed1-4d00-8de9-a9aaf02d859b","resolution":{"observed_at":"2026-08-05T22:37:00.878270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-04T23:10:23.964516Z","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-05T22:36:59.878230Z","title":"Towards general text embeddings with multi-stage contrastive learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T22:36:59.878230Z"},"links":{"cited_paper":"/paper/2308.03281","citing_paper":"/paper/2508.06781"},"observation_digest":"sha256:7abb921248a9bfb8c00b9db2c3281f991b46d02e09223709ccbe50854442f181","observation_id":"58c5d901-bc32-4696-9cd4-eedd22665f6d","resolution":{"observed_at":"2026-08-05T22:36:59.878230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.06781","last_updated":"2025-08-09T02:15:17Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T10:11:41.231716Z","submitted_at":"2025-08-09T02:15:17Z","title":"BiXSE: Improving Dense Retrieval via Probabilistic Graded Relevance Distillation"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":2,"verified_fuzzy":30},"total_outbound_references":47},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 2 inbound Pith citation observations for arXiv:2508.06781."}