{"as_of":"2026-08-17T19:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e8427e037ef883edadb54e55bfe153edecb4abc8a4f7e7eeca35c11c6802567","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:58:02.955349Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-11T02:10:44.402412Z","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.082819Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2505.11636","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11636","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2505.11636 , year=","venue":null,"work_id":"5b589d3b-27f1-404b-918a-2c56919c297f","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":40,"source":"arxiv_source","source_observed_at":"2026-05-11T02:10:44.402412Z"},"links":{"cited_paper":"/paper/2505.11636","citing_paper":"/paper/2605.07239"},"observation_digest":"sha256:3bdc7f560ddedb35857ae931b245d4745c1c02db86e6d037ba58417ff8728cf7","observation_id":"c654334f-15bf-4b13-ba0c-a0ac0f93f4f9","resolution":{"observed_at":"2026-05-11T03:50:58.085139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.11636/citation-record","integrity":"/paper/2505.11636/integrity","json":"/paper/2505.11636/citation-record.json","paper":"/paper/2505.11636"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.769926Z","title":"Constraint integer programming","venue":null,"work_id":null,"year":2007},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.769926Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:87c2b29c9c746dbd12798ca782fdd7968bfef15d40117432a8d6730cfeaefac7","observation_id":"0b12bb7b-5901-4905-ba73-31dd38c7bb57","resolution":{"observed_at":"2026-08-15T20:58:02.769926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.495818Z","title":"Scip: solving constraint integer programs","venue":null,"work_id":"4d719694-f690-4158-9ad6-53a54b04dbe8","year":2009},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.774514Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:dde5b2fefd9084e52e673eeb4286db6a358857935fc42930eb80b41050685289","observation_id":"f454616a-8c49-4495-9082-63ce654e9cf2","resolution":{"observed_at":"2026-08-15T20:58:03.499918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.483075Z","title":"Branching rules revisited","venue":null,"work_id":"477ccb17-5248-4c24-9905-7e6aceed2c8b","year":2005},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.778701Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:c0893aa34a18f20c9fe4c905ffb42e1fc342169819c21b6ad0e2ab6d6aea778e","observation_id":"59e02e3a-ee9d-4ce3-8319-62216570f2f5","resolution":{"observed_at":"2026-08-15T20:58:03.487036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.469985Z","title":"A machine learning-based approximation of strong branching","venue":null,"work_id":"01ab2c82-3e46-49ca-b304-e0cbd02c413f","year":2017},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.783066Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:27edeef836c8c3eb337c52e5ad9bcd27d9095c67e3d54b15ac46411dda1fb75f","observation_id":"5e1e550e-6ce4-4519-8035-3bc1461aaa8a","resolution":{"observed_at":"2026-08-15T20:58:03.475117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.458249Z","title":"Neural network learning: Theoretical foundations, volume 9","venue":null,"work_id":"57c9eb4d-26d6-4f00-8540-e486df8a0aa3","year":1999},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.786820Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:d54cdaf3b908558b9cb01514e5ddb66ab9338f68a7df3f70efea5a69adf9a83a","observation_id":"b624f318-6b38-495f-9070-f874bdf25bf8","resolution":{"observed_at":"2026-08-15T20:58:03.462627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.446435Z","title":"Data-driven algirithm design","venue":null,"work_id":"8281f7ea-6e52-4dff-b03f-ed3316bb8a3b","year":2020},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.790936Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:16ec8e054def11c0bfb2cf32c1e15b9cda3c24be5d77a0fc83c19a50791a704a","observation_id":"c3e99c23-c07b-4c7d-9607-b13bda796f9f","resolution":{"observed_at":"2026-08-15T20:58:03.450318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15911","last_updated":"2025-05-18T15:13:22Z","snapshot_observed_at":"2026-08-17T17:42:02.398696Z","submitted_at":"2024-05-24T20:10:10Z","title":"Learning accurate and interpretable tree-based models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15911","snapshot_observed_at":"2026-08-15T20:58:02.795184Z","title":"Learning accurate and interpretable decision trees","venue":null,"work_id":null,"year":2024},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.795184Z"},"links":{"cited_paper":"/paper/2405.15911","citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:331429678c67396599aeff01923717213fe348761d60a87c43ecfe25facb4a59","observation_id":"9c13bb80-01df-4b80-be5b-5302f07d75a3","resolution":{"observed_at":"2026-08-15T20:58:02.795184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.799449Z","title":"Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems","venue":null,"work_id":null,"year":2017},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.799449Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:9766297a4093974291bd8ea62ef033aa32d5d641dcaf2dee27daaade2dd1180c","observation_id":"47850320-3403-422a-a2d2-9fb43dba658e","resolution":{"observed_at":"2026-08-15T20:58:02.799449Z","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-17T05:58:15.403858Z","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:0f3f0e36755d08dcde741ea2c60050a105ccb0ab251425e633898e960d7df7ae","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.425582Z","title":"Generalization in portfolio-based algorithm selection","venue":null,"work_id":"11c6220e-61b6-44c8-992c-dc8805ef463c","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":10,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.808034Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:b6d4006f7781f884bcebbf9730bc33a0e4957651a53903573b0d1e8954dc1932","observation_id":"5d0955f4-b762-4a0a-a629-1d1ab9070466","resolution":{"observed_at":"2026-08-15T20:58:03.429792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.811552Z","title":"How much data is sufficient to learn high-performing algorithms? J","venue":null,"work_id":null,"year":2024},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.811552Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:0d5dff97f405aa2bfa52eebc87f9d9a9694272b8987a0688e6f0ade7a7a63e84","observation_id":"811e9c45-bbab-430b-bd6b-71774803f8da","resolution":{"observed_at":"2026-08-15T20:58:02.811552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3637840","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.983891Z","title":"Learning to branch: Generalization guarantees and limits of data-independent discretization","venue":null,"work_id":"e5718c58-e992-4e5e-92c8-d1cbd8a9ef86","year":2024},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.815686Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:f99d23d09cfb13ac24ba41ea39c0407bf34ca4dd04968b2f8810e440f87774a0","observation_id":"855f8545-17e2-44cc-803c-93977e040145","resolution":{"observed_at":"2026-08-15T20:58:02.989948Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04367","last_updated":"2025-05-22T03:57:47Z","snapshot_observed_at":"2026-08-16T13:20:42.830996Z","submitted_at":"2024-09-06T15:58:20Z","title":"Algorithm Configuration for Structured Pfaffian Settings","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.04367","snapshot_observed_at":"2026-08-15T20:58:02.819319Z","title":"Algorithm configuration for structured pfaffian settings","venue":null,"work_id":null,"year":2024},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.819319Z"},"links":{"cited_paper":"/paper/2409.04367","citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:d0aeb09e4855f72f75f89bce2a142c833272e43f07b07c626a587774b16051e1","observation_id":"320eb3e0-ac5e-43e5-a660-f4051574c163","resolution":{"observed_at":"2026-08-15T20:58:02.819319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13734","last_updated":"2025-04-29T18:05:37Z","snapshot_observed_at":"2026-08-14T02:16:23.098708Z","submitted_at":"2025-01-23T15:10:51Z","title":"Sample complexity of data-driven tuning of model hyperparameters in neural networks with structured parameter-dependent dual function","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13734","snapshot_observed_at":"2026-08-15T20:58:02.823148Z","title":"Sample complexity of data-driven tuning of model hyperparameters in neural networks with structured parameter-dependent dual function","venue":null,"work_id":null,"year":2025},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.823148Z"},"links":{"cited_paper":"/paper/2501.13734","citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:7434eb1d088e89aa1f3870642e452b6567d01a641d035ccd26caad065a2e12e2","observation_id":"157374ac-d899-45ec-ad6c-765fe1dafd87","resolution":{"observed_at":"2026-08-15T20:58:02.823148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.414088Z","title":"Generalization guarantees for multi-item profit maximization: Pricing, auctions, and randomized mechanisms","venue":null,"work_id":"822f7c2e-88e9-4581-ba87-d15ce238a5a1","year":2025},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.827092Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:49e11c521d453c72282c9ffdfa3a060ff4e1a1a797f841ab6f56cac4a24165c0","observation_id":"f1a72d9f-55e0-4006-96e5-78ff5c4acefc","resolution":{"observed_at":"2026-08-15T20:58:03.418228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.400764Z","title":"Sample complexity of tree search configuration: Cutting planes and beyond","venue":null,"work_id":"5f12d408-fb26-4891-a363-002694729ec5","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":16,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.830782Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:ec233636e02f0b60f650d999ac9b421d6a1de193957e30b94efe79a6f123bb89","observation_id":"946af643-b3eb-47bd-86cb-dfb1c9537bee","resolution":{"observed_at":"2026-08-15T20:58:03.405900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.388194Z","title":"Provably tuning the E lastic N et across instances","venue":null,"work_id":"4074d943-9235-44a6-beef-8704325458c9","year":2022},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.834485Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:7d28fe45c40744c11baf26014a961c51e20101e0291a70e90857afc1f06633b6","observation_id":"947da4d2-bf0e-42f2-a0ac-34ee981de948","resolution":{"observed_at":"2026-08-15T20:58:03.392307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.376183Z","title":"Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts","venue":null,"work_id":"175ec404-41fe-40c3-9f2b-ecd7de00f022","year":2022},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.838239Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:75488aaa5156f5cd7ce387a0b3a03b8f7cf003ddc30b9bebc818b97bea27d76f","observation_id":"591cd80c-87bb-4469-9d33-0250e39f455c","resolution":{"observed_at":"2026-08-15T20:58:03.380412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.841698Z","title":"Generalization bounds for data-driven numerical linear algebra","venue":null,"work_id":null,"year":2013},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.841698Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:44e7557843205f06524bc90cba820a7af33ffcf0cf0fdfe5a4dce94c0ade4f7a","observation_id":"c341fc75-38e1-4c33-9c83-6a2acd7c33f8","resolution":{"observed_at":"2026-08-15T20:58:02.841698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.846487Z","title":"Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks","venue":null,"work_id":null,"year":2019},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.846487Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:c1ee93667d58533ed39959e97d4aac40eaef4740c3d1724cc2b5c3c0ee61c502","observation_id":"d27e4d3a-f39f-43fd-b722-67ba00988055","resolution":{"observed_at":"2026-08-15T20:58:02.846487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.349678Z","title":"A geometric approach to cut-generating functions","venue":null,"work_id":"f28c807c-2e3c-41f7-94fc-f3d7329aeb1c","year":2015},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.850370Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:0a7fed4a952dfe288de6a39afe32000c54bfcc33af52c72beb9aa1b4db30279e","observation_id":"1d84ea4b-8eb8-4870-a19b-f6ba0b1a7d00","resolution":{"observed_at":"2026-08-15T20:58:03.353701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.854184Z","title":"Learning cut generating functions for integer programming","venue":null,"work_id":null,"year":2024},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.854184Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:3b927b7f335b2d5a635e5f8cce861da58f375be034c19e21d316f38de038b5c8","observation_id":"a4d01dfb-3699-4b1a-91be-db1dc69e53c7","resolution":{"observed_at":"2026-08-15T20:58:02.854184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.329168Z","title":"Sample complexity of algorithm selection using neural networks and its applications to branch-and-cut","venue":null,"work_id":"588cd24e-a05d-44c3-9e2d-688ad2287cff","year":2024},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.857972Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:d5462d429355ad6390973b9eefd1a814ca99463378e8be0041c7ce483035b4b6","observation_id":"b3549548-e155-434e-ac04-e12d8c42ca93","resolution":{"observed_at":"2026-08-15T20:58:03.333491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.316731Z","title":"Integer programming, volume 271","venue":null,"work_id":"67d798ad-4ec4-4fb2-898d-7b44875bf863","year":2014},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.861505Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:0ec3e305f5f55530631df2a3eadc4721968f263798499ca175e57d82267ebe1a","observation_id":"4d7f30fa-af90-44c0-b3b5-4006ee61e933","resolution":{"observed_at":"2026-08-15T20:58:03.320944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.304305Z","title":"Cutting planes from the branch-and-bound tree: Challenges and opportunities","venue":null,"work_id":"939bb35c-a56c-40ef-b127-14d57f333e57","year":2023},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.865392Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:728c788b589d06d0a6208d9aef23ff2359e496210fe7aaa158efd8bec7401bf4","observation_id":"967055fb-8134-4803-8b3e-b3c8b2e0752a","resolution":{"observed_at":"2026-08-15T20:58:03.308256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.291515Z","title":"u t \\\"u nc \\","venue":null,"work_id":"d7fb4506-4db7-4ab2-b6e5-25be3dc5ffb3","year":2018},"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":26,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.869099Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:361e6af17dc1f36005801ab7dcfe76f6eb74b7e50ffa8070dd062251e0838155","observation_id":"54aeff4f-2c9a-4f56-a3b1-30f91109be21","resolution":{"observed_at":"2026-08-15T20:58:03.296340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.872858Z","title":"The scip optimization suite 7.0","venue":null,"work_id":null,"year":2020},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.872858Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:3bab5e1035a99874867367df1673fe2befa6cbdb3ccedc00f4a997f15f933923","observation_id":"7d159d23-036c-4ecc-823c-be3c8c5d5dc2","resolution":{"observed_at":"2026-08-15T20:58:02.872858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.877054Z","title":"Exact combinatorial optimization with graph convolutional neural networks","venue":null,"work_id":null,"year":2019},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.877054Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:582234873807c1eed297bda369fa4e42a604561c9c8683b6d4cf418cacad2fcc","observation_id":"7b0ee141-d853-4243-a673-6620afa79f4e","resolution":{"observed_at":"2026-08-15T20:58:02.877054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.881217Z","title":"Extremely randomized trees","venue":null,"work_id":null,"year":2006},"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":29,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.881217Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:0cde17f09c487fc0844f6ecfc3c2eee7ca92567585a0751e7c6aeb9ca4452227","observation_id":"b79cbee8-00c2-49ae-b057-c215a18a0d07","resolution":{"observed_at":"2026-08-15T20:58:02.881217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.257246Z","title":"A pac approach to application-specific algorithm selection","venue":null,"work_id":"580f4a44-75cd-43c0-b0e1-3389fc330e5d","year":2016},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.884663Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:9150a7ccb951c50b7eb0d72c00db92d99fe3b814042dc3088fa1aec17d2a76e4","observation_id":"4649b7eb-caba-4427-a8de-4103b97e1118","resolution":{"observed_at":"2026-08-15T20:58:03.262168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.244073Z","title":"Integer linear programming in computational and systems biology: an entry-level text and course","venue":null,"work_id":"fb823597-2091-41c2-827b-b1c97f2ff6dc","year":2019},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.888173Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:c8bc7ed186bddd67d2d317ec2f979f7d7bad02ffe32a18215be97deb13ef84d3","observation_id":"52b14b7d-c478-4601-942f-04c49064d100","resolution":{"observed_at":"2026-08-15T20:58:03.249575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.232206Z","title":"Learning to search in branch and bound algorithms","venue":null,"work_id":"c79b3be0-234b-4a5b-aa3a-ad724b8ac1ce","year":2014},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.891757Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:410224716d2d4add3397e8c736f63fdb449783b66399158e89967d3304ca187f","observation_id":"9d62c802-6418-4ece-93b5-03088598bf30","resolution":{"observed_at":"2026-08-15T20:58:03.236366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.895603Z","title":"Learning to select cuts for efficient mixed-integer programming","venue":null,"work_id":null,"year":2022},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.895603Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:70fad223ef517d32aa50f2ac62fcf1666488ed5a6b3d01f6f5edd645528ece44","observation_id":"4952e3a1-f003-4f28-aa70-64f37de52a25","resolution":{"observed_at":"2026-08-15T20:58:02.895603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.212274Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","venue":null,"work_id":"e0ad5252-f255-4ef8-82f3-74ba13a25e52","year":2025},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.899143Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:1e5aa1bad1e77a40c5a958e78ff48ec0b0d8a7c72600c445ea96590043f17ff5","observation_id":"daa76efe-97eb-4538-b3e5-3dd1fd6f32be","resolution":{"observed_at":"2026-08-15T20:58:03.217146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.200477Z","title":"50 Years of integer programming 1958-2008: From the early years to the state-of-the-art","venue":null,"work_id":"edad05fd-8d01-42f8-8704-289e9a20dcb0","year":1958},"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":35,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.902870Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:c265813fcad1c8b93c45419eea2d498296511574ffd8d35397a07a3656bde97d","observation_id":"4f77ec90-b0cb-427d-8097-4ddf4788bae0","resolution":{"observed_at":"2026-08-15T20:58:03.204538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.187372Z","title":"An abstract model for branch and cut","venue":null,"work_id":"3f6e94b9-7d1f-49d7-b036-d60a07df3e8f","year":2024},"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":36,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.906880Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:13fd10132303728c333be82342251f0903a8ba72d5766bfea610aac9711a31e6","observation_id":"2b610777-a6e9-478f-bc04-2ac71491a30e","resolution":{"observed_at":"2026-08-15T20:58:03.191752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.175447Z","title":"Design of survivable networks: A survey","venue":null,"work_id":"810b4091-1402-4db4-b13d-36bbfea82804","year":2005},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.910684Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:e0af819049cfd4b83dccd7e1fcaaf389fa28146c1e6dffefe45a6e0a2273b0e5","observation_id":"c0167e17-28cf-463a-94bd-a97f7c9af632","resolution":{"observed_at":"2026-08-15T20:58:03.179487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.914203Z","title":"Learning to branch in mixed integer programming","venue":null,"work_id":null,"year":2016},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.914203Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:4d57a62178a5227a362a1de5b7d5509511de372e27f5f7311b219acb7a2cb8c4","observation_id":"64e69ef4-2513-4ea3-b513-46e5f9f2f448","resolution":{"observed_at":"2026-08-15T20:58:02.914203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.155613Z","title":"A computational study of search strategies for mixed integer programming","venue":null,"work_id":"999d9163-ecb4-4e29-8121-15793951313e","year":1999},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.917857Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:e58bbf0b85a401960e2979f883e189fcf61475bbbc50cdfdcce40a3c1cb41371","observation_id":"8e594f74-e025-4e66-afbf-cd2b13ea70c5","resolution":{"observed_at":"2026-08-15T20:58:03.160129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.142943Z","title":"Foundations of Machine Learning","venue":null,"work_id":"5df54a9a-a0f9-41b7-a49e-f5225e9fbfbd","year":2018},"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":40,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.921340Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:79573d493bf33bb1717be4c52deb5d5581b8dddf6f571c4f3b38d27d7c957f28","observation_id":"2b67bad2-249a-49b5-8165-47e715b0668b","resolution":{"observed_at":"2026-08-15T20:58:03.147570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.130324Z","title":"Learning to cut by looking ahead: Cutting plane selection via imitation learning","venue":null,"work_id":"61185993-ba9f-4fc3-996b-b29b2da6b5d9","year":2022},"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":41,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.925062Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:b502a86f555b386e6df6577a31c20d4b42cc18f0ea8058274497bf0abf3523d9","observation_id":"95d19ed9-c8ff-40ba-a692-5cf8e67d198e","resolution":{"observed_at":"2026-08-15T20:58:03.134490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.928810Z","title":"Production planning by mixed integer programming, volume 149","venue":null,"work_id":null,"year":2006},"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":42,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.928810Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:8b4df64b21901b2264f966d6af59cd982934ebd5e5a8c5fbad90eca6f6adbf1d","observation_id":"e3427201-7f82-4f91-8c37-2c71a7c8fc14","resolution":{"observed_at":"2026-08-15T20:58:02.928810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.108901Z","title":"Sample complexity of learning heuristic functions for greedy-best-first and A * search","venue":null,"work_id":"3b6d5297-a8cd-4121-85d2-b54562564f01","year":2022},"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":43,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.932393Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:089a37db2308b88786a500d701211f94810e5c7226562a15ce55915586f0a2bd","observation_id":"5841cf5f-b4f8-48c9-a5e8-54cb0def8b43","resolution":{"observed_at":"2026-08-15T20:58:03.114675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.936557Z","title":"Generalization bound and learning methods for data-driven projections in linear programming","venue":null,"work_id":null,"year":2024},"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":44,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.936557Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:07c9410822487573dfa3dda1f928374bde3c23db462f273b5223ffca432bdbf3","observation_id":"25b0fb93-0405-45e6-aacc-90660c186617","resolution":{"observed_at":"2026-08-15T20:58:02.936557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.940434Z","title":"Understanding machine learning: From theory to algorithms","venue":null,"work_id":null,"year":2014},"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":45,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.940434Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:5ca764246b328b3b94946b53e1ece08f3e9b6d66c1bc6c0dd275c66c78cb8463","observation_id":"221ccf0d-6077-402c-9b55-13b9c845c849","resolution":{"observed_at":"2026-08-15T20:58:02.940434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:02.944316Z","title":"Reinforcement learning for integer programming: Learning to cut","venue":null,"work_id":null,"year":2020},"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":46,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.944316Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:06b69944c051a905a06e7e65a972213840be13f3d4e8cb63f6174519e4b7d79e","observation_id":"07a7fb05-bc4b-4d71-b7e1-6310138b4f11","resolution":{"observed_at":"2026-08-15T20:58:02.944316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.075296Z","title":"Vehicle routing: problems, methods, and applications","venue":null,"work_id":"88e8ac9f-488d-4653-b547-41ffbfa175aa","year":2014},"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":47,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.947910Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:a552ab56a5537eae875e7a7765b46c94a28614d101380d79c46adf7a3e485c57","observation_id":"76eb1c5c-1b02-49e8-8ef5-897aacdbb0cc","resolution":{"observed_at":"2026-08-15T20:58:03.079873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.062542Z","title":"Implementing cutting plane management and selection techniques","venue":null,"work_id":"c8ca353a-b163-48ab-b017-3a8a5d9d953d","year":2012},"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":48,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.951471Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:f2e0a17b8f2d12be794fe547af899b7a7b9d8a32f1bee48f01aec8061286c996","observation_id":"f6351438-9bbe-463e-8d6a-2eaec827658a","resolution":{"observed_at":"2026-08-15T20:58:03.066517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:03.048989Z","title":"A study of learning search approximation in mixed integer branch and bound: Node selection in scip","venue":null,"work_id":"6d3f1946-31f7-4b92-baac-d0eebd76f258","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":49,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.955349Z"},"links":{"citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:7e1dae48b6ed3d04997226fc9e6cbab1e93a4cc679a56fc062203e8b7e40ce10","observation_id":"903ba874-6195-48a4-95d1-5e0a806d6210","resolution":{"observed_at":"2026-08-15T20:58:03.054028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.11636","last_updated":"2025-05-16T19:00:02Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":49},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2505.11636."}