{"as_of":"2026-08-23T16:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f49942a1bb6299749cb29c1f62b4c2fc4eb16b8dbbaf77717a01e470dc4cedcb","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-23T06:30:58.430688+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-14T14:42:14.839085Z","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.905393Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.10294","last_updated":"2021-03-18T14:49:52Z","snapshot_observed_at":"2026-08-16T18:37:58.922884Z","submitted_at":"2021-03-18T14:49:52Z","title":"Learning to Schedule Heuristics in Branch-and-Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10294","snapshot_observed_at":"2026-08-14T14:42:14.839085Z","title":"Learning to schedule heuristics in branch-and-bound","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"1908.02894","last_updated":"2021-04-25T22:01:32Z","snapshot_observed_at":"2026-08-18T03:33:22.890926Z","submitted_at":"2019-08-08T01:08:08Z","title":"How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:42:14.839085Z"},"links":{"cited_paper":"/paper/2103.10294","citing_paper":"/paper/1908.02894"},"observation_digest":"sha256:0b1864769608e86e228cbed20325980554952897d308f46668e1bfd74a16d97e","observation_id":"4573a097-64cb-4f0d-8b39-44c33b0ad6d4","resolution":{"observed_at":"2026-08-14T14:42:14.839085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10294","last_updated":"2021-03-18T14:49:52Z","snapshot_observed_at":"2026-08-16T18:37:58.922884Z","submitted_at":"2021-03-18T14:49:52Z","title":"Learning to Schedule Heuristics in Branch-and-Bound","version":1},"cited_work":{"arxiv_id":"2103.10294","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10294","snapshot_observed_at":"2026-07-04T07:09:37.905393Z","title":"arXiv preprint arXiv:2103.10294 , year=","venue":null,"work_id":"1aaaca08-062c-4fcd-9695-424e0ec46e56","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":28,"source":"arxiv_source","source_observed_at":"2026-06-26T13:44:16.025930Z"},"links":{"cited_paper":"/paper/2103.10294","citing_paper":"/paper/2606.21483"},"observation_digest":"sha256:a8cd2b966acd95426a3a6522f9dc67dc3f4a6ab95c6ae94442b6e084ac38fcdb","observation_id":"5bec6ea0-7669-49a3-93aa-715b493d64be","resolution":{"observed_at":"2026-07-04T07:09:37.906831Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2103.10294/citation-record","integrity":"/paper/2103.10294/integrity","json":"/paper/2103.10294/citation-record.json","paper":"/paper/2103.10294"},"outbound":[],"paper":{"arxiv_id":"2103.10294","last_updated":"2021-03-18T14:49:52Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:37:58.922884Z","submitted_at":"2021-03-18T14:49:52Z","title":"Learning to Schedule Heuristics in Branch-and-Bound"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2103.10294."}