{"as_of":"2026-08-20T01:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0bd6b1d041d20e703ff85b4e6611163da1be9e78f15e6b1d087f93d7fd4a2082","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T03:17:20.012125Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.05712/citation-record","integrity":"/paper/2607.05712/integrity","json":"/paper/2607.05712/citation-record.json","paper":"/paper/2607.05712"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.556078Z","title":"https: //ai.google.dev/gemini-api/docs/models/ gemini-2.5-flash-lite","venue":null,"work_id":"80288260-6b4f-440a-8353-549696318274","year":2026},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:a6bc77171960f22ad82a33737fa0d835e811720bf21f2e372eb2c01a636d6f79","observation_id":"d9f68b6c-92c9-4691-a6fa-3def5f5cb5a2","resolution":{"observed_at":"2026-07-11T03:17:52.585472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.01060","last_updated":"2020-11-12T07:47:48Z","snapshot_observed_at":"2026-08-14T05:50:17.249446Z","submitted_at":"2020-11-02T15:42:40Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","version":2},"cited_work":{"arxiv_id":"2011.01060","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.01060","snapshot_observed_at":"2026-07-11T03:17:50.841893Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","venue":"cs.CL","work_id":"73ded6d0-6905-404f-b7d5-b66e36e1b4f8","year":2020},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"cited_paper":"/paper/2011.01060","citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:8222d1ce681e4116a23179e993a9a13992e5b49d03b49e139eaefba88046d7e3","observation_id":"472c4520-63b8-4094-9577-a4ce9154dbf7","resolution":{"observed_at":"2026-07-11T03:17:50.867183Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.02916","last_updated":"2019-06-30T22:30:19Z","snapshot_observed_at":"2026-08-15T04:31:33.137248Z","submitted_at":"2019-06-07T06:22:17Z","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","version":2},"cited_work":{"arxiv_id":"1906.02916","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.02916","snapshot_observed_at":"2026-07-11T03:17:50.806238Z","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","venue":"cs.CL","work_id":"59d7cdf2-e563-4685-92b3-2d212c5bb3f0","year":2019},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"cited_paper":"/paper/1906.02916","citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:a31913a1abc3487ea7fb332923174a058a255ddf6db63617eea8c805382fbafb","observation_id":"cd0914b8-037e-4b7b-ba04-1dc228b1cbad","resolution":{"observed_at":"2026-07-11T03:17:50.833187Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.589399Z","title":"https://platform","venue":null,"work_id":"657ae083-d8d4-4808-b17c-51b801e8cff2","year":2026},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:31c5b09cf988d4738e55f28124ca1de56d936bb0227e09e899ac01bea7567024","observation_id":"926bd81c-019f-4775-9410-4a27dfa169ac","resolution":{"observed_at":"2026-07-11T03:17:52.613798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.523901Z","title":"https: //developers.openai.com/api/docs/ models/gpt-5.4-nano","venue":null,"work_id":"1a1e605c-99ee-4a5b-8585-0e6be10efb29","year":2026},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:b139d3f3a4b3feea0d2931a171111d02525d68006c2013eb5733d3252aedc91b","observation_id":"b912975e-57e6-4c01-8c2b-32e7b6fdfb7d","resolution":{"observed_at":"2026-07-11T03:17:52.549678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.617828Z","title":"InFindings of the Association for Computa- tional Linguistics: EMNLP 2023, pages 5687–5711","venue":null,"work_id":"15f88f07-9c34-44f1-af22-7e6dc1cef84a","year":2023},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:214cd2ee6f800b94f567d86e91d445bc4a2e30ceccdc7049a3869401bf736900","observation_id":"d9ef5767-dda0-42ca-aa1a-2fbae7e45702","resolution":{"observed_at":"2026-07-11T03:17:52.639849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.12756","last_updated":"2021-02-19T22:15:03Z","snapshot_observed_at":"2026-08-17T21:54:41.083823Z","submitted_at":"2020-09-27T06:12:29Z","title":"Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval","version":2},"cited_work":{"arxiv_id":"2009.12756","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.12756","snapshot_observed_at":"2026-07-11T03:17:50.918153Z","title":"L., Iyer, S., Du, J., Lewis, P., Wang, W","venue":"cs.CL","work_id":"5a17405f-5af8-4b79-9c5e-8c37a3314a5c","year":2020},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"cited_paper":"/paper/2009.12756","citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:c79f2dae8933236eb340467315ad8aada16d72a0d92ab07dcd194250ee3287c6","observation_id":"105698b4-a216-4816-b2a5-540521ede305","resolution":{"observed_at":"2026-07-11T03:17:50.948483Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.670472Z","title":"InProceedings of the 2018 conference on empiri- cal methods in natural language processing, pages 2369–2380","venue":null,"work_id":"ff0ae822-5f67-4281-beac-ecf986cf43e0","year":2018},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:c9fb65265c35bda9b9266e3c77c972d7941221f8e3ea8db0acdbf863dc84f160","observation_id":"5067093d-5783-4c66-98d0-2b754bd1580d","resolution":{"observed_at":"2026-07-11T03:17:52.695535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04343","last_updated":"2025-03-02T19:44:37Z","snapshot_observed_at":"2026-08-17T04:15:37.543157Z","submitted_at":"2024-10-06T03:42:15Z","title":"Inference Scaling for Long-Context Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":"2410.04343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.04343","snapshot_observed_at":"2026-07-11T03:17:50.738757Z","title":"arXiv:2410.04343 [cs.CL] https://arxiv.org/abs/2410.04343","venue":"cs.CL","work_id":"9e4fec63-85d0-49b9-94ea-6e5f55779d95","year":2024},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"cited_paper":"/paper/2410.04343","citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:e54f9f1852f82c3d3505b4999eb3bd057b2b4e5f03c3139e117e64bdf41fb647","observation_id":"0f5653fc-b16a-4ab8-8f98-a8e8646c2af0","resolution":{"observed_at":"2026-07-11T03:17:50.766405Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.500581Z","title":null,"venue":null,"work_id":"c12356ed-1610-49d6-92bb-f3d9d534131b","year":2024},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:8ea6a2ae39c8464b88f5264c9dff352214d4871a8922e5bc41bf4ea8024de098","observation_id":"3a1de3ee-2090-432f-beb3-38dcffefd4a2","resolution":{"observed_at":"2026-07-11T03:17:52.520138Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-08-17T07:57:12.232097Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":"2506.05176","doi":"10.1016/j.displa.2025.103255","metadata_source":"pith","pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","venue":"cs.CL","work_id":"bab684a8-d933-426c-a19e-2c855a0d1f59","year":2025},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:f704850b942bba9b3360a1b411452f148dc2b4fca7b342e0046b51ecd0ee9750","observation_id":"1707647a-9990-4334-bc87-ccf0ef865f5d","resolution":{"observed_at":"2026-07-11T03:17:50.906771Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8470.8630","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:50.772554Z","title":"The margin loss in Eq","venue":null,"work_id":"7ce7dcb1-e8d9-4844-8eda-034b200da0e1","year":2024},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:27e18a7bfaca960d7ceae771cf1ff3703aeb91873e5f7898740372b29393867f","observation_id":"8da4a405-f2a4-4221-a6df-d9ec344950a7","resolution":{"observed_at":"2026-07-11T03:17:50.799396Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.443608Z","title":null,"venue":null,"work_id":"b166c59c-4c0e-46a4-93df-a5ef08606e07","year":2025},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:ee0bb5f09a3a556206e38a92d6302cd8902d0eb1aaaf09edccf74bb5eed42ca3","observation_id":"68760641-78c3-4b22-9372-c7c9d5975494","resolution":{"observed_at":"2026-07-11T03:17:52.464969Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.643296Z","title":"This behavior is consis- tent with its intended role as a lightweight set-level explorer rather than a high-capacity reranker","venue":null,"work_id":"358e6a3d-60e6-4e2b-b351-3b88022b0e5f","year":2023},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:2308862486b4d88dcdcb3f861e0a7d34ba41dc83adedc4a535ebc099dacc1815","observation_id":"9adc9da2-f1ad-4a7c-a3c2-d142e881e0b9","resolution":{"observed_at":"2026-07-11T03:17:52.666922Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:52.468877Z","title":"We do not redistribute the original datasets or pretrained model weights","venue":null,"work_id":"7a8fdb46-2035-462c-a34c-40f174710709","year":2018},"citing_paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T03:17:20.012125Z"},"links":{"citing_paper":"/paper/2607.05712"},"observation_digest":"sha256:b2babee0b571f4235676db3266804efd2af40380ce42fbc705e923e44909723b","observation_id":"f88c7042-e31b-4b0d-9249-3d0a5cd1ec04","resolution":{"observed_at":"2026-07-11T03:17:52.496724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.05712","last_updated":"2026-07-07T00:37:45Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-14T05:50:56.634525Z","submitted_at":"2026-07-07T00:37:45Z","title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":2,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":1,"verified_exact":3,"verified_fuzzy":6},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.05712."}