{"as_of":"2026-08-19T16:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8ace1fef05dac24b1db58f6ed317253d579883cf75b3e303711de6e31454bbb","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:02:28.684763Z","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-22T19:35:03.934920Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.10613","last_updated":"2025-05-13T05:08:02Z","snapshot_observed_at":"2026-08-16T13:25:18.563752Z","submitted_at":"2024-08-20T07:48:19Z","title":"Task-level Distributionally Robust Optimization for Large Language Model-based Dense Retrieval","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10613","snapshot_observed_at":"2026-08-12T14:02:28.684763Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15766","last_updated":"2024-11-24T09:27:43Z","snapshot_observed_at":"2026-08-19T11:16:01.703291Z","submitted_at":"2024-11-24T09:27:43Z","title":"ScalingNote: Scaling up Retrievers with Large Language Models for Real-World Dense Retrieval","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:02:28.684763Z"},"links":{"cited_paper":"/paper/2408.10613","citing_paper":"/paper/2411.15766"},"observation_digest":"sha256:c11a98a55dd58cedcaec239783ffbd0485fef1b0ca90f2b3d4e215bc47fbf71a","observation_id":"435682e5-2e2c-459c-92ff-def60a5abcd3","resolution":{"observed_at":"2026-08-12T14:02:28.684763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10613","last_updated":"2025-05-13T05:08:02Z","snapshot_observed_at":"2026-08-16T13:25:18.563752Z","submitted_at":"2024-08-20T07:48:19Z","title":"Task-level Distributionally Robust Optimization for Large Language Model-based Dense Retrieval","version":3},"cited_work":{"arxiv_id":"2408.10613","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.10613","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Xueguang Ma, Xinyu Zhang, Ronak Pradeep, and Jimmy Lin","venue":null,"work_id":"4711c6f9-87f3-4e9f-9163-592f02d56593","year":null},"citing_paper":{"arxiv_id":"2504.21015","last_updated":"2026-05-10T18:30:41Z","snapshot_observed_at":"2026-07-30T05:05:56.009708Z","submitted_at":"2025-04-20T08:34:10Z","title":"Don't Retrieve, Generate: Prompting LLMs for Synthetic Training Data in Dense Retrieval","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T19:35:02.029358Z"},"links":{"cited_paper":"/paper/2408.10613","citing_paper":"/paper/2504.21015"},"observation_digest":"sha256:2e16d9603e284ddbb986f898fd3aa12dc4b86bab578b1b01372a6f37d1e15ad6","observation_id":"350c7de1-abda-48ed-8fd2-4ef6f4a7c7e5","resolution":{"observed_at":"2026-05-22T19:35:03.936693Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10613","last_updated":"2025-05-13T05:08:02Z","snapshot_observed_at":"2026-08-16T13:25:18.563752Z","submitted_at":"2024-08-20T07:48:19Z","title":"Task-level Distributionally Robust Optimization for Large Language Model-based Dense Retrieval","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10613","snapshot_observed_at":"2026-08-07T14:33:13.481979Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18458","last_updated":"2025-06-01T16:00:34Z","snapshot_observed_at":"2026-08-16T16:04:23.826018Z","submitted_at":"2025-05-24T01:57:12Z","title":"A Survey of LLM $\\times$ DATA","version":3},"reference_index":278,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:13.481979Z"},"links":{"cited_paper":"/paper/2408.10613","citing_paper":"/paper/2505.18458"},"observation_digest":"sha256:9711a99410d15e0b0e258fd719aaf8dd376fe5eba2ab886ff514f83430a33e9a","observation_id":"c813735f-13dc-416a-9c07-572026f8a7b6","resolution":{"observed_at":"2026-08-07T14:33:13.481979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.10613/citation-record","integrity":"/paper/2408.10613/integrity","json":"/paper/2408.10613/citation-record.json","paper":"/paper/2408.10613"},"outbound":[],"paper":{"arxiv_id":"2408.10613","last_updated":"2025-05-13T05:08:02Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T13:25:18.563752Z","submitted_at":"2024-08-20T07:48:19Z","title":"Task-level Distributionally Robust Optimization for Large Language Model-based Dense Retrieval"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.10613."}