{"as_of":"2026-08-11T06:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92ee3c2ec80b09c591e107b2281066dba0b02bf72df6a6e710d410e0ff294ca3","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":23,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:37:40.476105Z","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-07-03T05:27:40.545965Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T21:05:25.809179Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2310.02170"},"observation_digest":"sha256:7399ff1bb477293a315df30baadb7e6a2a03200ff49cc4b8ae9f286615c7fa19","observation_id":"f3721202-a668-4fa2-81a1-eedc7ab15246","resolution":{"observed_at":"2026-05-21T21:05:25.968969Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-10T20:37:40.476105Z","title":"Five in a Row","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.07834","last_updated":"2025-02-23T06:20:37Z","snapshot_observed_at":"2026-08-10T21:57:38.451703Z","submitted_at":"2025-01-14T04:35:37Z","title":"Flow: Modularized Agentic Workflow Automation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T20:37:40.476105Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2501.07834"},"observation_digest":"sha256:338b7cd91debf30872c79620f82bfcae010dd115a78c6b0f1698c29b00c3d474","observation_id":"4ebe7805-4e46-4558-b13a-eac666afbb9f","resolution":{"observed_at":"2026-08-10T20:37:40.476105Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-06T18:12:39.729351Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08958","last_updated":"2025-07-15T22:55:30Z","snapshot_observed_at":"2026-08-10T20:27:21.008437Z","submitted_at":"2025-07-11T18:31:20Z","title":"Bridging Literature and the Universe Via A Multi-Agent Large Language Model System","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:12:39.729351Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2507.08958"},"observation_digest":"sha256:268d5ee92f528e0e2682264edc34b9fb170e1dc3a580120fd1eed65bdfa27a54","observation_id":"0a9f4bd4-4e2f-41c8-899a-88ec2d8a95a0","resolution":{"observed_at":"2026-08-06T18:12:39.729351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-06T17:37:11.837113Z","title":"Language agents as optimizable graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.10539","last_updated":"2025-07-14T17:57:45Z","snapshot_observed_at":"2026-08-09T14:14:07.441053Z","submitted_at":"2025-07-14T17:57:45Z","title":"Graph World Model","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:37:11.837113Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2507.10539"},"observation_digest":"sha256:11526712f077bc38e31bf2bd8a24231ddbe681efa57ecb617f0303c87c38d659","observation_id":"cce25671-f081-433d-a384-3e46d69ddd93","resolution":{"observed_at":"2026-08-06T17:37:11.837113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2510.07799","last_updated":"2026-05-16T23:46:00Z","snapshot_observed_at":"2026-07-06T22:32:07.945004Z","submitted_at":"2025-10-09T05:28:28Z","title":"Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T20:40:13.721163Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2510.07799"},"observation_digest":"sha256:9dddc8c31ac395b91a253c871664847308e7bca359d38a9a6ba4809585904c0b","observation_id":"2be9b05d-161b-443a-ae3e-eabad0f588b8","resolution":{"observed_at":"2026-05-21T20:40:35.652238Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-03T20:17:53.466265Z","title":"Zhuge, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.20639","last_updated":"2026-08-03T15:58:02Z","snapshot_observed_at":"2026-08-06T23:37:32.107617Z","submitted_at":"2025-11-25T18:56:57Z","title":"Latent Collaboration in Multi-Agent Systems","version":3},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-03T20:17:53.466265Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2511.20639"},"observation_digest":"sha256:ceb58e0bf8a0f689331aa9e339b9d0abb941b83dee47d730d3dff9707c9750db","observation_id":"9f1856bb-b1e3-4eba-a430-5f6da23da761","resolution":{"observed_at":"2026-08-03T20:17:53.466265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-04T06:52:33.636145Z","title":"Zhuge, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.20639","last_updated":"2026-08-03T15:58:02Z","snapshot_observed_at":"2026-08-06T23:37:32.107617Z","submitted_at":"2025-11-25T18:56:57Z","title":"Latent Collaboration in Multi-Agent Systems","version":4},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-04T06:52:33.636145Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2511.20639"},"observation_digest":"sha256:7ed881ecfdd798ca9cb22631f2e8f0bcbf6bec3e83203dda289b3633a75dffaa","observation_id":"9316d8ec-242f-4bc2-b58d-2e09a02d3d0b","resolution":{"observed_at":"2026-08-04T06:52:33.636145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-03T03:17:25.021493Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08567","last_updated":"2026-05-28T08:11:28Z","snapshot_observed_at":"2026-08-03T03:17:20.996807Z","submitted_at":"2026-02-09T12:06:07Z","title":"ValueFlow: Measuring the Propagation of Value Perturbations in Multi-Agent LLM Systems","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-03T03:17:25.021493Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2602.08567"},"observation_digest":"sha256:61bf1e07e31d70afbc2ff0d848f57338ff83d0edaa27f2720a661e10f69e0ec3","observation_id":"412c3700-c5d3-4992-a6bd-a15b1305be32","resolution":{"observed_at":"2026-08-03T03:17:25.021493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-02T22:58:14.460939Z","title":"Language agents as optimizable graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.15382","last_updated":"2026-05-28T08:46:27Z","snapshot_observed_at":"2026-08-03T23:19:36.572742Z","submitted_at":"2026-02-17T06:31:53Z","title":"The Vision Wormhole: Latent-Space Communication in Heterogeneous Multi-Agent Systems","version":2},"reference_index":108,"source":"arxiv_source","source_observed_at":"2026-08-02T22:58:14.460939Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2602.15382"},"observation_digest":"sha256:f100c5387e06d4eaab519fe0f1f302fdbea65d8082494ec0a8c1aa52c9f8eadd","observation_id":"88c1360d-58e0-4991-a6e0-c0b03a7f7662","resolution":{"observed_at":"2026-08-02T22:58:14.460939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2604.06452","last_updated":"2026-04-07T20:47:40Z","snapshot_observed_at":"2026-08-05T13:22:07.566013Z","submitted_at":"2026-04-07T20:47:40Z","title":"Learning to Interrupt in Language-based Multi-agent Communication","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-10T19:08:45.818851Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2604.06452"},"observation_digest":"sha256:4f6938c50aca162e5352a7f0d33a327c7c7277f937aceac880943df3c08f6eba","observation_id":"7195f635-e8d6-4222-b9b1-b1f26c3e49c5","resolution":{"observed_at":"2026-05-10T23:25:53.732225Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2604.09611","last_updated":"2026-03-12T10:10:37Z","snapshot_observed_at":"2026-08-11T02:59:48.123994Z","submitted_at":"2026-03-12T10:10:37Z","title":"Characterizing Performance-Energy Trade-offs of Large Language Models in Multi-Request Workflows","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-05-15T12:28:38.809950Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2604.09611"},"observation_digest":"sha256:b50a66d84f29e3412a456a6f9e4b510ebcd24daa9a2f839ce4c8e2542ad9716c","observation_id":"8dadc6c3-5b82-4c2a-b830-34d96d38b268","resolution":{"observed_at":"2026-05-15T12:30:00.258254Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2605.05657","last_updated":"2026-05-07T04:18:53Z","snapshot_observed_at":"2026-08-11T01:00:25.484074Z","submitted_at":"2026-05-07T04:18:53Z","title":"Retrieval-Conditioned Topology Selection with Provable Budget Conservation for Multi-Agent Code Generation","version":1},"reference_index":106,"source":"arxiv_source","source_observed_at":"2026-05-08T11:55:43.558721Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2605.05657"},"observation_digest":"sha256:d5752d79e75bb2580c86130026a1cd0e5380923a243ecc9ec43bf2e1913a7022","observation_id":"9f3d6f66-0688-46cf-b55e-7c32e60b1687","resolution":{"observed_at":"2026-05-11T19:26:09.769875Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2605.07073","last_updated":"2026-05-08T00:48:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-08T00:48:45Z","title":"TeamBench: Evaluating Agent Coordination under Enforced Role Separation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T00:55:51.358828Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2605.07073"},"observation_digest":"sha256:486f29a28203bfdc57c4f14f5ca5b4b9e420114f62e895c6d1073e1fc2027576","observation_id":"ea1dab9f-c23c-4b65-b3c1-951bf86203bf","resolution":{"observed_at":"2026-05-11T05:00:55.493472Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2605.08715","last_updated":"2026-05-13T23:06:48Z","snapshot_observed_at":"2026-08-10T21:09:02.826978Z","submitted_at":"2026-05-09T05:55:19Z","title":"AgentForesight: Online Auditing for Early Failure Prediction in Multi-Agent Systems","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-12T01:19:49.062330Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2605.08715"},"observation_digest":"sha256:47c778732eadd13b7bb40ae73594a276e81fec597135b060c6afec961e16bc5f","observation_id":"ff31cc33-5ccc-475a-9b17-8eeda9c1c651","resolution":{"observed_at":"2026-05-12T08:06:27.459570Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2605.08715","last_updated":"2026-05-13T23:06:48Z","snapshot_observed_at":"2026-08-10T21:09:02.826978Z","submitted_at":"2026-05-09T05:55:19Z","title":"AgentForesight: Online Auditing for Early Failure Prediction in Multi-Agent Systems","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:54.265411Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2605.08715"},"observation_digest":"sha256:24029fc6724b57daeb0cb45ec8d140f5eed4fedb5ae17297cf50732dee6cfcd6","observation_id":"f5b72905-7e0d-4289-a66e-8002092362d1","resolution":{"observed_at":"2026-05-15T05:25:03.858003Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2605.20425","last_updated":"2026-05-19T19:22:21Z","snapshot_observed_at":"2026-08-08T23:28:01.023904Z","submitted_at":"2026-05-19T19:22:21Z","title":"AgentCo-op: Retrieval-Based Synthesis of Interoperable Multi-Agent Workflows","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T07:05:28.416552Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2605.20425"},"observation_digest":"sha256:f8ec1b0f04e857bcdc5ad89e7ec07db6e33ff9ceeee136f73388ce9842c476f7","observation_id":"a1b32c1e-a707-4618-abd2-ef075bd731f5","resolution":{"observed_at":"2026-05-21T07:09:46.402726Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2605.28655","last_updated":"2026-05-27T15:56:12Z","snapshot_observed_at":"2026-07-06T23:38:14.056361Z","submitted_at":"2026-05-27T15:56:12Z","title":"AutoScientists: Self-Organizing Agent Teams for Long-Running Scientific Experimentation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T12:39:00.460842Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2605.28655"},"observation_digest":"sha256:72dbf74bdd59a8f884c08613e10308b226e39b94ce35cc682879f7f23508e24a","observation_id":"00cc6aa2-2965-4f10-b6f5-84a0fe5ac3a4","resolution":{"observed_at":"2026-06-29T12:43:25.731022Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2606.09498","last_updated":"2026-06-08T13:50:23Z","snapshot_observed_at":"2026-08-01T16:17:07.275923Z","submitted_at":"2026-06-08T13:50:23Z","title":"Self-Harness: Harnesses That Improve Themselves","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T16:25:59.583722Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2606.09498"},"observation_digest":"sha256:898e61d66b5e29610c4467ca0982478153069a10ce66a6b2c08274caf270c03e","observation_id":"06cfbb80-0fcc-4511-a42c-107c099d39bd","resolution":{"observed_at":"2026-07-03T01:37:30.804821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2606.10402","last_updated":"2026-06-09T04:25:28Z","snapshot_observed_at":"2026-08-10T22:28:25.702597Z","submitted_at":"2026-06-09T04:25:28Z","title":"Harnessing the Collective Intelligence of AI Agents in the Wild for New Discoveries","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T13:10:23.450482Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2606.10402"},"observation_digest":"sha256:d857b95c18ec1bd094da56299dd75e26ada6dcb19123dda80f2845c1c207797a","observation_id":"3819017e-4cc1-4cb9-b878-3b2fc8489f74","resolution":{"observed_at":"2026-07-03T05:27:40.547519Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":"2402.16823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-03T05:27:40.545965Z","title":"Language agents as optimizable graphs","venue":null,"work_id":"7f01c57e-b214-4a9e-8c4a-eb17a7acc5b7","year":2024},"citing_paper":{"arxiv_id":"2606.30602","last_updated":"2026-06-29T17:40:45Z","snapshot_observed_at":"2026-08-03T17:51:38.702679Z","submitted_at":"2026-06-29T17:40:45Z","title":"MESA: Prioritizing Vulnerable Communication Channels for Securing Multi-Agent Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T04:48:51.748711Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2606.30602"},"observation_digest":"sha256:0128e00dc5eb3d0002eb88892f88ea81054ecbdd7fca7f551f6e683634029ff8","observation_id":"8c966511-9b92-4a25-84b7-7c2a472b2b78","resolution":{"observed_at":"2026-06-30T16:14:53.924426Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-07-12T05:56:18.797766Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02942","last_updated":"2026-07-03T04:28:49Z","snapshot_observed_at":"2026-08-08T04:24:02.724600Z","submitted_at":"2026-07-03T04:28:49Z","title":"A Workflow-Aware Serving Layer for Agentic Applications","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-12T05:56:18.797766Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2607.02942"},"observation_digest":"sha256:e73bbe23b29cabf5f163c0a7f2e663fa337a6fe3b77d86a9c99a5f60b42427e8","observation_id":"3684d2f4-2e0d-4946-9b5c-eb6ce81a16e1","resolution":{"observed_at":"2026-07-12T05:56:18.797766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-01T05:22:44.352468Z","title":"Language Agents as Optimizable Graphs, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27578","last_updated":"2026-07-30T01:42:09Z","snapshot_observed_at":"2026-08-09T07:19:34.412868Z","submitted_at":"2026-07-30T01:42:09Z","title":"What makes prompts a graph: necessary and sufficient conditions for prompt graph engineering","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-01T05:22:44.352468Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2607.27578"},"observation_digest":"sha256:e6360fcaf2b0fc4bd5ffe91fadd5b322c30d45ec6b8cf22679b19e69aa160488","observation_id":"8d35ea0e-c75e-43fa-be59-1ce818377a7c","resolution":{"observed_at":"2026-08-01T05:22:44.352468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16823","snapshot_observed_at":"2026-08-03T00:55:42.213910Z","title":"arXiv preprint arXiv:2402.16823 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28636","last_updated":"2026-05-19T13:56:13Z","snapshot_observed_at":"2026-08-10T20:43:57.798906Z","submitted_at":"2026-05-19T13:56:13Z","title":"Chain-of-Models: Cross-Model Auditing for Bias-Robust LLM Judges","version":1},"reference_index":285,"source":"arxiv_source","source_observed_at":"2026-08-03T00:55:42.213910Z"},"links":{"cited_paper":"/paper/2402.16823","citing_paper":"/paper/2607.28636"},"observation_digest":"sha256:a6bdaf529909d6ce210a5499d192bda092ffc2b9251ec03f30c48b7456f1a82c","observation_id":"c51284e5-5956-4170-8c3c-881d461f6ee6","resolution":{"observed_at":"2026-08-03T00:55:42.213910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.16823/citation-record","integrity":"/paper/2402.16823/integrity","json":"/paper/2402.16823/citation-record.json","paper":"/paper/2402.16823"},"outbound":[],"paper":{"arxiv_id":"2402.16823","last_updated":"2024-08-22T13:06:51Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-01T23:06:25.314616Z","submitted_at":"2024-02-26T18:48:27Z","title":"Language Agents as Optimizable Graphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 23 inbound Pith citation observations for arXiv:2402.16823."}