{"as_of":"2026-08-10T23:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d154862d07a0b450306f4a6431c5291f31609abe0cad22ac1b819329655ee8d","coverage":[{"denominator":95,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":95,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T22:37:58.353677Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T03:05:04.196270Z","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-15T03:09:44.133776Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"cited_work":{"arxiv_id":"2509.07253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.07253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Benchmarking information retrieval models on complex retrieval tasks.arXiv preprint arXiv:2509.07253","venue":null,"work_id":"e6cc5116-e8b3-45c3-b7e1-1f9dd5e93fe5","year":2025},"citing_paper":{"arxiv_id":"2604.21096","last_updated":"2026-04-22T21:34:01Z","snapshot_observed_at":"2026-07-06T23:07:47.244208Z","submitted_at":"2026-04-22T21:34:01Z","title":"Multilingual and Domain-Agnostic Tip-of-the-Tongue Query Generation for Simulated Evaluation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-09T22:59:35.651020Z"},"links":{"cited_paper":"/paper/2509.07253","citing_paper":"/paper/2604.21096"},"observation_digest":"sha256:20ffde7222f3c7352a268463eaffe1202e6b720397328722a6d24f1ab169ab54","observation_id":"b069a409-5316-4834-871f-04fec633bd0e","resolution":{"observed_at":"2026-05-09T23:04:18.159738Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"cited_work":{"arxiv_id":"2509.07253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.07253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Benchmarking information retrieval models on complex retrieval tasks.arXiv preprint arXiv:2509.07253","venue":null,"work_id":"e6cc5116-e8b3-45c3-b7e1-1f9dd5e93fe5","year":2025},"citing_paper":{"arxiv_id":"2604.22661","last_updated":"2026-04-24T15:36:40Z","snapshot_observed_at":"2026-08-01T01:04:19.885169Z","submitted_at":"2026-04-24T15:36:40Z","title":"Can QPP Choose the Right Query Variant? Evaluating Query Variant Selection for RAG Pipelines","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-08T10:18:59.759192Z"},"links":{"cited_paper":"/paper/2509.07253","citing_paper":"/paper/2604.22661"},"observation_digest":"sha256:3d2fe4f9cf15292c3927fe70b243a1c4d3c1562b5149eacbcdba822f0494f77c","observation_id":"24b1ba3f-5854-44bf-b998-44ba28049462","resolution":{"observed_at":"2026-05-11T20:06:10.080462Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"cited_work":{"arxiv_id":"2509.07253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.07253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Benchmarking information retrieval models on complex retrieval tasks.arXiv preprint arXiv:2509.07253","venue":null,"work_id":"e6cc5116-e8b3-45c3-b7e1-1f9dd5e93fe5","year":2025},"citing_paper":{"arxiv_id":"2604.27577","last_updated":"2026-04-30T08:30:09Z","snapshot_observed_at":"2026-07-06T23:13:02.921765Z","submitted_at":"2026-04-30T08:30:09Z","title":"Reproducing Adaptive Reranking for Reasoning-Intensive IR","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-07T08:08:06.342207Z"},"links":{"cited_paper":"/paper/2509.07253","citing_paper":"/paper/2604.27577"},"observation_digest":"sha256:a6ca981c2ff4a19b95d4b0bae25184d52427f7e78c529634a472cd1c4e00c103","observation_id":"85e58383-81cb-4303-8ff8-e99e66c9435f","resolution":{"observed_at":"2026-05-12T10:01:29.361580Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"cited_work":{"arxiv_id":"2509.07253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.07253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Benchmarking information retrieval models on complex retrieval tasks.arXiv preprint arXiv:2509.07253","venue":null,"work_id":"e6cc5116-e8b3-45c3-b7e1-1f9dd5e93fe5","year":2025},"citing_paper":{"arxiv_id":"2605.13137","last_updated":"2026-05-14T05:15:13Z","snapshot_observed_at":"2026-07-06T23:24:42.799888Z","submitted_at":"2026-05-13T08:04:57Z","title":"LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Proving","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-14T18:32:24.957899Z"},"links":{"cited_paper":"/paper/2509.07253","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:cc7eb45f8aa5b62178b3cbc67d90fb636bd486c6b6dcb499da0bc31f9317a60c","observation_id":"229d590e-f808-43f2-82b4-840d3eaea75c","resolution":{"observed_at":"2026-05-14T18:32:34.097138Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"cited_work":{"arxiv_id":"2509.07253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.07253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Benchmarking information retrieval models on complex retrieval tasks.arXiv preprint arXiv:2509.07253","venue":null,"work_id":"e6cc5116-e8b3-45c3-b7e1-1f9dd5e93fe5","year":2025},"citing_paper":{"arxiv_id":"2605.13137","last_updated":"2026-05-14T05:15:13Z","snapshot_observed_at":"2026-07-06T23:24:42.799888Z","submitted_at":"2026-05-13T08:04:57Z","title":"LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Proving","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T03:05:04.196270Z"},"links":{"cited_paper":"/paper/2509.07253","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:15248023a34191950cfb5b08c74ce0c180b77805be5e18bbcba596866c304a02","observation_id":"2764bb9e-2a83-472f-8a52-4ca4a1300898","resolution":{"observed_at":"2026-05-15T03:09:44.138324Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.07253/citation-record","integrity":"/paper/2509.07253/integrity","json":"/paper/2509.07253/citation-record.json","paper":"/paper/2509.07253"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T22:37:57.994582Z","title":"https://openai.com/index/introducing-o3-and-o4-mini/","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:57.994582Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:c45a6de69d1e89da6356c45dc1c4090ea8bb3008a0bdc6112775dba254a94220","observation_id":"a6b0a099-544a-4ffa-88d5-71a68df7256f","resolution":{"observed_at":"2026-08-04T22:37:57.994582Z","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-04T22:37:57.999007Z","title":"Saling, Mark Sanderson, Falk Scholer, Damiano Spina, and Ryen W","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:57.999007Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:774a7636189735f00adb5e153e59676642a2d34b909affb7a499d43baa789c3d","observation_id":"c9db6e22-39f5-4834-81a7-0176499a78d2","resolution":{"observed_at":"2026-08-04T22:37:57.999007Z","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-04T22:37:58.003548Z","title":"Voorhees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.003548Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:ed56c40631ba416fb2c4ccbaa52bbecff290cc21e37d223d7f24bb72954720fa","observation_id":"a3388b82-1b94-4036-b8ec-07c3f5771476","resolution":{"observed_at":"2026-08-04T22:37:58.003548Z","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-04T22:37:58.007610Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.007610Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:b557bbbcd62270a6c7e980528e483dfb30028b96f3fa1ed9838db42ba84ecd1a","observation_id":"0c305690-add3-42c7-a11c-fcba777a1afa","resolution":{"observed_at":"2026-08-04T22:37:58.007610Z","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-04T22:37:58.011410Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.011410Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:5b29b688377df88ddaf39eb76087ea2f3025626db2e227c6c8b07027b9c26c7e","observation_id":"e92a3797-9abc-406f-8697-acd87b98d709","resolution":{"observed_at":"2026-08-04T22:37:58.011410Z","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-04T22:37:58.015196Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.015196Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:bee0fd61020b62911c07d186d6fc10a93c9c7b282b8dd286623110e53f79236b","observation_id":"5a9469e7-1255-4c1d-88ae-cf4a248c4abb","resolution":{"observed_at":"2026-08-04T22:37:58.015196Z","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-04T22:37:58.019061Z","title":"The document should be in the style and format mentioned in the first line of the information request","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.019061Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:25fd63f263f0401662533524d46714fb039112fd023affb8f9ae5802dc7e7941","observation_id":"18d7da15-d28c-485d-8dcc-1fbec4ee8696","resolution":{"observed_at":"2026-08-04T22:37:58.019061Z","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-04T22:37:58.022964Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.022964Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:79452a4a32774f31341e7da30e4a630e7bc800598e55ae3109528204fe184adf","observation_id":"3001cd22-ac20-41c9-bc69-540c6af4fa21","resolution":{"observed_at":"2026-08-04T22:37:58.022964Z","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-04T22:37:58.026822Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.026822Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:d17b978ed9cb0fc05f3802c33fc87866791cff9f62581a927f64dd3a03536ddf","observation_id":"7c507365-7a9d-43bc-b23f-bb0148bdad05","resolution":{"observed_at":"2026-08-04T22:37:58.026822Z","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-04T22:37:58.030939Z","title":"Information Request:<instruction> <query> Fig","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.030939Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:2f9095808327752f8531cb29c3ef2ef5548debbb8c41768595683e3590a0485c","observation_id":"7f5bd124-0eef-4428-ab0a-a68ea5121a91","resolution":{"observed_at":"2026-08-04T22:37:58.030939Z","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-04T22:37:58.035076Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.035076Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:32556840961266059d898a1f204382142c0e8a2a2665452991a10004dda6a568","observation_id":"53bccee5-7b61-456b-9996-ff010305dd61","resolution":{"observed_at":"2026-08-04T22:37:58.035076Z","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-04T22:37:58.038777Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.038777Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:6b1761538870974101c571bbdae1c0f38969c26ecc00c9bf21c7a62f0d3b7a4d","observation_id":"a0240bed-35eb-4c06-b0ff-127d9d57305b","resolution":{"observed_at":"2026-08-04T22:37:58.038777Z","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-04T22:37:58.042474Z","title":"Information Request:<instruction> <query> Fig","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.042474Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:f6ebcd54bbd1f9638c7d101cf43252949cd2e7a06e8eb15eab8a3453f5f70c2a","observation_id":"f0cedf1f-2316-43d1-afff-714ee7dfe795","resolution":{"observed_at":"2026-08-04T22:37:58.042474Z","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-04T22:37:58.046021Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.046021Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:84c2530169e47c1a736714a5dcf72bfadf1bc9d64154211d5b546c60123a02ba","observation_id":"f282c2ec-db7e-4e1a-9e2d-49cabc7f2767","resolution":{"observed_at":"2026-08-04T22:37:58.046021Z","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-04T22:37:58.049857Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.049857Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:91ac0ec12f9ffefe11b134f014bd9e7085406224e2346e944141480c4327b155","observation_id":"d8ac2d14-d821-4d78-bc65-701ea838d014","resolution":{"observed_at":"2026-08-04T22:37:58.049857Z","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":"6522.34460","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T22:37:59.133660Z","title":null,"venue":null,"work_id":"62ca3a0d-f2ba-43ec-9c8c-f0ab7a85b0b5","year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.054285Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:524660476233c00fec9632a3ab7a7316a7ceae86104c8d7fecd1cdb9da2ea04a","observation_id":"2798aafb-8bde-47d9-afe0-74ec7fa02d45","resolution":{"observed_at":"2026-08-04T22:37:59.140065Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.057981Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.057981Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:d424d16a148ea7c2936ace6af0b9fd082d11c5a2ec9d5d84611c941fcaaafa2b","observation_id":"cebfd818-c9c1-4740-8b49-5165423decd9","resolution":{"observed_at":"2026-08-04T22:37:58.057981Z","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-04T22:37:58.061832Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.061832Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:e7e04dde1bdca2e382db9e0748213f77871312fe7bcbb5d6413efcfc96f24624","observation_id":"eb1839f4-8968-460c-a898-a81f8b09a4a1","resolution":{"observed_at":"2026-08-04T22:37:58.061832Z","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":"10.1002/asi.21549","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the American Society for Information Science and Technology","work_id":"ec041216-a8da-423f-9fdb-e5e27d18403f","year":2011},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.065530Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:1702c97b9eaf5d06b4eead58f1e48c2b9e10104b06364e5fdc173a1d8172f471","observation_id":"de3ca917-62b4-4b05-9067-907a4eefb110","resolution":{"observed_at":"2026-08-04T22:37:58.855497Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.069227Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.069227Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:f338052c497517836058d63fb2f594598beebcab2d5f60e43e0fa52e6a86dbbc","observation_id":"f029a1ff-2518-45d2-aa12-3950489d3708","resolution":{"observed_at":"2026-08-04T22:37:58.069227Z","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-04T22:37:58.072969Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.072969Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:b30fd868ef2fa382e8fdbfb699abacfa7795ce95726582520590dcce55383133","observation_id":"9350a411-70f2-405e-93f5-3720cfdf9193","resolution":{"observed_at":"2026-08-04T22:37:58.072969Z","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-04T22:37:59.457252Z","title":"Bennett, Fernando Diaz, Charlie Clarke, and Ellen M","venue":null,"work_id":"a71b6499-a216-46fd-b821-7aa39afdaffd","year":2013},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.076670Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:50d8e066cd282381e014f142681a339d320116ceee2370b3eb46565d161da606","observation_id":"1fa9e96c-7ada-46b4-a5a1-89dae2ed8ebd","resolution":{"observed_at":"2026-08-04T22:37:59.461552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.443554Z","title":"Bennett, Fernando Diaz, and Ellen M","venue":null,"work_id":"1e57d705-e76b-4e8c-9534-c30a20b9983d","year":2014},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.080372Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:98149628d45bf8171bd95c788290cdbad40c639c15eaaebaa78002acb9c6bbaf","observation_id":"f104ce4b-2294-4ce7-968a-e4db2ea42741","resolution":{"observed_at":"2026-08-04T22:37:59.447509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.430564Z","title":null,"venue":null,"work_id":"dd17439f-09d0-4457-a096-f15b8635771e","year":2020},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.084113Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:5d1ad1d21b664b4217f0d1f0ebff538fd4b2d7bf2c4b2cab9c80d7af0286d4f1","observation_id":"a56d5098-a325-4e97-a701-58dfd7ead754","resolution":{"observed_at":"2026-08-04T22:37:59.434605Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.07820","last_updated":"2020-03-18T16:56:56Z","snapshot_observed_at":"2026-08-10T13:25:09.780441Z","submitted_at":"2020-03-17T17:12:36Z","title":"Overview of the TREC 2019 deep learning track","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.07820","snapshot_observed_at":"2026-08-04T22:37:58.087765Z","title":"Voorhees","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.087765Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:8e3ef71c47e03bfd2f8cddde4e47f96451f48e3b852da59e32f4f907cdea6369","observation_id":"e0f40ca3-e55f-4244-9e36-49c52aced602","resolution":{"observed_at":"2026-08-04T22:37:58.087765Z","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":"1184.33313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T22:37:59.098515Z","title":null,"venue":null,"work_id":"45d333e3-d948-4424-980e-1e1631d8e2b7","year":2019},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.091690Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:fbc6b265fdba789cea447489aee362f2e852348e3318da1fcc6637476022c29f","observation_id":"1262463e-3cf1-4c8f-9cb5-ce64b8e6709b","resolution":{"observed_at":"2026-08-04T22:37:59.105376Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.417421Z","title":"data.txt","venue":null,"work_id":"d40742e3-080f-4b3b-a6fb-b79f4e0a2471","year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.095415Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:521e97cb65d0acef3995116075521483ae07ac66e90a22ed88318b74537c9cad","observation_id":"6178ca2b-f579-4834-a601-deb49330698f","resolution":{"observed_at":"2026-08-04T22:37:59.421447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-04T22:37:58.099118Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.099118Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:73de8bf9acfe8c647401cd29be74f1a8d9896cf4aa02a6718dec7e3f4368a4b0","observation_id":"61a31514-7d1a-4607-bfa5-db68c00716a4","resolution":{"observed_at":"2026-08-04T22:37:58.099118Z","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-04T22:37:58.103266Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.103266Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:8b9d56b225a6e53fe2f488d89e2b1a7ad18a1d52259471d0106ecaa90c676816","observation_id":"f310d7e2-0a3e-4545-8c5c-520eade255e3","resolution":{"observed_at":"2026-08-04T22:37:58.103266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-04T22:37:58.107012Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.107012Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:d44481eeda01d9218646073e77f3ad6e58cbe5a60d5f21c7cf0365724ddd5b1a","observation_id":"fb38d1c3-6623-40d3-a86a-c66ea20df073","resolution":{"observed_at":"2026-08-04T22:37:58.107012Z","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-04T22:37:59.393882Z","title":null,"venue":null,"work_id":"84d7bd37-f9a8-47f5-a8cb-8e2e693ba9a4","year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.111360Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:451fc76a9e5057438877021a45613947553aba7eb11beb6deb7e5e9c0a83b712","observation_id":"6effa3af-da87-4e53-9052-d063e88b475a","resolution":{"observed_at":"2026-08-04T22:37:59.398151Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.156780Z","title":"Dai, Jakob Uszkoreit, Quoc Le, and Slav Petrov","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.156780Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:564a5925f3aad4ea0088b23186a3aca28ec7a8060cff766eb2d5f19225a3a93c","observation_id":"a6c75a89-250c-4284-98a3-0ccf888d0fa9","resolution":{"observed_at":"2026-08-04T22:37:58.156780Z","resolver_source":null,"status":"malformed_identifier"},"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-04T22:37:58.118845Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.118845Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:4e2226100c78350605ff4f9383c7fb0fc72d0e67d071550d4462e6015c5533d7","observation_id":"974bd11f-c994-469d-b66e-d86ac9cd2715","resolution":{"observed_at":"2026-08-04T22:37:58.118845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16766","last_updated":"2025-03-03T19:56:32Z","snapshot_observed_at":"2026-08-09T02:53:33.486890Z","submitted_at":"2025-02-24T01:08:15Z","title":"ATEB: Evaluating and Improving Advanced NLP Tasks for Text Embedding Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16766","snapshot_observed_at":"2026-08-04T22:37:58.122385Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.122385Z"},"links":{"cited_paper":"/paper/2502.16766","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:ca3d84d9571c2f86d1d3ea10b134d2f18da6a51f4e71bbc74698d2287c6cc0a6","observation_id":"d8f5d642-3429-4583-b092-8bf8ec381608","resolution":{"observed_at":"2026-08-04T22:37:58.122385Z","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-04T22:37:59.363436Z","title":null,"venue":null,"work_id":"1cf8356d-7b65-41fa-8566-0ab47e22475c","year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.126485Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:cc30cfa22d45cff376a875d7cd96a179fcee774878317da59a0a263f09c3b350","observation_id":"f5055a3d-430f-48ce-88f4-1931ec5eb7ab","resolution":{"observed_at":"2026-08-04T22:37:59.367670Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.350412Z","title":null,"venue":null,"work_id":"15418e4b-4a1a-48f4-bc16-77de754a22d2","year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.130120Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:0cc51bb5f7134925b619033318acbf346dc1865987b417d0e361e8c94e0cb3dd","observation_id":"dc5a3174-9230-42e1-a545-0cf21c2359f4","resolution":{"observed_at":"2026-08-04T22:37:59.354333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03653","last_updated":"2023-05-05T16:16:45Z","snapshot_observed_at":"2026-08-09T15:02:51.320534Z","submitted_at":"2023-05-05T16:16:45Z","title":"Query Expansion by Prompting Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03653","snapshot_observed_at":"2026-08-04T22:37:58.133713Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.133713Z"},"links":{"cited_paper":"/paper/2305.03653","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:4cc8ca4c48169113afd2615a5851962be0551c2e1f8aafc0a56c1fbf6e46560a","observation_id":"2a4fbbf0-048e-4a8e-878a-9b0eac4da28e","resolution":{"observed_at":"2026-08-04T22:37:58.133713Z","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-04T22:37:58.137816Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.137816Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:794e96808c6f10303b6a350d4d44887e3df566d0660dd6d5ce0056cd9b884a40","observation_id":"cd8c5ad2-b885-4b89-9f6b-2229ed7e5fa6","resolution":{"observed_at":"2026-08-04T22:37:58.137816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09516","last_updated":"2025-08-05T19:08:38Z","snapshot_observed_at":"2026-07-06T20:51:28.022519Z","submitted_at":"2025-03-12T16:26:39Z","title":"Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09516","snapshot_observed_at":"2026-08-04T22:37:58.141216Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.141216Z"},"links":{"cited_paper":"/paper/2503.09516","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:1cf6211eed2cb8ac2df433c2b56414221f58623ba11237ed8119f2246b6a8ded","observation_id":"e4e6fe35-a079-4b81-8475-7637124f9eec","resolution":{"observed_at":"2026-08-04T22:37:58.141216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15585","last_updated":"2025-05-21T14:40:27Z","snapshot_observed_at":"2026-08-10T06:36:21.113288Z","submitted_at":"2025-05-21T14:40:27Z","title":"MIRB: Mathematical Information Retrieval Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15585","snapshot_observed_at":"2026-08-04T22:37:58.145219Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.145219Z"},"links":{"cited_paper":"/paper/2505.15585","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:c3ef6901d009c5dda1abd5f1cad541b249a4a5846a76f9a10c3916fbaa1c1ef1","observation_id":"1d7c870d-94fa-4930-ad64-44155acaa919","resolution":{"observed_at":"2026-08-04T22:37:58.145219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-08-04T22:37:58.148990Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.148990Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:6b59b5f359cb2b74d06ff7eb64d6bd5b72034799d64408a38b4ed8d7053af5a5","observation_id":"cbcf92b2-ff45-4af3-a8ba-bbea1634f711","resolution":{"observed_at":"2026-08-04T22:37:58.148990Z","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-04T22:37:58.152930Z","title":"What kind of car do you have?\\","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.152930Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:a2566e7cf72c0cb159606f8bfd658b07674e910e683f9ccf2ba551d57f1c66d2","observation_id":"546da676-b812-42e3-9725-8ce36342e1c8","resolution":{"observed_at":"2026-08-04T22:37:58.152930Z","resolver_source":null,"status":"malformed_identifier"},"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-04T22:37:59.311091Z","title":null,"venue":null,"work_id":"4d7e7594-96c0-4384-a2d7-1d1c88bd7727","year":2016},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.198508Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:6b2305e1131c8ba2566eae4c6aaad304bc93bf27e1e8b17226412239ba772663","observation_id":"564a745c-eebf-4744-860c-ca44f0f6dbd7","resolution":{"observed_at":"2026-08-04T22:37:59.315393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14558","last_updated":"2026-04-03T16:04:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-20T16:15:30Z","title":"R2MED: A Benchmark for Reasoning-Driven Medical Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14558","snapshot_observed_at":"2026-08-04T22:37:58.160620Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.160620Z"},"links":{"cited_paper":"/paper/2505.14558","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:c517c9e5b41fc4ea2fff2244b6f7c33d1acb4051011aff0e5e1581e59e9cb89b","observation_id":"898c3e4c-125b-4ec7-ad71-5b986a4cfb3e","resolution":{"observed_at":"2026-08-04T22:37:58.160620Z","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-04T22:37:59.336791Z","title":null,"venue":null,"work_id":"69d83fdf-be1e-4cae-aed4-4a360fcf7d06","year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.164480Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:4cc6aad64e9217c46ca1611ddd3f3364def0b1652b9691faae3d1d349446c69f","observation_id":"751a7ddf-2318-45cc-98bd-738f33229552","resolution":{"observed_at":"2026-08-04T22:37:59.340842Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.167990Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.167990Z"},"links":{"cited_paper":"/paper/2308.03281","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:f55c870e1cbe47b51496e7b4b3091b73bba2bad6da001b402224aa26cd3af90a","observation_id":"874ebbc1-95e6-4792-990e-9182d49d8dee","resolution":{"observed_at":"2026-08-04T22:37:58.167990Z","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-04T22:37:59.323884Z","title":null,"venue":null,"work_id":"ce0e5985-ba01-49af-980d-9ad2240d0ce3","year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.171878Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:8160582aad37e0482aa9e8c6277aafc9a76faf7625088f237b3dc8309667441c","observation_id":"7ce3f46c-ea78-4358-b355-913957f1c47f","resolution":{"observed_at":"2026-08-04T22:37:59.327767Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.175700Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.175700Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:3f0b1ea5ff014b96fb4436af477ba159972efeb88df8e3db43e92d18706bbb45","observation_id":"2f2809d2-d754-4722-982a-d114ffd9bc49","resolution":{"observed_at":"2026-08-04T22:37:58.175700Z","resolver_source":null,"status":"malformed_identifier"},"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-04T22:37:58.179466Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.179466Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:7a7a655a46878a8ecee3eda67aaf54f6d750b05eb802e5f0fa6a3914d0009f91","observation_id":"72c96f0c-0d77-402a-ae01-935b144aedf9","resolution":{"observed_at":"2026-08-04T22:37:58.179466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.12344","last_updated":"2020-02-27T18:58:15Z","snapshot_observed_at":"2026-07-06T09:00:43.755186Z","submitted_at":"2020-02-27T18:58:15Z","title":"Generating Followup Questions for Interpretable Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":"2002.12344","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.12344","snapshot_observed_at":"2026-08-04T22:37:59.039769Z","title":"Generating Followup Questions for Interpretable Multi-hop Question Answering","venue":"cs.CL","work_id":"e094da06-2082-4c32-9aac-a2cad2c2ae67","year":2020},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.183304Z"},"links":{"cited_paper":"/paper/2002.12344","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:96db85af3a45404d21ece4f4306aa162598d2a275bc3faaf07ca1528a767755e","observation_id":"e25ebd1b-9701-4a54-a50e-f01910dbeed1","resolution":{"observed_at":"2026-08-04T22:37:59.044151Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1108/00220410710827745","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Documentation","work_id":"25b2cbd4-89c8-4a4f-8359-9904fb220314","year":2007},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.187405Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:9ccde572c82915256630f7f8857659c52dff8b53d28399e917d1ff8737b038b8","observation_id":"da576560-0088-4053-9fc0-d3d4803d9f2f","resolution":{"observed_at":"2026-08-04T22:37:58.658686Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19754","last_updated":"2025-04-28T12:52:05Z","snapshot_observed_at":"2026-08-08T10:45:53.124420Z","submitted_at":"2025-04-28T12:52:05Z","title":"Reconstructing Context: Evaluating Advanced Chunking Strategies for Retrieval-Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19754","snapshot_observed_at":"2026-08-04T22:37:58.191041Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.191041Z"},"links":{"cited_paper":"/paper/2504.19754","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:2f00044540d4aa1e4fdfde622bd520a3e0c6d920f45e0532df9aea8618f0e114","observation_id":"a105d9ae-7f0b-4ed7-9853-587702869774","resolution":{"observed_at":"2026-08-04T22:37:58.191041Z","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-04T22:37:58.194772Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.194772Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:e7a429a8379ac451afb2fd906b2834c0f2ba84d1738c3b1c0f4458834585d992","observation_id":"d0764417-12ef-465d-b11d-5bcbc7f56dec","resolution":{"observed_at":"2026-08-04T22:37:58.194772Z","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-04T22:37:59.249648Z","title":null,"venue":null,"work_id":"787d9626-e6c6-4c39-9c15-5b1b6da072c2","year":null},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.241004Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:d47a92965fc84d036959ee22799dd9e2995db2a60afd93e5cfbca2eec5eab39f","observation_id":"5c948f88-e58e-42c3-8b90-ea96e7be76cf","resolution":{"observed_at":"2026-08-04T22:37:59.253401Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.202305Z","title":"Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.202305Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:57b4c8e55bcc0ed59a89d9d8538f8a80d38b840cf34f0d19ee6b6f9ef056b0cc","observation_id":"75abde6d-b68e-423e-9c2c-55101f175e32","resolution":{"observed_at":"2026-08-04T22:37:58.202305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.21500","last_updated":"2025-07-29T04:48:55Z","snapshot_observed_at":"2026-08-08T03:32:53.516422Z","submitted_at":"2025-07-29T04:48:55Z","title":"VN-MTEB: Vietnamese Massive Text Embedding Benchmark","version":1},"cited_work":{"arxiv_id":"2507.21500","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.21500","snapshot_observed_at":"2026-08-04T22:37:59.019341Z","title":"VN-MTEB: Vietnamese Massive Text Embedding Benchmark","venue":"cs.CL","work_id":"322cb789-96e9-4548-a52d-c7dfccde6227","year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.205960Z"},"links":{"cited_paper":"/paper/2507.21500","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:c0cb2677c361d7ec3ddc7cd3d324c16b87369e6c592a2c993d9159d1909fa906","observation_id":"2c5aaf97-ea94-4026-9dad-a623088f2bbb","resolution":{"observed_at":"2026-08-04T22:37:59.024385Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.10138","last_updated":"2026-04-24T15:07:37Z","snapshot_observed_at":"2026-08-03T00:32:28.055605Z","submitted_at":"2024-05-16T14:33:39Z","title":"PL-MTEB: Polish Massive Text Embedding Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.10138","snapshot_observed_at":"2026-08-04T22:37:58.209885Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.209885Z"},"links":{"cited_paper":"/paper/2405.10138","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:1553a90585af964bce9cc346be96ec6e17632cab2aa7d48861e7d631f4af9304","observation_id":"2d68c8ac-6b11-4cc7-b26e-8c60c69a31b0","resolution":{"observed_at":"2026-08-04T22:37:58.209885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-04T22:37:58.214154Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.214154Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:2eb60e40f645df15838d0097da662904639824e91c78ab5234940fa3eb6d3572","observation_id":"471f71dc-1269-4349-90c5-b4cb81b94d47","resolution":{"observed_at":"2026-08-04T22:37:58.214154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04506","last_updated":"2024-12-14T00:13:09Z","snapshot_observed_at":"2026-07-06T20:02:26.756229Z","submitted_at":"2024-12-03T22:59:36Z","title":"Arctic-Embed 2.0: Multilingual Retrieval Without Compromise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04506","snapshot_observed_at":"2026-08-04T22:37:58.218170Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.218170Z"},"links":{"cited_paper":"/paper/2412.04506","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:29fd955ced97fa48f32a6c9aafaa1f928af2bb3de5fc79e3a635ac45d8e8be68","observation_id":"575edfb3-37a3-4f32-8bcd-51ac987d2685","resolution":{"observed_at":"2026-08-04T22:37:58.218170Z","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":"2021.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T22:37:58.967082Z","title":"Voorhees, Lucy Lu Wang, and William R","venue":null,"work_id":"cddf822f-c616-4692-be37-b89b39511901","year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.222083Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:f593d2cf3a6147bdba8426388132070dfa0ebc8982e269764aaca2f9c703c43f","observation_id":"d1e268f8-16e8-46b8-aeb8-ca3ee6a3971c","resolution":{"observed_at":"2026-08-04T22:37:58.974050Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.287436Z","title":"Voorhees, Steven Bedrick, and William R","venue":null,"work_id":"910ca587-2311-4609-99b0-92049c0a44c0","year":2022},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.225991Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:9b5d0548b860c9a00b4443a3d94fcb58a5d588ac795875c2e45267402960b5d3","observation_id":"5578970e-42b9-4941-9ea3-757731b0f532","resolution":{"observed_at":"2026-08-04T22:37:59.291612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.274119Z","title":"Robertson and Ian Soboroff","venue":null,"work_id":"4638fa20-1885-48b8-9d71-c92c0cc72674","year":2001},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.229628Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:2caaa0ae98c9dd13b5fe382f0d7522675d636ed5afaadacdf2526bd695c69fd6","observation_id":"00243686-750e-4562-8105-3c66c6c84077","resolution":{"observed_at":"2026-08-04T22:37:59.278219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.261943Z","title":null,"venue":null,"work_id":"d40d1594-8f08-4b69-ae36-336ec5f67536","year":1994},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.233447Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:a182e853df9c2141ca60476b0b92dd554c18df322995e2535975a4b5f754c11c","observation_id":"f37f5e75-d1c1-4199-9555-17091f23c3ee","resolution":{"observed_at":"2026-08-04T22:37:59.265584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20595","last_updated":"2025-04-29T09:49:28Z","snapshot_observed_at":"2026-08-07T15:58:18.063496Z","submitted_at":"2025-04-29T09:49:28Z","title":"ReasonIR: Training Retrievers for Reasoning Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20595","snapshot_observed_at":"2026-08-04T22:37:58.236980Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.236980Z"},"links":{"cited_paper":"/paper/2504.20595","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:9edc1f35f01754a0dbb0334dba61a7b9349b997c957983815c8c26da824d1ae5","observation_id":"0947da87-7537-41d8-aecc-534b916aa643","resolution":{"observed_at":"2026-08-04T22:37:58.236980Z","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-04T22:37:59.214368Z","title":null,"venue":null,"work_id":"19e445fa-dc26-40d3-a5ee-c834377f74e1","year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.285468Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:1fcebdb9f404d88d7ae29bfc3d693b11b5d9fc133abf4575a865a25fe137abe3","observation_id":"5e0e7589-c596-4b15-a44b-ce0876cb3f0d","resolution":{"observed_at":"2026-08-04T22:37:59.218327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05592","last_updated":"2025-03-18T08:32:24Z","snapshot_observed_at":"2026-08-09T05:07:17.305244Z","submitted_at":"2025-03-07T17:14:44Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05592","snapshot_observed_at":"2026-08-04T22:37:58.244609Z","title":"arXiv:2503.05592 doi:10.48550/ARXIV.2503.05592","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.244609Z"},"links":{"cited_paper":"/paper/2503.05592","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:5fdf290bc2c8230b59a4b745c059b90ce66ad5c9625893376303c5dfa0727445","observation_id":"ea50013d-9d93-4d64-bc49-702c515acf38","resolution":{"observed_at":"2026-08-04T22:37:58.244609Z","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-04T22:37:58.248748Z","title":"Smith, Luke Zettlemoyer, and Tao Yu","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.248748Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:48002d96944c554b38c62d8b2f59324941dfc4baab3a9587ec8d385d6c4f69b0","observation_id":"4fa794eb-6aa7-4a55-a748-8749a0831a25","resolution":{"observed_at":"2026-08-04T22:37:58.248748Z","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-04T22:37:59.235759Z","title":"Siegel, Michael Tang, Ruoxi Sun, Jinsung Yoon, Sercan Ö","venue":null,"work_id":"62159b92-c62c-48c8-869d-ca20357cecbc","year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.252355Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:c77b2baa10c5b704932dce465319670e7f18faea0c51273e535934de5ea00d47","observation_id":"75c0aa7b-4166-4e51-828f-da3e78f943a2","resolution":{"observed_at":"2026-08-04T22:37:59.240080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.255731Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.255731Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:206dfb4d685f62c5c4739cad62335eb7bcffa2657d3adc9caea31ee263952541","observation_id":"7523e215-2d83-441c-af58-1819a79a2373","resolution":{"observed_at":"2026-08-04T22:37:58.255731Z","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-04T22:37:58.259531Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.259531Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:2c5020e752dff853dd8b4f11757f366015525cbb241821c6e6e2e0fa53661209","observation_id":"2ebfca8d-cfac-4bd1-a8a6-4fb5a48ff9e3","resolution":{"observed_at":"2026-08-04T22:37:58.259531Z","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":"10.18653/v1/2022.acl-long.517","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","work_id":"1104a67c-d1d6-46ae-a1fd-2589bfdf4e50","year":2022},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.263393Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:43fd81579e352f4d116c4312da0bbe304b54ad910cabd36631ae7f2c591e1283","observation_id":"0ee88d07-b339-4c25-91c5-e8063c62e681","resolution":{"observed_at":"2026-08-04T22:37:58.547330Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.267074Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.267074Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:0e8d6ec3aca06316c48fb22cb1a65f0c74586c3ad4d3e5913fb3205068678db7","observation_id":"a4d786a6-a889-49db-bbf5-4869b8a78368","resolution":{"observed_at":"2026-08-04T22:37:58.267074Z","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-04T22:37:58.270618Z","title":"Trippas, Sara Fahad Dawood Al Lawati, Joel Mackenzie, and Luke Gallagher","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.270618Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:e47ed07dc95293c90cefd7c82b432d2dc5dab5457504a9e3d1f3840d47d2ed1f","observation_id":"2d41b01a-bb14-41e8-b8ec-ac059d41b39b","resolution":{"observed_at":"2026-08-04T22:37:58.270618Z","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-04T22:37:58.274156Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.274156Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:014e7bc1fa27c75039f7cac256e7a21ab83533f28e8533cc52825a7831472c37","observation_id":"caac792b-134e-4655-ac43-d28f943aa72a","resolution":{"observed_at":"2026-08-04T22:37:58.274156Z","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-04T22:37:58.277974Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.277974Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:0c15d33f8bd24334dc695068d049db377b5663d9ab7be92fbb4bcc0c962b749e","observation_id":"e32d33a7-d23d-43d8-90e2-b501e3808937","resolution":{"observed_at":"2026-08-04T22:37:58.277974Z","resolver_source":null,"status":"malformed_identifier"},"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-04T22:37:58.281647Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.281647Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:1f467019e3fdd3bcac769a6ffd709485a9971c3b9ff68e7eb43a968e76046106","observation_id":"3f7c9e16-6562-42cc-ac68-d405bba00d18","resolution":{"observed_at":"2026-08-04T22:37:58.281647Z","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-04T22:37:58.330693Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.330693Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:0f1906470b6989e93ab4bf0f9f20ed52c5263b8708c3d62c2547469cd1f1412e","observation_id":"4d15b8dc-176d-4600-b352-2f5f25e5ec34","resolution":{"observed_at":"2026-08-04T22:37:58.330693Z","resolver_source":null,"status":"malformed_identifier"},"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-04T22:37:58.288937Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.288937Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:fabb2863dad84079ab5b841706b1ec3f80c33eff961c08da7fead5945f586cee","observation_id":"1485659c-c0dd-4fde-9f4d-ef1bef886bc0","resolution":{"observed_at":"2026-08-04T22:37:58.288937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14151","last_updated":"2024-04-03T20:11:02Z","snapshot_observed_at":"2026-08-06T17:30:19.965381Z","submitted_at":"2024-02-21T22:22:30Z","title":"BIRCO: A Benchmark of Information Retrieval Tasks with Complex Objectives","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14151","snapshot_observed_at":"2026-08-04T22:37:58.292987Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.292987Z"},"links":{"cited_paper":"/paper/2402.14151","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:60ccc558c2e095815189ae329b40826fef0388421742d25ad0c9cb7f59ac8e8c","observation_id":"e6b75439-3fc7-40d2-9a82-4438b7f8e17f","resolution":{"observed_at":"2026-08-04T22:37:58.292987Z","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-04T22:37:59.200605Z","title":"Le, Ed H","venue":null,"work_id":"022df197-c23f-4ca7-bff2-17ff8cbc403c","year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.296856Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:8e12e5b1cc7450c274b3c54f18db5ec5e6dc0b88ea3e7f4038f9cc91b9a103b4","observation_id":"2b8c3d9e-8b87-4b46-9798-d623c51f8a6f","resolution":{"observed_at":"2026-08-04T22:37:59.204399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7508.36383","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T22:37:58.930352Z","title":null,"venue":null,"work_id":"6682ba84-7577-497d-824e-5ec85101f1aa","year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.300390Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:29ab6a73aea95e17692b5acacada4e5c540f2fa6d27b2c18c7ac853c9ae13a5c","observation_id":"1c9c15c3-7bde-428a-b039-b619edc29777","resolution":{"observed_at":"2026-08-04T22:37:58.937435Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:59.187617Z","title":"Chi, Quoc V","venue":null,"work_id":"3be38877-69ac-4aed-93f9-a0de26afc745","year":2022},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.304039Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:ce7a1676485f1deee3a8405752d4f121a1eaf1610ad5f6794e33a5f7f4bc2882","observation_id":"65864a15-2170-4854-8a0c-d6de06ab8451","resolution":{"observed_at":"2026-08-04T22:37:59.191717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1162/tacl_a_00021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Transactions of the Association for Computational Linguistics","work_id":"4c2bbf95-4c68-40d4-8570-c04aa01d4d19","year":2018},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.307968Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:b48954c51521739f9e60bb5bd7b3ccf7ddc74e7480cf630727fea4436d72e50f","observation_id":"20163787-4cb7-4a0d-be49-3d8b5e81dfd8","resolution":{"observed_at":"2026-08-04T22:37:58.481892Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T17:38:09.486065+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T17:38:09.486065+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T17:38:09.486065+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T22:37:58.311530Z","title":"Lawrie, and Luca Soldaini","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.311530Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:49f3d24259764d50baab8e54c4212844090fd48ec77d838e4ac10a4e6fc84199","observation_id":"36460930-a8b1-4c70-990b-8ba8f5513c14","resolution":{"observed_at":"2026-08-04T22:37:58.311530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11136","last_updated":"2024-09-17T12:42:55Z","snapshot_observed_at":"2026-08-10T01:21:09.527448Z","submitted_at":"2024-09-17T12:42:55Z","title":"Promptriever: Instruction-Trained Retrievers Can Be Prompted Like Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11136","snapshot_observed_at":"2026-08-04T22:37:58.315215Z","title":"Lawrie, Ashwin Paranjape, Yuhao Zhang, and Jack Hessel","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.315215Z"},"links":{"cited_paper":"/paper/2409.11136","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:ba504c34a807bf35ccc7245b45dd61ca161c05f576fd147096f862606707d8a0","observation_id":"50d60de5-73fc-4b5f-a152-02d92774e6b1","resolution":{"observed_at":"2026-08-04T22:37:58.315215Z","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-04T22:37:59.164966Z","title":"Lawrie, and Benjamin Van Durme","venue":null,"work_id":"2e8b8314-7a9c-47ab-bc0e-e318f4ca5e6d","year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.319149Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:c58cc4a64fc364c4fe059e27f028c5ab9dee24e1681092b043b6db832a22af9b","observation_id":"4cb6560b-b545-4998-a53b-8b500d61b913","resolution":{"observed_at":"2026-08-04T22:37:59.169070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-04T22:37:58.322861Z","title":"Lawrie, and Benjamin Van Durme","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.322861Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:4aee9b124b739f1fd1f1f366fcb4782e35aec3b8d37a3c9b6bc188d944c8c370","observation_id":"83c493c8-7327-4827-9d3f-758fcd58c3f3","resolution":{"observed_at":"2026-08-04T22:37:58.322861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-04T22:37:58.326725Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.326725Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:e0e23ea6969a61e8ac3fef4a546e7de31fd4b75d774791c2ba2e8c7c434170b1","observation_id":"498cc5dd-fe39-40b4-9410-7721d6cd9095","resolution":{"observed_at":"2026-08-04T22:37:58.326725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04506","last_updated":"2024-12-14T00:13:09Z","snapshot_observed_at":"2026-07-06T20:02:26.756229Z","submitted_at":"2024-12-03T22:59:36Z","title":"Arctic-Embed 2.0: Multilingual Retrieval Without Compromise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04506","snapshot_observed_at":"2026-08-04T22:37:58.334377Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.334377Z"},"links":{"cited_paper":"/paper/2412.04506","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:27713bcd200cdc417ca45ec73bb9222729edaeade63bca200ab49561bbc46a20","observation_id":"d31da775-6c12-4e3b-abc6-308ad312f73e","resolution":{"observed_at":"2026-08-04T22:37:58.334377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15526","last_updated":"2025-02-21T15:28:26Z","snapshot_observed_at":"2026-08-07T17:58:15.621646Z","submitted_at":"2025-02-21T15:28:26Z","title":"Scaling Sparse and Dense Retrieval in Decoder-Only LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15526","snapshot_observed_at":"2026-08-04T22:37:58.338982Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.338982Z"},"links":{"cited_paper":"/paper/2502.15526","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:3ba76361d43c42d8396fe1503cafc35433a3d9cc58f78514934fcdffef2298a3","observation_id":"0695eaf2-22a4-4428-ac89-2e88ceadfc79","resolution":{"observed_at":"2026-08-04T22:37:58.338982Z","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":"10.1002/asi.20915","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the American Society for Information Science and Technology","work_id":"c2bbeb24-f93b-4bdb-97c8-1304900e9663","year":2008},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.342810Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:09c2603f9b26edd1c7086f41e43efad929929aeadaa2166b81c50221a8e2cd6d","observation_id":"88df9d2e-9c74-4559-a54e-6a5b51fe2bee","resolution":{"observed_at":"2026-08-04T22:37:58.418573Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9025.37122","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T22:37:58.878087Z","title":"Manning, Peter Henderson, and Daniel E","venue":null,"work_id":"1268a644-bc87-49bd-a21d-e1e958159f92","year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.346503Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:739f7414968ab931eea56ea0ea365d33453a85352185cba0a09a7c901e04eaf6","observation_id":"6e023177-adbf-47ba-b534-159927fb0b73","resolution":{"observed_at":"2026-08-04T22:37:58.885117Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2023.findings-emnlp.470","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"800b295a-fd6a-42c5-a1b3-14af51de162a","year":2023},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.349972Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:869179d514ed6b89a0b9e9f64b33585cc517a5fe8af60e0bcf3c764325444aed","observation_id":"0c22ad5e-ac7b-4585-812c-74f87c814f80","resolution":{"observed_at":"2026-08-04T22:37:58.404734Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06034","last_updated":"2025-03-08T03:14:26Z","snapshot_observed_at":"2026-08-07T17:20:46.152437Z","submitted_at":"2025-03-08T03:14:26Z","title":"Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06034","snapshot_observed_at":"2026-08-04T22:37:58.353677Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.353677Z"},"links":{"cited_paper":"/paper/2503.06034","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:4a41fbf6dbdcf98ff57a989606b962fba59198eaf12d54b4fb05ebf18d469b37","observation_id":"ebf58274-23e7-4d63-a4c9-aaa6c600a468","resolution":{"observed_at":"2026-08-04T22:37:58.353677Z","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-04T22:37:59.378877Z","title":"InThe Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025","venue":null,"work_id":"2e0f3acb-4801-424e-b040-b7db20719f20","year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.115310Z"},"links":{"citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:d432f646d0dc684b3176cea52a7fdbc1b2a475d81d0af14187f3a8b43d4d0db7","observation_id":"a5a81166-15f8-4782-bb21-7af0d31e5dab","resolution":{"observed_at":"2026-08-04T22:37:59.383916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks"},"reference_resolution":{"displayed":95,"state_counts":{"malformed_identifier":5,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":67,"verified_exact":8,"verified_fuzzy":10},"total_outbound_references":95},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 95 of 95 outbound references and 5 inbound Pith citation observations for arXiv:2509.07253."}