{"as_of":"2026-08-11T06:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:054d68f72947575605cf5563ac9a7e2584a7cd228371198cd3c8a8c19a7fd859","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:54:05.379392Z","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.899030Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.14987","last_updated":"2022-12-29T08:08:04Z","snapshot_observed_at":"2026-07-06T13:26:14.318051Z","submitted_at":"2022-06-30T02:33:32Z","title":"Lookback for Learning to Branch","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.14987","snapshot_observed_at":"2026-08-04T14:54:05.379392Z","title":"Khalil, Didier Chételat, Maxime Gasse, Yoshua Bengio, Andrea Lodi, and M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22557","last_updated":"2026-07-01T14:40:14Z","snapshot_observed_at":"2026-08-09T05:45:24.319695Z","submitted_at":"2025-09-26T16:39:00Z","title":"Self-Improving Neural Pruning: A Graph Neural Network Framework for Scalable Mixed Bundle Pricing","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:05.379392Z"},"links":{"cited_paper":"/paper/2206.14987","citing_paper":"/paper/2509.22557"},"observation_digest":"sha256:b28c9933e08dbab58ef24c2e98b760bb83c7b0db96b75760170ee1f83dca1f88","observation_id":"46143718-4e85-46f3-9152-429015c962d1","resolution":{"observed_at":"2026-08-04T14:54:05.379392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.14987","last_updated":"2022-12-29T08:08:04Z","snapshot_observed_at":"2026-07-06T13:26:14.318051Z","submitted_at":"2022-06-30T02:33:32Z","title":"Lookback for Learning to Branch","version":2},"cited_work":{"arxiv_id":"2206.14987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.14987","snapshot_observed_at":"2026-07-04T07:09:37.899030Z","title":"arXiv preprint arXiv:2206.14987 , year=","venue":null,"work_id":"852f3be0-952d-4890-bced-9f2a1bd97b5b","year":null},"citing_paper":{"arxiv_id":"2604.22107","last_updated":"2026-04-23T22:47:04Z","snapshot_observed_at":"2026-07-06T23:08:33.204647Z","submitted_at":"2026-04-23T22:47:04Z","title":"A Hybrid Reinforcement and Self-Supervised Learning Aided Benders Decomposition Algorithm","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-09T20:29:43.525551Z"},"links":{"cited_paper":"/paper/2206.14987","citing_paper":"/paper/2604.22107"},"observation_digest":"sha256:4ce1cb829e162c59a2bd9e78cdb9f920f5032ce88c8778c86ab72fa7bb8e1751","observation_id":"be7d70c1-6fec-4489-805f-247594ce9a19","resolution":{"observed_at":"2026-05-11T15:11:07.936813Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.14987","last_updated":"2022-12-29T08:08:04Z","snapshot_observed_at":"2026-07-06T13:26:14.318051Z","submitted_at":"2022-06-30T02:33:32Z","title":"Lookback for Learning to Branch","version":2},"cited_work":{"arxiv_id":"2206.14987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.14987","snapshot_observed_at":"2026-07-04T07:09:37.899030Z","title":"arXiv preprint arXiv:2206.14987 , year=","venue":null,"work_id":"852f3be0-952d-4890-bced-9f2a1bd97b5b","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":83,"source":"arxiv_source","source_observed_at":"2026-06-26T13:44:16.025930Z"},"links":{"cited_paper":"/paper/2206.14987","citing_paper":"/paper/2606.21483"},"observation_digest":"sha256:096122cee71049d6ab7e79c572050904292a5406e24deb27119444afbe1fa33d","observation_id":"6d77571c-b512-44f5-976f-80e6ecb36985","resolution":{"observed_at":"2026-07-04T07:09:37.900609Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.14987/citation-record","integrity":"/paper/2206.14987/integrity","json":"/paper/2206.14987/citation-record.json","paper":"/paper/2206.14987"},"outbound":[],"paper":{"arxiv_id":"2206.14987","last_updated":"2022-12-29T08:08:04Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:26:14.318051Z","submitted_at":"2022-06-30T02:33:32Z","title":"Lookback 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}