{"as_of":"2026-08-10T05:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e4594512f31b2b03dcdb1fc042bc51d994b84d01c9c5bb5ca404d39375794ad","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:45:29.806953Z","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-03T20:28:55.071229Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-08-06T21:45:29.806953Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23534","last_updated":"2025-06-30T05:47:09Z","snapshot_observed_at":"2026-08-10T04:49:33.318738Z","submitted_at":"2025-06-30T05:47:09Z","title":"Improving vulnerability type prediction and line-level detection via adversarial training-based data augmentation and multi-task learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T21:45:29.806953Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2506.23534"},"observation_digest":"sha256:ad3fe9eab06046b1894b703e9a7a1f01da0dc2a583b1e729b0ea2364f16e5641","observation_id":"2f05c7dc-8658-442c-8df8-5e94b31c7951","resolution":{"observed_at":"2026-08-06T21:45:29.806953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-08-06T17:41:43.057480Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.10182","last_updated":"2025-07-14T11:44:04Z","snapshot_observed_at":"2026-08-08T23:20:51.475560Z","submitted_at":"2025-07-14T11:44:04Z","title":"Breaking the Myth: Can Small Models Infer Postconditions Too?","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T17:41:43.057480Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2507.10182"},"observation_digest":"sha256:40f005515e6f283ae789428bbf2a081828b32c6c60406ca74c2fd6d00ebf6bee","observation_id":"db617505-0875-4a77-b3af-10d0d4276610","resolution":{"observed_at":"2026-08-06T17:41:43.057480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":"2312.00413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-07-03T20:28:55.071229Z","title":"arXiv preprint arXiv:2312.00413 , year=","venue":null,"work_id":"a553ce90-a9e8-40da-b49d-f89ce963fe35","year":2023},"citing_paper":{"arxiv_id":"2604.16420","last_updated":"2026-04-03T07:35:43Z","snapshot_observed_at":"2026-08-03T20:56:06.399724Z","submitted_at":"2026-04-03T07:35:43Z","title":"Breaking Validity-Induced Boundaries to Expand Algorithm Search Space: A Two-Stage AST-Based Operator for LLM-Driven Automated Heuristic Evolution","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T18:58:46.374476Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2604.16420"},"observation_digest":"sha256:ea6ee51ad76b8ca76816a055d01506cc67a17e57644c7ebfe954133180d6cdf8","observation_id":"cbefa792-622c-4f69-a932-705869f82330","resolution":{"observed_at":"2026-05-13T19:03:08.637297Z","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":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":"2312.00413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-07-03T20:28:55.071229Z","title":"arXiv preprint arXiv:2312.00413 , year=","venue":null,"work_id":"a553ce90-a9e8-40da-b49d-f89ce963fe35","year":2023},"citing_paper":{"arxiv_id":"2604.21051","last_updated":"2026-04-22T19:51:31Z","snapshot_observed_at":"2026-08-08T17:37:57.833244Z","submitted_at":"2026-04-22T19:51:31Z","title":"Residual Risk Analysis in Benign Code: How Far Are We? A Multi-Model Semantic and Structural Similarity Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-09T23:30:14.280951Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2604.21051"},"observation_digest":"sha256:6db76c4d56fea4260446f7a0b6e99350dd6dbc887e4f3c3c7c28cd532d44edd1","observation_id":"7f54e46b-75ea-4bda-8847-37e59f02a7ec","resolution":{"observed_at":"2026-05-11T14:06:05.028124Z","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":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":"2312.00413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-07-03T20:28:55.071229Z","title":"arXiv preprint arXiv:2312.00413 , year=","venue":null,"work_id":"a553ce90-a9e8-40da-b49d-f89ce963fe35","year":2023},"citing_paper":{"arxiv_id":"2605.00504","last_updated":"2026-05-01T08:30:36Z","snapshot_observed_at":"2026-08-07T23:50:22.342214Z","submitted_at":"2026-05-01T08:30:36Z","title":"EnCoDe: Energy Estimation of Source Code At Design-Time","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-09T18:57:40.726628Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2605.00504"},"observation_digest":"sha256:a794eb69df8adc9bef478ab3bc33842b8c49f1c9d9dd4c2c261299e46fd70a48","observation_id":"03d286d9-6e9b-4051-82fc-e84c883806cc","resolution":{"observed_at":"2026-05-11T15:56:50.425227Z","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":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":"2312.00413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-07-03T20:28:55.071229Z","title":"arXiv preprint arXiv:2312.00413 , year=","venue":null,"work_id":"a553ce90-a9e8-40da-b49d-f89ce963fe35","year":2023},"citing_paper":{"arxiv_id":"2605.03356","last_updated":"2026-05-05T04:29:38Z","snapshot_observed_at":"2026-08-06T23:24:38.436110Z","submitted_at":"2026-05-05T04:29:38Z","title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-07T16:04:48.394294Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2605.03356"},"observation_digest":"sha256:1c188669bbb5015725188f2479210f5f3f3a256da2816dcedd98afb211be622d","observation_id":"90ee21c4-c9ac-41f8-a8ef-fdcb610b6bef","resolution":{"observed_at":"2026-05-11T23:56:12.216545Z","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":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":"2312.00413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-07-03T20:28:55.071229Z","title":"arXiv preprint arXiv:2312.00413 , year=","venue":null,"work_id":"a553ce90-a9e8-40da-b49d-f89ce963fe35","year":2023},"citing_paper":{"arxiv_id":"2607.01425","last_updated":"2026-07-04T12:11:09Z","snapshot_observed_at":"2026-08-08T07:06:39.198392Z","submitted_at":"2026-07-01T19:41:38Z","title":"Agent4cs: A Multi-agent System for Code Summarization in Large Hierarchical Codebases","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-03T20:27:58.300943Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2607.01425"},"observation_digest":"sha256:a89a6b14482acf0aa7aa8c4a5d280369dcdbbc1b42da0ce6949f11fb8244a3e3","observation_id":"8480b20a-3d59-40ac-a78c-970924097bc1","resolution":{"observed_at":"2026-07-03T20:28:55.072715Z","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":"2312.00413","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00413","snapshot_observed_at":"2026-07-12T08:50:08.955250Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.01425","last_updated":"2026-07-04T12:11:09Z","snapshot_observed_at":"2026-08-08T07:06:39.198392Z","submitted_at":"2026-07-01T19:41:38Z","title":"Agent4cs: A Multi-agent System for Code Summarization in Large Hierarchical Codebases","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T08:50:08.955250Z"},"links":{"cited_paper":"/paper/2312.00413","citing_paper":"/paper/2607.01425"},"observation_digest":"sha256:e3334f898096d9199dc375493de839d3e30d863a187ad711791cf99f0ffe2257","observation_id":"cc0e5437-369c-4d63-981e-cfef7e7e9452","resolution":{"observed_at":"2026-07-12T08:50:08.955250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2312.00413/citation-record","integrity":"/paper/2312.00413/integrity","json":"/paper/2312.00413/citation-record.json","paper":"/paper/2312.00413"},"outbound":[],"paper":{"arxiv_id":"2312.00413","last_updated":"2023-12-01T08:37:27Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-10T04:49:16.776822Z","submitted_at":"2023-12-01T08:37:27Z","title":"Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2312.00413."}