{"as_of":"2026-08-09T15:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:004e6427fe2b3950c5da0661c20f3082aed62d51c2d10464ee6ce5d243a33983","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-09T06:31:02.800959+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-09T04:32:42.818889Z","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-05-18T06:00:57.233637Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.13383","last_updated":"2023-07-25T10:07:02Z","snapshot_observed_at":"2026-07-06T15:58:12.694734Z","submitted_at":"2023-07-25T10:07:02Z","title":"Predicting Code Coverage without Execution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13383","snapshot_observed_at":"2026-08-09T04:32:42.818889Z","title":"Predicting code coverage without execution","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03568","last_updated":"2025-07-04T16:53:00Z","snapshot_observed_at":"2026-08-09T06:40:24.468945Z","submitted_at":"2025-02-05T19:30:28Z","title":"Code Simulation as a Proxy for High-order Tasks in Large Language Models","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T04:32:42.818889Z"},"links":{"cited_paper":"/paper/2307.13383","citing_paper":"/paper/2502.03568"},"observation_digest":"sha256:89fb7f66f7f94a793bd2c401d4c9aa40a2ef7b2d09537763088c4c7d008ef995","observation_id":"8702dc1b-d10f-4498-a33b-e9e0fff95c8a","resolution":{"observed_at":"2026-08-09T04:32:42.818889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13383","last_updated":"2023-07-25T10:07:02Z","snapshot_observed_at":"2026-07-06T15:58:12.694734Z","submitted_at":"2023-07-25T10:07:02Z","title":"Predicting Code Coverage without Execution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13383","snapshot_observed_at":"2026-08-06T05:45:41.210269Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.01250","last_updated":"2025-08-02T08:02:06Z","snapshot_observed_at":"2026-08-06T05:45:40.426146Z","submitted_at":"2025-08-02T08:02:06Z","title":"DisFaceRep: Representation Disentanglement for Co-occurring Facial Components in Weakly Supervised Face Parsing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T05:45:41.210269Z"},"links":{"cited_paper":"/paper/2307.13383","citing_paper":"/paper/2508.01250"},"observation_digest":"sha256:5381b0bddb00f47d3af90b7a95596f5abced439085f0c475df0109375b1a5632","observation_id":"45328c19-31d1-4436-8d7b-225ffe208de3","resolution":{"observed_at":"2026-08-06T05:45:41.210269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13383","last_updated":"2023-07-25T10:07:02Z","snapshot_observed_at":"2026-07-06T15:58:12.694734Z","submitted_at":"2023-07-25T10:07:02Z","title":"Predicting Code Coverage without Execution","version":1},"cited_work":{"arxiv_id":"2307.13383","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.13383","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"84d7c99a-fb47-48a1-b2ae-3997b3963837","year":2023},"citing_paper":{"arxiv_id":"2510.15079","last_updated":"2026-04-07T05:37:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-16T18:48:12Z","title":"Assessing Coherency and Consistency of Code Execution Reasoning by Large Language Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-18T05:59:00.400429Z"},"links":{"cited_paper":"/paper/2307.13383","citing_paper":"/paper/2510.15079"},"observation_digest":"sha256:d7c28c52cffd7d76602b1008443664cddb38805c20e732d1df6387570cad77fd","observation_id":"7d57f757-91bf-4d27-b626-508001eb9477","resolution":{"observed_at":"2026-05-18T06:00:57.239647Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2307.13383/citation-record","integrity":"/paper/2307.13383/integrity","json":"/paper/2307.13383/citation-record.json","paper":"/paper/2307.13383"},"outbound":[],"paper":{"arxiv_id":"2307.13383","last_updated":"2023-07-25T10:07:02Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T15:58:12.694734Z","submitted_at":"2023-07-25T10:07:02Z","title":"Predicting Code Coverage without Execution"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2307.13383."}