{"as_of":"2026-08-14T20:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:702e69448711fd9e5405a1b047b70d4a5f44ce7575ef0e4d48e080f80481e5cc","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T22:26:03.073002Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T14:57:43.125819Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T15:05:03.555925Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"cited_work":{"arxiv_id":"2605.31238","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.31238","snapshot_observed_at":"2026-07-08T15:05:03.555925Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","venue":"cs.CL","work_id":"1dda824a-02d7-4ea6-8b6d-f2617be6c4d4","year":2026},"citing_paper":{"arxiv_id":"2607.06160","last_updated":"2026-08-03T07:05:08Z","snapshot_observed_at":"2026-08-14T17:03:55.996543Z","submitted_at":"2026-07-07T11:35:48Z","title":"LongCrafter: Towards Diverse Long-Context Understanding via Evidence-Graph-Guided Instruction Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-08T14:57:43.125819Z"},"links":{"cited_paper":"/paper/2605.31238","citing_paper":"/paper/2607.06160"},"observation_digest":"sha256:b8c75555df3c3b60d9dd9baf5fe748b2fbae91fb5e036c02c5a7b88638b13067","observation_id":"bc5857e0-eaf8-46ff-8f94-0def8d3ac347","resolution":{"observed_at":"2026-07-08T15:05:03.557523Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.31238/citation-record","integrity":"/paper/2605.31238/integrity","json":"/paper/2605.31238/citation-record.json","paper":"/paper/2605.31238"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T22:26:03.073002Z","title":"Self-RAG: Learn- ing to retrieve, generate, and critique through self-reflection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:10cb24dccb3c1508789524652ee7487eaf5fad66aa9f4b08f73b23bcd577e734","observation_id":"ad4f363e-799c-441e-aec4-ff4bdfa0f77b","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"AlpaGasus: Training a better alpaca with fewer data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:b32b6964538bbd7803045a9b9c5837d5ba9ac60c2f58db1d738fc7d9d4cae6fd","observation_id":"d71d2720-7e70-4db7-aaa7-77db89eae3a2","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Program of thoughts prompt- ing: Disentangling computation from reasoning for numerical reasoning tasks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:dd16b1dce513d2d8e95a8b1f5f10515a47515e6966f0253f12df72d3dfae9789","observation_id":"ad926a5a-68f3-47e6-b699-4a6b9e6b1e43","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"DoG-Instruct: Towards premium instruction-tuning data via text-grounded instruction wrapping","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:54970592c8caa5f52d250b2fcbde85813531b9f2ba4c2066eb84c6d6add4fec2","observation_id":"0d3113c8-c10b-456f-b1d5-ddb9072d04c9","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"QLoRA: Efficient fine- tuning of quantized LLMs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:a97b91819bca49c64334895962d494c83de29e4dc7fb4d360e653b7104575c73","observation_id":"026f4ea4-0978-4963-8b48-3edccffe327a","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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":"2601.09727","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T22:32:44.582541Z","title":"SciNets: Graph-constrained multi-hop reasoning for scientific literature syn- thesis","venue":null,"work_id":"9c5695d7-d955-4d4b-8dbb-f8bcd1f945b7","year":2026},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:762b49f6b9b973d31fdf525502edd35cb28e60348753cb164a90769761084ac8","observation_id":"847308a0-3616-4da0-bc98-c6fd886f65fa","resolution":{"observed_at":"2026-06-28T22:32:44.583981Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T22:26:03.073002Z","title":"Faith and fate: Limits of transformers on compositionality","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:e457b5d1a0a90d4e9028f5d2141dfe3f39f3483cbe2a2c95bb2cd288088d4ec3","observation_id":"5ea04bd4-38b3-4d24-9b4a-0f0f2fd68a89","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"IIRC: A dataset of incomplete information reading comprehension questions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:a9850aa400a4f54c9ed5838239d0f53120e530d642e419f6d1dcdf2482130ba6","observation_id":"24f1c75a-ebc7-4ee8-8d1f-5e839e9c5f3f","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"SimCSE: Simple contrastive learning of sen- tence embeddings","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:e02a616a7bbef8fdce1f5238fd682f9ee6f2e1219c549896dd1d30ef631b2ce8","observation_id":"d2214417-8d7e-43a6-97af-91ab5b3eae3c","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"TrueTeacher: Learning factual consistency evaluation with large language models","venue":null,"work_id":null,"year":2053},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:52e74ef50752b7afb18800c2fb0c05bb83889a41f7af900216b84af1c9f0d010","observation_id":"f302523a-4303-40c8-8e80-33172673e343","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Did Aristotle use a laptop? A question answering benchmark with implicit reasoning strategies","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:5eacd0c1f4da55c8b9e1217c68310d7d5ccae99fa5b95d75597d0565521c7ef5","observation_id":"d118c817-d282-4a5d-9f9f-e6c010bc64dd","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"LegalBench: A collaboratively built benchmark for measuring legal reasoning in large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:f675142ff7b2f4a4c63a684cc6cdc380f9e1a3dec66fa935e6d517e32ca6f42c","observation_id":"ca43bf56-5fd5-4afc-a6a5-951ac884b92f","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:d656446ff386013dbcb0cee0649eabdcbddb34407da7d7e3530ff557e5e42bda","observation_id":"7b555c43-706d-459b-97ad-bbaefd98321b","resolution":{"observed_at":"2026-06-28T22:32:44.586800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T22:26:03.073002Z","title":"CUAD: An expert-annotated NLP dataset for legal contract review","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:c835b8bf2cf22957805c56ca15a23169aa8967ea96c74a2914e6bfa0eedaeb71","observation_id":"2b9aa21c-3390-4f29-aeeb-9e2a47648f24","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Constructing a multi-hop QA dataset for comprehensive evaluation of reasoning steps","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:3b2d0e27f819c74621f3a39c462b896adde993e8027cd34a67ce3b0479d00975","observation_id":"f23681b9-70cf-4c09-a68b-770a720f86b7","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Unnatural instructions: Tuning language models with (almost) no human labor","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:741bc791e7b85a288c729b90f3bc0c9712ae15afdf9fcf6dfd7164fcd5d77f5f","observation_id":"357048c9-3df7-4f4f-bff2-09e20efff17e","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"LoRA: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:95716a1ccce7498649a48bdd4ad598831b96f8b9ee99b4efc1bd225af20a7c73","observation_id":"d7cf4cbe-c933-4bb3-b79a-68d1624c6f04","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Active retrieval augmented generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:525f3ac3995dcac771553b8dd1f36382714df4b9a84813f2ba4b5f54f1353655","observation_id":"f16f0574-4731-4c04-9b08-8c8371ec34aa","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Billion-scale similarity search with GPUs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:d7ba2984400f11909bc21b970c4a662b219321617a4b948fdbc7fb580fbddda7","observation_id":"fa995294-a3b3-480b-8723-1cf77dc106be","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"TriviaQA: A large scale dis- tantly supervised challenge dataset for reading comprehension","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:4c48e66de037dc9f406dc17b9177005423c64082afbd5cf83e8fc79fe3648f8f","observation_id":"fde82150-5dab-42fa-b4b2-d2d3a3d3e39f","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Learning from synthetic data improves multi-hop reasoning","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:368f195c87330a6b28a7d36ac1c257d971f6ecb39a2c53abf269b0c765ff224d","observation_id":"b67b4d34-5934-40df-b5c1-79da0768c995","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:c528690e41a8554ecfd4e459f585301d976052f193620bac36dfe4d59153af86","observation_id":"4218954f-485d-494b-88c1-02fcb05a1b4c","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Decomposed prompting: A modular approach for solving complex tasks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:ad254fff26407efc7ab5cfc44e025b3fbab8b91fc565d4054eb9bcda7aa457fe","observation_id":"7e4f5fbc-b8f8-44dd-83cb-f4fc78bf79f6","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Overcoming catastrophic forgetting in neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:618b07df9811eb7be03646b75c85b623ce1830973d1e1e16ce58444571e04a4f","observation_id":"39fb8e61-1f20-4576-9163-398e8d04003e","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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":"2603.14257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T22:32:44.579958Z","title":"Automatic inter- document multi-hop scientific QA generation","venue":null,"work_id":"129638ed-3263-4ece-994a-0887c76c5629","year":2026},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:df87ab86366ad68d67c39bdc28cc8ee3dbfd42b79b9b3eac11c7d2428c8e3102","observation_id":"962ec0d1-7ef6-4404-b4ba-e88cfe597d54","resolution":{"observed_at":"2026-06-28T22:32:44.581280Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T22:26:03.073002Z","title":"FactCG: Enhancing fact checkers with graph-based multi-hop data","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:838652e8d1ab026d5717a40f8136e08c41aa1b708adbeb6cfb8130be2c91e1e2","observation_id":"4e5c2075-54f4-48fb-bf2e-147f6060d7df","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Retrieval- augmented generation for knowledge-intensive NLP tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:81d2b5abb8f2ac4c7a7fae00ae201fe2b28f32864dfe256f9ea85f676e5b37bf","observation_id":"897727d7-4e35-4246-b693-483efa713d7c","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"DESIGNER: Design-logic-guided multidisciplinary data synthesis for LLM reasoning","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:f86f068975c33aa28fb1a57b0bffa489e8cd47af558e06d48d4ced278c685579","observation_id":"166cadb0-ddb2-45e6-a64d-9b4b152b54c7","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"SelfCheckGPT: Zero-resource black-box hallucination detection for generative large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:4bfa277f2244ff620d097303dc1ea251b41bee84e2a3ea53592839c46c8dda5b","observation_id":"d0f281ba-69ea-4725-af2e-c4ed29b4ee44","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"FActScore: Fine-grained atomic evalua- tion of factual precision in long form text generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:9efe52dc8d77c8c260ad15db53659c42a82c7585ed93c882ba8429b967ddfee7","observation_id":"b557ed47-8a01-44ba-8e24-e85011ff7bb7","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:d99caab0e79b1263ca43b9c567777c4808fc933d8e896e17503d9bbc35b789c6","observation_id":"f48e95a7-6624-41dd-b4cc-53457445d7da","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Mea- suring and narrowing the compositionality gap in language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:604df6375a1dd545ef1e97e5b85022f602dd1811ebdc4dc66dd2745ef2bb15d9","observation_id":"f2a5289d-7a46-4871-811a-c92b9ff65230","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Sentence-BERT: Sentence embeddings using Siamese BERT-networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:a6c6c608cfb6b857eebab5c04172271fea26b0e6f73003df9bc586e5d0f88cbc","observation_id":"f74bea4b-7fa3-4256-8247-6ff33f26e1d2","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"The web as a knowledge-base for answering complex questions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:e87d503b305673d50e29266ed39c4dc3263c28cc40e2647ce13c9bc35d16f761","observation_id":"bb5d6d51-a483-4882-a3fc-cff37953a72c","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"MuSiQue: Multihop questions via single-hop question generation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:da5c9d1c4c9493d6d28b420b9769c566fb8bcf5e6e36807883141c25c76b352d","observation_id":"ab987f10-e25f-4487-ac1b-838beef63164","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"MAUD: An expert- annotated legal NLP dataset for merger agreement understanding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:849111fbcd0bfab009de6af7632f1dc5f1bf176638a173dd48e72c3e08e324f2","observation_id":"2ba47d8a-91bb-4ad0-a952-9b02c33d2357","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Self-consistency improves chain of thought reasoning in lan- guage models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:833c323ecdeb7788220c612f9ff4618ae7aad46912f182f3d4aaa3f1307e0523","observation_id":"c99cbd08-9d63-4f73-8764-4f90914b31be","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Self-Instruct: Aligning language models with self-generated instruc- tions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:8e92fd4c333dbf91e143e621396310b04a5fca77c61c36239ad6fa3c0a381fdc","observation_id":"c566d5c1-69c3-46b0-bee8-393a3bf4ab94","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:b6d5bc242e923fa739978ee5b9ade8010b3ba1c2c5a4b46e7bece6a0ba2ee4b2","observation_id":"0cc9934d-bfb0-498c-9fa9-0e78cb5e298a","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"WizardLM: Empowering large language models to follow complex instructions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:c568a202bf4ecc13868832c86f1e6aa0bdff9d33ba4a84789c5d13b2fa11f6e3","observation_id":"425a3c37-710e-44a9-83e5-a90e4932c1fa","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"HotpotQA: A dataset for diverse, explainable multi-hop question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:f90b7b77b6232d87e159537eba62b2c00ac6dee4c23fbcc061fa9768cde9dce1","observation_id":"6ac6ba00-f3b6-4129-bee1-d430c6e81236","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Tree of thoughts: Deliberate problem solving with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:0d672f2215e8a50410156e4fffdcf5023bc6938bff6e47e7e4ea4361c557b6e9","observation_id":"2ad0d4c0-7070-428c-b9cc-5fbd617bc2d7","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"QA- GNN: Reasoning with language models and knowledge graphs for question answering","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:067ad103ccf109b80d6264b6b02affc6f32f446e6921fcc69ed34df78b9d69ce","observation_id":"677caf56-849b-4c0b-aac3-a041a8569d1b","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.19127","last_updated":"2026-07-02T15:09:01Z","snapshot_observed_at":"2026-08-12T09:18:28.128058Z","submitted_at":"2026-02-22T10:55:21Z","title":"AgenticRAGTracer: A Hop-Aware Benchmark for Diagnosing Multi-Step Retrieval Reasoning in Agentic RAG","version":2},"cited_work":{"arxiv_id":"2602.19127","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.19127","snapshot_observed_at":"2026-07-03T02:17:09.666261Z","title":"AgenticRAGTracer: A hop-aware benchmark for diagnosing multi-step retrieval reasoning in agentic RAG","venue":null,"work_id":"e2824299-e805-492c-a3b3-a0afe9598723","year":2026},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"cited_paper":"/paper/2602.19127","citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:d933370226b9f3801ef9ab885c92c275e9fdd4b08ab6051b78b2ed499a3b09b5","observation_id":"1d16e7c8-28ea-485f-83a8-c254bcaeafc8","resolution":{"observed_at":"2026-07-03T02:17:09.666261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T22:26:03.073002Z","title":"GreaseLM: Graph reasoning enhanced language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:9fe895a7512b481df6624b4c7acc90b9538c074db368de3013b9fa3539334094","observation_id":"e94c4fe0-20f3-4022-9a82-3e88a4a98fd5","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"LIMA: Less is more for alignment","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:47c94b5b84af27349f05981e15747a8b78e8fcd20f991f4dc97f5dfd52cb8c2d","observation_id":"0fb937e2-81d4-4bf2-8738-ffda7958039c","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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-06-28T22:26:03.073002Z","title":"Least-to-most prompting enables complex reasoning in large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:50e9f218348b237467c664a71a4660013e58f2e4adcf0a41e21e67a2cf508b08","observation_id":"488ff751-54d2-4a59-97db-29e14cc2aaa3","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","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":"2603.00889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T22:32:44.590701Z","title":"find candidate evidence paths that the teacher comfortably verbalizes","venue":null,"work_id":"58efa9ae-3a5f-4ae9-8a98-9943717f0cde","year":2026},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:5c9a9c9b092080f5f1e3ef9dbe8bbbcac2b828a152f5de936e13c8ecd0fcab2a","observation_id":"f07b4bc8-bf48-466c-bb42-d43e8e9fb6f9","resolution":{"observed_at":"2026-06-28T22:32:44.592100Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T22:26:03.073002Z","title":"no transfer","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:b8d4d2dc6e061ba50d6e9dab60ccf8b90c12c0f6d3219770fca43dd8c446459f","observation_id":"3416c61b-bed0-4cb3-bec4-a4ad737c3822","resolution":{"observed_at":"2026-06-28T22:26:03.073002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":49},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2605.31238."}