{"as_of":"2026-08-07T23:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa0ff133294fe491f273523538fc3f7fb7cf69e579594ed55c2eee920de2549e","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:40:15.702642Z","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-02T03:56:34.651017Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-08-06T20:40:15.702642Z","title":"Rtl++: Graph-enhanced llm for rtl code generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.02226","last_updated":"2025-07-03T01:17:44Z","snapshot_observed_at":"2026-08-06T20:31:57.968196Z","submitted_at":"2025-07-03T01:17:44Z","title":"DecoRTL: A Run-time Decoding Framework for RTL Code Generation with LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:15.702642Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2507.02226"},"observation_digest":"sha256:aaa45c9df40c06dbdf0b2c6bd87566e3919b4dde76dcde66edc321d782f67724","observation_id":"4002d0c8-0195-4812-8013-d651e65399ab","resolution":{"observed_at":"2026-08-06T20:40:15.702642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-08-06T18:54:01.135603Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13369","last_updated":"2025-07-09T17:06:54Z","snapshot_observed_at":"2026-08-06T22:55:48.453713Z","submitted_at":"2025-07-09T17:06:54Z","title":"VerilogDB: The Largest, Highest-Quality Dataset with a Preprocessing Framework for LLM-based RTL Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:54:01.135603Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2507.13369"},"observation_digest":"sha256:46bc8b6f690dab0ed41410ef3015801becbefceebeeecd30c53645741c7a077b","observation_id":"a10dbe5d-33bc-403b-998a-2880c8229865","resolution":{"observed_at":"2026-08-06T18:54:01.135603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-08-06T14:42:04.944107Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.17962","last_updated":"2025-07-23T22:08:15Z","snapshot_observed_at":"2026-08-06T14:36:20.671748Z","submitted_at":"2025-07-23T22:08:15Z","title":"TimelyHLS: LLM-Based Timing-Aware and Architecture-Specific FPGA HLS Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T14:42:04.944107Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2507.17962"},"observation_digest":"sha256:d1982946d4a04f883c0715f04a123f1421061f52e0592de7938a18d04dc024d7","observation_id":"8b659837-5d7c-425a-b77b-784d77b459ee","resolution":{"observed_at":"2026-08-06T14:42:04.944107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-08-04T16:31:32.475251Z","title":"Rtl++: Graph- enhanced llm for rtl code generation.arXiv preprint arXiv:2505.13479, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.13557","last_updated":"2026-05-30T18:21:39Z","snapshot_observed_at":"2026-08-07T21:51:44.373642Z","submitted_at":"2025-09-16T21:52:04Z","title":"MACO: A Multi-Agent LLM Framework for Automated CGRA Hardware/Software Co-Design","version":7},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T16:31:32.475251Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2509.13557"},"observation_digest":"sha256:2f0bb66e926a4ccf6e6343e018285818c3e6e14ce3ef33ca184c2db8d7608d44","observation_id":"2eb52469-5d7d-4b55-9785-aa958f9f930f","resolution":{"observed_at":"2026-08-04T16:31:32.475251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":"2505.13479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-07-02T03:56:34.651017Z","title":"RTL++: Graph-enhanced LLM for RTL code generation","venue":null,"work_id":"fed18a07-4236-4b68-8e56-a14a78a83492","year":2025},"citing_paper":{"arxiv_id":"2604.27238","last_updated":"2026-04-29T22:26:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-29T22:26:00Z","title":"SafeTune: Mitigating Data Poisoning in LLM Fine-Tuning for RTL Code Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-07T10:16:07.200458Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2604.27238"},"observation_digest":"sha256:132f8aa460769d0741e495c2eea0fd35fd99688447f626d7520e36d842417365","observation_id":"869a73da-f650-42f6-adc5-dd29e74dada0","resolution":{"observed_at":"2026-05-12T09:36:26.580465Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":"2505.13479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-07-02T03:56:34.651017Z","title":"RTL++: Graph-enhanced LLM for RTL code generation","venue":null,"work_id":"fed18a07-4236-4b68-8e56-a14a78a83492","year":2025},"citing_paper":{"arxiv_id":"2605.10807","last_updated":"2026-06-04T15:08:08Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:31:14Z","title":"LLMs for Secure Hardware Design and Related Problems: Opportunities and Challenges","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T03:57:51.577486Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2605.10807"},"observation_digest":"sha256:a90129c73e07adaa9766936a5da1fe64baabb18a7b50e1c490195790f17bbffe","observation_id":"f7252fa3-7c8f-4a3b-9413-0748c382302e","resolution":{"observed_at":"2026-05-12T06:51:26.667352Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":"2505.13479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-07-02T03:56:34.651017Z","title":"RTL++: Graph-enhanced LLM for RTL code generation","venue":null,"work_id":"fed18a07-4236-4b68-8e56-a14a78a83492","year":2025},"citing_paper":{"arxiv_id":"2605.10807","last_updated":"2026-06-04T15:08:08Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:31:14Z","title":"LLMs for Secure Hardware Design and Related Problems: Opportunities and Challenges","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-14T21:12:08.821202Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2605.10807"},"observation_digest":"sha256:fcc02a21a4ad953fd617d0731be6d12891ba6688852e552e187cb70455c390ce","observation_id":"9c57c413-e0d6-4b1b-b415-aff54724ac05","resolution":{"observed_at":"2026-05-14T21:12:58.759395Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":"2505.13479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-07-02T03:56:34.651017Z","title":"RTL++: Graph-enhanced LLM for RTL code generation","venue":null,"work_id":"fed18a07-4236-4b68-8e56-a14a78a83492","year":2025},"citing_paper":{"arxiv_id":"2605.10807","last_updated":"2026-06-04T15:08:08Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:31:14Z","title":"LLMs for Secure Hardware Design and Related Problems: Opportunities and Challenges","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T08:58:25.469021Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2605.10807"},"observation_digest":"sha256:063c4d53f80ccccab2fb5289bd7dc1d721139f8e29cfdceb762862f2830bd074","observation_id":"e5fdfad5-b8e3-4cdd-96f1-3dade813bfc6","resolution":{"observed_at":"2026-05-21T08:59:55.406683Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":"2505.13479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-07-02T03:56:34.651017Z","title":"RTL++: Graph-enhanced LLM for RTL code generation","venue":null,"work_id":"fed18a07-4236-4b68-8e56-a14a78a83492","year":2025},"citing_paper":{"arxiv_id":"2605.10807","last_updated":"2026-06-04T15:08:08Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:31:14Z","title":"LLMs for Secure Hardware Design and Related Problems: Opportunities and Challenges","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T22:18:09.663488Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2605.10807"},"observation_digest":"sha256:4ea1b9474d1486c5385b824f5564c2c95c51d2149841ba8f0c622afa55161db4","observation_id":"ad2ac106-b284-4f5e-b59c-cbc1727a34a0","resolution":{"observed_at":"2026-07-01T14:05:46.819888Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":"2505.13479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-07-02T03:56:34.651017Z","title":"RTL++: Graph-enhanced LLM for RTL code generation","venue":null,"work_id":"fed18a07-4236-4b68-8e56-a14a78a83492","year":2025},"citing_paper":{"arxiv_id":"2606.04246","last_updated":"2026-06-02T21:52:48Z","snapshot_observed_at":"2026-08-07T19:08:14.911867Z","submitted_at":"2026-06-02T21:52:48Z","title":"StepPRM-RTL: Stepwise Process-Reward Guided LLM Fine-Tuning for Enhanced RTL Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T09:35:34.571333Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2606.04246"},"observation_digest":"sha256:33c85753d47488170ceefc2c8fdd5972894edfb585dcf15e95d4764ad2c24d20","observation_id":"90f07db2-e68c-4961-8395-62e1347ff294","resolution":{"observed_at":"2026-07-02T03:56:34.652684Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13479","snapshot_observed_at":"2026-08-06T10:13:18.224348Z","title":"RTL++: Graph-enhanced LLM for RTL code generation,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05063","last_updated":"2026-08-05T17:09:13Z","snapshot_observed_at":"2026-08-07T23:17:24.611639Z","submitted_at":"2026-08-05T17:09:13Z","title":"Hardware Design and Security in the Era of Chiplets and LLMs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T10:13:18.224348Z"},"links":{"cited_paper":"/paper/2505.13479","citing_paper":"/paper/2608.05063"},"observation_digest":"sha256:d7262b3d35b9712a6230512fd7633decef82511f6373a99153972c6159e317de","observation_id":"c255d8b9-0d72-447b-8e95-137867ab2117","resolution":{"observed_at":"2026-08-06T10:13:18.224348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.13479/citation-record","integrity":"/paper/2505.13479/integrity","json":"/paper/2505.13479/citation-record.json","paper":"/paper/2505.13479"},"outbound":[],"paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-07T15:48:10.132598Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2505.13479."}