{"as_of":"2026-08-12T05:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d995e92bdd313ad16aa7e250d08b4faf3a4e09f704081c30b4c197e15f5d548b","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:20:34.599943Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:20:34.457147Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T12:19:18.205977Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14382","snapshot_observed_at":"2026-08-11T12:20:34.457147Z","title":"Balans: Multi-armed bandits-based adaptive large neighborhood search for mixed-integer programming problem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.457147Z"},"links":{"cited_paper":"/paper/2412.14382","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:d3e9720f67b69dc4412354cc2ae0abb805db19034b2dc64bb3fad86f788e441f","observation_id":"8a291054-99fd-47c3-989e-4996c4638c81","resolution":{"observed_at":"2026-08-11T12:20:34.457147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"cited_work":{"arxiv_id":"2412.14382","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.14382","snapshot_observed_at":"2026-08-11T12:19:18.205977Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","venue":"cs.AI","work_id":"90160d6a-1484-4d66-a233-9666562d2686","year":2024},"citing_paper":{"arxiv_id":"2412.14409","last_updated":"2025-06-11T21:30:19Z","snapshot_observed_at":"2026-08-11T12:14:13.698732Z","submitted_at":"2024-12-18T23:33:32Z","title":"Multi-task Representation Learning for Mixed Integer Linear Programming","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T12:19:17.582977Z"},"links":{"cited_paper":"/paper/2412.14382","citing_paper":"/paper/2412.14409"},"observation_digest":"sha256:f4ccb61676f5e4ba29550c2d7a10e51e28b0f0017964fad443144eb8a33435b4","observation_id":"b033c820-3803-47ee-b81f-20c363754801","resolution":{"observed_at":"2026-08-11T12:19:18.214112Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.14382/citation-record","integrity":"/paper/2412.14382/integrity","json":"/paper/2412.14382/citation-record.json","paper":"/paper/2412.14382"},"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-11T12:20:35.271993Z","title":"Rounding and propagation heuristics for mixed integer programming","venue":null,"work_id":"64226b27-edd7-4e75-9f40-54da484d36de","year":2011},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.416110Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:f561c29df992b00bb0647582fc0bf73cf0c3bdbeb6d6b157217c3bc77e9ba785","observation_id":"458a4394-77a0-4544-9b0b-2423d3bf5769","resolution":{"observed_at":"2026-08-11T12:20:35.276600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.259477Z","title":"Hyper-heuristics using multi-armed bandit models for multi-objective optimization","venue":null,"work_id":"1efd7f68-5f9d-4b8a-bab5-d479e5b3c200","year":2020},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.421944Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:734b0199b4d0abf5d8cbd20e7a111d99d0d1f9e1a399fa459947d63aefcbf74a","observation_id":"0af1b0ba-24ff-4cfb-b09f-8b4c76bca8ea","resolution":{"observed_at":"2026-08-11T12:20:35.263426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.248238Z","title":"Athanor: high-level local search over abstract constraint specifications in essence","venue":null,"work_id":"62124771-c938-4329-b408-05e0d357408c","year":2019},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.425930Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:8cc88dc1d4b991955908ec1312c0689d464deb688f2a2c723007c0a3411ca4db","observation_id":"5f758712-6ee7-470c-92e5-1efa84f97abd","resolution":{"observed_at":"2026-08-11T12:20:35.252222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.235214Z","title":"Finite-time analysis of the multiarmed bandit problem","venue":null,"work_id":"7d82ce5c-0616-4319-b9c1-91889fd39589","year":2002},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.429919Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:d4a7471fc23a83c63637c440f5f32616eb984b8ac8f16b9b8094e264ba51c088","observation_id":"8fcc0c27-9226-4584-9ca4-d2b3f5c10eae","resolution":{"observed_at":"2026-08-11T12:20:35.239591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.223365Z","title":"Machine learning for combinatorial optimization: A methodological tour d’horizon","venue":null,"work_id":"63fca40a-8f1b-4d4c-aafb-c09529f543be","year":2021},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.434274Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:816cdd91d7bc8448ee2a8ce5ac6912d29827e20fb4a4d3b9ab0200b055c816a5","observation_id":"3fad60da-b6f3-4715-8081-0b1d0c842bc7","resolution":{"observed_at":"2026-08-11T12:20:35.227356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.210766Z","title":"Primal heuristics for mixed integer programs","venue":null,"work_id":"b8f3a599-9d1c-4c82-8614-1ee96d29b411","year":2006},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.437966Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:9415709138ab861c001587c4fcfec651191bb6d415ce6628eb6312f38811be4b","observation_id":"37fdcee6-5f1a-450d-9e7f-ef46c0726363","resolution":{"observed_at":"2026-08-11T12:20:35.215437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.196176Z","title":"Rens: the optimal rounding","venue":null,"work_id":"98709412-c6fa-4f73-9894-cace6e67325d","year":2014},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.442174Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:e53167ffe07b103ceb15f333aeb93bdcd1e96b80dd25487c4fd4d582bc980bce","observation_id":"f10d867b-a0cf-4f96-860e-e5f3736eebac","resolution":{"observed_at":"2026-08-11T12:20:35.201318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-08-09T15:59:40.427485Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-11T12:20:34.445949Z","title":"The scip optimization suite 9.0","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.445949Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:39a91ad9007dd97b1fd16f1c3e8a7b731cb7417dd2c13a6a2e356ef303177334","observation_id":"59816b02-70a1-486f-8b05-0aaf34a67372","resolution":{"observed_at":"2026-08-11T12:20:34.445949Z","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-11T12:20:35.182682Z","title":"Learning backdoors for mixed integer programs with contrastive learning","venue":null,"work_id":"ff48b228-3568-4eae-a255-5119bc51c521","year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.449699Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:60f1dd2d022effb8f53eea95750716218343286ff7e650731ce9b61094cb64ee","observation_id":"2caeab4b-bf4e-4a5e-807e-59688255dffa","resolution":{"observed_at":"2026-08-11T12:20:35.187111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14409","last_updated":"2025-06-11T21:30:19Z","snapshot_observed_at":"2026-08-11T12:14:13.698732Z","submitted_at":"2024-12-18T23:33:32Z","title":"Multi-task Representation Learning for Mixed Integer Linear Programming","version":2},"cited_work":{"arxiv_id":"2412.14409","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.14409","snapshot_observed_at":"2026-08-11T12:20:34.715019Z","title":"Multi-task Representation Learning for Mixed Integer Linear Programming","venue":"cs.AI","work_id":"87bcef84-5e6b-47c4-a877-ad962d910708","year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.453420Z"},"links":{"cited_paper":"/paper/2412.14409","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:57c481ac2e9b8bcc2ad6fc980b00ac5c0c5232309765e745f800f40bb801500c","observation_id":"d6a2ff4e-7e02-4bb9-82cb-695797b4a531","resolution":{"observed_at":"2026-08-11T12:20:34.720938Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14382","snapshot_observed_at":"2026-08-11T12:20:34.457147Z","title":"Balans: Multi-armed bandits-based adaptive large neighborhood search for mixed-integer programming problem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.457147Z"},"links":{"cited_paper":"/paper/2412.14382","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:d3e9720f67b69dc4412354cc2ae0abb805db19034b2dc64bb3fad86f788e441f","observation_id":"8a291054-99fd-47c3-989e-4996c4638c81","resolution":{"observed_at":"2026-08-11T12:20:34.457147Z","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-11T12:20:35.170762Z","title":"Learning to schedule heuristics in branch and bound","venue":null,"work_id":"278544d3-5857-45bc-a747-b5257037ed07","year":2021},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.462073Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:421951c37910091e56e5d6f6663639f98135950c8a5013137de400845aea3218","observation_id":"a43f5332-fc54-4aa9-b6cc-b9e9fc59b2e2","resolution":{"observed_at":"2026-08-11T12:20:35.174460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.158029Z","title":"Online learning for scheduling mip heuristics","venue":null,"work_id":"b20ebf5e-4f1b-47a7-9a9f-0ee0462f7e9f","year":2023},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.465417Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:e1e95dba11ab790d63912eb850603ffbba81bd011fabff82aecba5bbd3c0d987","observation_id":"2b6618e9-09a8-4479-998d-16239d6d729c","resolution":{"observed_at":"2026-08-11T12:20:35.162416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.145500Z","title":"Exploring relaxation induced neighborhoods to improve mip solutions","venue":null,"work_id":"576868a3-943f-4941-8df3-d50111621496","year":2005},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.469107Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:cad34988b0bdfc3daa9679545d73d84108ff55eca3c5efe9c7f09b60db385a7c","observation_id":"f2e3a14c-75b3-4d41-839c-5c7870a5b876","resolution":{"observed_at":"2026-08-11T12:20:35.149253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.133627Z","title":"Accelerating primal solution findings for mixed integer programs based on solution prediction","venue":null,"work_id":"d2155861-ec7f-4f9a-8f93-84784901525a","year":2020},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.472075Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:d533489b9a55119ef0ce271233a8f6cfb46554be94f721eb29a258a0cec48dc9","observation_id":"649775d4-91ae-4a7c-ab4f-1ea68260b589","resolution":{"observed_at":"2026-08-11T12:20:35.137990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.122942Z","title":"Local branching","venue":null,"work_id":"81d3428e-e88b-4d85-ace6-adce1dffd1ee","year":2003},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.475622Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:bc89520819104ac602ecbb7c0825cfba2b523994314bc8806776698c92c7314c","observation_id":"787a8db2-c3b3-4ba8-b8fd-0e1b0b55b23e","resolution":{"observed_at":"2026-08-11T12:20:35.126304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.111531Z","title":"Proximity search for 0-1 mixed-integer convex programming","venue":null,"work_id":"7650dae1-101d-4d76-9ce1-d29817bd3512","year":2014},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.479653Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:fcce119012bc8d63ba3380c035f268b1473e918a4aaf7cd9e22b16daaceee48d","observation_id":"95b26815-c68f-4518-99f5-fbe1cfaa6d33","resolution":{"observed_at":"2026-08-11T12:20:35.115093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.100081Z","title":"Dins, a mip improvement heuristic","venue":null,"work_id":"da42e429-9c06-4fce-b96b-516d0f3d2d62","year":2007},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.483611Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:f1b30baaa3c106aea4d8eae13f492cacecf6b46c4d5c42ab07eaba67a65e6b5e","observation_id":"4cd7af5c-d40b-4caa-9410-81b8fd2b22ab","resolution":{"observed_at":"2026-08-11T12:20:35.103472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.090008Z","title":"Miplib 2017: data-driven compilation of the 6th mixed-integer programming library","venue":null,"work_id":"7b098b04-18e1-4618-a0aa-99bbd5115a07","year":2017},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.487162Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:04f7d1be877a48740b35770e0dda7f08922ed74375388aa0638145887f8b3c7d","observation_id":"d40ffd6c-de20-4b42-bd88-1768a76e9a82","resolution":{"observed_at":"2026-08-11T12:20:35.093627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.077011Z","title":"Gurobi Optimizer Reference Manual , 2024","venue":null,"work_id":"3734df71-1544-4307-9f2d-a83a6b2a2155","year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.491003Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:e4c9be31b69eeb31e6283826bf282e24e6a8e0ec81753208e9b0d983035c3b91","observation_id":"4dd73094-6fb0-45cb-9128-58f0eb12ad4e","resolution":{"observed_at":"2026-08-11T12:20:35.082802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.062235Z","title":"Learning to search in branch and bound algorithms","venue":null,"work_id":"30dd68b8-f605-4443-8bba-361e5770bc83","year":2014},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.494507Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:b93c10a37e59650df563a6a1543f6e3c81afd85bdf36c36c12da39f68daf2cd0","observation_id":"18f34c24-d09f-46b8-a16c-ded3f67f94a6","resolution":{"observed_at":"2026-08-11T12:20:35.067282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.050169Z","title":"Adaptive large neighborhood search for mixed integer programming","venue":null,"work_id":"1a6a5149-839d-47be-a214-bbb67d9a363f","year":2022},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.497613Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:39056114542a3b17269ef3442563fce695e9444aaafc85bd5ade312475b235bb","observation_id":"8e840437-f9f9-4f15-9a70-4bf75511756d","resolution":{"observed_at":"2026-08-11T12:20:35.054130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.037185Z","title":"Local branching relaxation heuristics for integer linear programs","venue":null,"work_id":"72eeb6b6-d8d7-4fcc-ab6e-ac25849bf41a","year":2023},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.500794Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:56c3109c1772730a9f91383a05958d20a4dfc41c6eda630c03a9a2727d61b34a","observation_id":"bc1bb8c9-01fc-49df-b5e3-ee8991676727","resolution":{"observed_at":"2026-08-11T12:20:35.042621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:35.026141Z","title":"Searching large neighborhoods for integer linear programs with contrastive learning","venue":null,"work_id":"3601a908-609d-4fb1-8ebd-97f77d45a149","year":2023},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.503976Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:29313a7559d69fc6b0c92623500a904f493320d24a2551e9944b4a8efa3ac503","observation_id":"364d91a1-9d59-4f9c-9663-41c77e1fd79d","resolution":{"observed_at":"2026-08-11T12:20:35.030445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06954","last_updated":"2024-10-27T01:54:10Z","snapshot_observed_at":"2026-08-11T05:35:49.149098Z","submitted_at":"2024-06-11T05:25:38Z","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06954","snapshot_observed_at":"2026-08-11T12:20:34.507171Z","title":"Distributional miplib: a multi-domain library for advancing ml-guided milp methods","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.507171Z"},"links":{"cited_paper":"/paper/2406.06954","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:44254eb352e2fd5442bde424b240f5037724e3f03f83e4177789ad046436690f","observation_id":"edad81f8-94f1-46b4-a09c-3dbeab1df839","resolution":{"observed_at":"2026-08-11T12:20:34.507171Z","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-11T12:20:35.011322Z","title":"Building higher-order abstractions from the components of recommender systems","venue":null,"work_id":"465b6871-44c3-4b98-b1f1-d6d70bc5d5e5","year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.510512Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:0c885ba65697524a4fbe0f69b4f2a62eebfa81fd20a0e51b369fd4f76064cc4d","observation_id":"5300aab1-b4c5-41cb-b915-1838cd643bf9","resolution":{"observed_at":"2026-08-11T12:20:35.016831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.994173Z","title":"ISAC - instance-specific algorithm configuration","venue":null,"work_id":"4f53c606-8a45-4fb6-a0ff-7f05c79429a1","year":2010},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.514157Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:d5a3b791239c5b12e9809f50e6bd910f9b1c991dfb49a93e4e41612d23ecf236","observation_id":"49d51fcf-7c22-41a8-86f4-9d2bb11c8421","resolution":{"observed_at":"2026-08-11T12:20:34.998259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.984287Z","title":"Algorithm selection and scheduling","venue":null,"work_id":"5b1c9a25-6e9a-4ad3-ac8c-99f4940510ec","year":2011},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.518531Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:927523cb7685f0e93c70062e5e768e7c0e011ef8788f6a0a3f7a9b8e65dcfe2e","observation_id":"23f39c44-4c1a-470b-85a2-207ef6741859","resolution":{"observed_at":"2026-08-11T12:20:34.987871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.974403Z","title":"Non-model-based search guidance for set partitioning problems","venue":null,"work_id":"8513ff8a-54ce-42b8-9fcd-a3205ae8b0b0","year":2012},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.522197Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:c2ab5296033bd9deb022df8d28ad7274aa2b836edead1829742b1317baaf8454","observation_id":"20ecfba2-f0f7-4c56-93a4-f9d6aa8a801a","resolution":{"observed_at":"2026-08-11T12:20:34.977960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.964522Z","title":"Learning to branch in mixed integer programming","venue":null,"work_id":"d14e7eaa-8be1-4b7a-9684-117087d86c3e","year":2016},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.525561Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:ef45c8f581af9dfaf3c4cd507ddde152d9af894f1152c3bc343a93898c309d67","observation_id":"96a5420c-b1b1-46b0-9488-fa5ac53c47ca","resolution":{"observed_at":"2026-08-11T12:20:34.967539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.953944Z","title":"Learning to run heuristics in tree search","venue":null,"work_id":"4641f05f-f5bf-461c-959f-b2209eef8965","year":2017},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.530445Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:6825d21890214288f1eab901d7c71615dd5c86a8c957c7643a63e9ba4dbb17c1","observation_id":"5b15ec10-bf51-43b8-92e5-a30383bbe22c","resolution":{"observed_at":"2026-08-11T12:20:34.957267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-11T12:20:34.533757Z","title":"Algorithms for multi-armed bandit problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.533757Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:422205ab00e7ce09b587af0bfb4176e14b0da1996078447156f974f221288032","observation_id":"fb8c18c8-6623-4393-a84d-b031ace2c2e8","resolution":{"observed_at":"2026-08-11T12:20:34.533757Z","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-11T12:20:34.943991Z","title":"An automatic method for solving discrete programming problems","venue":null,"work_id":"ae2e0793-3314-4c7f-b799-45e314d061b3","year":2010},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.537702Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:7c93fa4b6eaa74ff2e0e175c3439f2cb2b96e3154953484842bc5b9f60011abe","observation_id":"164387aa-e3c5-46ba-93b2-6dcf4c9d09af","resolution":{"observed_at":"2026-08-11T12:20:34.948188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.931509Z","title":"On learning and branching: a survey","venue":null,"work_id":"8cc05d3b-1289-4ef8-9ec6-47aef0ef2504","year":2017},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.540982Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:b19b7fc78f4b1167c59f7a7d7ee8eebfc7ec35fe7a3a1b4fb22bf14a69868b3e","observation_id":"befc5823-5977-41d6-b0d2-403173e2e225","resolution":{"observed_at":"2026-08-11T12:20:34.936099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.916909Z","title":"The choice axiom after twenty years","venue":null,"work_id":"3ea3f9a3-f90f-48dd-8e3f-45f4760a714f","year":1977},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.544142Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:10d799d9337345973c279f776b06a11adc5cd078d54b46f47ca9bc1799a260e9","observation_id":"d4693df1-8cb0-40b2-ac56-acd5df3e3216","resolution":{"observed_at":"2026-08-11T12:20:34.921404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.899329Z","title":"Adaptive anytime multi-agent path finding using bandit-based large neighborhood search","venue":null,"work_id":"3584a5ee-ea95-4781-937a-84877bd32cdc","year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.548187Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:b4722853303e1858cd928d698798b20febbb0c8dd62b1d1de1a0954f365cdad3","observation_id":"323be866-2df7-4d96-9944-f9585e9542c2","resolution":{"observed_at":"2026-08-11T12:20:34.904366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.884290Z","title":"Large neighborhood search","venue":null,"work_id":"baced6e8-da71-4597-8e7e-8694b1b37a4c","year":2019},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.552085Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:cada354b7f7e897fd5bf7fe1da43c63be210a72d3b774427a9c384e22b1e05c0","observation_id":"761088f0-80d1-4f88-a777-466544759591","resolution":{"observed_at":"2026-08-11T12:20:34.888591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.866210Z","title":"An evolutionary algorithm for polishing mixed integer programming solutions","venue":null,"work_id":"b2d2ed9e-f2bf-4fcf-b7b4-12aaa7ff05b2","year":2007},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.555823Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:35f76c6abb325e236f421e52d05acdbaee02e8055ad12c4ae6b3eb061c0d80b0","observation_id":"bae5415a-3777-4aa6-943b-1330047a7bf8","resolution":{"observed_at":"2026-08-11T12:20:34.872812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06910","last_updated":"2019-12-14T19:34:47Z","snapshot_observed_at":"2026-07-06T08:44:32.993381Z","submitted_at":"2019-12-14T19:34:47Z","title":"Adapting Behaviour for Learning Progress","version":1},"cited_work":{"arxiv_id":"1912.06910","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.06910","snapshot_observed_at":"2026-08-11T12:20:34.661892Z","title":"Adapting Behaviour for Learning Progress","venue":"cs.LG","work_id":"6c824c24-4b88-4f0b-b58c-75e6dd8c4b6f","year":2019},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.559763Z"},"links":{"cited_paper":"/paper/1912.06910","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:f6b200d5234d1eec8642c2da35fe907c282e68e87feb0fe350f413d1035572ec","observation_id":"3f62961d-9ccc-4015-b4c5-5cc16b1f779e","resolution":{"observed_at":"2026-08-11T12:20:34.666142Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.852313Z","title":"A general large neighborhood search framework for solving integer programs","venue":null,"work_id":"4ed04a4f-5452-4b53-a099-945b1cc5ea63","year":2020},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.563709Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:4d527c6f7e0afaa65aef264a662644b4c95d0411aca7d222438249f57f0be7b7","observation_id":"d9982832-c4dc-4d11-8ec6-9652d16a19ec","resolution":{"observed_at":"2026-08-11T12:20:34.856729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.10201","last_updated":"2022-05-20T16:31:03Z","snapshot_observed_at":"2026-08-11T05:46:10.044576Z","submitted_at":"2021-07-21T16:43:46Z","title":"Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.10201","snapshot_observed_at":"2026-08-11T12:20:34.566791Z","title":"Learning a large neighborhood search algorithm for mixed integer programs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.566791Z"},"links":{"cited_paper":"/paper/2107.10201","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:c7ec9d603e7d38f64c0871f529a67ace52ec891d53698f0e7446de4940acf925","observation_id":"31a8c388-5a5b-46ca-9195-1d80a6a8ae95","resolution":{"observed_at":"2026-08-11T12:20:34.566791Z","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-11T12:20:34.838311Z","title":"Mabwiser: A parallelizable contextual multi-armed bandit library for python","venue":null,"work_id":"6a097478-884e-40a6-8d27-00c760d5ba18","year":2019},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.569830Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:3bf0bc4b8a73ce8c599c563b8dbe55b9261cff0fb1a61ad559989324827133bd","observation_id":"9230c88b-836c-442f-abed-86eef7b06e58","resolution":{"observed_at":"2026-08-11T12:20:34.843406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.818245Z","title":"MABWiser: parallelizable contextual multi-armed bandits","venue":null,"work_id":"dd780832-160c-4db5-9bd1-d3b2a4ec4554","year":2021},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.573060Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:e0bb6b8fd85f0a70eb4fea85da54eda49fd0637f9552e3a658bdc69c6cf9815e","observation_id":"f407a3c2-6683-4826-91ac-a538d889f358","resolution":{"observed_at":"2026-08-11T12:20:34.824055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.803334Z","title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples","venue":null,"work_id":"69ca08f5-ba3c-4ab8-94b9-d5c2f71a9c49","year":1933},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.577104Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:84fbaaa2d76fdabdd3df223b23275e6d43b843c354aafc1b56d087162b1493be","observation_id":"888ef021-e4f9-4097-b78b-d855a0e58ef6","resolution":{"observed_at":"2026-08-11T12:20:34.807413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.788468Z","title":"Optimization over trained neural networks: Taking a relaxing walk","venue":null,"work_id":"5eac79d5-b9a1-47c1-bd0f-ae1fbe6d9eaf","year":2024},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.580791Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:7f8dbdf754ded6220781c6d4d2cfc70d1110a4258b872c851ab5d0b6ac43477d","observation_id":"cad03c12-bfdb-4fd1-9f84-efbb1ee598ab","resolution":{"observed_at":"2026-08-11T12:20:34.793415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.774819Z","title":"Multi-armed bandit algorithms and empirical evaluation","venue":null,"work_id":"15d0538a-0483-4cdb-a59b-4faa16d7bc39","year":2005},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.584595Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:c847bf837f7b6be116b50fc83d33ba50102901c454f52376fb77f1e79812b824","observation_id":"7279dae6-9657-4a31-90d2-503a57924efc","resolution":{"observed_at":"2026-08-11T12:20:34.778684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.764049Z","title":"Wouda and Leon Lan","venue":null,"work_id":"76b60aa3-d781-43c6-a63a-7b49f3bc369c","year":2023},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.588246Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:a2c749b8adce4b2c76c888ce44097d5bf0e4f035e36e159b261adf5dcf1c48f2","observation_id":"c8b57913-8cf5-471a-bf62-e38ad54402aa","resolution":{"observed_at":"2026-08-11T12:20:34.767782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.752302Z","title":"Learning large neighborhood search policy for integer programming","venue":null,"work_id":"975715e0-88d8-4fed-a248-85b9eb1c272c","year":2021},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.592347Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:b572a119c8ec2b3490e4434d3abcf046a6498d634ae18c56d89f7d5bb4bcbe7f","observation_id":"9e743846-31b7-49b5-8064-5914b79e52d9","resolution":{"observed_at":"2026-08-11T12:20:34.756760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05544","last_updated":"2022-06-16T06:28:00Z","snapshot_observed_at":"2026-07-06T12:27:25.910874Z","submitted_at":"2022-01-14T16:32:39Z","title":"BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit","version":2},"cited_work":{"arxiv_id":"2201.05544","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.05544","snapshot_observed_at":"2026-08-11T12:20:34.632266Z","title":"BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit","venue":"cs.AI","work_id":"752d70fd-22d2-4bf0-88e8-0cfd5e3cf4c6","year":2022},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.596177Z"},"links":{"cited_paper":"/paper/2201.05544","citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:138504b895e3d43ffec56e07bd4f6cff953300fd1df74205f014beb11b07b4cb","observation_id":"c2694cfd-8588-440b-a400-79f5d67ec3ca","resolution":{"observed_at":"2026-08-11T12:20:34.639530Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"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-11T12:20:34.599943Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T12:20:34.599943Z"},"links":{"citing_paper":"/paper/2412.14382"},"observation_digest":"sha256:d99ddb689a0602b5a7badbd3967cf76d8e648637163e903c3370013a1d8cbd67","observation_id":"25381740-4653-4278-98e2-d1f52100b7bd","resolution":{"observed_at":"2026-08-11T12:20:34.599943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-11T12:15:03.164914Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":3,"verified_fuzzy":41},"total_outbound_references":50},"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 12 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 2 inbound Pith citation observations for arXiv:2412.14382."}