{"as_of":"2026-08-08T21:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c12f193c709ef187c47860ef9ae11839eb8499bea30872c88807a68eb6af1af","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-08T06:32:00.761636+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-07T14:58:27.990784Z","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-07T06:16:28.064256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.11107","last_updated":"2022-10-13T13:37:42Z","snapshot_observed_at":"2026-08-03T19:24:13.227094Z","submitted_at":"2022-05-23T07:57:32Z","title":"Learning to branch with Tree MDPs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11107","snapshot_observed_at":"2026-08-07T14:58:27.990784Z","title":"Learning to branch with tree mdps.arXiv preprint arXiv:2205.11107, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-08T13:31:47.967420Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.990784Z"},"links":{"cited_paper":"/paper/2205.11107","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:0c3d9bcde2711ee97f8b14f5b160c7c4c1888ff8584278dac65ebf0975076815","observation_id":"346d5815-76a8-45c3-94a5-9d95413a785a","resolution":{"observed_at":"2026-08-07T14:58:27.990784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11107","last_updated":"2022-10-13T13:37:42Z","snapshot_observed_at":"2026-08-03T19:24:13.227094Z","submitted_at":"2022-05-23T07:57:32Z","title":"Learning to branch with Tree MDPs","version":3},"cited_work":{"arxiv_id":"2205.11107","doi":"10.48550/arxiv.2205.11107","metadata_source":"pith","pith_arxiv_id":"2205.11107","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Learning to branch with Tree MDPs","venue":"cs.LG","work_id":"32ef76c6-ed41-4fdb-b136-c62a596f2a3e","year":2022},"citing_paper":{"arxiv_id":"2507.04099","last_updated":"2025-07-15T16:49:25Z","snapshot_observed_at":"2026-08-08T20:05:59.077948Z","submitted_at":"2025-07-05T16:49:34Z","title":"Conversation Forests: The Key to Fine Tuning Large Language Models for Multi-Turn Medical Conversations is Branching","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:01:44.927157Z"},"links":{"cited_paper":"/paper/2205.11107","citing_paper":"/paper/2507.04099"},"observation_digest":"sha256:fa25464235a3c985534ffbafe455cd75be63af3ccec456c56c148dce65445baa","observation_id":"30747c74-d84d-467a-9eb6-4bfd4d8e3087","resolution":{"observed_at":"2026-08-06T20:01:46.229114Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.11107/citation-record","integrity":"/paper/2205.11107/integrity","json":"/paper/2205.11107/citation-record.json","paper":"/paper/2205.11107"},"outbound":[],"paper":{"arxiv_id":"2205.11107","last_updated":"2022-10-13T13:37:42Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T19:24:13.227094Z","submitted_at":"2022-05-23T07:57:32Z","title":"Learning to branch with Tree MDPs"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.11107."}