{"as_of":"2026-08-09T18:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e7e1ce52cd895b6019787e0bd21b571c1e51eb87759f6e4536bd76b0f64a3ab","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":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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:27:36.178869Z","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-05-14T22:23:15.322246Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03723","snapshot_observed_at":"2026-08-07T05:27:36.178869Z","title":"Vflow: Discovering optimal agentic workflows for verilog generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07945","last_updated":"2025-07-15T16:24:28Z","snapshot_observed_at":"2026-08-07T22:12:34.938175Z","submitted_at":"2025-06-09T17:10:47Z","title":"ProtocolLLM: RTL Benchmark for SystemVerilog Generation of Communication Protocols","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:27:36.178869Z"},"links":{"cited_paper":"/paper/2504.03723","citing_paper":"/paper/2506.07945"},"observation_digest":"sha256:6ec8994968d5941068e322a93d0d44ac4817630ccb5426c82158d47f05569998","observation_id":"a062c18c-e004-42bb-849d-172756067885","resolution":{"observed_at":"2026-08-07T05:27:36.178869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03723","snapshot_observed_at":"2026-08-06T15:51:34.459558Z","title":"Vflow: Discovering op- timal agentic workflows for verilog generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.14776","last_updated":"2025-07-20T00:28:55Z","snapshot_observed_at":"2026-08-06T17:02:06.602812Z","submitted_at":"2025-07-20T00:28:55Z","title":"VeriOpt: PPA-Aware High-Quality Verilog Generation via Multi-Role LLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:51:34.459558Z"},"links":{"cited_paper":"/paper/2504.03723","citing_paper":"/paper/2507.14776"},"observation_digest":"sha256:431460bed3b4ab737ad72f57fb856f9d0909c1a4527a5dd25e578a29c2113334","observation_id":"9a1d96cc-e2e9-49e7-bb62-dec476a6fa88","resolution":{"observed_at":"2026-08-06T15:51:34.459558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation","version":2},"cited_work":{"arxiv_id":"2504.03723","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.03723","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.03723 , year=","venue":null,"work_id":"13d175ed-0860-45a9-9bf8-8473ac66a8e3","year":2025},"citing_paper":{"arxiv_id":"2507.21046","last_updated":"2026-01-16T20:59:08Z","snapshot_observed_at":"2026-08-01T06:32:44.461162Z","submitted_at":"2025-07-28T17:59:05Z","title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","version":4},"reference_index":268,"source":"arxiv_source","source_observed_at":"2026-05-14T22:23:14.621091Z"},"links":{"cited_paper":"/paper/2504.03723","citing_paper":"/paper/2507.21046"},"observation_digest":"sha256:70fd382735d7af1ca9e5bef42eb933e3b56702d6315a51d48d98129f7d3ffec8","observation_id":"945924ee-ef2e-4930-98a8-2b695c576608","resolution":{"observed_at":"2026-05-14T22:23:15.325383Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03723","snapshot_observed_at":"2026-08-06T12:52:01.510274Z","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-09T01:02:43.312508Z","submitted_at":"2025-07-29T00:27:12Z","title":"Graph-Augmented Large Language Model Agents: Current Progress and Future Prospects","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T12:52:01.510274Z"},"links":{"cited_paper":"/paper/2504.03723","citing_paper":"/paper/2507.21407"},"observation_digest":"sha256:dc6126bec0f956e456059dbf2387668a4fdb311dc3f266940d0d5987d68a34e1","observation_id":"d38ddf72-0ea4-42de-853b-17fa515f13fb","resolution":{"observed_at":"2026-08-06T12:52:01.510274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation","version":2},"cited_work":{"arxiv_id":"2504.03723","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.03723","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.03723 , year=","venue":null,"work_id":"13d175ed-0860-45a9-9bf8-8473ac66a8e3","year":2025},"citing_paper":{"arxiv_id":"2512.13564","last_updated":"2026-01-13T09:33:57Z","snapshot_observed_at":"2026-08-06T08:27:07.254588Z","submitted_at":"2025-12-15T17:22:34Z","title":"Memory in the Age of AI Agents","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-11T18:18:19.911342Z"},"links":{"cited_paper":"/paper/2504.03723","citing_paper":"/paper/2512.13564"},"observation_digest":"sha256:86e602b9243030dfa7af64c218a482b7b7d2d84241f0faaa69e4db306223c14d","observation_id":"eeea3e63-ef4e-4555-b11d-eea21f833a1c","resolution":{"observed_at":"2026-05-11T18:18:20.218722Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation","version":2},"cited_work":{"arxiv_id":"2504.03723","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.03723","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.03723 , year=","venue":null,"work_id":"13d175ed-0860-45a9-9bf8-8473ac66a8e3","year":2025},"citing_paper":{"arxiv_id":"2604.19856","last_updated":"2026-04-21T17:20:24Z","snapshot_observed_at":"2026-08-05T13:44:29.091535Z","submitted_at":"2026-04-21T17:20:24Z","title":"ChipCraftBrain: Validation-First RTL Generation via Multi-Agent Orchestration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T01:24:08.563327Z"},"links":{"cited_paper":"/paper/2504.03723","citing_paper":"/paper/2604.19856"},"observation_digest":"sha256:e403daac358e6d6e774c394740827c64795fea4041078bf9949237f658cd4493","observation_id":"781fda5d-600f-414d-a841-777702c99738","resolution":{"observed_at":"2026-05-11T13:36:08.301599Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.03723/citation-record","integrity":"/paper/2504.03723/integrity","json":"/paper/2504.03723/citation-record.json","paper":"/paper/2504.03723"},"outbound":[],"paper":{"arxiv_id":"2504.03723","last_updated":"2025-07-13T08:44:02Z","latest_version":2,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-07T16:27:20.178881Z","submitted_at":"2025-03-30T15:44:22Z","title":"VFlow: Discovering Optimal Agentic Workflows for Verilog Generation"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2504.03723."}