{"as_of":"2026-08-15T01:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a8700cf36d59ea66dfc380c15ae89d383b39156f37a0528f4b457909a0bc75c","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-14T06:32:32.682623+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-12T14:08:35.523344Z","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-12T18:16:22.223912Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.16423","last_updated":"2023-12-27T06:09:48Z","snapshot_observed_at":"2026-08-13T04:53:32.015062Z","submitted_at":"2023-12-27T06:09:48Z","title":"General Method for Solving Four Types of SAT Problems","version":1},"cited_work":{"arxiv_id":"2312.16423","doi":"10.48550/arxiv.2312.16423","metadata_source":"pith","pith_arxiv_id":"2312.16423","snapshot_observed_at":"2026-08-12T18:16:22.223912Z","title":"General Method for Solving Four Types of SAT Problems","venue":"cs.AI","work_id":"8ecb5a23-3466-40cc-99b7-0fb697d3cd2d","year":2023},"citing_paper":{"arxiv_id":"2411.15645","last_updated":"2025-06-01T08:26:17Z","snapshot_observed_at":"2026-08-13T05:13:04.720951Z","submitted_at":"2024-11-23T20:31:58Z","title":"MC-NEST: Enhancing Mathematical Reasoning in Large Language Models leveraging a Monte Carlo Self-Refine Tree","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:08:35.523344Z"},"links":{"cited_paper":"/paper/2312.16423","citing_paper":"/paper/2411.15645"},"observation_digest":"sha256:29aa90709b97207cd09dc5572e790fa5207f0d3aed5a7326d27890d101467a8c","observation_id":"600ca247-09fa-4995-9bdc-6aef2385572b","resolution":{"observed_at":"2026-08-12T14:08:37.227999Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.16423/citation-record","integrity":"/paper/2312.16423/integrity","json":"/paper/2312.16423/citation-record.json","paper":"/paper/2312.16423"},"outbound":[],"paper":{"arxiv_id":"2312.16423","last_updated":"2023-12-27T06:09:48Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T04:53:32.015062Z","submitted_at":"2023-12-27T06:09:48Z","title":"General Method for Solving Four Types of SAT Problems"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2312.16423."}