{"as_of":"2026-08-08T07:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:929e8df512784c2eb5e517af3f49d50345aa5f0c03871df11c11551c6ffadfb8","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:19:55.119600Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.014773Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"cited_work":{"arxiv_id":"2506.00252","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.00252","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2506.00252 , year=","venue":null,"work_id":"e2afeed3-7e11-4f64-9803-56a2dabc0909","year":null},"citing_paper":{"arxiv_id":"2605.07239","last_updated":"2026-05-08T04:52:59Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T04:52:59Z","title":"Sample Complexity of Stochastic Optimization with Integer Variables","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-11T02:10:44.402412Z"},"links":{"cited_paper":"/paper/2506.00252","citing_paper":"/paper/2605.07239"},"observation_digest":"sha256:53f3031d2a1c0e20ec7e80d1b5315d13134d8647ad8b8597e500cdb653a51f34","observation_id":"60f8d6a3-cfe3-4405-9d3a-7a8b3d47e7b0","resolution":{"observed_at":"2026-05-11T03:50:58.016781Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.00252/citation-record","integrity":"/paper/2506.00252/integrity","json":"/paper/2506.00252/citation-record.json","paper":"/paper/2506.00252"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:19:58.639691Z","title":"Neural network learning: Theoretical foundations","venue":null,"work_id":"ce1180db-89d3-4ee1-bdd7-6078f83fcd27","year":2009},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.161349Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:1b5e3deafe603ed428ef4b8f081c15c5b810e4112e35ebc89ed4e139043a3fe8","observation_id":"d1d66e27-b2e9-413a-b213-cfa40ec71060","resolution":{"observed_at":"2026-08-07T12:19:58.719610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:58.430197Z","title":"Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks","venue":null,"work_id":"e7e48e71-88ed-49fb-906c-31432f37cfe7","year":2019},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.269816Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:fb1932c26f35faeb069b47c76743a529ac40b43ab7f65a065d2a057edccf7845","observation_id":"c026e06a-66c2-442a-9cd0-e947b6c56254","resolution":{"observed_at":"2026-08-07T12:19:58.555648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:58.236642Z","title":"Sample complexity of tree search configuration: Cutting planes and beyond","venue":null,"work_id":"a61e1c1b-2627-47d9-b8b4-4396a1c4b8ec","year":2021},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.360477Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:b29ac077a5a417f733aca4c6bd762491d698322664d20e7b8fe8cede30cb5499","observation_id":"de262358-c797-4338-ba5f-47ed0abd96f1","resolution":{"observed_at":"2026-08-07T12:19:58.343515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:58.051737Z","title":"Integer programming , volume 271","venue":null,"work_id":"1029e79c-cdf9-446e-aa17-4089761db298","year":2014},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.448843Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:f09ff465381dab041e74408893370720ede8473a85ff6d83600b8ff322fa78b4","observation_id":"cf30c805-1729-408e-a2ab-7a589fe5a5b5","resolution":{"observed_at":"2026-08-07T12:19:58.155865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:57.831061Z","title":"Chv\\'atal","venue":null,"work_id":"f733d971-46a0-4e58-bf30-a75be845a080","year":1973},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.548198Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:a375781904fc83a885f9626c824fcadb75651462c35d4f7e4fa3d821fd82dbac","observation_id":"8fa27d63-fae9-441b-b608-4f24e80efd3f","resolution":{"observed_at":"2026-08-07T12:19:57.926258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02328","last_updated":"2024-06-04T17:05:20Z","snapshot_observed_at":"2026-07-06T17:24:57.402088Z","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-07T12:06:57.606271Z","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:1f89269d86a293aaad90b82070fb380891cabb2db7c63c168f3f2ce2af0ffb1e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:57.627814Z","title":"Rethinking the capacity of graph neural networks for branching strategy","venue":null,"work_id":"dd760919-f970-43b6-8e3a-9b81e05218cc","year":2024},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.717143Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:0499a09e549512672d19ff5d84b2c0fcae4c361948d712d3177fb6a70c2b3fed","observation_id":"de28d8e3-f5d0-472c-891e-f3dfd8df75ff","resolution":{"observed_at":"2026-08-07T12:19:57.717902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09166","last_updated":"2023-10-31T15:57:05Z","snapshot_observed_at":"2026-08-07T23:44:01.569795Z","submitted_at":"2023-02-17T22:26:49Z","title":"Machine Learning for Cutting Planes in Integer Programming: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09166","snapshot_observed_at":"2026-08-07T12:19:53.788524Z","title":"Machine learning for cutting planes in integer programming: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.788524Z"},"links":{"cited_paper":"/paper/2302.09166","citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:8065761e83d94c570ddb6de71806d3a1bf60e30729dfbd9b820c490066ec31bf","observation_id":"59c06e39-e4db-42fa-a465-3499179425ad","resolution":{"observed_at":"2026-08-07T12:19:53.788524Z","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-07T12:19:57.341007Z","title":"Generalization of erm in stochastic convex optimization: The dimension strikes back","venue":null,"work_id":"8845f925-ef03-4dec-a097-5561fc56a6fe","year":2016},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.864721Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:03400edd7752d4a4fffb9b12a960bdc340ac525caea96dcca49af370ce5f3165","observation_id":"2be8d7b1-c638-4a05-833f-a0adf75edc9c","resolution":{"observed_at":"2026-08-07T12:19:57.510390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:57.161537Z","title":null,"venue":null,"work_id":"1d0535b9-80d3-4a42-8974-df668b64bbe6","year":1958},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:53.962394Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:b15a7936234c9168e404e181655227e393ea20044e491ba5fb9bfa3084b8766d","observation_id":"c75397b9-7c65-4e43-8f2b-836c7e1bfc85","resolution":{"observed_at":"2026-08-07T12:19:57.258876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:56.969911Z","title":"A pac approach to application-specific algorithm selection","venue":null,"work_id":"63325c0d-9610-4f56-963d-f780dba61c10","year":2016},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.046261Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:8e360752a358631a99e4c1b5b0a29c7b6ced8bd6a53e774f708a9cdaef713759","observation_id":"9293b657-a35c-4fa5-ba0d-8eeabbd15bae","resolution":{"observed_at":"2026-08-07T12:19:57.041721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:56.790764Z","title":null,"venue":null,"work_id":"3cbd0e5b-5315-4dd4-ac99-88cfd5be8bb7","year":null},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.135362Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:9df88892d96ab9a408fcce2c0cb5168ff2a1d76e2d53d7b5bdd319c3b11c0c63","observation_id":"7cbb236a-ec68-4db3-af3b-58ceaf15df7d","resolution":{"observed_at":"2026-08-07T12:19:56.843931Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:56.581424Z","title":"Learning to select cuts for efficient mixed-integer programming","venue":null,"work_id":"3fc1d35b-e69e-4680-ad40-00e47b385a69","year":2022},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.243322Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:7db831acb06c702174d835232e26ca2bdfb9088177c1d355d18fc2fd10c2d314","observation_id":"1a45aa8d-7aac-4f5d-ba9c-0039c4a2a204","resolution":{"observed_at":"2026-08-07T12:19:56.669392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:56.396618Z","title":"Mixed integer programming computation","venue":null,"work_id":"bc7b4dad-619e-4e66-b492-4863d449f0a9","year":1958},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.309818Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:71e22e40a82303721369fa0b2c679c10854aee1f616bf894ede309c165fef1f0","observation_id":"1466ec31-4970-4ec4-98ee-d0c350799fe6","resolution":{"observed_at":"2026-08-07T12:19:56.479893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:56.237018Z","title":"Learning to stop cut generation for efficient mixed-integer linear programming","venue":null,"work_id":"dac4e416-7c19-49d7-b54c-861fa242cf8c","year":2024},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.384382Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:658ea1d017a2bf3049dd291a2f3f79d2c1ce10a1fcd61bf67e1036de7fbb2a32","observation_id":"c3c3a6f8-eff0-4a83-8d80-b5e28771b01c","resolution":{"observed_at":"2026-08-07T12:19:56.296070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:54.532824Z","title":"Algorithms with predictions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.532824Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:d28ebaa83c70defd33696d13264bd98ed8c86a66836af3d4d45a2d873c2c6b87","observation_id":"12b74494-cc26-4437-a8f2-168c1a4d49c6","resolution":{"observed_at":"2026-08-07T12:19:54.532824Z","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-07T12:19:56.076943Z","title":"Integer and combinatorial optimization , volume 18","venue":null,"work_id":"595c300b-a0a7-4d2a-8a73-28f43055225b","year":1988},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.629789Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:de1547deeb47d7afc4959ae5c8a3c1c4fe8fa42346cb11576d602e0ebdfad736","observation_id":"48fa4827-9a4d-479a-8e5c-c0f0ad65bac5","resolution":{"observed_at":"2026-08-07T12:19:56.164666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:55.963129Z","title":"Learning to cut by looking ahead: Cutting plane selection via imitation learning","venue":null,"work_id":"9cf290e2-0595-4d52-80b0-d7d21af2dae6","year":2022},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.733182Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:305b68a95504b9a74faf20519793cc7f9e983b98dc2ab1cc5f15cab70b1557e8","observation_id":"2355c4d5-5c27-4d66-a18a-a36f40dba4b5","resolution":{"observed_at":"2026-08-07T12:19:56.019804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:55.833288Z","title":"The algorithm selection problem","venue":null,"work_id":"f130f170-8fd5-4b8f-b50f-96a646ed3590","year":1976},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.823378Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:12e8d49e1044f6e601e60709be99476c924e71abe4339605ecf7b07fb5138fb9","observation_id":"e4172877-05f3-4010-bc09-f8747bd598ec","resolution":{"observed_at":"2026-08-07T12:19:55.884539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:55.694672Z","title":"Theory of Linear and Integer Programming","venue":null,"work_id":"b278cd15-d581-47b9-b818-b4e166377261","year":1986},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:54.895272Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:23c64b3c42948375826d404e45e47d007081424b0d2c800944cdbe5b159bc252","observation_id":"5c0de0c2-f1d4-486a-bd1e-97b678583633","resolution":{"observed_at":"2026-08-07T12:19:55.752834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:55.547692Z","title":"Stochastic convex optimization","venue":null,"work_id":"a5ab4fd3-0dc3-47c7-a62f-20310da77aec","year":2009},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:55.003737Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:b037fe4669a1083bd4f5f707e0b94e46996ed55ed5882e6a04d9d022f1b23b1a","observation_id":"5e0c61bd-385a-4804-8be9-84eca65e653e","resolution":{"observed_at":"2026-08-07T12:19:55.605868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:19:55.398325Z","title":"Reinforcement learning for integer programming: Learning to cut","venue":null,"work_id":"bb54f5a8-1381-454f-9842-96555de506cc","year":2020},"citing_paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:19:55.119600Z"},"links":{"citing_paper":"/paper/2506.00252"},"observation_digest":"sha256:3ab96a96939390d7fe223ca078cb1de3604ec89e57cff51542877e5292520669","observation_id":"30a8197d-1364-4898-85bc-06fac2e83dba","resolution":{"observed_at":"2026-08-07T12:19:55.465262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.00252","last_updated":"2025-05-30T21:41:01Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T12:06:57.606271Z","submitted_at":"2025-05-30T21:41:01Z","title":"How hard is learning to cut? Trade-offs and sample complexity"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":3,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":22},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 1 inbound Pith citation observation for arXiv:2506.00252."}