{"as_of":"2026-08-15T20:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd76beca5a0574c71abcc53d7886c85f06bc6d5bd60f8d66f75c491929b54b88","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:29:37.840638Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.14563","last_updated":"2025-02-20T13:47:51Z","snapshot_observed_at":"2026-08-14T16:17:03.269090Z","submitted_at":"2025-02-20T13:47:51Z","title":"Plan-over-Graph: Towards Parallelable LLM Agent Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14563","snapshot_observed_at":"2026-08-06T23:26:46.304893Z","title":"Plan-over- graph: Towards parallelable llm agent schedule,","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-12T12:16:56.653983Z","submitted_at":"2025-06-22T12:59:12Z","title":"Graphs Meet AI Agents: Taxonomy, Progress, and Future Opportunities","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T23:26:46.304893Z"},"links":{"cited_paper":"/paper/2502.14563","citing_paper":"/paper/2506.18019"},"observation_digest":"sha256:69743222190f1fc1706c81976e9ebbc60a5bbbf5bb0772f67d71066fc1830b1f","observation_id":"bc73a47d-0e9e-48ac-967b-3408a3cde61c","resolution":{"observed_at":"2026-08-06T23:26:46.304893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14563","last_updated":"2025-02-20T13:47:51Z","snapshot_observed_at":"2026-08-14T16:17:03.269090Z","submitted_at":"2025-02-20T13:47:51Z","title":"Plan-over-Graph: Towards Parallelable LLM Agent Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14563","snapshot_observed_at":"2026-08-06T12:52:01.614901Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.21407","last_updated":"2025-08-30T06:01:56Z","snapshot_observed_at":"2026-08-15T03:27:34.517290Z","submitted_at":"2025-07-29T00:27:12Z","title":"Graph-Augmented Large Language Model Agents: Current Progress and Future Prospects","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-06T12:52:01.614901Z"},"links":{"cited_paper":"/paper/2502.14563","citing_paper":"/paper/2507.21407"},"observation_digest":"sha256:9c436cf628571f20339925675a6c6b610be62436e1e857007bdca906909fd882","observation_id":"fe61eb80-ed21-4fa9-a1c0-8fd4820ca2b1","resolution":{"observed_at":"2026-08-06T12:52:01.614901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14563","last_updated":"2025-02-20T13:47:51Z","snapshot_observed_at":"2026-08-14T16:17:03.269090Z","submitted_at":"2025-02-20T13:47:51Z","title":"Plan-over-Graph: Towards Parallelable LLM Agent Schedule","version":1},"cited_work":{"arxiv_id":"2502.14563","doi":"10.48550/arxiv.2502.14563","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14563","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Plan-over-graph: Towards parallelable LLM agent schedule.CoRR, abs/2502.14563, 2025","venue":"ArXiv.org","work_id":"b8f8576f-6c67-40b3-b122-718f18f26689","year":2025},"citing_paper":{"arxiv_id":"2607.01942","last_updated":"2026-07-02T09:34:20Z","snapshot_observed_at":"2026-07-07T00:07:28.231599Z","submitted_at":"2026-07-02T09:34:20Z","title":"Atomic Task Graph: A Unified Framework for Agentic Planning and Execution","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-03T13:59:31.697155Z"},"links":{"cited_paper":"/paper/2502.14563","citing_paper":"/paper/2607.01942"},"observation_digest":"sha256:c441e29bf9f0e7d4379f6302107337cd1a42f463668f9a2d427901d80487aca2","observation_id":"59875c5a-a4ec-4b05-a1a1-e0fdf8fdbc97","resolution":{"observed_at":"2026-07-03T14:08:21.352402Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14563","last_updated":"2025-02-20T13:47:51Z","snapshot_observed_at":"2026-08-14T16:17:03.269090Z","submitted_at":"2025-02-20T13:47:51Z","title":"Plan-over-Graph: Towards Parallelable LLM Agent Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14563","snapshot_observed_at":"2026-08-01T22:01:12.920513Z","title":"Plan-over- Graph: Towards parallelable LLM agent schedule,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22689","last_updated":"2026-07-17T12:48:03Z","snapshot_observed_at":"2026-08-09T16:08:16.303983Z","submitted_at":"2026-07-17T12:48:03Z","title":"Beyond Sequential Interaction: Benchmarking Parallel Execution and Coordination for GUI Agents","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T22:01:12.920513Z"},"links":{"cited_paper":"/paper/2502.14563","citing_paper":"/paper/2607.22689"},"observation_digest":"sha256:965f7702ad6154a2e9c8d3f24f7088da3bd33fecd2af2544d89945598c412668","observation_id":"cf1ef71c-ecd5-4fd0-aa26-3270f22ac232","resolution":{"observed_at":"2026-08-01T22:01:12.920513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14563","last_updated":"2025-02-20T13:47:51Z","snapshot_observed_at":"2026-08-14T16:17:03.269090Z","submitted_at":"2025-02-20T13:47:51Z","title":"Plan-over-Graph: Towards Parallelable LLM Agent Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14563","snapshot_observed_at":"2026-08-07T23:29:37.840638Z","title":"arXiv preprint arXiv:2502.14563 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05791","last_updated":"2026-08-06T09:26:24Z","snapshot_observed_at":"2026-08-14T06:08:53.789510Z","submitted_at":"2026-08-06T09:26:24Z","title":"A Two-Tier Perspective on Inference-Time Parallelism in Multi-Agent LLM Systems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T23:29:37.840638Z"},"links":{"cited_paper":"/paper/2502.14563","citing_paper":"/paper/2608.05791"},"observation_digest":"sha256:4579e99b7999799a066250f6de2fc3c66874587725ae737c25ca2b138b01cf74","observation_id":"f0b4c1e8-1052-4b6b-960a-e3aebca7950a","resolution":{"observed_at":"2026-08-07T23:29:37.840638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.14563/citation-record","integrity":"/paper/2502.14563/integrity","json":"/paper/2502.14563/citation-record.json","paper":"/paper/2502.14563"},"outbound":[],"paper":{"arxiv_id":"2502.14563","last_updated":"2025-02-20T13:47:51Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T16:17:03.269090Z","submitted_at":"2025-02-20T13:47:51Z","title":"Plan-over-Graph: Towards Parallelable LLM Agent Schedule"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2502.14563."}