{"as_of":"2026-08-14T07:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e6d9ac4304da64b290ea3be98102933c975a0ac35a5e32a4a261f74d98001c0","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:26:28.103764Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"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-05-10T16:44:21.688397Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T08:16:01.472961Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"cited_work":{"arxiv_id":"2505.19189","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.19189","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Poqd: Performance- oriented query decomposer for multi-vector retrieval","venue":null,"work_id":"64ea9122-ebdb-4293-bc6a-ac85c7087a5d","year":2025},"citing_paper":{"arxiv_id":"2604.10389","last_updated":"2026-06-11T15:19:21Z","snapshot_observed_at":"2026-08-03T04:13:37.440484Z","submitted_at":"2026-04-12T00:30:31Z","title":"BLUEmed: Retrieval-Augmented Multi-Agent Debate for Clinical Error Detection","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T16:44:21.688397Z"},"links":{"cited_paper":"/paper/2505.19189","citing_paper":"/paper/2604.10389"},"observation_digest":"sha256:b6c40fda99b85dc9efe63ead3c9c712d32cabb21acddbab631db6e17e6ffc877","observation_id":"c96323ef-4515-441c-b74a-4c7ca2f39acb","resolution":{"observed_at":"2026-05-11T08:16:01.476085Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2505.19189/citation-record","integrity":"/paper/2505.19189/integrity","json":"/paper/2505.19189/citation-record.json","paper":"/paper/2505.19189"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-07T14:26:24.935260Z","title":"deepseek.com","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:24.935260Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:c5decbb355b6c4a34097a07d6608cf066d7535cdef3d353fa2f95265c69ac14d","observation_id":"e870846d-2381-4956-aed3-d729032a13fd","resolution":{"observed_at":"2026-08-07T14:26:24.935260Z","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-07T14:26:28.730424Z","title":"We therefore further evaluate how this filtering step influences the performance of POQD as well as baseline methods","venue":null,"work_id":"521680f7-3b9c-40e9-b5e2-3c1b8d39c02e","year":2025},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:28.103764Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:4a7439a2516af0f84d94b9f5788be3f2c04219f99e8938d8aacee3d446a2a711","observation_id":"4055e144-7589-400c-9fa2-67a36fb1ff05","resolution":{"observed_at":"2026-08-07T14:26:28.757535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:31.326944Z","title":"Coil: Revisit exact lex- ical match in information retrieval with contextualized inverted list","venue":null,"work_id":"8506f9cb-91b3-4498-b0b2-93913a499c3f","year":2021},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.275918Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:ff3ade9d97afab772ad57f7fcb7dea3338428aea7b3f98149aabd1e29762d452","observation_id":"49ef839a-3bf3-4eab-bd54-479c4524b408","resolution":{"observed_at":"2026-08-07T14:26:31.389409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2403.12393","last_updated":"2024-03-19T03:00:03Z","snapshot_observed_at":"2026-08-13T00:50:42.564864Z","submitted_at":"2024-03-19T03:00:03Z","title":"Dr3: Ask Large Language Models Not to Give Off-Topic Answers in Open Domain Multi-Hop Question Answering","version":1},"cited_work":{"arxiv_id":"2403.12393","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12393","snapshot_observed_at":"2026-08-07T14:26:28.416637Z","title":"Dr3: Ask Large Language Models Not to Give Off-Topic Answers in Open Domain Multi-Hop Question Answering","venue":"cs.CL","work_id":"ad4a1e20-0e88-4381-81dc-b36289f176b0","year":2024},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.391328Z"},"links":{"cited_paper":"/paper/2403.12393","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:9c2b49d8ff3a40534eb0692b2577ec30a748845c05ed5efc3c65961456cb3a8d","observation_id":"f6e991a5-8429-4db5-8a8b-1a79337f05b3","resolution":{"observed_at":"2026-08-07T14:26:28.510064Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:31.034065Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":"b828d685-ec3b-4b27-b7ce-8b0ce0599939","year":2020},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.604139Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:04f4e6bb8cf21ecde0dc5907b76e98588a9d965ced8a39ecd0a91a62f5fc9a4b","observation_id":"07a87740-4bf6-41a3-a265-0fca50723135","resolution":{"observed_at":"2026-08-07T14:26:31.111885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:30.898273Z","title":"Decomposed prompting: A modular approach for solving complex tasks","venue":null,"work_id":"340fa6f7-a935-4f58-8590-c4d64fa11e9e","year":2021},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.688615Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:c5bd7b43411e466307d06cf181a82ce13fd7d8166c639b0a2901322a56d1f213","observation_id":"988269bb-6fbc-4d16-9da5-f1eaf81cba17","resolution":{"observed_at":"2026-08-07T14:26:30.959177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T14:26:25.852159Z","title":"Llm-based optimization of compound ai systems: A survey","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.852159Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:1481090b4de5a75f7cfec7ec351be5947dfe7b0a6dc98d00dd57d7b69928a6cc","observation_id":"f92273ee-a8fb-4b3b-b4a0-c624cce9c104","resolution":{"observed_at":"2026-08-07T14:26:25.852159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-07T14:26:25.953132Z","title":"On the optimiza- tion landscape of low rank adaptation methods for large language models","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.953132Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:1990d6b4ca20b776c4d982b5bc765442de7c592bc308690d2408b389ceee8c19","observation_id":"92c2bcff-6fa7-4c3b-912f-5158615b408f","resolution":{"observed_at":"2026-08-07T14:26:25.953132Z","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-07T14:26:30.383238Z","title":"Unsu- pervised question decomposition for question answering","venue":null,"work_id":"1184f0db-46ae-4fb1-80ca-4edf49d6d875","year":2020},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.109999Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:1003b921111a20b6a06963e38bf8b7235eca60a8e89251a920d07d0451e02443","observation_id":"0860cfa9-25c7-4ca9-a3c0-905a5b9a71cb","resolution":{"observed_at":"2026-08-07T14:26:30.467215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:30.198116Z","title":"A., and Lewis, M","venue":null,"work_id":"c6e0933e-4be3-4513-87e3-6d13b01d6cb5","year":2023},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.168386Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:4f9d46e277d0832a3e87c1677284eb054c07c8dd9dd6e8c89eee67cc96f21222","observation_id":"cfb55767-a52f-4fb5-91c9-f059972b4da0","resolution":{"observed_at":"2026-08-07T14:26:30.297729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:30.082520Z","title":"T., Zhu, C., and Zeng, M","venue":null,"work_id":"7b103610-d3c4-45c7-9b87-f1e274fb5599","year":2023},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.242329Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:6b75fa7f18c2d237aceba900dd8c1601cfc693c434d346b7714c854df0c9612a","observation_id":"d9c90ee4-a327-453d-b372-1fad88efcb93","resolution":{"observed_at":"2026-08-07T14:26:30.129056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","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-07T14:26:26.357007Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.357007Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:a249a697da23bc437b9bfedff09fa32578c4b2678205e936db5b6d9e1417fae8","observation_id":"e6066854-4113-4ebe-b816-ecab83a868f9","resolution":{"observed_at":"2026-08-07T14:26:26.357007Z","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-07T14:26:29.988102Z","title":"Plaid: an efficient engine for late interaction retrieval","venue":null,"work_id":"8556b911-3f23-4af8-8d99-9b8d150e881c","year":2022},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.457508Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:376ac1066c5cd72dd0ccc8a399dd73d454f9f8ba7be3f23307c522ebcd60554b","observation_id":"5716871c-c0c9-4086-a185-c5bbee891218","resolution":{"observed_at":"2026-08-07T14:26:30.029801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2402.11166","last_updated":"2024-02-17T02:21:44Z","snapshot_observed_at":"2026-08-13T04:17:09.949073Z","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-07T14:26:26.537051Z","title":"Multi- modalqa: complex question answering over text, tables and images","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.537051Z"},"links":{"cited_paper":"/paper/2402.11166","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:a76c3705592f760c500237dfe1b0c4cad77a37737a0e5156f38b2b12c3628bb9","observation_id":"de389022-f718-4f58-8e33-9f175337bde4","resolution":{"observed_at":"2026-08-07T14:26:26.537051Z","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-07T14:26:29.769025Z","title":"and Zhu, X","venue":null,"work_id":"c18e67f1-a8fc-403e-a26c-8f03d12f4bd0","year":2021},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.753172Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:9674978af15068fe3d292220486d73ab52d73b7ee0eabfcaefbecb5756f261b5","observation_id":"503a827c-4d1d-471a-8b8a-c6936c153b31","resolution":{"observed_at":"2026-08-07T14:26:29.833257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.654060Z","title":null,"venue":null,"work_id":"31a6b25e-c51a-4fe6-9400-bf441ef4db51","year":2018},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.873239Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:6cf9009e9ead51613367a3b3344757c70e56e7a52372cecfc1149ad1b70cb17d","observation_id":"0e488497-ba75-4ef5-966d-4fceaedca8ca","resolution":{"observed_at":"2026-08-07T14:26:29.708684Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2408.11875","last_updated":"2024-08-20T09:29:31Z","snapshot_observed_at":"2026-08-12T23:00:52.805100Z","submitted_at":"2024-08-20T09:29:31Z","title":"Hierarchical Retrieval-Augmented Generation Model with Rethink for Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11875","snapshot_observed_at":"2026-08-07T14:26:26.968854Z","title":"Offline training of language model agents with functions as learnable weights","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.968854Z"},"links":{"cited_paper":"/paper/2408.11875","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:1ad63c55db9dd1d8c9770219442334f3c7a31c0f088dfeb342b8b1e08098c74a","observation_id":"e1b37035-c833-4396-b030-f639a423544f","resolution":{"observed_at":"2026-08-07T14:26:26.968854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15809","last_updated":"2024-08-08T07:05:46Z","snapshot_observed_at":"2026-08-13T04:10:55.942410Z","submitted_at":"2024-02-24T13:13:04Z","title":"Empowering Large Language Model Agents through Action Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15809","snapshot_observed_at":"2026-08-07T14:26:27.036884Z","title":"Empowering large language model agents through action learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.036884Z"},"links":{"cited_paper":"/paper/2402.15809","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:6af767d075c93eb9e47bcbb81aa916fdb149be71718fbf82a451c6607e6c2ba1","observation_id":"c235c46a-220d-4ab4-9133-4ae714471215","resolution":{"observed_at":"2026-08-07T14:26:27.036884Z","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-07T14:26:29.527943Z","title":"Chain-of-questions training with latent answers for robust multistep question answering","venue":null,"work_id":"aaccfa26-5237-4621-8672-ab5044b68a96","year":2023},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.103510Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:3b47c3f396589225d9026f1e2686838677860d557606793fe7826ec13cd062c9","observation_id":"35a64d3c-05e9-46ec-8544-bd6545ec94bc","resolution":{"observed_at":"2026-08-07T14:26:29.580873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.440412Z","title":"By leveraging the fact that L(Θold 0 ; pold) ≤ M and Gold > 0, then the above formula is further bounded by: Gold − Gnew ≥ α − Aτ M","venue":null,"work_id":"a207fb05-d20c-4fa9-897c-f7d791269501","year":2013},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.230517Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:e8371076d1753b9f989097e99a289f2b5ae034a6e2b295a876f75e4807815282","observation_id":"adc08ba4-c5d9-4640-bdb3-5945ec4f94aa","resolution":{"observed_at":"2026-08-07T14:26:29.479797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.328802Z","title":"Among these datasets, WebQA, MultiModalQA and ManyModalQA contain questions that may require retrieving data from different modalities","venue":null,"work_id":"eb781ce3-1a33-48a6-a4d9-cf6d004ac006","year":2013},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.314849Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:9ff9f0c75d611646f4c740ac7f8b2d24bbcce7a5ab88d6e10055ace6d63ec86c","observation_id":"150dd83a-9ca7-4e1d-9ac8-8b98503bb2de","resolution":{"observed_at":"2026-08-07T14:26:29.372891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.256406Z","title":"Since ColBERT decomposes queries at the token level, which may not be suitable for decomposed sub-queries, we thus employ the Sentence-Bert model (Reimers,","venue":null,"work_id":"8cc58038-65f5-4aa2-a808-4ea6594b5e45","year":2016},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.466087Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:d9bb3d6c737fd7b5ffe54979dcc55c6bef7fd16be6b837746e4f987d32ae6963","observation_id":"b2bc6ff7-7a71-4e30-807f-53603675d950","resolution":{"observed_at":"2026-08-07T14:26:29.292661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.151424Z","title":null,"venue":null,"work_id":"c5272255-8a3e-4f40-863e-fcd903e5f2b2","year":2010},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.567497Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:9df1ecaedca0ef0283b1bd56391a18db4f681f4da6def9a1dfa6f3ed39c46f76","observation_id":"f712ec92-0eb8-4c74-8c48-389a8bb426d4","resolution":{"observed_at":"2026-08-07T14:26:29.195513Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.058517Z","title":null,"venue":null,"work_id":"924c3d50-6282-4540-a217-d42877ca1901","year":2022},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.667596Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:ea48292a107d757f5709dcbcd111d62bf3019d0542a0302968f367ae5a53739e","observation_id":"3838f15f-ef5d-4c72-9264-7fbc4142365b","resolution":{"observed_at":"2026-08-07T14:26:29.100348Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:28.985494Z","title":null,"venue":null,"work_id":"1d17d7a8-31e1-4925-b4d3-adc3724d6aef","year":2023},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.802349Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:572a3d617611395285fc8a190b914a810d16a02aafebc89034a6d043bf0f95e6","observation_id":"8d055540-b4d1-4998-be9e-e9e0781fd215","resolution":{"observed_at":"2026-08-07T14:26:29.019756Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:28.887593Z","title":null,"venue":null,"work_id":"49b6e232-ec8a-4fa3-9ce8-fc807f493073","year":2024},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:27.930361Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:ce4c0e29f547b0258a12c2dee030416e15aadfc55d7586a33c6680a456db8f4d","observation_id":"be6f0fbe-2d81-4a44-ac4a-ee86ae4a70dc","resolution":{"observed_at":"2026-08-07T14:26:28.933897Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:28.797036Z","title":"Comparison against the query rewrite strategy There is an emerging trend in the literature for rewriting user queries to maximize the RAG performance","venue":null,"work_id":"94c8da62-62e4-46a3-a468-8922dd7c92a2","year":2023},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:28.036559Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:e997632fc199146744fa80e0563f2ec5eb504e9359eac9d8f294cf7bc0e834de","observation_id":"e85b8703-c41f-4701-80e2-71c18fe99b54","resolution":{"observed_at":"2026-08-07T14:26:28.828006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T14:26:24.538174Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:24.538174Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:5e3a8ab156603cdb8bb4b1d1fde6cfece8ea60dabe3359aef51adcd4b53ddeb3","observation_id":"f4da702b-1e46-4a86-bf5d-8fcc9bbf29f3","resolution":{"observed_at":"2026-08-07T14:26:24.538174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18371","last_updated":"2023-10-26T11:11:07Z","snapshot_observed_at":"2026-08-13T05:39:58.381379Z","submitted_at":"2023-10-26T11:11:07Z","title":"In-Context Ability Transfer for Question Decomposition in Complex QA","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18371","snapshot_observed_at":"2026-08-07T14:26:24.739192Z","title":"In-context ability transfer for question decomposition in complex qa","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:24.739192Z"},"links":{"cited_paper":"/paper/2310.18371","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:e185a9fe836f93259d1a06fddd4d96aa4e94f8229dbf3c986369a070868bee8f","observation_id":"ca8294c4-b969-4842-a91b-5320d471793e","resolution":{"observed_at":"2026-08-07T14:26:24.739192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T14:26:25.043729Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.043729Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:213e738cf786c9e083432a082cebdbe5381e960365f14a4b7f9e7e5d13721915","observation_id":"5dcf8c6b-6eee-45ae-bb86-da27f13225e3","resolution":{"observed_at":"2026-08-07T14:26:25.043729Z","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-07T14:26:30.553911Z","title":"Query rewriting in retrieval-augmented large language mod- els","venue":null,"work_id":"664aee3c-220d-403a-b737-4231df4c9c81","year":2023},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.037050Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:e64d326a3b3bb41f8b594b9a52c38533298e11cc7eb50d056df1b6444ca04092","observation_id":"f924f9f3-ff27-47da-8874-a1f8c55f719c","resolution":{"observed_at":"2026-08-07T14:26:30.671738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:31.188608Z","title":"Latent reasoning for low-resource question generation","venue":null,"work_id":"844de7b6-93a3-4cde-99d8-c067a05deb8f","year":2021},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.510513Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:aa82c36c5cbb79f4485275471bb2956824ab4d53e199e1604cc58478ee248824","observation_id":"5e77dabd-dc68-40fd-beaf-e91705e763f9","resolution":{"observed_at":"2026-08-07T14:26:31.258801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2109.00590","last_updated":"2022-03-28T02:42:56Z","snapshot_observed_at":"2026-08-13T18:19:00.704830Z","submitted_at":"2021-09-01T19:43:59Z","title":"WebQA: Multihop and Multimodal QA","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00590","snapshot_observed_at":"2026-08-07T14:26:24.818434Z","title":"Chen, J., Kim, G., Sriram, A., Durrett, G., and Choi, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:24.818434Z"},"links":{"cited_paper":"/paper/2109.00590","citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:8f3cdab73dc22c6604b72205c5e2399ce8371c7ba73c2a021ddd72e690c57b6c","observation_id":"93af552f-7528-4f86-8363-e05ad6c596f2","resolution":{"observed_at":"2026-08-07T14:26:24.818434Z","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-07T14:26:31.455541Z","title":"and Callan, J","venue":null,"work_id":"78711399-07d7-4ef5-8da7-af8b1a89746c","year":2021},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.158438Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:d125650b1221a871fb13ab1956c1188af5ec77d4679116c26fa03745f9287af2","observation_id":"4da90eb5-8084-430f-9e6a-67c9684355c9","resolution":{"observed_at":"2026-08-07T14:26:31.543404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:30.754268Z","title":"A framework of knowledge graph-enhanced large language model based on question decomposition and atomic retrieval","venue":null,"work_id":"056a0e42-83b4-4841-9a1f-7dafbda9c946","year":2024},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:25.775323Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:0f1ae63d289ad5f3c11d24e0f14c104753e60c0d1ca8c958f0e6f35ea56a482a","observation_id":"c12c18ab-817b-4069-9937-56a6db61e190","resolution":{"observed_at":"2026-08-07T14:26:30.838793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:31.606765Z","title":"Semantic parsing on freebase from question-answer pairs","venue":null,"work_id":"9ca9c57a-47d1-404b-8431-dfaf245886c4","year":2013},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:24.645569Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:170d003c6fcb96d9b06612cb502d6b298b767082b3206d15f115bf2f06cf2090","observation_id":"a5881677-8531-4095-a066-927641370f0a","resolution":{"observed_at":"2026-08-07T14:26:31.666906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:26:29.883728Z","title":"Search-in-the-chain: Interactively enhancing large lan- guage models with search for knowledge-intensive tasks","venue":null,"work_id":"b01bf9af-e55b-4cd5-b164-810e095549de","year":2024},"citing_paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:26.681996Z"},"links":{"citing_paper":"/paper/2505.19189"},"observation_digest":"sha256:18172dadcb13857f1c1af53674ea2751856d1e7297c47ba8b744804f2f55a067","observation_id":"2811d108-72a7-457b-9207-2746a753a305","resolution":{"observed_at":"2026-08-07T14:26:29.926067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2505.19189","last_updated":"2025-06-01T01:41:09Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-12T00:42:48.923153Z","submitted_at":"2025-05-25T15:31:52Z","title":"POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":20},"total_outbound_references":37},"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 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2505.19189."}