{"as_of":"2026-08-08T21:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c754f9f8ea541276fb6d8dc894ea57c2bd2b578824a8ef899d5d018915059de0","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-06T21:58:40.945319Z","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-06T21:58:50.037091Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.13638","last_updated":"2023-06-20T02:59:28Z","snapshot_observed_at":"2026-07-06T15:07:22.262799Z","submitted_at":"2023-03-23T19:52:30Z","title":"Planning as Theorem Proving with Heuristics","version":3},"cited_work":{"arxiv_id":"2303.13638","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.13638","snapshot_observed_at":"2026-08-06T21:58:50.037091Z","title":"Planning as Theorem Proving with Heuristics","venue":"cs.AI","work_id":"c2c052bd-f644-4ada-a9a4-851ef5c309c6","year":2023},"citing_paper":{"arxiv_id":"2506.22991","last_updated":"2025-06-28T19:41:42Z","snapshot_observed_at":"2026-08-08T02:00:51.165534Z","submitted_at":"2025-06-28T19:41:42Z","title":"Resilient-Native and Intelligent Next-Generation Wireless Systems: Key Enablers, Foundations, and Applications","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:40.945319Z"},"links":{"cited_paper":"/paper/2303.13638","citing_paper":"/paper/2506.22991"},"observation_digest":"sha256:526319c0ef8ad408a5a33801c22a17bfd46489d089252ff4502693391ebac735","observation_id":"c618b65a-2056-4beb-81c8-dde85946c992","resolution":{"observed_at":"2026-08-06T21:58:50.107848Z","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/2303.13638/citation-record","integrity":"/paper/2303.13638/integrity","json":"/paper/2303.13638/citation-record.json","paper":"/paper/2303.13638"},"outbound":[],"paper":{"arxiv_id":"2303.13638","last_updated":"2023-06-20T02:59:28Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T15:07:22.262799Z","submitted_at":"2023-03-23T19:52:30Z","title":"Planning as Theorem Proving with Heuristics"},"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:2303.13638."}