Pith. sign in

Paper Citation Record · LEDGER

An Improved Reinforcement Learning Algorithm for Learning to Branch

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.06213.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2201.06213 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T17:06:49.424150Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-04T07:09:37.893902Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 09526d2d-ded3-44a3-b13a-2bfff4f04e57 · inbound

Learning to Split: A Reinforcement-Learning-Guided Splitting Heuristic for Neural Network Verification cites this paper.

Learning to Split: A Reinforcement-Learning-Guided Splitting Heuristic for Neural Network Verification An Improved Reinforcement Learning Algorithm for Learning to Branch

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-03T17:06:49.424150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T17:06:49.424150Z digest=sha256:34c8aa424636cf2cce84a8022be2daa55521657efa56ed3e8c89efb7b7a2a827

Observation b8ba276e-8ad4-489a-8556-71ff1bde4308 · inbound

A note on the convergence guarantees of RLT-based algorithms for polynomial optimization cites this paper.

A note on the convergence guarantees of RLT-based algorithms for polynomial optimization An Improved Reinforcement Learning Algorithm for Learning to Branch

Reference 94

Resolution
verified exact
arxiv_id, observed 2026-07-04T07:09:37.895444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-06-26T13:44:16.025930Z digest=sha256:443dd519c9e58ea9941abad2d19291f4dc83f73d42ada1f241988b5e56179331