{"as_of":"2026-08-09T17:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:72d2267e0df7998211d8365de7cde76a7d51ecd659c954630fc88ab93d8aa001","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:23:23.307391Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2507.00355/citation-record","integrity":"/paper/2507.00355/integrity","json":"/paper/2507.00355/citation-record.json","paper":"/paper/2507.00355"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.11511","last_updated":"2023-10-17T18:18:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-17T18:18:32Z","title":"Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11511","snapshot_observed_at":"2026-08-06T21:23:20.077195Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.077195Z"},"links":{"cited_paper":"/paper/2310.11511","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:6c759725691067d5191179a76f2992512fc4f6311a5e13d74c56aa7ebba308c6","observation_id":"644fde40-4959-4b09-adbe-62aec85eb048","resolution":{"observed_at":"2026-08-06T21:23:20.077195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00610","last_updated":"2024-03-31T08:58:54Z","snapshot_observed_at":"2026-08-09T13:15:07.647793Z","submitted_at":"2024-03-31T08:58:54Z","title":"RQ-RAG: Learning to Refine Queries for Retrieval Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00610","snapshot_observed_at":"2026-08-06T21:23:20.146034Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.146034Z"},"links":{"cited_paper":"/paper/2404.00610","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:a72a1736fa2e7b9db71c34ccd877bc121470f54950c8432c08fd638f378ca1cd","observation_id":"159b8ec5-3d8b-4b1f-a39d-4ce6d0cf168d","resolution":{"observed_at":"2026-08-06T21:23:20.146034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17490","last_updated":"2023-11-14T06:49:33Z","snapshot_observed_at":"2026-08-09T05:28:11.034482Z","submitted_at":"2023-10-26T15:45:12Z","title":"Improving Zero-shot Reader by Reducing Distractions from Irrelevant Documents in Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":"2310.17490","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.17490","snapshot_observed_at":"2026-08-06T21:23:24.776081Z","title":"Improving Zero-shot Reader by Reducing Distractions from Irrelevant Documents in Open-Domain Question Answering","venue":"cs.CL","work_id":"e52dccff-1b18-4bcb-9f92-54bd0e8b41cf","year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.219223Z"},"links":{"cited_paper":"/paper/2310.17490","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:2d9d0eb97b113eab3f896901153a6c1dc9bf4904b7f5993c5f700ba28c019ca1","observation_id":"486d9553-1da7-4279-8981-562a25deaf00","resolution":{"observed_at":"2026-08-06T21:23:24.894957Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-06T21:23:20.307442Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.307442Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:49079fb5b78175477e9e77e6cbe1e1def273390f62d15ee94d7696791f4ce595","observation_id":"6210af9e-149e-4204-9de1-6e7c34bb34ba","resolution":{"observed_at":"2026-08-06T21:23:20.307442Z","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-06T21:23:26.308080Z","title":null,"venue":null,"work_id":"db099307-d05b-46d8-af8b-92ff37b5cd51","year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.336647Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:7a03a7183462c3a662e5b00a04ad8b63f974fd78399a70ba8ad0523b50a88754","observation_id":"9c0f8577-0a12-4182-88a7-133b4ab86b6f","resolution":{"observed_at":"2026-08-06T21:23:26.476735Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10245","last_updated":"2024-07-14T15:25:08Z","snapshot_observed_at":"2026-08-09T00:28:18.128617Z","submitted_at":"2024-07-14T15:25:08Z","title":"GenSco: Can Question Decomposition based Passage Alignment improve Question Answering?","version":1},"cited_work":{"arxiv_id":"2407.10245","doi":"10.48550/arxiv.2407.10245","metadata_source":"pith","pith_arxiv_id":"2407.10245","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"GenSco: Can Question Decomposition based Passage Alignment improve Question Answering?","venue":"cs.CL","work_id":"458a1552-e868-4ed9-985a-fefd38cef53d","year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.454788Z"},"links":{"cited_paper":"/paper/2407.10245","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:17105bb2e5abdf9f3fdeb250f9ca34494a47cafd569f8fac0a85d52f15e76e10","observation_id":"fd93a626-978e-42fc-9088-8670fb256439","resolution":{"observed_at":"2026-08-06T21:23:24.575798Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06606","last_updated":"2019-06-15T19:17:10Z","snapshot_observed_at":"2026-08-09T00:28:15.487571Z","submitted_at":"2019-06-15T19:17:10Z","title":"Multi-Hop Paragraph Retrieval for Open-Domain Question Answering","version":1},"cited_work":{"arxiv_id":"1906.06606","doi":"10.48550/arxiv.1906.06606","metadata_source":"pith","pith_arxiv_id":"1906.06606","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Multi-Hop Paragraph Retrieval for Open-Domain Question Answering","venue":"cs.CL","work_id":"30976c61-99f0-48e0-9d08-460db1b7ad2b","year":2019},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.490842Z"},"links":{"cited_paper":"/paper/1906.06606","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:8690211da1dcd62a7655f8c8a0df3ca3b3e358bcaafed2b8cf543892aecf942a","observation_id":"45801ea4-f5a8-4540-858d-446927bd22cb","resolution":{"observed_at":"2026-08-06T21:23:24.402883Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10496","last_updated":"2022-12-20T18:09:52Z","snapshot_observed_at":"2026-07-06T14:33:08.041820Z","submitted_at":"2022-12-20T18:09:52Z","title":"Precise Zero-Shot Dense Retrieval without Relevance Labels","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10496","snapshot_observed_at":"2026-08-06T21:23:20.556920Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.556920Z"},"links":{"cited_paper":"/paper/2212.10496","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:112c34924d6576eb4c3c6f7cf684323786887c47ab4747959cf4b6291e07fed4","observation_id":"9f66963e-c93d-4221-830f-b4edff4b5da0","resolution":{"observed_at":"2026-08-06T21:23:20.556920Z","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-06T21:23:20.628266Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.628266Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:e190f87c41f2ddd8865030595c76c8a48ee0c63310c0e14457a77ea93e725b8d","observation_id":"f9bdd54b-c9d0-4dfb-836d-1ba8ae1cfc37","resolution":{"observed_at":"2026-08-06T21:23:20.628266Z","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/2023.emnlp-demo.1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:23:24.142623Z","title":null,"venue":null,"work_id":"7e287f7f-b782-421c-8b97-3e5e90f45f00","year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.689848Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:b4ed60cc64b620c1a918a67ffb843a1990f192e9cf7be57c0df53335311ed969","observation_id":"c083d8fd-8e4b-46fe-8ec9-fcc630b17bed","resolution":{"observed_at":"2026-08-06T21:23:24.231022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:23:26.043531Z","title":null,"venue":null,"work_id":"ae3c8662-44ee-462e-8882-10c16031b913","year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.761093Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:030a41572f415cc0af5e52a7df7b4ca27721cb507f9c5e06b42f8138f06ab6ff","observation_id":"7c77785f-1ad3-428d-b065-7d9631ae82ee","resolution":{"observed_at":"2026-08-06T21:23:26.165604Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14403","last_updated":"2024-03-28T06:45:11Z","snapshot_observed_at":"2026-08-04T09:23:59.079378Z","submitted_at":"2024-03-21T13:52:30Z","title":"Adaptive-RAG: Learning to Adapt Retrieval-Augmented Large Language Models through Question Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14403","snapshot_observed_at":"2026-08-06T21:23:20.797477Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.797477Z"},"links":{"cited_paper":"/paper/2403.14403","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:2df28580dced119e9d4255c7520aace7e1466931b4d8dbcf9947d15f9c9f0ac8","observation_id":"b2806c3a-dee3-40d6-8c34-ecb16529f284","resolution":{"observed_at":"2026-08-06T21:23:20.797477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.03551","last_updated":"2017-05-13T21:12:37Z","snapshot_observed_at":"2026-08-02T11:13:42.401488Z","submitted_at":"2017-05-09T21:35:07Z","title":"TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.03551","snapshot_observed_at":"2026-08-06T21:23:20.915312Z","title":"Weld, and Luke Zettlemoyer","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.915312Z"},"links":{"cited_paper":"/paper/1705.03551","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:25f95852e5a96a323b8e616ce07c66d0ee474cbf20826792cb167c11d20243e3","observation_id":"eb11506c-de47-4c57-8e1b-0816da7ad74f","resolution":{"observed_at":"2026-08-06T21:23:20.915312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-06T21:23:20.989634Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:20.989634Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:32bce44710dc4eb900053edfcbd8605e1ab35e163f678b61b93b19c979bf86ef","observation_id":"1c4962c1-9419-434b-8c8a-e6ba6f3126df","resolution":{"observed_at":"2026-08-06T21:23:20.989634Z","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-06T21:23:25.809190Z","title":null,"venue":null,"work_id":"cc7162eb-d12d-4053-8285-aacfe2296563","year":2025},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.068095Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:9913a9bf0f33d48aaccfa6642d37132512c021161402f979ba07f2c30a78944d","observation_id":"9cccb22f-7969-4a0f-a6dc-fda2c3f2f6dc","resolution":{"observed_at":"2026-08-06T21:23:25.950253Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.11401","last_updated":"2021-04-12T15:42:18Z","snapshot_observed_at":"2026-08-07T05:44:30.677502Z","submitted_at":"2020-05-22T21:34:34Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.11401","snapshot_observed_at":"2026-08-06T21:23:21.114651Z","title":"u ttler, Mike Lewis, Wen-tau Yih, Tim Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.114651Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:35eee28cffdf88d21554415ae63d255a34de7be1f55d2e3b7a0b2807908b4c3b","observation_id":"50a4cd40-b44b-4a51-8bf3-00e364f8d3bf","resolution":{"observed_at":"2026-08-06T21:23:21.114651Z","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/2024.findings-acl.280","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:23:23.999455Z","title":null,"venue":null,"work_id":"7a14d7c6-6c8a-40c1-a94c-420973cc442e","year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.206323Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:bd3ba44a8ba01a2a43bc595ad7a93ebea6faa72e939b21101c060632a1d77b08","observation_id":"95ba0dc5-1d2d-4cb8-bb5e-77295ed269df","resolution":{"observed_at":"2026-08-06T21:23:24.117197Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14283","last_updated":"2023-10-23T02:34:49Z","snapshot_observed_at":"2026-07-06T15:31:41.985646Z","submitted_at":"2023-05-23T17:27:50Z","title":"Query Rewriting for Retrieval-Augmented Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14283","snapshot_observed_at":"2026-08-06T21:23:21.273058Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.273058Z"},"links":{"cited_paper":"/paper/2305.14283","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:5972e8ce92950895736288c7e1f2592f16a4b0cbbc6804f4b094e4e0694fb302","observation_id":"761ec101-2f34-489f-8aa8-a37280fb77d7","resolution":{"observed_at":"2026-08-06T21:23:21.273058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.09140","last_updated":"2024-05-31T14:28:40Z","snapshot_observed_at":"2026-08-04T15:29:57.954444Z","submitted_at":"2022-04-19T21:55:18Z","title":"Multi-hop Question Answering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.09140","snapshot_observed_at":"2026-08-06T21:23:21.366817Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.366817Z"},"links":{"cited_paper":"/paper/2204.09140","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:529bff9a03e89dfe7c64b7d2bac1f7d1f5c2408f32ac5c2236dd950f5e73ce77","observation_id":"53b82efa-5f64-4423-905d-0aca666af6bf","resolution":{"observed_at":"2026-08-06T21:23:21.366817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.02916","last_updated":"2019-06-30T22:30:19Z","snapshot_observed_at":"2026-08-08T07:45:48.992984Z","submitted_at":"2019-06-07T06:22:17Z","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.02916","snapshot_observed_at":"2026-08-06T21:23:21.463992Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.463992Z"},"links":{"cited_paper":"/paper/1906.02916","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:23f44d507492e0ec26d46d0f9ab2573430791c5389d84e90d6605fc9b82dd72c","observation_id":"eb303553-d484-49d6-a43e-a0b191939ed4","resolution":{"observed_at":"2026-08-06T21:23:21.463992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-02T11:18:37.014004Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-06T21:23:21.534829Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.534829Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:1305f37d2832c43595125f93e623019dbc996717a18c2289a2bb4515cc98ee81","observation_id":"3fdf1879-3ea3-4099-b560-e016222b8e1f","resolution":{"observed_at":"2026-08-06T21:23:21.534829Z","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-06T21:23:25.594512Z","title":null,"venue":null,"work_id":"28affbb8-cf07-4fb3-a625-6b54bda4f7ba","year":2022},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.617538Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:f64eeaaeb8821473a5d4eace31bc6120d8a47648140871ab5c465d01721a5cb7","observation_id":"6567c2e5-22da-4157-952c-af9c997a2b0d","resolution":{"observed_at":"2026-08-06T21:23:25.687441Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.09758","last_updated":"2020-10-06T18:47:48Z","snapshot_observed_at":"2026-08-07T11:45:50.611722Z","submitted_at":"2020-02-22T19:40:35Z","title":"Unsupervised Question Decomposition for Question Answering","version":3},"cited_work":{"arxiv_id":"2002.09758","doi":"10.48550/arxiv.2002.09758","metadata_source":"pith","pith_arxiv_id":"2002.09758","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Unsupervised Question Decomposition for Question Answering","venue":"cs.CL","work_id":"5a737363-c3a5-41c0-956c-9d114363d10b","year":2020},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.680786Z"},"links":{"cited_paper":"/paper/2002.09758","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:7500bb66b6e0dd97b4402e479493c9689351e23f5ad273661d4a39ee4fec08b1","observation_id":"21e554b1-a966-469a-bfd4-7c72f8f2716c","resolution":{"observed_at":"2026-08-06T21:23:23.902086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03350","last_updated":"2023-10-17T18:57:17Z","snapshot_observed_at":"2026-07-31T15:52:06.089691Z","submitted_at":"2022-10-07T06:50:23Z","title":"Measuring and Narrowing the Compositionality Gap in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03350","snapshot_observed_at":"2026-08-06T21:23:21.749241Z","title":"Smith, and Mike Lewis","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.749241Z"},"links":{"cited_paper":"/paper/2210.03350","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:62622195568e15af2a37447f42a06cf9e35c9d2ccf29c08d066543575cc4bb5f","observation_id":"420c079b-3c61-4487-abc4-11a888c3ca66","resolution":{"observed_at":"2026-08-06T21:23:21.749241Z","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-06T21:23:25.359482Z","title":null,"venue":null,"work_id":"a173c6cd-e457-467c-a907-39ff32745357","year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.813498Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:84efcfa50e55e02c96880125dd140f890ab7ddbc7fbd7baaae039472e3f51d50","observation_id":"829ffa2a-76ed-49ae-826d-b84a2360a1ac","resolution":{"observed_at":"2026-08-06T21:23:25.440885Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.05250","last_updated":"2016-10-11T02:42:36Z","snapshot_observed_at":"2026-08-08T11:05:45.903773Z","submitted_at":"2016-06-16T16:36:00Z","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05250","snapshot_observed_at":"2026-08-06T21:23:21.883169Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.883169Z"},"links":{"cited_paper":"/paper/1606.05250","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:a97a193a0ef2bae9903b6d790959a7cf78e48bd8b7462efa1284b7fcbafd3e85","observation_id":"3e9d0bcb-3719-4bd6-8268-55ccb9631dbf","resolution":{"observed_at":"2026-08-06T21:23:21.883169Z","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-06T21:23:21.952547Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:21.952547Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:e635c3660362cf9009e95134f4cbd3ea41a8d3ed738f81dc9b3fd953fd17b1fe","observation_id":"a7610852-3ba6-4cfb-929f-84f090583d8a","resolution":{"observed_at":"2026-08-06T21:23:21.952547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-09T00:27:14.897803Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"cited_work":{"arxiv_id":"2505.16014","doi":"10.48550/arxiv.2505.16014","metadata_source":"pith","pith_arxiv_id":"2505.16014","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","venue":"cs.CL","work_id":"87402ae0-284c-42b8-92d9-4f656aa8aab3","year":2025},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.052677Z"},"links":{"cited_paper":"/paper/2505.16014","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:1f8769b9419dea47fe28e0cd9fbeb86e92c5ccf69e43af9c4e7ac9e33027c995","observation_id":"3ecf6f00-53bc-409d-ba4f-26cefd33541b","resolution":{"observed_at":"2026-08-06T21:23:23.751107Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15294","last_updated":"2023-10-23T09:58:13Z","snapshot_observed_at":"2026-08-03T16:18:57.922065Z","submitted_at":"2023-05-24T16:17:36Z","title":"Enhancing Retrieval-Augmented Large Language Models with Iterative Retrieval-Generation Synergy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15294","snapshot_observed_at":"2026-08-06T21:23:22.150044Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.150044Z"},"links":{"cited_paper":"/paper/2305.15294","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:18840a36737f39df47157a96d86ce0a8b32097350ed944dc721988d5f0b15286","observation_id":"9286b8cf-216c-44e1-a099-330ee8571f91","resolution":{"observed_at":"2026-08-06T21:23:22.150044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00093","last_updated":"2023-06-06T08:36:20Z","snapshot_observed_at":"2026-07-06T14:46:48.605674Z","submitted_at":"2023-01-31T20:48:57Z","title":"Large Language Models Can Be Easily Distracted by Irrelevant Context","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00093","snapshot_observed_at":"2026-08-06T21:23:22.232679Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.232679Z"},"links":{"cited_paper":"/paper/2302.00093","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:9b755b52282324d66a120d575c54c3b27e8d45cd52e46a4671c7cc9a3d1fc6f1","observation_id":"86a7b6e6-3bf5-4fc7-b813-08c03205cfe9","resolution":{"observed_at":"2026-08-06T21:23:22.232679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.15718","last_updated":"2022-10-27T18:44:58Z","snapshot_observed_at":"2026-07-06T14:11:23.745126Z","submitted_at":"2022-10-27T18:44:58Z","title":"QUILL: Query Intent with Large Language Models using Retrieval Augmentation and Multi-stage Distillation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.15718","snapshot_observed_at":"2026-08-06T21:23:22.286529Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.286529Z"},"links":{"cited_paper":"/paper/2210.15718","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:89bbdbe501accdb7326ddefa0db12ef0a65230b9524a2ea52ff0cf424865e5a9","observation_id":"95448eb2-ed39-40b2-85bc-fbe9bdf651cc","resolution":{"observed_at":"2026-08-06T21:23:22.286529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15391","last_updated":"2024-01-27T11:41:48Z","snapshot_observed_at":"2026-08-02T18:59:01.488566Z","submitted_at":"2024-01-27T11:41:48Z","title":"MultiHop-RAG: Benchmarking Retrieval-Augmented Generation for Multi-Hop Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15391","snapshot_observed_at":"2026-08-06T21:23:22.358816Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.358816Z"},"links":{"cited_paper":"/paper/2401.15391","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:7319e0db948dbff02284b98e2d93359e6f95f56fd31a82ceeced4e28a200c038","observation_id":"db283de2-8c20-4ae9-9a10-421c7ad662f0","resolution":{"observed_at":"2026-08-06T21:23:22.358816Z","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-06T21:23:25.201026Z","title":null,"venue":null,"work_id":"c7542fa7-317d-4ddd-aacb-216a4d06766f","year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.410644Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:ed0742ccaf4c23dd2a7e6aab0a0281b8e71e28df2353cbde62d69d6664b5109e","observation_id":"45addc31-3736-4e31-bd05-78114a42c037","resolution":{"observed_at":"2026-08-06T21:23:25.272035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12566","last_updated":"2024-10-01T04:42:48Z","snapshot_observed_at":"2026-07-06T18:32:57.295918Z","submitted_at":"2024-06-18T12:52:51Z","title":"RichRAG: Crafting Rich Responses for Multi-faceted Queries in Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12566","snapshot_observed_at":"2026-08-06T21:23:22.465614Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.465614Z"},"links":{"cited_paper":"/paper/2406.12566","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:ab889fe8195fb5653bb95343810210937d9f58a53337f1d0d1c44910c064698a","observation_id":"3cd419a0-7d88-4fab-a55c-b6059ee44616","resolution":{"observed_at":"2026-08-06T21:23:22.465614Z","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-06T21:23:22.533211Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.533211Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:5a6d1ae3323ba4995aca1117684594e22438942b65f91d592af20ce8a1999731","observation_id":"56c6025b-3220-4b8e-9819-d5778269786c","resolution":{"observed_at":"2026-08-06T21:23:22.533211Z","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-06T21:23:22.619510Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.619510Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:535a6611a7927b9fa40687237bdddfac991ebd6c66bbdaee54155741011eb2e1","observation_id":"b8f65ac3-3ea7-47d6-a5c6-9d103c0e63a3","resolution":{"observed_at":"2026-08-06T21:23:22.619510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11166","last_updated":"2024-02-17T02:21:44Z","snapshot_observed_at":"2026-08-03T22:37:56.873870Z","submitted_at":"2024-02-17T02:21:44Z","title":"GenDec: A robust generative Question-decomposition method for Multi-hop reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11166","snapshot_observed_at":"2026-08-06T21:23:22.684301Z","title":"Karlsson, and Manabu Okumura","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.684301Z"},"links":{"cited_paper":"/paper/2402.11166","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:25f9d50888b2d5c05af3095ba8a62e21ec4d58af45c345bda6460b6f19211ee8","observation_id":"9a9bc43b-6260-4ac3-9c83-232cf94f7d26","resolution":{"observed_at":"2026-08-06T21:23:22.684301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07597","last_updated":"2024-09-24T03:01:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-14T10:57:50Z","title":"C-Pack: Packed Resources For General Chinese Embeddings","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07597","snapshot_observed_at":"2026-08-06T21:23:22.737993Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.737993Z"},"links":{"cited_paper":"/paper/2309.07597","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:14ce8a766387abd8cf74713e09d69095200b86b8cb0fadae9a6cdb980547927d","observation_id":"34b4b030-0fd7-484c-98a9-1c027070c5ec","resolution":{"observed_at":"2026-08-06T21:23:22.737993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14732","last_updated":"2024-02-24T16:54:29Z","snapshot_observed_at":"2026-07-06T15:21:08.450594Z","submitted_at":"2023-04-28T10:15:25Z","title":"Search-in-the-Chain: Interactively Enhancing Large Language Models with Search for Knowledge-intensive Tasks","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.14732","snapshot_observed_at":"2026-08-06T21:23:22.785863Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.785863Z"},"links":{"cited_paper":"/paper/2304.14732","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:099632220b5581aa167500d0265250113f7287394896a834a5af92902b60047e","observation_id":"13753073-0d91-44ac-a649-a0478139f56c","resolution":{"observed_at":"2026-08-06T21:23:22.785863Z","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-06T21:23:24.988359Z","title":null,"venue":null,"work_id":"43b37f5c-e2a5-45e1-8a95-db69aa249848","year":2025},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.844879Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:edc1964f0bf65af6175ed789084b8fd12e55812ebae416d841f3e2ac0c52780e","observation_id":"6036bee3-54e3-4aa4-9d09-ae99f2e677cc","resolution":{"observed_at":"2026-08-06T21:23:25.077085Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15884","last_updated":"2024-10-07T02:19:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-29T04:36:39Z","title":"Corrective Retrieval Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15884","snapshot_observed_at":"2026-08-06T21:23:22.885332Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.885332Z"},"links":{"cited_paper":"/paper/2401.15884","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:148133ab80043261c4a875313cedc1c56b5865b8da19155ab2a8f6f5af5d27bd","observation_id":"92009a9e-4b55-469b-aca0-5982f1893da3","resolution":{"observed_at":"2026-08-06T21:23:22.885332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-06T21:23:22.950929Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.950929Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:398e3be481fcf61564b9e12255259b8f90af2aaa73fe82b23e13f97f24a7d074","observation_id":"2bc897c5-3470-4db6-bd4a-ded61b40f4ba","resolution":{"observed_at":"2026-08-06T21:23:22.950929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09600","last_updated":"2018-09-25T17:28:20Z","snapshot_observed_at":"2026-08-09T10:11:58.541007Z","submitted_at":"2018-09-25T17:28:20Z","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.09600","snapshot_observed_at":"2026-08-06T21:23:22.993682Z","title":"Cohen, Ruslan Salakhutdinov, and Christopher D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.993682Z"},"links":{"cited_paper":"/paper/1809.09600","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:21b85f7213df1b04a1284965be74b8c1931e648de716999222fe968302eab9f6","observation_id":"d78af964-a4d2-40f5-bcee-8064365e072c","resolution":{"observed_at":"2026-08-06T21:23:22.993682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-06T21:23:23.034448Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:23.034448Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:529f8cffcedb237e7dcfbd0a65a14b417ac926af94882a4318c22538409b6f9f","observation_id":"5015292e-78bf-4a38-b2e4-4ab2927de593","resolution":{"observed_at":"2026-08-06T21:23:23.034448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.16865","last_updated":"2022-10-30T15:38:03Z","snapshot_observed_at":"2026-08-09T13:59:39.921259Z","submitted_at":"2022-10-30T15:38:03Z","title":"Learning to Decompose: Hypothetical Question Decomposition Based on Comparable Texts","version":1},"cited_work":{"arxiv_id":"2210.16865","doi":"10.48550/arxiv.2210.16865","metadata_source":"pith","pith_arxiv_id":"2210.16865","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Learning to Decompose: Hypothetical Question Decomposition Based on Comparable Texts","venue":"cs.CL","work_id":"bef98509-68e6-45b4-b026-24b03b69c2c4","year":2022},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:23.095793Z"},"links":{"cited_paper":"/paper/2210.16865","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:c9296598002821994fce97aac9382ec1276cd27dd5502df9eaf0ac23fdb3f8bc","observation_id":"c507d527-e824-4dbc-aab2-6f2f9635ce0e","resolution":{"observed_at":"2026-08-06T21:23:23.465417Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14245","last_updated":"2025-05-28T01:19:26Z","snapshot_observed_at":"2026-08-07T18:03:04.162159Z","submitted_at":"2025-02-20T04:19:05Z","title":"Mitigating Lost-in-Retrieval Problems in Retrieval Augmented Multi-Hop Question Answering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14245","snapshot_observed_at":"2026-08-06T21:23:23.169941Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:23.169941Z"},"links":{"cited_paper":"/paper/2502.14245","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:4fab659fa7fecc04ef2b985a859d32f0d5cc420761e6e4273fbca86425740e2a","observation_id":"8ba11c44-f29e-4042-bac5-7a6bf3058116","resolution":{"observed_at":"2026-08-06T21:23:23.169941Z","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-06T21:23:23.230356Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:23.230356Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:f3cbf02962e7f549de63751c8ef75d26c61d750faafde133864216d6b12a5f3f","observation_id":"b2f8d51e-097b-409f-b0e3-e1dc0bb25798","resolution":{"observed_at":"2026-08-06T21:23:23.230356Z","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-06T21:23:23.307391Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:23.307391Z"},"links":{"citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:57eb53abf57d179b3cde41979707071eeea1b7c0edff0184d986c17dfaa20a4a","observation_id":"c4ec015f-791d-4456-bb17-121748a2a70c","resolution":{"observed_at":"2026-08-06T21:23:23.307391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T00:27:51.321314Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":40,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":48},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2507.00355."}