{"as_of":"2026-08-05T18:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5fd2627d0c70ddb020f7839ef4b33270e95d220c401e5dc453f2b80d4430f486","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T06:20:48.009002Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T07:51:12.700912Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.23626","snapshot_observed_at":"2026-07-13T05:38:27.357469Z","title":"Tao Feng, Haozhen Zhang, Zijie Lei, Peixuan Han, and Jiaxuan You","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08940","last_updated":"2026-07-18T17:05:31Z","snapshot_observed_at":"2026-08-02T07:51:10.193975Z","submitted_at":"2026-07-09T21:09:05Z","title":"TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T05:38:27.357469Z"},"links":{"cited_paper":"/paper/2604.23626","citing_paper":"/paper/2607.08940"},"observation_digest":"sha256:d380b06356f2e13c6df958c5417789f426e2a691d52ecb4541329006a8f3ea6c","observation_id":"db682290-236f-48c2-b194-c09b9c581f0f","resolution":{"observed_at":"2026-07-13T05:38:27.357469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.23626","snapshot_observed_at":"2026-08-02T07:51:12.700912Z","title":"Tao Feng, Haozhen Zhang, Zijie Lei, Peixuan Han, and Jiaxuan You","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08940","last_updated":"2026-07-18T17:05:31Z","snapshot_observed_at":"2026-08-02T07:51:10.193975Z","submitted_at":"2026-07-09T21:09:05Z","title":"TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T07:51:12.700912Z"},"links":{"cited_paper":"/paper/2604.23626","citing_paper":"/paper/2607.08940"},"observation_digest":"sha256:050c73cab127ab6323970a1cb90f033aff68a9bec605f4c0049879c6bb24ce71","observation_id":"aaa7683f-f078-425b-b0ea-da31256f1bad","resolution":{"observed_at":"2026-08-02T07:51:12.700912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.23626/citation-record","integrity":"/paper/2604.23626/integrity","json":"/paper/2604.23626/citation-record.json","paper":"/paper/2604.23626"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T00:05:48.311803Z","title":"write newline","venue":null,"work_id":"8e5fda61-e601-4df4-8204-015bee341570","year":null},"citing_paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-08T06:20:48.009002Z"},"links":{"citing_paper":"/paper/2604.23626"},"observation_digest":"sha256:0ff0ca6ba8a6588cda9104aae27286a5360f0f45a7de72b5cd124917354b7a2d","observation_id":"589a6ace-a10e-497d-b135-7d1a2a58e578","resolution":{"observed_at":"2026-05-26T18:58:15.321616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-08T23:55:44.012295Z","title":"@esa (Ref","venue":null,"work_id":"b058608d-98d0-4821-a4ae-403d2b7cd411","year":null},"citing_paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-08T06:20:48.009002Z"},"links":{"citing_paper":"/paper/2604.23626"},"observation_digest":"sha256:87ce05803c1738ce2e633a06022e8f2a429e1eb20b07adc3d746950483d02d96","observation_id":"96742762-554f-427f-ada1-03881cfc10ea","resolution":{"observed_at":"2026-05-26T18:58:15.325624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-09T00:05:48.337191Z","title":null,"venue":null,"work_id":"ea79bfb8-d434-45e9-8607-416d3839ec5c","year":null},"citing_paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-08T06:20:48.009002Z"},"links":{"citing_paper":"/paper/2604.23626"},"observation_digest":"sha256:a3628b4a079b14a99940c367f589eb44dd0cb0e716c1dd254ef771b8daedb612","observation_id":"a9ad55fc-8494-402a-a9a7-8f8585576859","resolution":{"observed_at":"2026-05-26T18:58:15.331820Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d051d6aa-efca-49eb-a66d-8ea01bf21294","year":null},"citing_paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-08T06:20:48.009002Z"},"links":{"citing_paper":"/paper/2604.23626"},"observation_digest":"sha256:e48407356b8d178e120951e61ef818d809d714bcd4fb5f5e06d24d3d7b2f702f","observation_id":"736803f5-3b68-4e40-af95-89de439fae42","resolution":{"observed_at":"2026-05-26T18:58:15.328906Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.23626","last_updated":"2026-04-26T09:38:32Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T17:37:08.298010Z","submitted_at":"2026-04-26T09:38:32Z","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":4},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 2 inbound Pith citation observations for arXiv:2604.23626."}