Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Lookback for Learning to Branch
As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2206.14987.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-04T14:54:05.379392Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T07:09:37.899030Z
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 46143718-4e85-46f3-9152-429015c962d1 · inbound
Self-Improving Neural Pruning: A Graph Neural Network Framework for Scalable Mixed Bundle Pricing cites this paper.
Self-Improving Neural Pruning: A Graph Neural Network Framework for Scalable Mixed Bundle Pricing Lookback for Learning to Branch
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T14:54:05.379392Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation be7d70c1-6fec-4489-805f-247594ce9a19 · inbound
A Hybrid Reinforcement and Self-Supervised Learning Aided Benders Decomposition Algorithm cites this paper.
A Hybrid Reinforcement and Self-Supervised Learning Aided Benders Decomposition Algorithm Lookback for Learning to Branch
Reference 9
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T15:11:07.936813Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 6d77571c-b512-44f5-976f-80e6ecb36985 · 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 Lookback for Learning to Branch
Reference 83
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T07:09:37.900609Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.