{"as_of":"2026-08-08T15:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c4e133a904b788378108c5265117893ce837fd2c543fa54bf41e0cd29959171b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:51:08.245901Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T05:51:08.543165Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.19730","last_updated":"2025-04-28T12:28:55Z","snapshot_observed_at":"2026-08-07T15:58:37.164745Z","submitted_at":"2025-04-28T12:28:55Z","title":"Evaluate-and-Purify: Fortifying Code Language Models Against Adversarial Attacks Using LLM-as-a-Judge","version":1},"cited_work":{"arxiv_id":"2504.19730","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.19730","snapshot_observed_at":"2026-08-07T05:51:08.543165Z","title":"Evaluate-and-Purify: Fortifying Code Language Models Against Adversarial Attacks Using LLM-as-a-Judge","venue":"cs.SE","work_id":"1398215e-cc5b-42c6-8d3b-6ff6a38f91bb","year":2025},"citing_paper":{"arxiv_id":"2506.06971","last_updated":"2025-06-12T14:47:31Z","snapshot_observed_at":"2026-08-07T07:20:17.397323Z","submitted_at":"2025-06-08T02:43:46Z","title":"Chain-of-Code Collapse: Reasoning Failures in LLMs via Adversarial Prompting in Code Generation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:51:08.245901Z"},"links":{"cited_paper":"/paper/2504.19730","citing_paper":"/paper/2506.06971"},"observation_digest":"sha256:abd33bdafc5f417a7bcfd56a82c31486abac202a25848c6055f59cf820e38efb","observation_id":"616200a2-78ed-404f-a347-e7e31ee6f17c","resolution":{"observed_at":"2026-08-07T05:51:08.549047Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2504.19730/citation-record","integrity":"/paper/2504.19730/integrity","json":"/paper/2504.19730/citation-record.json","paper":"/paper/2504.19730"},"outbound":[],"paper":{"arxiv_id":"2504.19730","last_updated":"2025-04-28T12:28:55Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-07T15:58:37.164745Z","submitted_at":"2025-04-28T12:28:55Z","title":"Evaluate-and-Purify: Fortifying Code Language Models Against Adversarial Attacks Using LLM-as-a-Judge"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.19730."}