{"as_of":"2026-08-19T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:387d084aec58b37f3283491f2b3dbaaf07e4730600157fe9d14a466db027cc00","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-19T06:32:44.657259+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-05T12:25:56.732575Z","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-16T13:22:55.190594Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.18429","last_updated":"2024-03-30T10:47:13Z","snapshot_observed_at":"2026-08-17T01:47:24.378645Z","submitted_at":"2024-03-27T10:35:41Z","title":"Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18429","snapshot_observed_at":"2026-08-05T12:25:56.732575Z","title":"Reinforcement learning for graph theory, i. reimplementation of wagner’s approach,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.732575Z"},"links":{"cited_paper":"/paper/2403.18429","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:1a3077472d017ea3649b9db4697fa342769b188f2477fbe9fb969cef2aea116e","observation_id":"fc876007-75a3-4c84-8453-e823ebe38bb2","resolution":{"observed_at":"2026-08-05T12:25:56.732575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18429","last_updated":"2024-03-30T10:47:13Z","snapshot_observed_at":"2026-08-17T01:47:24.378645Z","submitted_at":"2024-03-27T10:35:41Z","title":"Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach","version":2},"cited_work":{"arxiv_id":"2403.18429","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.18429","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning for graph theory, i","venue":null,"work_id":"f3d58f5d-7f6f-49b0-a63e-d3bc544a20e8","year":2024},"citing_paper":{"arxiv_id":"2601.11482","last_updated":"2026-05-05T17:33:08Z","snapshot_observed_at":"2026-08-17T00:17:20.676972Z","submitted_at":"2026-01-16T18:03:27Z","title":"A Genetic Algorithm for Generating Extreme Examples in Arithmetic Dynamics","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T13:22:51.651262Z"},"links":{"cited_paper":"/paper/2403.18429","citing_paper":"/paper/2601.11482"},"observation_digest":"sha256:79fd76b8d385a8cde62d3a709ee9b43665a713a878b832715b7a9c8bf70a74eb","observation_id":"08e8ed54-71cf-4e66-bb61-e4c5ed9bb4b0","resolution":{"observed_at":"2026-05-16T13:22:55.192998Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.18429/citation-record","integrity":"/paper/2403.18429/integrity","json":"/paper/2403.18429/citation-record.json","paper":"/paper/2403.18429"},"outbound":[],"paper":{"arxiv_id":"2403.18429","last_updated":"2024-03-30T10:47:13Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-17T01:47:24.378645Z","submitted_at":"2024-03-27T10:35:41Z","title":"Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.18429."}