{"as_of":"2026-08-21T22:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3d16608398058de1a76cd282a15b01fb2b21e9b6a8f461e83f795c0895aa9a5","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-21T06:32:19.484+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-12T14:39:32.738064Z","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-07T12:19:55.279222Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02328","last_updated":"2024-06-04T17:05:20Z","snapshot_observed_at":"2026-08-16T14:21:47.352199Z","submitted_at":"2024-02-04T03:03:27Z","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02328","snapshot_observed_at":"2026-08-12T14:39:32.738064Z","title":"Sample complexity of algorithm selection using neural networks an d its applications to branch-and-cut","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15090","last_updated":"2024-11-22T17:34:04Z","snapshot_observed_at":"2026-08-16T08:35:41.466390Z","submitted_at":"2024-11-22T17:34:04Z","title":"Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:39:32.738064Z"},"links":{"cited_paper":"/paper/2402.02328","citing_paper":"/paper/2411.15090"},"observation_digest":"sha256:d43b513d66a8dab87dd4192870dce2adef103710b149e771ddd414a5bc037cc7","observation_id":"779eaec1-77ad-4622-abae-85defec9869a","resolution":{"observed_at":"2026-08-12T14:39:32.738064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02328","last_updated":"2024-06-04T17:05:20Z","snapshot_observed_at":"2026-08-16T14:21:47.352199Z","submitted_at":"2024-02-04T03:03:27Z","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut","version":3},"cited_work":{"arxiv_id":"2402.02328","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.02328","snapshot_observed_at":"2026-08-07T12:19:55.279222Z","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut","venue":"cs.LG","work_id":"bc055b60-5275-4378-97a8-7cbc08086ddd","year":2024},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-09T00:35:12.878860Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.628634Z"},"links":{"cited_paper":"/paper/2402.02328","citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:c52718f5676bbc494cbaecbcc57bb71367c8d484860be3dfde49754f737337d7","observation_id":"dc4a4fe9-4463-497d-8ea4-db2f2d2ee976","resolution":{"observed_at":"2026-08-07T12:19:55.338608Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.02328/citation-record","integrity":"/paper/2402.02328/integrity","json":"/paper/2402.02328/citation-record.json","paper":"/paper/2402.02328"},"outbound":[],"paper":{"arxiv_id":"2402.02328","last_updated":"2024-06-04T17:05:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:21:47.352199Z","submitted_at":"2024-02-04T03:03:27Z","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.02328."}