{"as_of":"2026-08-01T20:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9637f3ae576f221f051a6f82c002b47d14b557562acc4a6719b77602f325ee3a","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-01T06:32:01.292127+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-05-23T20:33:06.956447Z","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-23T20:33:25.416084Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.11830","last_updated":"2020-11-25T10:28:55Z","snapshot_observed_at":"2026-07-06T08:24:41.779661Z","submitted_at":"2019-09-26T00:44:40Z","title":"Can $Q$-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?","version":2},"cited_work":{"arxiv_id":"1909.11830","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.11830","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kurin, S","venue":null,"work_id":"21b32474-b74a-4258-8309-c35ae1d9038d","year":1909},"citing_paper":{"arxiv_id":"2409.07501","last_updated":"2026-04-15T14:35:35Z","snapshot_observed_at":"2026-07-06T19:13:55.363649Z","submitted_at":"2024-09-10T18:46:26Z","title":"A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-23T20:33:06.956447Z"},"links":{"cited_paper":"/paper/1909.11830","citing_paper":"/paper/2409.07501"},"observation_digest":"sha256:7e05103d84a88d12f76503f4a113efe59b1f72d85c3bdc1ff820545e35f3885a","observation_id":"47fa298f-ad2b-4a03-807c-1407a8ff6892","resolution":{"observed_at":"2026-05-23T20:33:25.418600Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-01T06:32:01.292127+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-01T06:32:01.292127+00:00","source":"crossref"},{"observed_at":"2026-08-01T06:31:58.492377+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.11830/citation-record","integrity":"/paper/1909.11830/integrity","json":"/paper/1909.11830/citation-record.json","paper":"/paper/1909.11830"},"outbound":[],"paper":{"arxiv_id":"1909.11830","last_updated":"2020-11-25T10:28:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:24:41.779661Z","submitted_at":"2019-09-26T00:44:40Z","title":"Can $Q$-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?"},"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-01T06:32:01.292127+00:00","source":"crossref"},{"observed_at":"2026-08-01T06:31:58.492377+00:00","source":"retraction_watch"}],"thesis":"As of 1 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1909.11830."}