{"as_of":"2026-08-10T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0bc97a15b2826aff3dd3f21b531fc9dfc1ef01b066cfafcd91c7aa782e235108","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:16:21.483149Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:19:53.618384Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22192","snapshot_observed_at":"2026-08-04T09:19:53.618384Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.19838","last_updated":"2026-06-16T02:29:48Z","snapshot_observed_at":"2026-08-09T18:26:00.398528Z","submitted_at":"2025-10-18T00:45:37Z","title":"Branch-and-Browse: Efficient and Controllable Web Exploration with Tree-Structured Reasoning and Action Memory","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T09:19:53.618384Z"},"links":{"cited_paper":"/paper/2505.22192","citing_paper":"/paper/2510.19838"},"observation_digest":"sha256:094e8d5e7398d903b9e584c34fd3c496a8046515cf526c825bb612628245d1bd","observation_id":"f0a8434f-cc44-4124-aca6-ae454513f7d6","resolution":{"observed_at":"2026-08-04T09:19:53.618384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22192","snapshot_observed_at":"2026-08-01T00:32:23.761399Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26212","last_updated":"2026-07-28T19:26:50Z","snapshot_observed_at":"2026-08-06T02:06:44.605975Z","submitted_at":"2026-07-28T19:26:50Z","title":"Multi-Agent Debate Strategies: Survey, Taxonomy, and Challenges","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T00:32:23.761399Z"},"links":{"cited_paper":"/paper/2505.22192","citing_paper":"/paper/2607.26212"},"observation_digest":"sha256:58ae5d68f283d39a836521d0f662a0d51d8b6c2e7f1addb038b0eb80037994af","observation_id":"011cecdb-e124-4473-bcd1-1e5a50d0e33d","resolution":{"observed_at":"2026-08-01T00:32:23.761399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.22192/citation-record","integrity":"/paper/2505.22192/integrity","json":"/paper/2505.22192/citation-record.json","paper":"/paper/2505.22192"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.14325","last_updated":"2023-05-23T17:55:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T17:55:11Z","title":"Improving Factuality and Reasoning in Language Models through Multiagent Debate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14325","snapshot_observed_at":"2026-08-07T13:16:19.597111Z","title":"Improving factuality and reasoning in language models through multiagent debate,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:19.597111Z"},"links":{"cited_paper":"/paper/2305.14325","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:963b2652890857c871616d620dffc9a74e8ab216f9c8ccda00e86dc2bbac13ed","observation_id":"e3683dd6-2dbf-4da2-b776-9deafc21c250","resolution":{"observed_at":"2026-08-07T13:16:19.597111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08155","last_updated":"2023-10-03T20:47:10Z","snapshot_observed_at":"2026-08-08T22:28:26.004138Z","submitted_at":"2023-08-16T05:57:52Z","title":"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08155","snapshot_observed_at":"2026-08-07T13:16:19.685225Z","title":"Autogen: Enabling next-gen llm applications via multi-agent conversation framework,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:19.685225Z"},"links":{"cited_paper":"/paper/2308.08155","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:73e510cfd2d37885a4cd17db5ce73881601d424463e3354ffc619aea72fe0fe2","observation_id":"d699502b-ccf1-45cf-852a-f25c2ccb4242","resolution":{"observed_at":"2026-08-07T13:16:19.685225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05120","last_updated":"2024-10-11T09:38:40Z","snapshot_observed_at":"2026-08-09T10:40:49.501861Z","submitted_at":"2024-02-03T05:55:24Z","title":"More Agents Is All You Need","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05120","snapshot_observed_at":"2026-08-07T13:16:19.791117Z","title":"More agents is all you need,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:19.791117Z"},"links":{"cited_paper":"/paper/2402.05120","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:1f320b432d3991bdba0b54d4f74a517eab5c78c011c856afdae70ae6151cef81","observation_id":"b9c735de-dd20-4ef2-bf26-0675e8a2035d","resolution":{"observed_at":"2026-08-07T13:16:19.791117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00262","last_updated":"2024-02-01T01:17:46Z","snapshot_observed_at":"2026-08-10T17:36:09.175452Z","submitted_at":"2024-02-01T01:17:46Z","title":"Computational Experiments Meet Large Language Model Based Agents: A Survey and Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00262","snapshot_observed_at":"2026-08-07T13:16:19.873822Z","title":"Computational experiments meet large language model based agents: A survey and perspective,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:19.873822Z"},"links":{"cited_paper":"/paper/2402.00262","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:e18dedb7e9dd35fd1539b47246e0515cc37116cead481fc26944e2a00a57c277","observation_id":"c972a376-bbff-4106-aa57-6940afd04fb5","resolution":{"observed_at":"2026-08-07T13:16:19.873822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07864","last_updated":"2023-09-19T08:29:18Z","snapshot_observed_at":"2026-08-09T18:54:02.679174Z","submitted_at":"2023-09-14T17:12:03Z","title":"The Rise and Potential of Large Language Model Based Agents: A Survey","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07864","snapshot_observed_at":"2026-08-07T13:16:19.983174Z","title":"The rise and potential of large language model based agents: A survey,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:19.983174Z"},"links":{"cited_paper":"/paper/2309.07864","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:52613e9df4d8c76a48f1de8f0024a1fc65da69568bb2f6df2c26d04a2705eb44","observation_id":"5bb7575d-c537-4f00-bd2c-57a34a1dbc92","resolution":{"observed_at":"2026-08-07T13:16:19.983174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02170","last_updated":"2024-11-15T04:30:04Z","snapshot_observed_at":"2026-08-07T04:49:42.215176Z","submitted_at":"2023-10-03T16:05:48Z","title":"A Dynamic LLM-Powered Agent Network for Task-Oriented Agent Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02170","snapshot_observed_at":"2026-08-07T13:16:20.062821Z","title":"Dynamic llm-agent network: An llm-agent collaboration framework with agent team optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.062821Z"},"links":{"cited_paper":"/paper/2310.02170","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:309b809aeb394a6a4878674edd5e971980f580e8f74346ff62185668575172a8","observation_id":"73ca2157-22ff-408f-98c0-a47875f55b6a","resolution":{"observed_at":"2026-08-07T13:16:20.062821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.02364","last_updated":"2024-05-03T06:32:07Z","snapshot_observed_at":"2026-08-09T10:40:57.982562Z","submitted_at":"2024-05-03T06:32:07Z","title":"A Survey on Contribution Evaluation in Vertical Federated Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.02364","snapshot_observed_at":"2026-08-07T13:16:20.137727Z","title":"A survey on contribution evaluation in vertical federated learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.137727Z"},"links":{"cited_paper":"/paper/2405.02364","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:e72686fce6d2b794e3546c96efd4b64e83b049038c09aa30582fc45afb44d4da","observation_id":"54cef82e-45d1-4839-b18c-d2db5635b513","resolution":{"observed_at":"2026-08-07T13:16:20.137727Z","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-07T13:16:24.024858Z","title":"Survey on contribution evaluation for federated learning,","venue":null,"work_id":"49f392ba-fd13-426a-92bf-96ec19d83748","year":2022},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.213483Z"},"links":{"citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:08d8c908cd46587b4a944b0e73c017634a9a6689bf05fab5abe607e9545c781f","observation_id":"2ab31d35-1413-431c-bb16-d2dbaabb8558","resolution":{"observed_at":"2026-08-07T13:16:24.087073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03515","last_updated":"2025-02-10T10:10:45Z","snapshot_observed_at":"2026-08-09T10:42:03.991976Z","submitted_at":"2023-07-07T11:08:18Z","title":"Incentive Allocation in Vertical Federated Learning Based on Bankruptcy Problem","version":3},"cited_work":{"arxiv_id":"2307.03515","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.03515","snapshot_observed_at":"2026-08-07T13:16:22.472747Z","title":"Incentive Allocation in Vertical Federated Learning Based on Bankruptcy Problem","venue":"cs.LG","work_id":"f0f4eccd-94e8-491a-8ebd-54ef3dac1845","year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.279247Z"},"links":{"cited_paper":"/paper/2307.03515","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:46d1cbaa9408a2292216ec01afdbf45c73330b50b6eb2675ef7be32a0b32e890","observation_id":"192b2e43-d92c-47a0-8916-8ba04fab3b8a","resolution":{"observed_at":"2026-08-07T13:16:22.534500Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15247","last_updated":"2024-02-23T10:21:07Z","snapshot_observed_at":"2026-08-09T10:41:33.249883Z","submitted_at":"2024-02-23T10:21:07Z","title":"A Bargaining-based Approach for Feature Trading in Vertical Federated Learning","version":1},"cited_work":{"arxiv_id":"2402.15247","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.15247","snapshot_observed_at":"2026-08-07T13:16:22.295137Z","title":"A Bargaining-based Approach for Feature Trading in Vertical Federated Learning","venue":"cs.LG","work_id":"c9362296-d71b-4a42-b476-3d65139066f7","year":2024},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.355404Z"},"links":{"cited_paper":"/paper/2402.15247","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:77cd9b16ad2f099b97e58e58caae72485438e7d128e0a2f57e67e3f9ec85d00d","observation_id":"605dd47a-b50e-4eb6-a8cb-59d97033df3d","resolution":{"observed_at":"2026-08-07T13:16:22.372938Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:16:23.820229Z","title":"Efficient participant contribution evaluation for horizontal and vertical federated learning,","venue":null,"work_id":"9b282829-e13a-4dd2-b7f6-78b2686f2f5f","year":2022},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.431398Z"},"links":{"citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:d6b491976dbc29de94c7d50316e849f765ac795de197654faa670c6df5c4a6b4","observation_id":"c1df1953-a198-420d-82f9-e3a89d761480","resolution":{"observed_at":"2026-08-07T13:16:23.909005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.00233","last_updated":"2023-07-01T05:45:23Z","snapshot_observed_at":"2026-08-09T13:20:17.408688Z","submitted_at":"2023-07-01T05:45:23Z","title":"Hierarchical Federated Learning Incentivization for Gas Usage Estimation","version":1},"cited_work":{"arxiv_id":"2307.00233","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.00233","snapshot_observed_at":"2026-08-07T13:16:22.096439Z","title":"Hierarchical Federated Learning Incentivization for Gas Usage Estimation","venue":"cs.LG","work_id":"66caddda-63e0-4787-a9e7-00aceaaf7a84","year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.518521Z"},"links":{"cited_paper":"/paper/2307.00233","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:2f5cccc0761a7553051a1f27898e30e9b85a1513a45727f694a7fc5fce57deff","observation_id":"c1bb7f01-41bb-4666-b36c-6670304e487e","resolution":{"observed_at":"2026-08-07T13:16:22.197126Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.03736","last_updated":"2023-09-07T14:25:35Z","snapshot_observed_at":"2026-08-10T17:36:11.779370Z","submitted_at":"2023-09-07T14:25:35Z","title":"TradingGPT: Multi-Agent System with Layered Memory and Distinct Characters for Enhanced Financial Trading Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.03736","snapshot_observed_at":"2026-08-07T13:16:20.583371Z","title":"Tradinggpt: Multi- agent system with layered memory and distinct characters for enhanced financial trading performance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.583371Z"},"links":{"cited_paper":"/paper/2309.03736","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:53559112d1b5f80e23f413fd00ef38b3ddd0075c5d9a1e93ee39d86cb234597b","observation_id":"1962d965-c2a9-44db-8c25-6967305bcde5","resolution":{"observed_at":"2026-08-07T13:16:20.583371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10537","last_updated":"2024-06-04T23:47:43Z","snapshot_observed_at":"2026-07-06T16:49:04.651019Z","submitted_at":"2023-11-16T11:47:58Z","title":"MedAgents: Large Language Models as Collaborators for Zero-shot Medical Reasoning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10537","snapshot_observed_at":"2026-08-07T13:16:20.679329Z","title":"Medagents: Large language models as collaborators for zero-shot medical reasoning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.679329Z"},"links":{"cited_paper":"/paper/2311.10537","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:abac09e2ea61ea235a5556b42878cb3ca4a396bb62afbd125b9c1e9e33dcb100","observation_id":"6226bf2a-f805-4095-a318-d172b6807443","resolution":{"observed_at":"2026-08-07T13:16:20.679329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07201","last_updated":"2023-08-14T15:13:04Z","snapshot_observed_at":"2026-08-02T01:34:38.978920Z","submitted_at":"2023-08-14T15:13:04Z","title":"ChatEval: Towards Better LLM-based Evaluators through Multi-Agent Debate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07201","snapshot_observed_at":"2026-08-07T13:16:20.779271Z","title":"Chateval: Towards better llm-based evaluators through multi- agent debate,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.779271Z"},"links":{"cited_paper":"/paper/2308.07201","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:2dfd5c0c90cff7c93900a4a0906b2464e6444f8f076676bba7f68411396e1161","observation_id":"3b87b2b3-99fc-4348-ad15-872e2c36b98b","resolution":{"observed_at":"2026-08-07T13:16:20.779271Z","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-07T13:16:23.608951Z","title":"Examining inter- consistency of large language models collaboration: An in-depth analysis via debate,","venue":null,"work_id":"c89c8320-4973-4d25-83fe-24f2e1006fbd","year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.868446Z"},"links":{"citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:fde488fec0edb8037b2cf74c6396010abdae5047ce45c3c9bf717f119d25d424","observation_id":"a21369eb-375c-4824-9b6d-e512457b57c3","resolution":{"observed_at":"2026-08-07T13:16:23.689646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17760","last_updated":"2023-11-02T17:34:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-31T01:09:00Z","title":"CAMEL: Communicative Agents for \"Mind\" Exploration of Large Language Model Society","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17760","snapshot_observed_at":"2026-08-07T13:16:20.953096Z","title":"Camel: Communicative agents for","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:20.953096Z"},"links":{"cited_paper":"/paper/2303.17760","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:7bcaca9659e2d16e2554022148375709da5ec050f0c24490258f1a09d18873e9","observation_id":"06eddc09-a7ed-42ed-861d-94d77ab17c9d","resolution":{"observed_at":"2026-08-07T13:16:20.953096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15395","last_updated":"2024-12-16T08:57:29Z","snapshot_observed_at":"2026-08-10T12:14:15.935006Z","submitted_at":"2023-12-24T03:37:11Z","title":"Prompt Valuation Based on Shapley Values","version":2},"cited_work":{"arxiv_id":"2312.15395","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.15395","snapshot_observed_at":"2026-08-07T13:16:21.691344Z","title":"Prompt Valuation Based on Shapley Values","venue":"cs.CL","work_id":"feb3c198-718a-4db9-aaa2-aa624ceec721","year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:21.052427Z"},"links":{"cited_paper":"/paper/2312.15395","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:13a94a67d275d5d50036169ac4abe9b8b6e1a99f10bcc302fe1591b99ee334ca","observation_id":"f8c1bb0f-bba1-4f29-ac5c-7f12846f4f7e","resolution":{"observed_at":"2026-08-07T13:16:21.796758Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:16:23.357953Z","title":"Llm-blender: Ensembling large language models with pairwise ranking and generative fusion,","venue":null,"work_id":"bc1ce42a-1dc4-4fef-82a5-63ec89e7d911","year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:21.193450Z"},"links":{"citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:4c97ea4e62c49a726361a470e7fdf67bc4215f70886e0c38e8eb5da88752f8b4","observation_id":"023a3a62-934a-43f4-b0fb-55b5ac731bf5","resolution":{"observed_at":"2026-08-07T13:16:23.458976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17563","last_updated":"2024-03-28T13:59:09Z","snapshot_observed_at":"2026-07-06T15:48:44.267376Z","submitted_at":"2023-06-30T11:32:25Z","title":"Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17563","snapshot_observed_at":"2026-08-07T13:16:21.292940Z","title":"Large language models are effective text rankers with pairwise ranking prompting,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:21.292940Z"},"links":{"cited_paper":"/paper/2306.17563","citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:775cb8d5d3cd8356e05c47b181292d8aa8c516f51906f7e14baa4bab6e29959c","observation_id":"89561aa7-546f-4374-93aa-6ed99bb7101e","resolution":{"observed_at":"2026-08-07T13:16:21.292940Z","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-07T13:16:22.874754Z","title":"<copy other agents’ responses>","venue":null,"work_id":"072c8ab3-25c9-4a5d-8530-59346b061f8b","year":null},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:21.483149Z"},"links":{"citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:a2e87b1e25c74c5b2068505857b49b455627d5bdb96f3c1f901ebd6f759ec0cb","observation_id":"1d2d51d9-9b1c-497c-98ca-47a51b8d48af","resolution":{"observed_at":"2026-08-07T13:16:22.974811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:16:23.093791Z","title":"<copy other agents’ responses>","venue":null,"work_id":"5f3cd636-df33-441e-ab0b-524ed76c5b36","year":null},"citing_paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:21.377379Z"},"links":{"citing_paper":"/paper/2505.22192"},"observation_digest":"sha256:98690fc1814ef0deec3a848776756abfa4ff27facebdb1950b02aa2763a90914","observation_id":"7148a935-b145-438d-8307-0b04b396cfee","resolution":{"observed_at":"2026-08-07T13:16:23.202979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22192","last_updated":"2025-05-28T10:08:31Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-09T10:40:05.985582Z","submitted_at":"2025-05-28T10:08:31Z","title":"Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":4,"verified_fuzzy":6},"total_outbound_references":22},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 2 inbound Pith citation observations for arXiv:2505.22192."}