{"as_of":"2026-08-09T00:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9fc24b595ddfd1caec4d2fa8dee9ed63565bb6450fb4092b70cdee9096263238","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:24:39.321383Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2507.00352/citation-record","integrity":"/paper/2507.00352/integrity","json":"/paper/2507.00352/citation-record.json","paper":"/paper/2507.00352"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-06T21:24:38.744273Z","title":"Language models are few-shot learners,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:38.744273Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:b5b3b88a71a9c89265c00717db79ebfd716be8574ac5cf36ad0f5f432569a2c0","observation_id":"84cb977a-a65e-4990-ac05-32650afa6f10","resolution":{"observed_at":"2026-08-06T21:24:38.744273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10372","last_updated":"2024-01-08T05:41:51Z","snapshot_observed_at":"2026-07-06T16:48:56.495511Z","submitted_at":"2023-11-17T07:55:16Z","title":"A Survey of Large Language Models for Code: Evolution, Benchmarking, and Future Trends","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10372","snapshot_observed_at":"2026-08-06T21:24:38.802024Z","title":"A survey of large language models for code: Evolution, benchmarking, and future trends,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:38.802024Z"},"links":{"cited_paper":"/paper/2311.10372","citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:bd8183f8d90884451a6e356b7d1be047814132591e201e9b19aff4d080df0662","observation_id":"5bd897d8-73bb-429f-ab20-c048a8d577ec","resolution":{"observed_at":"2026-08-06T21:24:38.802024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:24:40.153180Z","title":"Parr, The Definitive ANTLR 4 Reference","venue":null,"work_id":"bcb03035-0119-4718-96d6-9b5dc39ac8df","year":2013},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:38.849038Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:8f085fb22f03a8d91c5b9320069ffc6fabb896c48cfad12e45c7956abf7ff722","observation_id":"634644df-97d2-422d-952d-ccc5de3cdea9","resolution":{"observed_at":"2026-08-06T21:24:40.214809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T21:24:40.003935Z","title":null,"venue":null,"work_id":"030e2a42-2c63-467b-bacd-e67812010b15","year":2007},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:38.902563Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:c4cb222e0aa40ec7b4524fd66bbdb2989f4e64a4d71fdea65d4d9d75b76bb529","observation_id":"c45435dd-1c24-4270-8607-edd0934f0034","resolution":{"observed_at":"2026-08-06T21:24:40.058608Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T21:24:39.845771Z","title":"Ast-based program transformation for enhanced program understanding,","venue":null,"work_id":"20787d6f-a4e2-4962-a99a-af2554bf950e","year":2004},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:38.937676Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:65eb30bc90480a3c579f66800a880757dda8ada123aa40df13a6dd6002d8ca8e","observation_id":"1aa92d61-b40d-41ec-8741-011fb597b07b","resolution":{"observed_at":"2026-08-06T21:24:39.913327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T21:24:39.747535Z","title":"Codet5: Identifier-aware unified pre-trained encoder-decoder models for code understanding and generation,","venue":null,"work_id":"5d4a0f29-2aef-4260-b3bc-26444d5718d2","year":2021},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:38.986506Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:573a46c9554229a7c8f9487eb0a2c1e3ccedaadce177316429cb57ece6bfaa6a","observation_id":"fa1dca33-f08d-49d7-98b8-d85bac3ee2ae","resolution":{"observed_at":"2026-08-06T21:24:39.793660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:24:39.070465Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:39.070465Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:31a816043c84f7708b50cfe5e7560ab58f904db17236fe9bf5867ac95c712ce8","observation_id":"7b3ba883-1415-409c-948f-4b8047a010f4","resolution":{"observed_at":"2026-08-06T21:24:39.070465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:24:39.123598Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:39.123598Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:391aff6ddb8070b556f9b0277bdded04bc2653ca2c023b7816aad176326ed64a","observation_id":"6ad4982e-e8dc-49e7-9788-5025af5dca83","resolution":{"observed_at":"2026-08-06T21:24:39.123598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11416","last_updated":"2022-12-06T21:39:48Z","snapshot_observed_at":"2026-07-06T14:08:18.855958Z","submitted_at":"2022-10-20T16:58:32Z","title":"Scaling Instruction-Finetuned Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11416","snapshot_observed_at":"2026-08-06T21:24:39.183575Z","title":"Scaling instruction-finetuned language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:39.183575Z"},"links":{"cited_paper":"/paper/2210.11416","citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:da916197d3eb2efcbf0ebc63e91fcd39d95174723a8bc0880ef4766eac2ea10c","observation_id":"736bc56d-e474-4b81-8519-6dbe4a705cc6","resolution":{"observed_at":"2026-08-06T21:24:39.183575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:24:39.223856Z","title":"Retrieval- augmented generation for knowledge-intensive nlp tasks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:39.223856Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:ed779e4f09ec680ff0c9d56af765977e6874ed50fc348b966bcf762a71e10fec","observation_id":"ee91b3ba-aa86-4308-927c-97b5ee434a79","resolution":{"observed_at":"2026-08-06T21:24:39.223856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:24:39.580527Z","title":"Rag: A semi-supervised pattern-based learning approach to adaptive code generation,","venue":null,"work_id":"804cd95e-48db-4267-9198-58bcf6211378","year":2022},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:39.272541Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:ea8429ba5d9c4350c48f61d09f511ba0a924e2b39d81bad70a488be68d425b44","observation_id":"4385dbf5-6bf6-4e2f-bf9e-c6db32ae09cd","resolution":{"observed_at":"2026-08-06T21:24:39.643269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T21:24:39.454599Z","title":"Workflow-based software development: Models, methods, and tools,","venue":null,"work_id":"d866339e-3ea8-4187-9cae-cc77675713df","year":2020},"citing_paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:39.321383Z"},"links":{"citing_paper":"/paper/2507.00352"},"observation_digest":"sha256:3cab6071db287b286cc67f56f14fe694eb1a3b84e5b0b17f9ae02a06f27eabd0","observation_id":"c6da42cd-dae2-4119-9724-96e2fae3ba91","resolution":{"observed_at":"2026-08-06T21:24:39.539602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.00352","last_updated":"2025-07-01T00:57:45Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-07T15:48:36.402332Z","submitted_at":"2025-07-01T00:57:45Z","title":"An AST-guided LLM Approach for SVRF Code Synthesis"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":12},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2507.00352."}