{"as_of":"2026-08-07T16:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e018f71024bbd097265ece617d6c86fdabd9fc06d0496ebe84c7dcb9e4f44382","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:54:11.498960Z","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-05T22:39:52.014524Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.13312","last_updated":"2024-03-20T05:29:06Z","snapshot_observed_at":"2026-07-06T17:47:30.518562Z","submitted_at":"2024-03-20T05:29:06Z","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13312","snapshot_observed_at":"2026-08-06T15:54:11.498960Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14722","last_updated":"2025-07-19T18:50:07Z","snapshot_observed_at":"2026-08-06T15:47:06.755812Z","submitted_at":"2025-07-19T18:50:07Z","title":"LeanTree: Accelerating White-Box Proof Search with Factorized States in Lean 4","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T15:54:11.498960Z"},"links":{"cited_paper":"/paper/2403.13312","citing_paper":"/paper/2507.14722"},"observation_digest":"sha256:8a62f3bb01a793bc530c10e948a272d2593ab9a2bb844266e00c5caa684a3bd3","observation_id":"8963308f-6cb8-462a-978c-63a8b192837f","resolution":{"observed_at":"2026-08-06T15:54:11.498960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13312","last_updated":"2024-03-20T05:29:06Z","snapshot_observed_at":"2026-07-06T17:47:30.518562Z","submitted_at":"2024-03-20T05:29:06Z","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean","version":1},"cited_work":{"arxiv_id":"2403.13312","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.13312","snapshot_observed_at":"2026-08-05T22:39:52.014524Z","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean","venue":"cs.CL","work_id":"6e99af12-9b69-4c74-8cf4-f6356b2fd738","year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.780904Z"},"links":{"cited_paper":"/paper/2403.13312","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:73978ccb56b850306fc409fce9f69d70ea97c21c461c4a29d99f1c9d73e44ea9","observation_id":"9acfe454-2b68-445b-a150-3c452d4ac173","resolution":{"observed_at":"2026-08-05T22:39:52.019717Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.13312/citation-record","integrity":"/paper/2403.13312/integrity","json":"/paper/2403.13312/citation-record.json","paper":"/paper/2403.13312"},"outbound":[],"paper":{"arxiv_id":"2403.13312","last_updated":"2024-03-20T05:29:06Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:47:30.518562Z","submitted_at":"2024-03-20T05:29:06Z","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.13312."}