{"as_of":"2026-08-07T20:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13e775eaee37ecbd7d2f9e3672dd8c9357c2fda3052d9267cf7f8b4534523985","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T11:01:33.318047Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.22621/citation-record","integrity":"/paper/2607.22621/integrity","json":"/paper/2607.22621/citation-record.json","paper":"/paper/2607.22621"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:27.594459Z","title":"Introducing gpt-5,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.594459Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:84f224153bb5fd623ff8dca9988f1bdd439ea09a2ed295e626cfd2d73a91d4e8","observation_id":"c7daca19-df08-4588-9b6f-5c175c519bc6","resolution":{"observed_at":"2026-08-02T11:01:27.594459Z","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-07-06T18:55:11.576666Z","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-02T11:01:27.649663Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.649663Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:a8904329d1ea62d4524e71fc504dfd0782eb255008d674c2f48135536838e050","observation_id":"40464fdf-d3b8-4e8e-aacb-9b01b8365e83","resolution":{"observed_at":"2026-08-02T11:01:27.649663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-02T11:01:27.712477Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.712477Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:a53042cb1fd97adbbe474df4dfbd49361344d61cd07831c1962022b59e354f44","observation_id":"772c3f2e-6c36-4cac-a620-d6ed33f244c7","resolution":{"observed_at":"2026-08-02T11:01:27.712477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-02T11:01:27.776078Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.776078Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:a157b6f238c82a8df2d00895a0546f3b51c5aad8973ee67e07a67fe39a0d2579","observation_id":"d296791c-8c1e-4122-b7ed-e9b79f878995","resolution":{"observed_at":"2026-08-02T11:01:27.776078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.00051","last_updated":"2017-04-28T03:53:14Z","snapshot_observed_at":"2026-07-06T05:36:07.769337Z","submitted_at":"2017-03-31T20:39:10Z","title":"Reading Wikipedia to Answer Open-Domain Questions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.00051","snapshot_observed_at":"2026-08-02T11:01:27.835674Z","title":"Reading wikipedia to answer open-domain questions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.835674Z"},"links":{"cited_paper":"/paper/1704.00051","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:cd51d515764e0ef98f58565493072af2af72f49f9b485231497f4853cb1a934c","observation_id":"2c2d80f2-c84c-4c00-bbb6-0818b3556ef8","resolution":{"observed_at":"2026-08-02T11:01:27.835674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.11401","last_updated":"2021-04-12T15:42:18Z","snapshot_observed_at":"2026-08-07T05:44:30.677502Z","submitted_at":"2020-05-22T21:34:34Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.11401","snapshot_observed_at":"2026-08-02T11:01:27.899870Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.899870Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:38722bddc0f6bb717c462a21daffe8bae3f97fa96a824b17350edd45750bd9a2","observation_id":"0b82f92b-3fc4-4018-b6ab-8a055cb0949e","resolution":{"observed_at":"2026-08-02T11:01:27.899870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-02T11:01:27.958951Z","title":"Dense passage retrieval for open-domain question answering,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:27.958951Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:8af8c881d4ecdc5db608472992dfa1c8855ae5f1c3586648bfc18b301b8114d5","observation_id":"3ff3292d-6f10-4e96-803d-71e34af85ec9","resolution":{"observed_at":"2026-08-02T11:01:27.958951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:28.015408Z","title":"Neural approaches to conversational ai: Question answering, task-oriented dialogues and social chatbots,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.015408Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:ac649605bf09eed4c52e8edf58754887c03ffc128bd270e0dd5552875b213264","observation_id":"056ed0df-42d8-4cc7-b69e-7544d1ac3857","resolution":{"observed_at":"2026-08-02T11:01:28.015408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:28.091965Z","title":"Establishing and maintaining long-term human-computer relationships,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.091965Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:3cbae490cd59b6dd62e44c669e53eaebd6b2e6183a1aa3d1d48c872bd984eb8c","observation_id":"f9eda9b8-1199-4003-8cf7-8eb7561a6aab","resolution":{"observed_at":"2026-08-02T11:01:28.091965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05138","last_updated":"2023-12-19T00:40:51Z","snapshot_observed_at":"2026-07-06T16:16:41.582815Z","submitted_at":"2023-09-10T21:15:42Z","title":"GenAIPABench: A Benchmark for Generative AI-based Privacy Assistants","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05138","snapshot_observed_at":"2026-08-02T11:01:28.177127Z","title":"Genaipabench: A benchmark for generative ai-based privacy assistants,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.177127Z"},"links":{"cited_paper":"/paper/2309.05138","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:aae6d20e85b35f48dbe15d9a2530874f558d9920365ec7dc9a02f665a1a610fa","observation_id":"bf78b49d-0123-4969-82f0-9dc91b0718bd","resolution":{"observed_at":"2026-08-02T11:01:28.177127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.21015","last_updated":"2025-02-07T23:27:07Z","snapshot_observed_at":"2026-08-06T12:15:04.691746Z","submitted_at":"2024-05-31T17:04:18Z","title":"The rising costs of training frontier AI models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.21015","snapshot_observed_at":"2026-08-02T11:01:28.249200Z","title":"The rising costs of training frontier ai models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.249200Z"},"links":{"cited_paper":"/paper/2405.21015","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:22fb9bdbc1e757d302753b993a06f8c740b394d4069635dcc5f5e4b7d882e046","observation_id":"04b4a209-a1f9-4284-b2c2-e9b5688c6a2c","resolution":{"observed_at":"2026-08-02T11:01:28.249200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:28.339511Z","title":"Energy and policy considerations for deep learning in NLP,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.339511Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:06cbbcf0107bb2d379b138c463539ee7c312179e48eb1468ccea5a19090c7927","observation_id":"70e78a88-83ac-4480-9e4d-7ab33290072c","resolution":{"observed_at":"2026-08-02T11:01:28.339511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.05149","last_updated":"2022-04-11T14:30:27Z","snapshot_observed_at":"2026-08-05T16:48:50.205106Z","submitted_at":"2022-04-11T14:30:27Z","title":"The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.05149","snapshot_observed_at":"2026-08-02T11:01:28.429406Z","title":"The carbon footprint of machine learning training will plateau, then shrink,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.429406Z"},"links":{"cited_paper":"/paper/2204.05149","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:ff263f58ada040d8ebf25c59bf75cce448afe19df2a9476ccae5bdba97a17182","observation_id":"336a890d-19bc-4214-a4c4-69f841119a69","resolution":{"observed_at":"2026-08-02T11:01:28.429406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:28.543625Z","title":"Chain-of-thought prompting elicits reasoning in large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.543625Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:e332ecd481048f451d2bdf43240f0192a67c1b8dca17a4073b2d2e9a29296787","observation_id":"442a240d-db6e-4bb6-ad29-77244eceb6cb","resolution":{"observed_at":"2026-08-02T11:01:28.543625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:28.657957Z","title":"Measuring short-form factuality in large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.657957Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:85b009ee348b279f48303b1e28f852029272208d753d29c9afdf747801eeea20","observation_id":"fa52fd15-179c-4f45-8246-9dbe3fc2659a","resolution":{"observed_at":"2026-08-02T11:01:28.657957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04506","last_updated":"2025-02-06T21:13:44Z","snapshot_observed_at":"2026-08-07T17:42:37.442236Z","submitted_at":"2025-02-06T21:13:44Z","title":"When One LLM Drools, Multi-LLM Collaboration Rules","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04506","snapshot_observed_at":"2026-08-02T11:01:28.811145Z","title":"When one llm drools, multi-llm collaboration rules,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.811145Z"},"links":{"cited_paper":"/paper/2502.04506","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:df31ef12e413e7602db9a1cb0da950617945295d037efa017a92018395d5ac0d","observation_id":"f1f1892b-688b-41de-9c5c-4de407a05089","resolution":{"observed_at":"2026-08-02T11:01:28.811145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:28.924771Z","title":"Ensemble methods in machine learning,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:28.924771Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:be1cdc63dc3a683d3c103ae256a61ac666a6cf2cfd513e3a55e20122dd90f922","observation_id":"6c1b5ccb-3a98-4322-8660-49e82b0caae0","resolution":{"observed_at":"2026-08-02T11:01:28.924771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:29.029593Z","title":"Prompt design and engineering: Introduction and advanced methods,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.029593Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:eeb8dd513b9f98cf54fb2c2cdc8cec6f820170ef172e4459f1fa5cfab9b38f17","observation_id":"a7508b28-4e4d-47de-a288-7f8fa8092598","resolution":{"observed_at":"2026-08-02T11:01:29.029593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:29.130027Z","title":"Reducing hallucinations in large language models: A consensus voting approach using mixture of experts,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.130027Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:f9cd9776fbd9a581521d5c5fe8bee88deb815a8b89a86c3f16a8f760aebc774f","observation_id":"2695c6a1-5bc4-425b-980d-4e87f1d52d05","resolution":{"observed_at":"2026-08-02T11:01:29.130027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05757","last_updated":"2025-02-22T10:48:18Z","snapshot_observed_at":"2026-08-07T17:56:38.238944Z","submitted_at":"2025-02-22T10:48:18Z","title":"Uncertainty-Aware Fusion: An Ensemble Framework for Mitigating Hallucinations in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05757","snapshot_observed_at":"2026-08-02T11:01:29.339897Z","title":"Uncertainty-aware fusion: An ensemble framework for mitigating hallucinations in large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.339897Z"},"links":{"cited_paper":"/paper/2503.05757","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:5dacbc6fc3032a82f2d6edbed958164755cdbc86443db2aa81439ce341b654fa","observation_id":"480115d9-467e-4f0b-9d40-29f3dd596766","resolution":{"observed_at":"2026-08-02T11:01:29.339897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02561","last_updated":"2023-06-30T21:39:54Z","snapshot_observed_at":"2026-08-05T15:27:19.717152Z","submitted_at":"2023-06-05T03:32:26Z","title":"LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02561","snapshot_observed_at":"2026-08-02T11:01:29.440785Z","title":"Llm-blender: Ensembling large language models with pairwise ranking and generative fusion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.440785Z"},"links":{"cited_paper":"/paper/2306.02561","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:498302d0c6ad589f16de959fdbac7bac67ed3b508eda8d1a26d2bbaa6842c5ff","observation_id":"42958fc3-d9e3-4267-a06b-abbfc2a90ab8","resolution":{"observed_at":"2026-08-02T11:01:29.440785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:29.573503Z","title":"[Online]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.573503Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:1b1f82b91787040d12482c1ea378a3e2790d77bb85a8bd835de16b1a23160392","observation_id":"3fccd97e-ab86-47db-b43a-feda34dd6ba0","resolution":{"observed_at":"2026-08-02T11:01:29.573503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:29.693931Z","title":"Palimpzest: Optimizing AI-powered analytics with declarative query processing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.693931Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:5640e27049c0a9d33e289f8e19e5d7ad5d8e7b7e63b592919ff93e05da95e8bb","observation_id":"304f70f3-dc84-4131-90ce-1e3502168240","resolution":{"observed_at":"2026-08-02T11:01:29.693931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:29.811696Z","title":"Bao: Making learned query optimization practical,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.811696Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:f4238c75b994b061f47db08fcc8d22f4e812a4e00b8df53b319141e136ac7a01","observation_id":"46a219a2-3cdb-406d-b4d9-036d1cabc91d","resolution":{"observed_at":"2026-08-02T11:01:29.811696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:29.894077Z","title":"Cardinality estimation in dbms: a comprehensive benchmark evaluation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:29.894077Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:cda7f03824a45f3a3fd05ef0b7dc4bb6dc79e08e740b845388cac4368b4e64ea","observation_id":"ed7dc210-3da7-4cc9-8643-6caf48bd4a17","resolution":{"observed_at":"2026-08-02T11:01:29.894077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06902","last_updated":"2025-03-10T04:07:56Z","snapshot_observed_at":"2026-08-07T17:18:04.430505Z","submitted_at":"2025-03-10T04:07:56Z","title":"A Query Optimization Method Utilizing Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06902","snapshot_observed_at":"2026-08-02T11:01:30.006953Z","title":"A query opti- mization method utilizing large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.006953Z"},"links":{"cited_paper":"/paper/2503.06902","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:a2349e1e1140ad476c54eb4ec2d13702d7780178317bffed39de51b29ffd21ea","observation_id":"c8facb7d-544f-49f6-a8c4-d365c41f555f","resolution":{"observed_at":"2026-08-02T11:01:30.006953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.091575Z","title":"Lero: A learning-to-rank query optimizer,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.091575Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:e01ad4f1b0cd37f488cf7dee8f8b1b37b5871b3d0c526bda9bb1750fb86de17f","observation_id":"3e9382f4-67c7-45eb-9215-16897a814234","resolution":{"observed_at":"2026-08-02T11:01:30.091575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.207561Z","title":"Dspy: Compiling declarative language model calls into self-improving pipelines,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.207561Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:39f7d5d008dd9ee3f4e259ab0c18c4c5e9b8e244bfc4c572000cd73f92b4c3d9","observation_id":"54282f41-d545-46a9-b021-79fe8a7fe1c0","resolution":{"observed_at":"2026-08-02T11:01:30.207561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.291857Z","title":"Frugalgpt: How to use large language models while reducing cost and improving performance,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.291857Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:2a399288761cff3be96b2d35be8885bd9ce3c697d6dba85853e100c32754502e","observation_id":"39f3577f-b0ee-4419-9dd3-58d07cd7a8db","resolution":{"observed_at":"2026-08-02T11:01:30.291857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03953","last_updated":"2024-10-04T22:31:15Z","snapshot_observed_at":"2026-08-06T08:05:53.917806Z","submitted_at":"2024-10-04T22:31:15Z","title":"LLM-TOPLA: Efficient LLM Ensemble by Maximising Diversity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03953","snapshot_observed_at":"2026-08-02T11:01:30.495871Z","title":"Llm-topla: Efficient llm ensemble by maximising diversity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.495871Z"},"links":{"cited_paper":"/paper/2410.03953","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:18dbcc3ec0345aa38f9884dbf208ed635932b68b9a6f7e7e7f31fb7e43a62f14","observation_id":"126ef2f8-33b5-4d09-aa76-2b40fab99027","resolution":{"observed_at":"2026-08-02T11:01:30.495871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.604585Z","title":"Thriftllm: On cost-effective selection of large language models for classification queries,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.604585Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:4152eb7038e113da6d3a01d633e855235574b0d1a0be4abc8afe823d668190d9","observation_id":"3a6eed1d-6301-41ab-b35d-65e6fb1e971a","resolution":{"observed_at":"2026-08-02T11:01:30.604585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01742","last_updated":"2024-01-29T16:36:31Z","snapshot_observed_at":"2026-07-06T17:24:33.169277Z","submitted_at":"2024-01-29T16:36:31Z","title":"Towards Optimizing the Costs of LLM Usage","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01742","snapshot_observed_at":"2026-08-02T11:01:30.701488Z","title":"Towards optimizing the costs of llm usage,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.701488Z"},"links":{"cited_paper":"/paper/2402.01742","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:f3dc466e1d8bc5fe71aeb1ec3911354f73b05905e893e49022c43dbe17c73408","observation_id":"1dab3295-76bd-493a-8e78-956d4c549b19","resolution":{"observed_at":"2026-08-02T11:01:30.701488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.805172Z","title":"Querying large language models with sql,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.805172Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:b98ecca1fa7060676376fea275f0131c53df18129ce0686f7d0698f565e5df71","observation_id":"d3b7b4b9-059a-4bcf-a0d7-83374683a12b","resolution":{"observed_at":"2026-08-02T11:01:30.805172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.890518Z","title":"Abacus: A cost-based optimizer for semantic operator systems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.890518Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:170cc698ffbea2b971d98c4dda7cfac37ec991c293c7f2a983cdea39da639fc8","observation_id":"ccdf3d29-d819-43c5-9c8c-925e3d158d88","resolution":{"observed_at":"2026-08-02T11:01:30.890518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:30.984685Z","title":"The stretto execution engine for llm-augmented data systems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.984685Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:7d2b3e502039a15935bb6b792aef9df6dd21d7a36587917306429356954b11d6","observation_id":"63c41dc3-9de6-47c8-958c-682af25f8f98","resolution":{"observed_at":"2026-08-02T11:01:30.984685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:31.084318Z","title":"Does size matter? on the influence of ensemble size on constructing ensembles of dispatching rules,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.084318Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:475502cc3fea39f7ac303031dd3ca7194e87fe067d9465298ec7d911fc6d24a3","observation_id":"18144bba-04ab-4d44-ad1a-da0acc8094d1","resolution":{"observed_at":"2026-08-02T11:01:31.084318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:31.200508Z","title":"ML.ENERGY leaderboard,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.200508Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:acf50ea73fc0942effb3f9e3b9cdcf6e9e6d528143dd76ac467dcf1294bb8b1b","observation_id":"9c866fdd-c371-4ed2-8d9c-ad5fbd0f9714","resolution":{"observed_at":"2026-08-02T11:01:31.200508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:31.377971Z","title":"A fast and elitist multiobjective genetic algorithm: Nsga-ii,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.377971Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:faf3216eda125f95aceef31b072a6b6de58b3f206f9fc44cc43651df126a92f8","observation_id":"24042e4d-6c12-4318-b7de-2a57e16b9a4a","resolution":{"observed_at":"2026-08-02T11:01:31.377971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:31.498864Z","title":"Opti-q extended version,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.498864Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:6d46619b65c1674fb5d7351bafc2c6646e8abcae451a6a35ec0aca7f99797d11","observation_id":"b9a012ee-1433-45e7-b991-f1616933b71e","resolution":{"observed_at":"2026-08-02T11:01:31.498864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06102","last_updated":"2022-09-29T22:14:43Z","snapshot_observed_at":"2026-07-06T13:41:11.010175Z","submitted_at":"2022-08-12T03:50:53Z","title":"Zeus: Understanding and Optimizing GPU Energy Consumption of DNN Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.06102","snapshot_observed_at":"2026-08-02T11:01:31.576930Z","title":"Zeus: Understanding and optimizing gpu energy consumption of dnn training,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.576930Z"},"links":{"cited_paper":"/paper/2208.06102","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:d9a587d9ffeac7f32b1d79b1d43a4aa34aa6fa805a52e04c118f812a696e62bd","observation_id":"7c9334c4-4d20-4989-94e0-86f8baab13d0","resolution":{"observed_at":"2026-08-02T11:01:31.576930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:31.697489Z","title":"A fast randomized algorithm for multi- objective query optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.697489Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:e1de4945feb1a06ce2a89f034b907b0dff52d9308fc0e28942283f92dffa5cfa","observation_id":"4549846a-b386-4439-92e2-cde59c61eb44","resolution":{"observed_at":"2026-08-02T11:01:31.697489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:31.809939Z","title":"[Online]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.809939Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:bc6a69800a315ed17704789bba5acfb7682986c829232c2248dc0bcdfbac874f","observation_id":"9066f999-48bb-4831-b170-b77c48ed8977","resolution":{"observed_at":"2026-08-02T11:01:31.809939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10225","last_updated":"2024-10-30T02:58:14Z","snapshot_observed_at":"2026-07-06T17:17:31.008185Z","submitted_at":"2024-01-18T18:59:11Z","title":"ChatQA: Surpassing GPT-4 on Conversational QA and RAG","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10225","snapshot_observed_at":"2026-08-02T11:01:31.933576Z","title":"Chatqa: Surpassing gpt-4 on conversational qa and rag,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:31.933576Z"},"links":{"cited_paper":"/paper/2401.10225","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:6653885bf3267800f3f9c503b28be0bb7281b74e06abbf02335b6d7cd2165a39","observation_id":"d41f6094-d82f-4a21-a6b5-0694840d7b59","resolution":{"observed_at":"2026-08-02T11:01:31.933576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-02T11:01:32.033711Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.033711Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:4633219120febe40b83e794b8ac9c48a3ada172ca725cb39681454dd147288a8","observation_id":"88ea943a-8d7b-46bf-9716-71f2399f0a5f","resolution":{"observed_at":"2026-08-02T11:01:32.033711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08905","last_updated":"2024-12-12T03:37:41Z","snapshot_observed_at":"2026-08-05T04:04:21.846023Z","submitted_at":"2024-12-12T03:37:41Z","title":"Phi-4 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08905","snapshot_observed_at":"2026-08-02T11:01:32.188980Z","title":"Phi-4 technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.188980Z"},"links":{"cited_paper":"/paper/2412.08905","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:852541ecacaa38dcc9964aca5f3ee72ca572c2f7ad43a90a4cde2e0288d97dd5","observation_id":"54dfb086-8947-4da1-af10-e9f286a6ee43","resolution":{"observed_at":"2026-08-02T11:01:32.188980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-02T11:01:32.314700Z","title":"Mistral 7b,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.314700Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:9f9d98106439d2961548a9eef8bae104f918899515b0d3b659ba97c32e94747f","observation_id":"e187a45a-2668-4844-b66a-ef3cf3c9c12c","resolution":{"observed_at":"2026-08-02T11:01:32.314700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:32.413319Z","title":"Benchmarking llms via uncertainty quantification,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.413319Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:3ad64f9cf6c45f41c2f85624a511b1beabee73ffac3c791e7d08bc6b4835b5aa","observation_id":"82bd6bb1-4669-4586-b694-f65485a91c5a","resolution":{"observed_at":"2026-08-02T11:01:32.413319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.05794","last_updated":"2022-03-11T08:35:15Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T08:35:15Z","title":"BERTopic: Neural topic modeling with a class-based TF-IDF procedure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.05794","snapshot_observed_at":"2026-08-02T11:01:32.517321Z","title":"Bertopic: Neural topic modeling with a class-based tf-idf procedure,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.517321Z"},"links":{"cited_paper":"/paper/2203.05794","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:112130bf0ec2d560b2eea3c5b076afa7119a8f67582e2f3d9600458229d4927e","observation_id":"4cd1d4c6-f912-4815-98bc-a4604be401cb","resolution":{"observed_at":"2026-08-02T11:01:32.517321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03426","last_updated":"2020-09-18T01:56:41Z","snapshot_observed_at":"2026-08-02T15:32:07.466568Z","submitted_at":"2018-02-09T19:39:33Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03426","snapshot_observed_at":"2026-08-02T11:01:32.671440Z","title":"Umap: Uniform manifold approximation and projection for dimension reduction,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.671440Z"},"links":{"cited_paper":"/paper/1802.03426","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:399177a339c41774edab4a2a351085746fab6166d5d4920cd2da43d28a5ec281","observation_id":"ad337888-a176-4f4e-bf63-3a4c6eab915a","resolution":{"observed_at":"2026-08-02T11:01:32.671440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:32.768346Z","title":"hdbscan: Hierarchical density based clustering","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.768346Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:75fa411a0c1bc3403ce2c3b28b600bb49f29dc170a29ac46eee248680fd04a77","observation_id":"572d4b1a-f6dd-4db0-b07b-2b7ae8ccbb8c","resolution":{"observed_at":"2026-08-02T11:01:32.768346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:32.919603Z","title":"Large lan- guage models are zero-shot reasoners,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:32.919603Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:c92f0d8c522b8115c3fd71322e26e4a8c25b4b723cde8513de3dd6386784a520","observation_id":"89e1afb2-c132-4cb3-96f3-2c1be1101fd4","resolution":{"observed_at":"2026-08-02T11:01:32.919603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:33.005209Z","title":"Language mod- els are few-shot learners,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:33.005209Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:ce1ca63b8f132da824ee0635d90b1afdb67e23bf0d9b1c09e410bcb1cdad3c63","observation_id":"2a147653-42b8-4481-a856-8a3f517a6240","resolution":{"observed_at":"2026-08-02T11:01:33.005209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:33.090481Z","title":"Bleu: a method for automatic evaluation of machine translation,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:33.090481Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:7ee8d9c4c26a2dafa92c146f5ae600d00f5143408e34de8edea196b98dfcec63","observation_id":"75ddf24c-0946-4ead-8696-2c995f01a9bd","resolution":{"observed_at":"2026-08-02T11:01:33.090481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T11:01:33.194188Z","title":"ROUGE: A package for automatic evaluation of summaries,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:33.194188Z"},"links":{"citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:6a7548169c8b3a787a3243cec31bf88562fd4d045bf709561bd9cc848b6ea747","observation_id":"36fe29f5-b1d2-4a92-a581-0c423108ac99","resolution":{"observed_at":"2026-08-02T11:01:33.194188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18036","last_updated":"2026-04-22T02:19:48Z","snapshot_observed_at":"2026-08-02T22:41:05.099083Z","submitted_at":"2025-02-25T09:48:53Z","title":"Harnessing Multiple Large Language Models: A Survey on LLM Ensemble","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18036","snapshot_observed_at":"2026-08-02T11:01:33.318047Z","title":"Harnessing multiple large language models: A survey on llm ensemble,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:33.318047Z"},"links":{"cited_paper":"/paper/2502.18036","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:23dd942801dc951a2d9ba6070f369f4579a9733a1b7200995f14ab1e624fd2b7","observation_id":"80b9415c-bd4a-4c9b-b9b7-88b8dc7a352c","resolution":{"observed_at":"2026-08-02T11:01:33.318047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-07-31T18:33:34.529799Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-02T11:01:30.368894Z","title":"Available: https://arxiv.org/abs/2305.05176","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T11:01:30.368894Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2607.22621"},"observation_digest":"sha256:ec81b6df049ae20fe8d58730d0ee8195b342671a33521e83ff0ad8455b04f1b1","observation_id":"dc627731-fd93-4eb2-961d-98424c411da5","resolution":{"observed_at":"2026-08-02T11:01:30.368894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22621","last_updated":"2026-06-17T02:43:58Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T07:28:37.776856Z","submitted_at":"2026-06-17T02:43:58Z","title":"Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":56},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.22621."}