{"as_of":"2026-08-22T22:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6e1684ae5b36108f5fcab5ea770a72c93ac02e71f73c70ae065b9f240f42537","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:18:47.167943Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:38:35.370291Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T16:53:40.450246Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-08-07T11:18:44.092100Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.092100Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:cc185edb59b4498f1a00ceffad3f17b21ab89d70a2061c7678ac30a3076f7688","observation_id":"de4a6875-e07e-4568-bf0a-176b9b285b0e","resolution":{"observed_at":"2026-08-07T11:18:44.092100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-08-06T23:26:51.542914Z","title":"Adaptive graph pruning for multi-agent communication,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.18019","last_updated":"2025-07-04T14:29:40Z","snapshot_observed_at":"2026-08-19T17:35:00.614412Z","submitted_at":"2025-06-22T12:59:12Z","title":"Graphs Meet AI Agents: Taxonomy, Progress, and Future Opportunities","version":3},"reference_index":114,"source":"pdf_text","source_observed_at":"2026-08-06T23:26:51.542914Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2506.18019"},"observation_digest":"sha256:ad0a3f5be3017b45063e3e179317b3a82db4d44e4e2032787831394b504e553c","observation_id":"863fa5aa-b4ef-40a2-ae4e-30b33698bb4e","resolution":{"observed_at":"2026-08-06T23:26:51.542914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-08-15T16:26:38.042533Z","title":"Adaptive Graph Pruning for Multi-Agent Communication, June 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05651","last_updated":"2025-09-06T09:03:36Z","snapshot_observed_at":"2026-08-18T01:04:19.110141Z","submitted_at":"2025-09-06T09:03:36Z","title":"Orchestrator: Active Inference for Multi-Agent Systems in Long-Horizon Tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:26:38.042533Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2509.05651"},"observation_digest":"sha256:9599a4a6eefcbd7f3cf4c946761446aeba6bddd9cc3476c0c6caac9544890c5d","observation_id":"c14edecc-a1cc-45bd-ac70-11ee25bcd54d","resolution":{"observed_at":"2026-08-15T16:26:38.042533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":"2506.02951","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-06-29T16:53:40.450246Z","title":"Adaptive graph pruning for multi-agent communication","venue":null,"work_id":"10733ea1-da5d-4115-93ef-488e1512ff8e","year":2025},"citing_paper":{"arxiv_id":"2511.20857","last_updated":"2026-05-18T16:18:02Z","snapshot_observed_at":"2026-08-20T12:55:17.970132Z","submitted_at":"2025-11-25T21:08:07Z","title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-14T23:13:15.016486Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2511.20857"},"observation_digest":"sha256:4301f5c1315a611c941744138ce7b6e2c671aac7ff163a95da427221c46c38d5","observation_id":"526522db-9735-4eed-a688-8b2bbd388c92","resolution":{"observed_at":"2026-05-14T23:13:16.179140Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":"2506.02951","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-06-29T16:53:40.450246Z","title":"Adaptive graph pruning for multi-agent communication","venue":null,"work_id":"10733ea1-da5d-4115-93ef-488e1512ff8e","year":2025},"citing_paper":{"arxiv_id":"2604.16543","last_updated":"2026-04-17T02:31:09Z","snapshot_observed_at":"2026-08-17T17:04:46.055501Z","submitted_at":"2026-04-17T02:31:09Z","title":"Conjunctive Prompt Attacks in Multi-Agent LLM Systems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-10T08:13:42.401992Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2604.16543"},"observation_digest":"sha256:9c78bea18793f3b4a1483088b673c6009416f9f245f6ad2cfa1151f44681da0c","observation_id":"e7913be0-9f9d-43af-8e33-fcacd6f197f0","resolution":{"observed_at":"2026-05-10T08:17:37.671876Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":"2506.02951","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-06-29T16:53:40.450246Z","title":"Adaptive graph pruning for multi-agent communication","venue":null,"work_id":"10733ea1-da5d-4115-93ef-488e1512ff8e","year":2025},"citing_paper":{"arxiv_id":"2605.17361","last_updated":"2026-07-09T07:36:31Z","snapshot_observed_at":"2026-08-15T21:54:16.502396Z","submitted_at":"2026-05-17T09:58:58Z","title":"MasFACT: Continual Multi-Agent Topology Learning via Geometry-Aware Posterior Transfer","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T14:35:46.376752Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2605.17361"},"observation_digest":"sha256:8ce68c384c095620385ef874d7948470f458585630dfb906a283cb56012d9c00","observation_id":"709dcbc3-94f2-4d6b-91b4-52dbbd826ede","resolution":{"observed_at":"2026-05-20T14:38:21.586795Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-07-12T16:38:30.296706Z","title":"Adaptive graph pruning for multi-agent communication.arXiv preprint arXiv:2506.02951, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.17361","last_updated":"2026-07-09T07:36:31Z","snapshot_observed_at":"2026-08-15T21:54:16.502396Z","submitted_at":"2026-05-17T09:58:58Z","title":"MasFACT: Continual Multi-Agent Topology Learning via Geometry-Aware Posterior Transfer","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T16:38:30.296706Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2605.17361"},"observation_digest":"sha256:95bfac70fddd8a34e7cf67f680abbeb7597089d5916477133078e4332a9ce993","observation_id":"91cc8139-0728-4336-be24-57f274e9d28c","resolution":{"observed_at":"2026-07-12T16:38:30.296706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":"2506.02951","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-06-29T16:53:40.450246Z","title":"Adaptive graph pruning for multi-agent communication","venue":null,"work_id":"10733ea1-da5d-4115-93ef-488e1512ff8e","year":2025},"citing_paper":{"arxiv_id":"2606.00765","last_updated":"2026-05-30T15:11:35Z","snapshot_observed_at":"2026-08-16T11:59:37.344693Z","submitted_at":"2026-05-30T15:11:35Z","title":"FALAT: Tracing Failures in LLM Agent Trajectories via Dependency-Guided Search","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T18:38:56.787942Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2606.00765"},"observation_digest":"sha256:27d45176cdd4d2a4722aff84c9ea64e5c1dc6ba473094bea577b7ea4a515cc53","observation_id":"f3dc26ea-d1d2-4c07-ba62-33ac6ab99b35","resolution":{"observed_at":"2026-06-28T18:42:29.562005Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":"2506.02951","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-06-29T16:53:40.450246Z","title":"Adaptive graph pruning for multi-agent communication","venue":null,"work_id":"10733ea1-da5d-4115-93ef-488e1512ff8e","year":2025},"citing_paper":{"arxiv_id":"2606.20621","last_updated":"2026-05-26T13:16:48Z","snapshot_observed_at":"2026-08-14T23:00:48.285362Z","submitted_at":"2026-05-26T13:16:48Z","title":"PEAR: Permutation-Equivariant Adaptive Routing Multi-Agent Debate","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-29T16:52:38.323900Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2606.20621"},"observation_digest":"sha256:4deea7a860e383450c20a637690220279866517be7575007ed1f14825786855c","observation_id":"5b51ec09-b23c-41a9-ad7b-2026b62ac983","resolution":{"observed_at":"2026-06-29T16:53:40.451745Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-07-31T23:30:37.739208Z","title":"Adaptive graph pruning for multi-agent communication,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23942","last_updated":"2026-07-27T02:38:59Z","snapshot_observed_at":"2026-08-06T10:12:30.858690Z","submitted_at":"2026-07-27T02:38:59Z","title":"From Cognitive Architectures to Language Agents: A Mechanism-Level Review of Lineage, Convergence, and Migration Gaps","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T23:30:37.739208Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2607.23942"},"observation_digest":"sha256:aff4d36ef3663e8c8c36f5b221669a031cb5efcfe49cb2180165fd4b37a6e894","observation_id":"90cb6b53-d4fa-4a94-97b5-d55bc11162ef","resolution":{"observed_at":"2026-07-31T23:30:37.739208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-08-14T04:35:56.346239Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.08605","last_updated":"2026-08-11T07:14:11Z","snapshot_observed_at":"2026-08-16T23:48:49.556147Z","submitted_at":"2026-08-09T09:38:52Z","title":"ForestBench: A Unified Graph Framework for Evaluating Multi-Agent Collaboration","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T04:35:56.346239Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2608.08605"},"observation_digest":"sha256:0c8de611074b037001a22246e80e126e90b96dfe1639d424dc141c8b1c6f0505","observation_id":"13d9416e-d0f8-42b6-b4e2-d727f2450c99","resolution":{"observed_at":"2026-08-14T04:35:56.346239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-08-15T20:38:35.370291Z","title":"arXiv preprint arXiv:2506.02951 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12921","last_updated":"2026-08-14T04:21:23Z","snapshot_observed_at":"2026-08-21T16:26:01.975085Z","submitted_at":"2026-08-13T08:03:02Z","title":"Discovering Efficient and Explainable Communication Topologies for LLM-based Multi-Agent Systems via Causal Inference","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T20:38:35.370291Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2608.12921"},"observation_digest":"sha256:ee4e2df469fad78aa0778f5672adcb4a76ad8db2882d40f8dc9f70cf93ebf469","observation_id":"b099d4ef-c616-4b7c-8841-40c17fd66086","resolution":{"observed_at":"2026-08-15T20:38:35.370291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.02951/citation-record","integrity":"/paper/2506.02951/integrity","json":"/paper/2506.02951/citation-record.json","paper":"/paper/2506.02951"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:18:51.832351Z","title":"Besta, N","venue":null,"work_id":"c50644da-d01a-4bfe-9bbd-a2e411c8abd0","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:41.581207Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:ad5b6dd5ab335637ad657fe877c989b959c6c3207b0dba31a87d7063d3eb35a5","observation_id":"b910c5b0-c24d-456f-b73b-857eda7290eb","resolution":{"observed_at":"2026-08-07T11:18:51.951081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:51.578268Z","title":null,"venue":null,"work_id":"2a6f5777-1a8f-4eb0-afee-735d2d09efda","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:41.678127Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:9c418e1417327a4f5f9ac28af8e255d898d118147ac4c99f5b9ab84c12774440","observation_id":"bb03c2cf-55e8-46ef-9339-dc5fda5a0b49","resolution":{"observed_at":"2026-08-07T11:18:51.692648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17288","last_updated":"2024-04-29T18:38:26Z","snapshot_observed_at":"2026-08-16T14:56:29.843666Z","submitted_at":"2023-09-29T14:46:30Z","title":"AutoAgents: A Framework for Automatic Agent Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17288","snapshot_observed_at":"2026-08-07T11:18:41.831841Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:41.831841Z"},"links":{"cited_paper":"/paper/2309.17288","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:4ea2615366794c4c871a15ac1d7ea4aac04d494c3eed9a2f768e6a1a538da6fe","observation_id":"fd5e7ea6-9862-429a-9ca7-593eac9d8350","resolution":{"observed_at":"2026-08-07T11:18:41.831841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02419","last_updated":"2024-06-04T21:20:33Z","snapshot_observed_at":"2026-08-16T14:12:54.897914Z","submitted_at":"2024-03-04T19:12:48Z","title":"Are More LLM Calls All You Need? Towards Scaling Laws of Compound Inference Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02419","snapshot_observed_at":"2026-08-07T11:18:41.961925Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:41.961925Z"},"links":{"cited_paper":"/paper/2403.02419","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:cc670db63b3e59e79976855fde67a6829c25718deb67203bf4c884dc2b7d088e","observation_id":"69c753b1-c500-4ef7-af71-757cf2840bd9","resolution":{"observed_at":"2026-08-07T11:18:41.961925Z","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-07T11:18:51.323609Z","title":null,"venue":null,"work_id":"e42ba5e3-f5dc-479f-9f16-97fd176842f3","year":2021},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.039257Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:756cc7935b0e86836d2c246b5a8aa7e2352656d451dbaf9a6c0290e4bcaf0db8","observation_id":"8374d701-288a-468a-aab0-89b632dfe15b","resolution":{"observed_at":"2026-08-07T11:18:51.463156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:51.089718Z","title":null,"venue":null,"work_id":"ea4cb833-fce4-42bb-af1d-3acb28c0dc1b","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.158607Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:b6fbb445804fcba3486d5586bd5599df1e5f3d4b06249aa70c2a7bf13fcfd11d","observation_id":"0f979198-a4b0-4301-8a0b-208d47a6eea0","resolution":{"observed_at":"2026-08-07T11:18:51.193761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T11:18:42.242385Z","title":"Cobbe, V","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.242385Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:6d10cff8371f606bb8cb7023a5aa75bb0a9991c6588c7407d6cca66406739f49","observation_id":"306fc23c-d317-4f01-9c9f-223a1fd69ae2","resolution":{"observed_at":"2026-08-07T11:18:42.242385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T11:18:42.328390Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.328390Z"},"links":{"cited_paper":"/paper/2305.14325","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:3514a2c88cb1e75d3e7ad84076ee3bb3794f2bc07dee25a5a0a9b5048d5737b8","observation_id":"b59d94cf-cc0a-4499-8389-11e029cd64ce","resolution":{"observed_at":"2026-08-07T11:18:42.328390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16797","last_updated":"2023-09-28T19:01:07Z","snapshot_observed_at":"2026-08-14T11:37:32.461743Z","submitted_at":"2023-09-28T19:01:07Z","title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16797","snapshot_observed_at":"2026-08-07T11:18:42.454284Z","title":"Fernando, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.454284Z"},"links":{"cited_paper":"/paper/2309.16797","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:9174639d5c7c5d59f4444eca9ebba2cb258254f8e8762eaac4cf56c7bb8885a2","observation_id":"cd00f561-4d8e-457f-9215-853c40887cc0","resolution":{"observed_at":"2026-08-07T11:18:42.454284Z","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-07T11:18:50.752775Z","title":null,"venue":null,"work_id":"f76d9688-2a1d-4498-9c4d-24e827da605c","year":2022},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.542298Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:a2d21b01bd32a56939b9e1b845c7b854176421f711e5b0560743f332325a11d1","observation_id":"78537f89-b0c2-4138-880a-28ec7b74c718","resolution":{"observed_at":"2026-08-07T11:18:50.934827Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08532","last_updated":"2025-05-01T11:56:52Z","snapshot_observed_at":"2026-08-21T11:33:21.306052Z","submitted_at":"2023-09-15T16:50:09Z","title":"EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08532","snapshot_observed_at":"2026-08-07T11:18:42.691961Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.691961Z"},"links":{"cited_paper":"/paper/2309.08532","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:b4525101363862950a26887395c62f8e09ae2b13d0fb16265d5179edfb5821e9","observation_id":"74857af2-446f-45f3-9db3-0459f5f9d124","resolution":{"observed_at":"2026-08-07T11:18:42.691961Z","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-07T11:18:50.453858Z","title":null,"venue":null,"work_id":"447ef50d-dce6-4024-9681-539ddb54d30a","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.803194Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:735e65814a162be8bafce79647fd95151806da6b3366c11fefef06858d6cb767","observation_id":"fe0dd39a-2e43-4388-beea-ca721633d85d","resolution":{"observed_at":"2026-08-07T11:18:50.588137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:50.148733Z","title":"Hendrycks, C","venue":null,"work_id":"e792a08b-d0fe-46f6-aba8-484aa751ba30","year":2021},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:42.930950Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:f751190896a421e8595ccc04d5ce9cf12424471aa48b14e580e03a14fafe7a1f","observation_id":"2f220f76-21eb-4f6a-96aa-609b813e3556","resolution":{"observed_at":"2026-08-07T11:18:50.294470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:49.821215Z","title":null,"venue":null,"work_id":"706fdd24-b772-45b3-bd0c-36f31c337c02","year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.049727Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:3e8cb9c215158ad7b9447cf2296a4a909f45d0261b5df515adc7fae4ea397a72","observation_id":"d4721ca8-983d-41e9-83f5-09a62f86970d","resolution":{"observed_at":"2026-08-07T11:18:49.946286Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:49.617766Z","title":null,"venue":null,"work_id":"86a7b029-704a-4055-8df1-421f36eed487","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.178951Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:b3e6b2205d142baebd447dd00f7edcb5071d1749078b2ce601c49701fffd5b12","observation_id":"8c7d2e6c-f451-486f-bde7-ce85ad893467","resolution":{"observed_at":"2026-08-07T11:18:49.693114Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08435","last_updated":"2025-03-02T05:13:28Z","snapshot_observed_at":"2026-08-06T11:45:45.286982Z","submitted_at":"2024-08-15T21:59:23Z","title":"Automated Design of Agentic Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08435","snapshot_observed_at":"2026-08-07T11:18:43.304670Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.304670Z"},"links":{"cited_paper":"/paper/2408.08435","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:d73011cd8ff12e74451db63cdbe4f882d146a5c6225a021dfe3e634d8fb45663","observation_id":"cb7e038c-4d99-4bb2-8c0e-da217acc0a9d","resolution":{"observed_at":"2026-08-07T11:18:43.304670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08550","last_updated":"2024-05-14T12:40:25Z","snapshot_observed_at":"2026-08-16T13:52:50.594931Z","submitted_at":"2024-05-14T12:40:25Z","title":"Learning Multi-Agent Communication from Graph Modeling Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08550","snapshot_observed_at":"2026-08-07T11:18:43.452061Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.452061Z"},"links":{"cited_paper":"/paper/2405.08550","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:c4b6ac392f37e36a0795ff60fd1dc2d6b3f126ee5f05599adc8bcc2c291ffb5e","observation_id":"70abaccb-c082-45ea-ae31-19ff9d009933","resolution":{"observed_at":"2026-08-07T11:18:43.452061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16946","last_updated":"2024-10-22T12:20:23Z","snapshot_observed_at":"2026-08-17T00:47:30.775865Z","submitted_at":"2024-10-22T12:20:23Z","title":"Self-Evolving Multi-Agent Collaboration Networks for Software Development","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16946","snapshot_observed_at":"2026-08-07T11:18:43.572297Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.572297Z"},"links":{"cited_paper":"/paper/2410.16946","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:8687f22c18d1070efbf17a675a19c4220ad3339aed5e604ff515fb4d5489f3e3","observation_id":"cd72863c-981f-48de-8f3f-a5690c06ab95","resolution":{"observed_at":"2026-08-07T11:18:43.572297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02183","last_updated":"2024-04-02T13:37:28Z","snapshot_observed_at":"2026-08-16T14:04:18.260936Z","submitted_at":"2024-04-02T13:37:28Z","title":"Self-Organized Agents: A LLM Multi-Agent Framework toward Ultra Large-Scale Code Generation and Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02183","snapshot_observed_at":"2026-08-07T11:18:43.770907Z","title":"Ishibashi and Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.770907Z"},"links":{"cited_paper":"/paper/2404.02183","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:dc5ccff6f0cac2490c04bf86371cce31d8328e6bd98ff73850c7d61eef3d520c","observation_id":"a34de830-fbe5-49ec-afda-4db6ebec76db","resolution":{"observed_at":"2026-08-07T11:18:43.770907Z","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-07T11:18:49.399331Z","title":"Jiang, X","venue":null,"work_id":"7b72d33e-0821-4e3e-a53e-7dc3e91526f1","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.885208Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:3c10c9621def4d8c955083aabce157a760549f51e912efd8419bee77c53a1d93","observation_id":"44cf69bb-105e-4c31-b619-7a31182896f0","resolution":{"observed_at":"2026-08-07T11:18:49.503751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03714","last_updated":"2023-10-05T17:37:25Z","snapshot_observed_at":"2026-08-04T05:21:05.846165Z","submitted_at":"2023-10-05T17:37:25Z","title":"DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03714","snapshot_observed_at":"2026-08-07T11:18:43.992573Z","title":"Khattab, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:43.992573Z"},"links":{"cited_paper":"/paper/2310.03714","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:d3d3974bd00be4f00c3eaa27606d79dc5256698276a5ad8624b9638f8617a45f","observation_id":"c9a49cda-2e96-45a5-a8a3-666af904a5f4","resolution":{"observed_at":"2026-08-07T11:18:43.992573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02951","snapshot_observed_at":"2026-08-07T11:18:44.092100Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.092100Z"},"links":{"cited_paper":"/paper/2506.02951","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:cc185edb59b4498f1a00ceffad3f17b21ab89d70a2061c7678ac30a3076f7688","observation_id":"de4a6875-e07e-4568-bf0a-176b9b285b0e","resolution":{"observed_at":"2026-08-07T11:18:44.092100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.04146","last_updated":"2017-10-23T16:45:03Z","snapshot_observed_at":"2026-08-14T21:01:22.490456Z","submitted_at":"2017-05-11T13:04:47Z","title":"Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.04146","snapshot_observed_at":"2026-08-07T11:18:44.207275Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.207275Z"},"links":{"cited_paper":"/paper/1705.04146","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:d13cf744baf52184bc6177d436b933a52cc01581aea3f55e4802df7cc7e71baf","observation_id":"b4dea7c3-2c84-484e-9495-a5316eb8bbd1","resolution":{"observed_at":"2026-08-07T11:18:44.207275Z","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-07T11:18:44.316529Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.316529Z"},"links":{"cited_paper":"/paper/2310.02170","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:527bcd4b9a91dc6af804aaec6cbb45de9580fc7709e167f5d0e5d47dce15c00c","observation_id":"48228321-ff7a-4e47-8d4b-2e45e389ee2c","resolution":{"observed_at":"2026-08-07T11:18:44.316529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.07191","last_updated":"2021-04-15T06:11:12Z","snapshot_observed_at":"2026-08-07T13:11:17.300265Z","submitted_at":"2021-03-12T10:23:47Z","title":"Are NLP Models really able to Solve Simple Math Word Problems?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.07191","snapshot_observed_at":"2026-08-07T11:18:44.448300Z","title":"Patel, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.448300Z"},"links":{"cited_paper":"/paper/2103.07191","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:ef95c5f3ce99c595365e3cdaa601a2949230dc8929a7035c0a4f4e9159036aa4","observation_id":"0214f49e-f20f-4945-80c2-202344f26fe1","resolution":{"observed_at":"2026-08-07T11:18:44.448300Z","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-07T11:18:49.210972Z","title":"Pesce and G","venue":null,"work_id":"debe694c-1fd3-4309-852d-37a996f9dfb1","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.539020Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:3015359a494ca0f24cea3a0b8a433c083d397b70e7531877f2d16897554d3620","observation_id":"d0e7f5d8-aa47-40f6-8af2-3be45af61185","resolution":{"observed_at":"2026-08-07T11:18:49.294700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:48.933687Z","title":null,"venue":null,"work_id":"71d10a8c-c243-4263-87ff-510f7e4c446d","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.689794Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:f0774b1972ba4b9e0de8f18477ae62f04e72819576bdb9b4b10134d2986c62ea","observation_id":"94fa6a01-c446-4867-ac8d-fca4eae062db","resolution":{"observed_at":"2026-08-07T11:18:49.083165Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07155","last_updated":"2025-03-17T00:22:42Z","snapshot_observed_at":"2026-08-19T21:56:01.787149Z","submitted_at":"2024-06-11T11:02:04Z","title":"Scaling Large Language Model-based Multi-Agent Collaboration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07155","snapshot_observed_at":"2026-08-07T11:18:44.814064Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.814064Z"},"links":{"cited_paper":"/paper/2406.07155","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:7b611b856d62f25de06701fa4d6c5de2de57f9bb52a0d8d23a22a32071408dbb","observation_id":"46d18bc3-19de-430f-8fe0-6b452a4a6a73","resolution":{"observed_at":"2026-08-07T11:18:44.814064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.01413","last_updated":"2016-08-20T11:50:41Z","snapshot_observed_at":"2026-08-18T09:21:00.040496Z","submitted_at":"2016-08-04T01:47:23Z","title":"Solving General Arithmetic Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.01413","snapshot_observed_at":"2026-08-07T11:18:44.940664Z","title":"Roy and D","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:44.940664Z"},"links":{"cited_paper":"/paper/1608.01413","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:bf282c84ddd1e689a239707831ecda19f53e13ae76e6876d95d3bdec3c88f9f5","observation_id":"57255405-a7e0-4657-a60f-333491071254","resolution":{"observed_at":"2026-08-07T11:18:44.940664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06153","last_updated":"2025-02-27T13:33:55Z","snapshot_observed_at":"2026-08-21T08:44:16.197423Z","submitted_at":"2024-10-08T15:52:42Z","title":"AgentSquare: Automatic LLM Agent Search in Modular Design Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06153","snapshot_observed_at":"2026-08-07T11:18:45.056024Z","title":"Shang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.056024Z"},"links":{"cited_paper":"/paper/2410.06153","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:d6a6873733be2b4b9912dadf27654d665e8e7cd0b44b4166372a7cebb81feaa2","observation_id":"d0b0fc20-4df0-4637-bf25-66e469b44c6b","resolution":{"observed_at":"2026-08-07T11:18:45.056024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11366","last_updated":"2023-10-10T05:21:45Z","snapshot_observed_at":"2026-08-17T19:15:32.679249Z","submitted_at":"2023-03-20T18:08:50Z","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11366","snapshot_observed_at":"2026-08-07T11:18:45.175031Z","title":"Shinn, B","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.175031Z"},"links":{"cited_paper":"/paper/2303.11366","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:201115c5128fc1854103d3e042b7d9674d5072059a100e488f7a7919f44fcb89","observation_id":"f1cd3a05-4eba-40c7-9e9f-d36ab10c8c49","resolution":{"observed_at":"2026-08-07T11:18:45.175031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16291","last_updated":"2023-10-19T16:27:03Z","snapshot_observed_at":"2026-08-13T16:55:46.498156Z","submitted_at":"2023-05-25T17:46:38Z","title":"Voyager: An Open-Ended Embodied Agent with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16291","snapshot_observed_at":"2026-08-07T11:18:45.265366Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.265366Z"},"links":{"cited_paper":"/paper/2305.16291","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:e0614ff67ed3a4cdc01b2500b02242dc0c10e7391a69bbcfcbc22e02dd56896b","observation_id":"22c2abe9-8bef-48bb-86ba-785636b9b620","resolution":{"observed_at":"2026-08-07T11:18:45.265366Z","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-07T11:18:45.385655Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.385655Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:df68ad697af5d9de906dd071c7470cb301b1f149aeb0d9786807fe1b566a1157","observation_id":"3227e5ce-6ea1-408a-b4b8-d727f169efe0","resolution":{"observed_at":"2026-08-07T11:18:45.385655Z","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-07T11:18:48.654224Z","title":null,"venue":null,"work_id":"c52a3891-179d-4144-95c0-41c06ede6efd","year":2022},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.546480Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:8fd23d7c7ce3ff4888a0a26733b39d40448b03a1585a9ac7516359e88522dbf7","observation_id":"e40db222-8ec6-4cf9-8f5b-dfbb4bc55ff2","resolution":{"observed_at":"2026-08-07T11:18:48.779426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:48.402555Z","title":null,"venue":null,"work_id":"f194f7dc-3a51-4191-b2d1-75951bf68333","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.646493Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:dae7fcb872d720a3c47c5316269ab7be13e9309b8c3eafb72bfbc8a328351f4d","observation_id":"8d51f70e-75fc-4882-b43e-9839eaf3e8be","resolution":{"observed_at":"2026-08-07T11:18:48.507409Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T11:18:48.172770Z","title":null,"venue":null,"work_id":"fbd0d94e-205d-4e23-bffa-47b52c5b5dd3","year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.791027Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:cfe3ca6440ed6642ec15fb4fc69bf15d6a1d20c659e621f3968203f8d79c4cc1","observation_id":"eb7000f5-a9fb-472a-8c52-7ecf6bcc0886","resolution":{"observed_at":"2026-08-07T11:18:48.276202Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14228","last_updated":"2025-03-10T02:42:01Z","snapshot_observed_at":"2026-08-16T13:41:08.794281Z","submitted_at":"2024-06-20T11:49:23Z","title":"EvoAgent: Towards Automatic Multi-Agent Generation via Evolutionary Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14228","snapshot_observed_at":"2026-08-07T11:18:45.889608Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.889608Z"},"links":{"cited_paper":"/paper/2406.14228","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:66070475c01e53eeb29c97bf5d580aebf925ddea0ce0b685f335e990ba886507","observation_id":"6f58b387-8234-4874-99d8-9f0d56a139a1","resolution":{"observed_at":"2026-08-07T11:18:45.889608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02506","last_updated":"2024-10-03T14:14:31Z","snapshot_observed_at":"2026-08-21T17:37:42.819116Z","submitted_at":"2024-10-03T14:14:31Z","title":"Cut the Crap: An Economical Communication Pipeline for LLM-based Multi-Agent Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02506","snapshot_observed_at":"2026-08-07T11:18:45.986822Z","title":"Zhang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:45.986822Z"},"links":{"cited_paper":"/paper/2410.02506","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:655d3aeef18f1fdb4bfaf77ce0ceaaed2c794689161a73d045d62d98f03a28cf","observation_id":"d1a0072a-f301-47d9-8a5c-7e868a7e5a8c","resolution":{"observed_at":"2026-08-07T11:18:45.986822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11782","last_updated":"2025-02-06T15:37:52Z","snapshot_observed_at":"2026-08-16T20:58:20.513341Z","submitted_at":"2024-10-15T17:01:21Z","title":"G-Designer: Architecting Multi-agent Communication Topologies via Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11782","snapshot_observed_at":"2026-08-07T11:18:46.099826Z","title":"Zhang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.099826Z"},"links":{"cited_paper":"/paper/2410.11782","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:49878eb765ebb9759644aae26b596821bcb0a3487deed30f51675d7b9a6d7375","observation_id":"cec72ef1-53a1-4642-bbf9-4f79bc6d90af","resolution":{"observed_at":"2026-08-07T11:18:46.099826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04180","last_updated":"2025-06-09T05:15:47Z","snapshot_observed_at":"2026-08-17T21:29:37.125066Z","submitted_at":"2025-02-06T16:12:06Z","title":"Multi-agent Architecture Search via Agentic Supernet","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04180","snapshot_observed_at":"2026-08-07T11:18:46.237941Z","title":"Zhang, L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.237941Z"},"links":{"cited_paper":"/paper/2502.04180","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:9c7de38725639bc04861a215b5a8f192e6eb4f83ead6d72d03b0ddecd43add4d","observation_id":"f5d90bcd-d383-4fd0-91eb-d7235b062fbb","resolution":{"observed_at":"2026-08-07T11:18:46.237941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02124","last_updated":"2024-05-27T11:12:45Z","snapshot_observed_at":"2026-08-16T14:55:27.994307Z","submitted_at":"2023-10-03T15:05:52Z","title":"Exploring Collaboration Mechanisms for LLM Agents: A Social Psychology View","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02124","snapshot_observed_at":"2026-08-07T11:18:46.316475Z","title":"Zhang, X","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.316475Z"},"links":{"cited_paper":"/paper/2310.02124","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:6c4ee5d381f8e49aa16db7325b3ee5fc35674a13ac1fcb082e0a58d3d2cbeb10","observation_id":"afcf7821-5f0e-457c-8df1-38c28bcd8f94","resolution":{"observed_at":"2026-08-07T11:18:46.316475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10762","last_updated":"2025-04-15T02:44:55Z","snapshot_observed_at":"2026-07-06T19:33:12.610676Z","submitted_at":"2024-10-14T17:40:40Z","title":"AFlow: Automating Agentic Workflow Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10762","snapshot_observed_at":"2026-08-07T11:18:46.411855Z","title":"Zhang, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.411855Z"},"links":{"cited_paper":"/paper/2410.10762","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:87388876b6b467ff829c9f9a6194bb45bee6bb1a6aa5a5cdf426775af451fe57","observation_id":"a72c9508-8c14-48f2-b680-91f1e825da70","resolution":{"observed_at":"2026-08-07T11:18:46.411855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.15209","last_updated":"2024-07-09T05:01:06Z","snapshot_observed_at":"2026-08-20T18:33:24.748433Z","submitted_at":"2023-11-26T06:38:16Z","title":"See and Think: Embodied Agent in Virtual Environment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.15209","snapshot_observed_at":"2026-08-07T11:18:46.557963Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.557963Z"},"links":{"cited_paper":"/paper/2311.15209","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:58de3dcc89aa924502cd0fe9811632a69d3cc2af453b6019c56b0f066527422a","observation_id":"77e60fa6-8c68-487c-8bd4-268cfe4ccbf3","resolution":{"observed_at":"2026-08-07T11:18:46.557963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08282","last_updated":"2024-03-18T05:03:53Z","snapshot_observed_at":"2026-08-19T13:58:50.680806Z","submitted_at":"2024-03-13T06:22:17Z","title":"Hierarchical Auto-Organizing System for Open-Ended Multi-Agent Navigation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08282","snapshot_observed_at":"2026-08-07T11:18:46.670093Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.670093Z"},"links":{"cited_paper":"/paper/2403.08282","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:376291459dd2810971da3d3cea61acbba57a7e1d731f3d20361824a96e8c570b","observation_id":"4cf03887-3e5d-4cbf-97e8-3b1abcf7464b","resolution":{"observed_at":"2026-08-07T11:18:46.670093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04619","last_updated":"2024-04-06T12:51:00Z","snapshot_observed_at":"2026-08-16T14:03:08.522492Z","submitted_at":"2024-04-06T12:51:00Z","title":"Do We Really Need a Complex Agent System? Distill Embodied Agent into a Single Model","version":1},"cited_work":{"arxiv_id":"2404.04619","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.04619","snapshot_observed_at":"2026-08-07T11:18:47.602333Z","title":"Do We Really Need a Complex Agent System? Distill Embodied Agent into a Single Model","venue":"cs.AI","work_id":"1a6e6cf1-21cb-4f13-a655-1038aaa83464","year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.772625Z"},"links":{"cited_paper":"/paper/2404.04619","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:dbec3dc83a396288e38074e29adf04758d368d99eda39050de809bd104ae1799","observation_id":"d0199a30-23c2-46a6-9a01-5fac88f204dc","resolution":{"observed_at":"2026-08-07T11:18:47.742570Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.24388","last_updated":"2025-03-31T17:59:52Z","snapshot_observed_at":"2026-08-19T18:41:48.581994Z","submitted_at":"2025-03-31T17:59:52Z","title":"RIG: Synergizing Reasoning and Imagination in End-to-End Generalist Policy","version":1},"cited_work":{"arxiv_id":"2503.24388","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.24388","snapshot_observed_at":"2026-08-07T11:18:47.352414Z","title":"RIG: Synergizing Reasoning and Imagination in End-to-End Generalist Policy","venue":"cs.AI","work_id":"d751c47e-adbf-4abd-a5e2-28160f86e7b1","year":2025},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.862570Z"},"links":{"cited_paper":"/paper/2503.24388","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:4cf824090b9155901f0e29403db8654b361f459c5602171f1e10f0260e295b05","observation_id":"0e418fa5-aaa0-4581-ab72-097aa2a8f0c1","resolution":{"observed_at":"2026-08-07T11:18:47.471736Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13373","last_updated":"2024-05-27T14:00:23Z","snapshot_observed_at":"2026-08-16T19:00:44.321598Z","submitted_at":"2023-11-22T13:15:42Z","title":"Large Language Model as a Policy Teacher for Training Reinforcement Learning Agents","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13373","snapshot_observed_at":"2026-08-07T11:18:46.991142Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:46.991142Z"},"links":{"cited_paper":"/paper/2311.13373","citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:455cb2f541720622fffe76034b4923833e80a528aa528d7811456f22a34608b3","observation_id":"8d5c5761-013b-439b-8053-a89b1157fb5b","resolution":{"observed_at":"2026-08-07T11:18:46.991142Z","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-07T11:18:48.013442Z","title":"Dialogue History","venue":null,"work_id":"cc872980-9ba0-4ffa-8fce-8043cc63730c","year":2024},"citing_paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:47.167943Z"},"links":{"citing_paper":"/paper/2506.02951"},"observation_digest":"sha256:56eb77721e6aaf09940df910019bf98fa533ad6a6c403f02bfcbb0ff517174eb","observation_id":"65225da3-726f-4913-b06e-a5bba3a8673f","resolution":{"observed_at":"2026-08-07T11:18:48.084252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.02951","last_updated":"2025-07-23T03:40:09Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T00:03:14.534757Z","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":2,"verified_fuzzy":5},"total_outbound_references":48},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 12 inbound Pith citation observations for arXiv:2506.02951."}