{"as_of":"2026-08-11T14:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a400ba1d98237bba4d83728dfa8d1417f09157683906148a021c6a51ab2d25a","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:58:00.703704Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.14545/citation-record","integrity":"/paper/2607.14545/integrity","json":"/paper/2607.14545/citation-record.json","paper":"/paper/2607.14545"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-11T04:38:08.231348Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23967","snapshot_observed_at":"2026-08-02T01:57:54.641353Z","title":"Improved approximations for hard graph problems using predictions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.641353Z"},"links":{"cited_paper":"/paper/2505.23967","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:8be1242d726db1311998e3d5d8537eba04b3be66dd6ab1b7b2706f9108dfe5ca","observation_id":"84871680-e607-4ea7-850a-98a5b0d54fcc","resolution":{"observed_at":"2026-08-02T01:57:54.641353Z","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-02T01:57:54.742334Z","title":"Presolve reductions in mixed integer programming","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.742334Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:985f70f9e261cfd5868a42991ee4c8b62eb59aff5e3e18d544f145a0fb2b9902","observation_id":"dbd9d8c2-063d-4d04-8b15-a6c35253f044","resolution":{"observed_at":"2026-08-02T01:57:54.742334Z","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-02T01:57:54.869594Z","title":"Approximation algorithms for combinatorial optimization with predictions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.869594Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:b8007e574d52f20ee8ddb1d84a07565867cf1492dfc95e7d63401d95ab84f00a","observation_id":"4e2c6735-a39b-4c16-8ab2-9ff2343bab3a","resolution":{"observed_at":"2026-08-02T01:57:54.869594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.07177","last_updated":"2020-11-14T00:51:57Z","snapshot_observed_at":"2026-08-07T10:15:16.236856Z","submitted_at":"2020-11-14T00:51:57Z","title":"Data-driven Algorithm Design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.07177","snapshot_observed_at":"2026-08-02T01:57:54.967235Z","title":"Data-driven algorithm design","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.967235Z"},"links":{"cited_paper":"/paper/2011.07177","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:11878b24b42d4baf61e73d882dca5dee8485fad16d5187c29d65e37921a43bfd","observation_id":"a5f89c91-ae2c-43d2-8375-bcee3ee21d29","resolution":{"observed_at":"2026-08-02T01:57:54.967235Z","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-02T01:57:55.089808Z","title":"Learning to branch","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.089808Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:a42ef902c9225aceb74b00131d5141f85b621e20dcf0e1edb65aa968333f13b3","observation_id":"530351cf-c3fe-4e21-aa80-1d647ba36008","resolution":{"observed_at":"2026-08-02T01:57:55.089808Z","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-02T01:57:55.203247Z","title":"How much data is sufficient to learn high-performing algorithms? Journal of the ACM, 71 0 (5): 0 1--58, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.203247Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:7aff2b32d7ac95e96066b8a19ab68810b119afb5349a5f752dc0f3f2a8daed2b","observation_id":"d0a72458-85d4-4a76-879d-dd48c37512e4","resolution":{"observed_at":"2026-08-02T01:57:55.203247Z","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-02T01:57:55.377570Z","title":"The primal-dual method for learning augmented algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.377570Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:4d26b42bfb22750f3d6b7aa95f4cd38a3a82a7e29a90e33bb25cdf238e7a8595","observation_id":"03034e74-17ab-4283-b9ab-f7b202e69921","resolution":{"observed_at":"2026-08-02T01:57:55.377570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-11T04:37:34.577274Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00841","snapshot_observed_at":"2026-08-02T01:57:55.546368Z","title":"Polynomial time learning-augmented algorithms for np-hard permutation problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.546368Z"},"links":{"cited_paper":"/paper/2502.00841","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:a7cfc3a8c1ed804985f97dc953f038623b6c6dad99ba39ef76d1e8abdbd4e994","observation_id":"b18f44ed-6c9e-49e6-846a-bd41667c8c3d","resolution":{"observed_at":"2026-08-02T01:57:55.546368Z","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-02T01:57:55.719159Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.719159Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:a50283c35b37daf10e4b42eb3ceeedacdcf5fdbd0ac21b3fb341cc0439a5083d","observation_id":"7d02c1a4-6133-41f2-85f7-438e2cd752ee","resolution":{"observed_at":"2026-08-02T01:57:55.719159Z","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-02T01:57:55.901209Z","title":"warm start","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.901209Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:ee3090a834e005b791b6de7117bbeca6a855c214c75f2c5e15f3445b06993ee0","observation_id":"a1a99933-813d-491e-88fc-73b812789ed8","resolution":{"observed_at":"2026-08-02T01:57:55.901209Z","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-02T01:57:56.067501Z","title":"Combinatorial optimization and reasoning with graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.067501Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:9be883d46930aa7215355b0f462d985413a2d29cfb7c5b0fe03f3588f3487222","observation_id":"3d776add-9288-46ef-9aee-6f417df0f074","resolution":{"observed_at":"2026-08-02T01:57:56.067501Z","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-02T01:57:56.263124Z","title":"Sample complexity of algorithm selection using neural networks and its applications to branch-and-cut","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.263124Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:28deb80ab439367af51fd3d18e427fc9a9c665dd342af2d6b73d2beccdf5c1e9","observation_id":"cf7e6b70-e01d-4b74-9cb2-01df93d94f3e","resolution":{"observed_at":"2026-08-02T01:57:56.263124Z","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-02T01:57:56.413352Z","title":"A greedy heuristic for the set-covering problem","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.413352Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:3b73caf9e3a448f07cf3eef4921712db16869b89cf2762e31df0a6d96c95bef9","observation_id":"5946109a-a55a-4324-baec-c0b461eb57c0","resolution":{"observed_at":"2026-08-02T01:57:56.413352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18263","last_updated":"2024-02-28T11:51:28Z","snapshot_observed_at":"2026-08-11T04:37:42.292321Z","submitted_at":"2024-02-28T11:51:28Z","title":"Max-Cut with $\\epsilon$-Accurate Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18263","snapshot_observed_at":"2026-08-02T01:57:56.652293Z","title":"Max-cut with -accurate predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.652293Z"},"links":{"cited_paper":"/paper/2402.18263","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:e5fcea8034a79c40d66c062d9de73a825896529b109623e3325b96afc4169828","observation_id":"3d54b3dd-037b-47e3-a8bb-1203e1882c94","resolution":{"observed_at":"2026-08-02T01:57:56.652293Z","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-02T01:57:56.806287Z","title":"Parameterized Algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.806287Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:af764d30a97208785738e3fa7597b4050da3cccf99af2520e60e00b4c2ef2c3b","observation_id":"4a9c90e8-5d86-4840-9ab0-4e10f496cbf0","resolution":{"observed_at":"2026-08-02T01:57:56.806287Z","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-02T01:57:56.986304Z","title":"Faster matchings via learned duals","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.986304Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:3b1c149afa4d7784b123ac6a6d6aab3d214180410691f1fbb8759402d2cde6d6","observation_id":"4acaad90-766b-4bb8-82fd-228cc8765c2c","resolution":{"observed_at":"2026-08-02T01:57:56.986304Z","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-02T01:57:57.125995Z","title":"Algorithms with prediction portfolios","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.125995Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:642f6fa7b006f725a67d93185ad9c2ef1219dc7c1a56d4218abf33e2c668bd70","observation_id":"86259ed0-a499-4781-8908-1d0ccfb9a8eb","resolution":{"observed_at":"2026-08-02T01:57:57.125995Z","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-02T01:57:57.263803Z","title":"Analytical approach to parallel repetition","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.263803Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:48f18640aefae910c6a7655833e4706afa59ccf757834b9fc0c87c8827d41788","observation_id":"d4a81ebc-e568-46e0-b057-f7c80b415221","resolution":{"observed_at":"2026-08-02T01:57:57.263803Z","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-02T01:57:57.363238Z","title":"Reduction tests for the steiner problem in grapsh","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.363238Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:bf16257e65bc22cc266edc37d1d4bf3c3261b56a918282fa1624f2a45e753d60","observation_id":"b2ab9f43-e80c-4930-bdcc-c55d45b7998e","resolution":{"observed_at":"2026-08-02T01:57:57.363238Z","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-02T01:57:57.459297Z","title":"Safe feature elimination in sparse supervised learning technical report no","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.459297Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:e9c69232c1a2c277b2d9c034f4ca9da1ba371e87a0014954ff4e9040b590db71","observation_id":"de555cab-b715-4485-aaad-e9e717c49ac3","resolution":{"observed_at":"2026-08-02T01:57:57.459297Z","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-02T01:57:57.569804Z","title":"A dual-based procedure for uncapacitated facility location","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.569804Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:0153e15b69bfb099268334699d7b2e0d3f4d9ddfc1b8eb071518c99cad400ebd","observation_id":"9bf5a664-c2e4-4195-8da0-549339257dba","resolution":{"observed_at":"2026-08-02T01:57:57.569804Z","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-02T01:57:57.713239Z","title":"A threshold of ln n for approximating set cover","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.713239Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:4991fc18824ed0850d6443a0beb1267727a32ba5df458845f61281fa3f3d1f5c","observation_id":"dfacb3ac-fcf8-4d37-b792-3336e06e17ff","resolution":{"observed_at":"2026-08-02T01:57:57.713239Z","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-02T01:57:57.844448Z","title":"Scip-jack—a solver for stp and variants with parallelization extensions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.844448Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:333c562f683fee3418f8f077f0e9849099966166a1f259575a0b4751fc34352f","observation_id":"fcde4a60-aad3-4767-ad3b-1a3283930dde","resolution":{"observed_at":"2026-08-02T01:57:57.844448Z","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-02T01:57:57.948812Z","title":"A pac approach to application-specific algorithm selection","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:57.948812Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:9f7e34c8fb807739cf65ed818f1659077d4a8651190c66a5a3ad35e11d7dd970","observation_id":"53a86576-8e2c-4385-9f1a-d9fa52d843d9","resolution":{"observed_at":"2026-08-02T01:57:57.948812Z","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-02T01:57:58.047926Z","title":"Approximation algorithms for the set covering and vertex cover problems","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.047926Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:cdc13ca6fb55663bb8fedcf7971e7e2ef3f2cbac077b660d3181f4c57fb3b1bf","observation_id":"640ba918-49dc-4b6f-b35c-8bb293c5edee","resolution":{"observed_at":"2026-08-02T01:57:58.047926Z","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-02T01:57:58.175366Z","title":"Reduction algorithm for zero-one single knapsack problems","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.175366Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:88dbc4ee20e47fee4c3c87270d96eb6f7472b870642f95f7641f8cd39ae39b1a","observation_id":"44b20c7c-fb23-4d8a-b8e2-9f0d7f09941c","resolution":{"observed_at":"2026-08-02T01:57:58.175366Z","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-02T01:57:58.290451Z","title":"Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.290451Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:3343621bbe4d7811f08cfe23aaa4c13d412a604bcbdb9b25ef48762ef358d44d","observation_id":"e2523580-b518-42ca-8b6b-1a303d286452","resolution":{"observed_at":"2026-08-02T01:57:58.290451Z","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-02T01:57:58.355467Z","title":"Vertex cover might be hard to approximate to within 2-","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.355467Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:8c083a89eba92155bf7db2dfff22d5d738ac45dbf6531940784ddcf5484a8bc3","observation_id":"070421c7-5f61-47ed-ae6a-dd93fb1e9f35","resolution":{"observed_at":"2026-08-02T01:57:58.355467Z","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-02T01:57:58.468751Z","title":"Fine-grained search space classification for hard enumeration variants of subset problems","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.468751Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:291db3664cb7730f5e0d6612e6371c88e6a07793a6373605bea8c61f1f90aedf","observation_id":"731abffe-67cc-423f-98a3-9877f9e1e653","resolution":{"observed_at":"2026-08-02T01:57:58.468751Z","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-02T01:57:58.587343Z","title":"A 1.488 approximation algorithm for the uncapacitated facility location problem","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.587343Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:f0b17929ce062441fa9808cf1618ca801f4200d82f865177247f000ebb22d3f7","observation_id":"5184deb7-edae-48d1-800b-07da4f2b14c6","resolution":{"observed_at":"2026-08-02T01:57:58.587343Z","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-02T01:57:58.687506Z","title":"-approximations with minimum packing constraint violation","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.687506Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:d11d09c04b8cf653220a5c4dadb333e8a329026abbdc44e8ffe276667385efe9","observation_id":"c62c0e9d-acc0-44bd-b140-c83c43d141e2","resolution":{"observed_at":"2026-08-02T01:57:58.687506Z","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-02T01:57:58.787717Z","title":"L2p-mip: Learning to presolve for mixed integer programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.787717Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:1dc6dae7f64d657083382c3026393ec0da7987e032aaf862a23e4ab264b56c92","observation_id":"db4a1c1f-0d53-41c8-b50b-d50d6e603e05","resolution":{"observed_at":"2026-08-02T01:57:58.787717Z","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-02T01:57:58.897509Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.897509Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:dcf2d917b5bc254c730cc3b28519b724a4aeeb807fe73dee7fd757515f12120f","observation_id":"d3e2b4a8-ecfd-40fa-8fac-976da4c561d3","resolution":{"observed_at":"2026-08-02T01:57:58.897509Z","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-02T01:57:58.971853Z","title":"Knapsack problems: algorithms and computer implementations","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:58.971853Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:b28099af294fe4bcd6cb4f0bb4ee21e622cf45737c5ff53879b50b881b5d68af","observation_id":"5a3abf47-4dd3-4ea4-a2c6-f5fd9f3b8da7","resolution":{"observed_at":"2026-08-02T01:57:58.971853Z","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-02T01:57:59.148833Z","title":"Certifying algorithms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:59.148833Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:ef678dffbf6f26ac7d83dd0b55316e9e88833f1d23dde95731f93360c06a1004","observation_id":"ecfaca12-f001-4151-bf7d-6e9280f1ae38","resolution":{"observed_at":"2026-08-02T01:57:59.148833Z","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-02T01:57:59.278126Z","title":"Algorithms with predictions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:59.278126Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:66c845335e721dc7edceaa08071f5037a8b0901fd66115d0d780bd715cb12506","observation_id":"a28f3bfc-f98f-4128-bb38-42e47d551295","resolution":{"observed_at":"2026-08-02T01:57:59.278126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13349","last_updated":"2021-07-29T13:41:25Z","snapshot_observed_at":"2026-08-07T23:29:46.974172Z","submitted_at":"2020-12-23T09:33:11Z","title":"Solving Mixed Integer Programs Using Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13349","snapshot_observed_at":"2026-08-02T01:57:59.370362Z","title":"Solving mixed integer programs using neural networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:59.370362Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:000ff385f0aa4e05c3f0e619a6441747a60fb4989d343bac8cfe330c5cd25f1f","observation_id":"d00cd95b-6a25-4d52-8712-9bfb8e95db2d","resolution":{"observed_at":"2026-08-02T01:57:59.370362Z","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-02T01:57:59.515968Z","title":"Gap safe screening rules for sparsity enforcing penalties","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:59.515968Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:187b663c89c58fde864569cfe6ccd278fcd27222459056122e7b013f41ce8af5","observation_id":"57922822-01cd-4b4e-8be8-8fb364b28353","resolution":{"observed_at":"2026-08-02T01:57:59.515968Z","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-02T01:57:59.679299Z","title":"Vertex packings: structural properties and algorithms","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:59.679299Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:7e490ac30836dacc17f245e3c14ed947924de9709228f5345efeb5086241c9e5","observation_id":"1b1acb22-e04e-4ce0-9539-366c4fb47b92","resolution":{"observed_at":"2026-08-02T01:57:59.679299Z","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-02T01:57:59.851152Z","title":"Where are the hard knapsack problems? Computers & Operations Research, 32 0 (9): 0 2271--2284, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:59.851152Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:a4b8ae2f47ebd7a9a17c8d592733eb73a0fe2d03edbeace4c200f14968d0011b","observation_id":"087b06e2-616b-4197-be62-088153c3d83c","resolution":{"observed_at":"2026-08-02T01:57:59.851152Z","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-02T01:58:00.008161Z","title":"Improved algorithms for the steiner problem in networks","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-02T01:58:00.008161Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:d40e041fcf2996800047da4143e4f97ae9fdb32c7f98bf0d94e6c3023ff64075","observation_id":"dc730f94-3ee4-44bf-953c-e77e1772c16f","resolution":{"observed_at":"2026-08-02T01:58:00.008161Z","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-02T01:58:00.206541Z","title":"Improving online algorithms via ml predictions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T01:58:00.206541Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:214b7906b2fc3633e4624ab16121ae9351324767e834ff78f2d3bf1feca5b729","observation_id":"0f4ddd4f-dc30-4d88-9097-2c071334f804","resolution":{"observed_at":"2026-08-02T01:58:00.206541Z","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-02T01:58:00.327290Z","title":"Beyond the worst-case analysis of algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-02T01:58:00.327290Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:0ac13ed286f5af9040aa282a2ed5480ebb073e0fd75ddd641a6a238a5b23e67b","observation_id":"84a6043a-172e-45ad-9e9b-a3b2d354d129","resolution":{"observed_at":"2026-08-02T01:58:00.327290Z","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-02T01:58:00.460921Z","title":"Approximation algorithms for facility location problems","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T01:58:00.460921Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:421a50b77fc2bf8f9330364d871c44ada6648adc6b8b677b21a4792ab9d506d9","observation_id":"be32cf10-9710-44fc-9ad3-ec9469054c5d","resolution":{"observed_at":"2026-08-02T01:58:00.460921Z","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-02T01:58:00.567619Z","title":"Using statistical measures and machine learning for graph reduction to solve maximum weight clique problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-02T01:58:00.567619Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:d098b29195027467dcf333a7b4be11e5727372f39368f3a55ec9a16f123e8b2d","observation_id":"c33d0e31-2763-47cd-b11b-2d431617e583","resolution":{"observed_at":"2026-08-02T01:58:00.567619Z","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-02T01:58:00.703704Z","title":"Optimal robustness-consistency trade-offs for learning-augmented online algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-02T01:58:00.703704Z"},"links":{"citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:220ee91001dedbb4cac76fc7f5c72de80f5c01569eb127b65a10f46aae193941","observation_id":"5bac2093-986e-455b-b032-a4d899f8849b","resolution":{"observed_at":"2026-08-02T01:58:00.703704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":46},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2607.14545."}