{"as_of":"2026-08-10T01:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ee7bbfbe1b48574209c02f788aac61509d5aed1e17f76245332a2fe421af781","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-09T06:31:02.800959+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-03T17:06:49.424150Z","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-07-04T07:09:37.893902Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.06213","last_updated":"2022-01-17T04:50:11Z","snapshot_observed_at":"2026-08-09T18:28:36.971184Z","submitted_at":"2022-01-17T04:50:11Z","title":"An Improved Reinforcement Learning Algorithm for Learning to Branch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.06213","snapshot_observed_at":"2026-08-03T17:06:49.424150Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.10747","last_updated":"2026-07-26T09:23:33Z","snapshot_observed_at":"2026-08-09T15:58:44.949447Z","submitted_at":"2025-12-11T15:36:16Z","title":"Learning to Split: A Reinforcement-Learning-Guided Splitting Heuristic for Neural Network Verification","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T17:06:49.424150Z"},"links":{"cited_paper":"/paper/2201.06213","citing_paper":"/paper/2512.10747"},"observation_digest":"sha256:34c8aa424636cf2cce84a8022be2daa55521657efa56ed3e8c89efb7b7a2a827","observation_id":"09526d2d-ded3-44a3-b13a-2bfff4f04e57","resolution":{"observed_at":"2026-08-03T17:06:49.424150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.06213","last_updated":"2022-01-17T04:50:11Z","snapshot_observed_at":"2026-08-09T18:28:36.971184Z","submitted_at":"2022-01-17T04:50:11Z","title":"An Improved Reinforcement Learning Algorithm for Learning to Branch","version":1},"cited_work":{"arxiv_id":"2201.06213","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.06213","snapshot_observed_at":"2026-07-04T07:09:37.893902Z","title":"arXiv preprint arXiv:2201.06213 , year=","venue":null,"work_id":"3344498d-db7e-4895-a2df-1330b388e8a4","year":null},"citing_paper":{"arxiv_id":"2606.21483","last_updated":"2026-06-19T14:34:17Z","snapshot_observed_at":"2026-08-07T12:30:36.186965Z","submitted_at":"2026-06-19T14:34:17Z","title":"A note on the convergence guarantees of RLT-based algorithms for polynomial optimization","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-06-26T13:44:16.025930Z"},"links":{"cited_paper":"/paper/2201.06213","citing_paper":"/paper/2606.21483"},"observation_digest":"sha256:443dd519c9e58ea9941abad2d19291f4dc83f73d42ada1f241988b5e56179331","observation_id":"b8ba276e-8ad4-489a-8556-71ff1bde4308","resolution":{"observed_at":"2026-07-04T07:09:37.895444Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.06213/citation-record","integrity":"/paper/2201.06213/integrity","json":"/paper/2201.06213/citation-record.json","paper":"/paper/2201.06213"},"outbound":[],"paper":{"arxiv_id":"2201.06213","last_updated":"2022-01-17T04:50:11Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T18:28:36.971184Z","submitted_at":"2022-01-17T04:50:11Z","title":"An Improved Reinforcement Learning Algorithm for Learning to Branch"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.06213."}