{"as_of":"2026-08-06T16:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:894c3958f28934d668e67c51673b2e3f1be6dba6536a1a97e20cab521c97c6f7","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:29:39.035397Z","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-05T14:29:54.072171Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.09342","last_updated":"2024-02-12T20:25:31Z","snapshot_observed_at":"2026-08-06T15:11:52.623141Z","submitted_at":"2023-10-13T18:13:52Z","title":"Ranking LLM-Generated Loop Invariants for Program Verification","version":3},"cited_work":{"arxiv_id":"2310.09342","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.09342","snapshot_observed_at":"2026-08-05T14:29:54.072171Z","title":"Ranking LLM-Generated Loop Invariants for Program Verification","venue":"cs.PL","work_id":"979313db-0925-41a9-91f7-589671dfaeee","year":2023},"citing_paper":{"arxiv_id":"2508.21302","last_updated":"2025-12-09T02:27:24Z","snapshot_observed_at":"2026-08-05T14:29:34.969913Z","submitted_at":"2025-08-29T01:47:07Z","title":"Locus: Agentic Predicate Synthesis for Directed Fuzzing","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:29:39.035397Z"},"links":{"cited_paper":"/paper/2310.09342","citing_paper":"/paper/2508.21302"},"observation_digest":"sha256:a9df411eef6bbdbd931280e1205d032f70caeb316b0d4a94ed9cc5590b7b671f","observation_id":"a279287b-5885-4df3-9464-4278f1ea22c7","resolution":{"observed_at":"2026-08-05T14:29:54.142991Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09342","last_updated":"2024-02-12T20:25:31Z","snapshot_observed_at":"2026-08-06T15:11:52.623141Z","submitted_at":"2023-10-13T18:13:52Z","title":"Ranking LLM-Generated Loop Invariants for Program Verification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09342","snapshot_observed_at":"2026-07-13T12:22:36.910102Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.03758","last_updated":"2026-04-04T15:17:08Z","snapshot_observed_at":"2026-07-13T12:22:36.131151Z","submitted_at":"2026-04-04T15:17:08Z","title":"AutoReSpec: A Framework for Generating Specification using Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T12:22:36.910102Z"},"links":{"cited_paper":"/paper/2310.09342","citing_paper":"/paper/2604.03758"},"observation_digest":"sha256:d8d3c623d5b53854cb0723e6da3927277694c3b5519029ff9c19a9df5c2c24d2","observation_id":"b59dd75b-15dc-45c2-bc5f-009c31f881e7","resolution":{"observed_at":"2026-07-13T12:22:36.910102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09342","last_updated":"2024-02-12T20:25:31Z","snapshot_observed_at":"2026-08-06T15:11:52.623141Z","submitted_at":"2023-10-13T18:13:52Z","title":"Ranking LLM-Generated Loop Invariants for Program Verification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09342","snapshot_observed_at":"2026-07-13T03:34:35.116630Z","title":"CoRRabs/2310.09342(2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09366","last_updated":"2026-07-10T12:44:08Z","snapshot_observed_at":"2026-08-02T10:03:21.422521Z","submitted_at":"2026-07-10T12:44:08Z","title":"Diversifying to Verify: When Task-Equivalent Programs Differ in Verifiability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T03:34:35.116630Z"},"links":{"cited_paper":"/paper/2310.09342","citing_paper":"/paper/2607.09366"},"observation_digest":"sha256:7d04b2a2cd4aac57d856ccb4e848a98cc4438b41a61ef479a33b2ba1be0d0621","observation_id":"a68fe4aa-0b9f-4a9c-8c5c-7b71f81cdbb9","resolution":{"observed_at":"2026-07-13T03:34:35.116630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.09342/citation-record","integrity":"/paper/2310.09342/integrity","json":"/paper/2310.09342/citation-record.json","paper":"/paper/2310.09342"},"outbound":[],"paper":{"arxiv_id":"2310.09342","last_updated":"2024-02-12T20:25:31Z","latest_version":3,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-06T15:11:52.623141Z","submitted_at":"2023-10-13T18:13:52Z","title":"Ranking LLM-Generated Loop Invariants for Program Verification"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2310.09342."}