{"as_of":"2026-08-09T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1f767692307e20b3cb910d99c6fc59523f1c9a28a4cc4c53469332100abebf2","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-08T00:18:01.550573Z","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-05T16:20:47.172172Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.12369","last_updated":"2024-09-19T00:07:56Z","snapshot_observed_at":"2026-08-02T10:46:06.301144Z","submitted_at":"2024-09-19T00:07:56Z","title":"Program Slicing in the Era of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12369","snapshot_observed_at":"2026-08-07T04:35:14.223802Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10322","last_updated":"2025-06-12T03:11:38Z","snapshot_observed_at":"2026-08-08T00:51:13.611345Z","submitted_at":"2025-06-12T03:11:38Z","title":"Minimizing False Positives in Static Bug Detection via LLM-Enhanced Path Feasibility Analysis","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T04:35:14.223802Z"},"links":{"cited_paper":"/paper/2409.12369","citing_paper":"/paper/2506.10322"},"observation_digest":"sha256:c383b8885d84523fb39ec8169931a74cf38812fe35d64a2a2599285971eb933e","observation_id":"c54c9998-b24a-4c51-b41d-72db5141af04","resolution":{"observed_at":"2026-08-07T04:35:14.223802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12369","last_updated":"2024-09-19T00:07:56Z","snapshot_observed_at":"2026-08-02T10:46:06.301144Z","submitted_at":"2024-09-19T00:07:56Z","title":"Program Slicing in the Era of Large Language Models","version":1},"cited_work":{"arxiv_id":"2409.12369","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.12369","snapshot_observed_at":"2026-08-05T16:20:47.172172Z","title":"Program Slicing in the Era of Large Language Models","venue":"cs.SE","work_id":"b73ab487-8085-43d0-8de6-e3b44db17d5e","year":2024},"citing_paper":{"arxiv_id":"2508.18721","last_updated":"2025-09-03T14:34:30Z","snapshot_observed_at":"2026-08-08T04:52:35.687709Z","submitted_at":"2025-08-26T06:38:38Z","title":"LLM as an Execution Estimator: Recovering Missing Dependency for Practical Time-travelling Debugging","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T16:20:46.929442Z"},"links":{"cited_paper":"/paper/2409.12369","citing_paper":"/paper/2508.18721"},"observation_digest":"sha256:a5f1ae017695d37c46720bc603b56286fa375e54ab84250a96d7e51a7c77bc63","observation_id":"809bef31-0af1-400e-8d31-d213a216a932","resolution":{"observed_at":"2026-08-05T16:20:47.177839Z","resolver_source":"local_arxiv","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":"2409.12369","last_updated":"2024-09-19T00:07:56Z","snapshot_observed_at":"2026-08-02T10:46:06.301144Z","submitted_at":"2024-09-19T00:07:56Z","title":"Program Slicing in the Era of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12369","snapshot_observed_at":"2026-08-08T00:18:01.550573Z","title":"Program slicing in the era of large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04217","last_updated":"2026-08-04T20:37:21Z","snapshot_observed_at":"2026-08-09T00:03:01.657363Z","submitted_at":"2026-08-04T20:37:21Z","title":"Neuro-Symbolic Proof-of-Vulnerability Generation with Open-Weight Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T00:18:01.550573Z"},"links":{"cited_paper":"/paper/2409.12369","citing_paper":"/paper/2608.04217"},"observation_digest":"sha256:7c503d4add785b72dd68d5c6b664f29b5143c606614294dae12392a839bb2d9d","observation_id":"8524b284-aba5-405e-997e-3dbe4a4fdbfa","resolution":{"observed_at":"2026-08-08T00:18:01.550573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.12369/citation-record","integrity":"/paper/2409.12369/integrity","json":"/paper/2409.12369/citation-record.json","paper":"/paper/2409.12369"},"outbound":[],"paper":{"arxiv_id":"2409.12369","last_updated":"2024-09-19T00:07:56Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-02T10:46:06.301144Z","submitted_at":"2024-09-19T00:07:56Z","title":"Program Slicing in the Era of Large Language Models"},"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:2409.12369."}