{"as_of":"2026-08-13T04:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6965d26ce2eb0678130cc51443f668f8e39e5ae6b825f3a8af0876c872a625f","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-12T06:34:41.77262+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-08-11T11:24:29.170919Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T11:24:29.221850Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.06965","last_updated":"2022-06-14T16:35:58Z","snapshot_observed_at":"2026-07-06T13:20:44.327329Z","submitted_at":"2022-06-14T16:35:58Z","title":"Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch","version":1},"cited_work":{"arxiv_id":"2206.06965","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.06965","snapshot_observed_at":"2026-08-11T11:24:29.221850Z","title":"Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch","venue":"cs.LG","work_id":"92655c81-ffc2-4953-87cb-916e4c114c6c","year":2022},"citing_paper":{"arxiv_id":"2412.15534","last_updated":"2025-02-25T23:42:25Z","snapshot_observed_at":"2026-08-11T11:18:44.274160Z","submitted_at":"2024-12-20T03:48:53Z","title":"SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T11:24:29.170919Z"},"links":{"cited_paper":"/paper/2206.06965","citing_paper":"/paper/2412.15534"},"observation_digest":"sha256:bb791b269995aac3c889972491b42a14371a128350591ad6e53537e512e8f76b","observation_id":"605535cc-6e04-4163-ab5f-33086a98eeec","resolution":{"observed_at":"2026-08-11T11:24:29.229893Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.06965/citation-record","integrity":"/paper/2206.06965/integrity","json":"/paper/2206.06965/citation-record.json","paper":"/paper/2206.06965"},"outbound":[],"paper":{"arxiv_id":"2206.06965","last_updated":"2022-06-14T16:35:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:20:44.327329Z","submitted_at":"2022-06-14T16:35:58Z","title":"Deep Reinforcement Learning for Exact Combinatorial Optimization: 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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2206.06965."}