{"as_of":"2026-08-17T01:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:181383be5dc301e4981dcb1c94b42b8eede594713cdda14266888546aedac41a","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-16T06:30:59.297886+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-15T20:58:02.803315Z","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-05-11T03:50:58.041264Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.11207","last_updated":"2022-05-11T21:33:18Z","snapshot_observed_at":"2026-08-16T17:41:00.280754Z","submitted_at":"2021-11-18T04:07:29Z","title":"Improved Sample Complexity Bounds for Branch-and-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.11207","snapshot_observed_at":"2026-08-11T13:12:21.499741Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.499741Z"},"links":{"cited_paper":"/paper/2111.11207","citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:951f0a652f1c0691c5b4bcfe15123c90a3ce4656aba8f4eb296b3242999bacaa","observation_id":"65ba58d5-05b2-43bf-88cd-59378ad92bb3","resolution":{"observed_at":"2026-08-11T13:12:21.499741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.11207","last_updated":"2022-05-11T21:33:18Z","snapshot_observed_at":"2026-08-16T17:41:00.280754Z","submitted_at":"2021-11-18T04:07:29Z","title":"Improved Sample Complexity Bounds for Branch-and-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.11207","snapshot_observed_at":"2026-08-15T20:58:02.803315Z","title":"Improved sample complexity bounds for branch-and-cut","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11636","last_updated":"2025-05-16T19:00:02Z","snapshot_observed_at":"2026-08-15T20:48:31.376005Z","submitted_at":"2025-05-16T19:00:02Z","title":"Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.803315Z"},"links":{"cited_paper":"/paper/2111.11207","citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:a257cf5fd162b813f528377bf309faf3d49729cc38d74af07746b87134fcdf47","observation_id":"61fd2a81-ecaa-456b-b3cf-27e50285b257","resolution":{"observed_at":"2026-08-15T20:58:02.803315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.11207","last_updated":"2022-05-11T21:33:18Z","snapshot_observed_at":"2026-08-16T17:41:00.280754Z","submitted_at":"2021-11-18T04:07:29Z","title":"Improved Sample Complexity Bounds for Branch-and-Cut","version":2},"cited_work":{"arxiv_id":"2111.11207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.11207","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2111.11207 , year=","venue":null,"work_id":"f744d3c3-05ee-4f5c-96a2-f97567ea2088","year":null},"citing_paper":{"arxiv_id":"2605.07239","last_updated":"2026-05-08T04:52:59Z","snapshot_observed_at":"2026-08-16T23:36:43.371737Z","submitted_at":"2026-05-08T04:52:59Z","title":"Sample Complexity of Stochastic Optimization with Integer Variables","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-11T02:10:44.402412Z"},"links":{"cited_paper":"/paper/2111.11207","citing_paper":"/paper/2605.07239"},"observation_digest":"sha256:c6047fadb47303935e6300fa411116ea1a0f89a954e0e7d2ef4afd350bbcb233","observation_id":"d2b03926-d241-4c85-a1cc-b7a4f959d0b8","resolution":{"observed_at":"2026-05-11T03:50:58.051027Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.11207/citation-record","integrity":"/paper/2111.11207/integrity","json":"/paper/2111.11207/citation-record.json","paper":"/paper/2111.11207"},"outbound":[],"paper":{"arxiv_id":"2111.11207","last_updated":"2022-05-11T21:33:18Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:41:00.280754Z","submitted_at":"2021-11-18T04:07:29Z","title":"Improved Sample Complexity Bounds for Branch-and-Cut"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2111.11207."}