{"as_of":"2026-08-11T05:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f17c5e0a112e0e3ddc7c579d9aebf36ddf870afc8019fa3f1b8b28762673bea","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T08:57:36.281367Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2605.29366/citation-record","integrity":"/paper/2605.29366/integrity","json":"/paper/2605.29366/citation-record.json","paper":"/paper/2605.29366"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T08:57:36.281367Z","title":"Solving conservation planning problems with integer linear programming.Ecological Modelling, 328: 14–22, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:02c676a828b5967660d0c22fa04d92efccf5083cc209a8f1ddb2850852d8dc03","observation_id":"1ae817bb-bf17-4f65-9878-e2d55e97d01a","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Exact integer linear programming solvers outperform simulated annealing for solving conservation planning problems.PeerJ, 8:e9258, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:310bef559a444aa564d866fb0d9dc9f6290a50fb97a426ba5a5270d609eab312","observation_id":"9805abc4-f80e-4e14-be7d-7fa7de64318c","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"An integer programming approach to scheduling.Computer scheduling of public transport urban passenger vehicle and crew scheduling, pages 269–280, 1981","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:8075d1a563c3c11a23b8a9f880a8528a1f645e5ddad42cab55499ef21ea45a5a","observation_id":"15115946-17dd-4d68-b6df-04b6e8013385","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Nurse scheduling using integer linear programming and constraint programming.IFAC Proceedings Volumes, 39(3):671–676, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:200ee48190d2c302f30ce4bc93db228ee6c18f6dccc636d3fb32df5232ad36fa","observation_id":"cd857ac3-6a18-4e20-beac-e7986b834a41","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Integer programming formulations of vehicle routing problems.European journal of operational research, 20(1):58–67, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:ef2aec9a9f07d8a9328e0c0780544bea9078cafc688198b2a88523cf0ed0103d","observation_id":"56ee7c99-227e-4413-9298-900246000e58","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"A mixed integer linear programming formulation of the optimal mean/value-at-risk portfolio problem.European Journal of Operational Research, 176 (1):423–434, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:32d1a98b7655fbef463942da6a5529e38cb27f2c78a7347a816a0e1cc1923f3b","observation_id":"83304e98-2450-407c-9e87-29ad7d496cf4","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Scip: solving constraint integer programs.Mathematical Programming Computation, 1(1):1–41, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:4fa986ed1e1ac8c2aee4a7d7b334c88f1dbc1f874cdcd5cf86a6fb4428c7a252","observation_id":"a46d8514-221a-42e2-8004-0d230aafb904","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Gurobi optimizer reference manual, 2020.URL http://www","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:604a366c9f3fc939acebde86e5b85b1e3a615fddc7a8343aa034769e91a8caad","observation_id":"fe9ac532-4034-423d-ae18-b066ad879175","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"An automatic method for solving discrete programming problems","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:4f93263929e622edf327328c27e46f2ca5fcbaa044b2a08fc043c90fde9be258","observation_id":"bafa0c9a-b5f0-4017-9144-064b32df2e58","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Branch-and-cut algorithms for combinatorial optimization problems.Hand- book of applied optimization, 1(1):65–77, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:b3fb0ae7e66385436bf3f93acb95a5fb32270741e62733f83eae7148d9def02f","observation_id":"ee09172b-a9ea-4753-9786-90a90dd85fc1","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"A survey for solving mixed integer programming via machine learning.Neurocomputing, 519: 205–217, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:bb730ac21817ece4f67a4747508db71cff3829b0fa4be634d83340e545286c27","observation_id":"9e39ffcb-ef34-48d7-8d9f-d93871c3e4b8","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.05960","last_updated":"2024-01-17T13:26:09Z","snapshot_observed_at":"2026-07-06T17:14:19.624035Z","submitted_at":"2024-01-11T15:02:15Z","title":"Machine Learning Insides OptVerse AI Solver: Design Principles and Applications","version":2},"cited_work":{"arxiv_id":"2401.05960","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.05960","snapshot_observed_at":"2026-06-29T09:03:15.990020Z","title":"Machine learning insides optverse ai solver: Design principles and applications.arXiv preprint arXiv:2401.05960, 2024","venue":null,"work_id":"37fb759d-7930-4c32-a8a1-a0b21fbd2515","year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"cited_paper":"/paper/2401.05960","citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:40e91b74da50ed4cdfe3e2e6889c81d8294194ae5f229dac2205d0a4097ece1c","observation_id":"c0d19328-1b11-4fbd-a321-331609cf371e","resolution":{"observed_at":"2026-06-29T09:03:15.991575Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T08:57:36.281367Z","title":"Exact combinatorial optimization with graph convolutional neural networks.Neural Information Processing Systems (NeurIPS), 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:71e69b2ff5a5ac9c41b62c085be035ef99ce6d3ce2dc3668a5ba341d3177e79c","observation_id":"34b2fcd7-f98a-4f32-b374-04cea11cdfc8","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Sorrel: Suboptimal-demonstration-guided reinforcement learning for learning to branch.AAAI Conference on Artificial Intelligence (AAAI), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:8df1f7eb3d33d09aef080ab1ffb94861b74b1d07351a85c9817d47ebdd1558c2","observation_id":"3362adca-77d8-4cda-821e-7cfba6ac5468","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning to cut generation in branch-and-cut algorithms for combinatorial optimization.ACM Transactions on Evolutionary Learning, 5(3):1–27, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:a222965c872ef60e209947c38aff66074a1650cdcd8ceadd0994ba3bace5d4c4","observation_id":"28c10c4a-3b6f-4f31-91b0-378f5960d494","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Accelerate presolve in large-scale linear programming via reinforcement learning.IEEE Transactions on Pattern Analysis and Machine Intelligence, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:26c258730dbc4b4f51dab3b26735a628f38641dcad863763a0df9b0db69e2974","observation_id":"c9dceb10-cadf-442d-8beb-220d9963efcb","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"A general large neighborhood search framework for solving integer linear programs.Neural Information Processing Systems (NeurIPS), 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:80242cc3dc1da3f0cd9415ba3f94e8da9df2fbab61d2201c07accdfec4a66270","observation_id":"1d7e1784-18dd-406f-92be-595d9a2bc6aa","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning large neighborhood search policy for integer programming.Neural Information Processing Systems (NeurIPS), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:7f0596c25f0e6b6dbce0c1e0ec1bfec2b3f5ca1b662ba41d01ca91b851007c50","observation_id":"63941816-f17d-41e3-abf1-9250fbb65294","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning to search in local branching.AAAI Conference on Artificial Intelligence (AAAI), 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:1e6255ebf1d176ae3b67536bbcbf26a87c107d8992bcaeeb07fda680afee0637","observation_id":"d8c203e1-f791-4076-a7e4-3d9c35c3d101","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Search- ing large neighborhoods for integer linear programs with contrastive learning.International Conference on Machine Learning (ICML), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:e59414e251e5daa88336d52df52f34633971b533895a34617b4f80e9a368d568","observation_id":"c50c24bb-fe4d-4766-abc7-ae53021e2dfe","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Ilp-former: Solving integer linear programming with sequence to multi-label learning.Uncertainty in Artificial Intelligence (UAI), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:c4874f2ad3cd249f283cf6772e0a6ee8e00a6064414b8196906a53c20c14dafa","observation_id":"c747f09b-91bf-4902-a4e2-f605a61816a5","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Large language model-driven large neigh- borhood search for large-scale milp problems.International Conference on Machine Learning (ICML), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:31d0536c97de6da06d19ee546b26c65efa378e5f15b782055078cde694cc08b3","observation_id":"0fc8edc9-8f5b-4555-ab2d-29b9d9436edc","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Btbs-lns: Binarized- tightening, branch and search on learning lns policies for mip.International Conference on Learning Representations (ICLR), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:96f79c2346907676c217877935ae0d1d068e5f14257c2cc4e0adc4fd22ca5e4f","observation_id":"c0212507-7cb3-4431-bc56-1e6ed23a3ef7","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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":"2012.13349","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.13349","snapshot_observed_at":"2026-07-08T02:44:27.746103Z","title":"Solving mixed integer programs using neural networks","venue":"math.OC","work_id":"0ebeb6e9-83a7-43f4-97db-00ad9ba34fdc","year":2020},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:f8b40fb150b2f6681c9f4915224776d31d6e2cac2c2aa0a973b945a1cb364a09","observation_id":"bd357c5d-9c7d-427e-9a0f-61a8f07c1fe5","resolution":{"observed_at":"2026-06-29T09:03:16.008879Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07506","last_updated":"2022-03-15T04:03:09Z","snapshot_observed_at":"2026-08-09T07:48:47.447030Z","submitted_at":"2022-02-15T15:23:22Z","title":"Confidence Threshold Neural Diving","version":2},"cited_work":{"arxiv_id":"2202.07506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07506","snapshot_observed_at":"2026-06-29T09:03:15.995808Z","title":"Confidence threshold neural diving.arXiv preprint arXiv:2202.07506, 2022","venue":null,"work_id":"516ad27e-52ea-4fc1-aee5-f65d6274a969","year":2022},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"cited_paper":"/paper/2202.07506","citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:7bfc7742f8dd8423dce08fa80c0fa04821b3a1b58f3a623989322e34354e2976","observation_id":"fc8996e5-5374-4313-89c6-078cc82503ad","resolution":{"observed_at":"2026-06-29T09:03:15.997277Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T08:57:36.281367Z","title":"A gnn-guided predict-and-search framework for mixed-integer linear programming.International Conference on Learning Representations (ICLR), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:92c32842769808df04612d05b6d64fbb9fe0c696e16499b730458aa13b10d585","observation_id":"94070437-eb6e-4d4c-a390-102240288327","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Contrastive predict-and-search for mixed integer linear programs.International Conference on Machine Learning (ICML), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:e961e2e5f96f836cc3619badf211985047db40942ebe919b17f656aaa5399db5","observation_id":"559c8874-3ef8-4ab6-a4b7-f79c3dbc3d78","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Effective generation of feasible solutions for integer programming via guided diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:c55879f5a69f4823f1f294e85f0f63e942b3bd1a1595e53c5f9a7ab863f70a6e","observation_id":"7f9f7a9e-3299-4736-918f-daff85bd005c","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Differentiable integer linear programming.International Conference on Learning Representations (ICLR), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:a1da981d40306e6aa6cb91d8e7888dd0bf149f86c8cdad01621908a4a4de9c44","observation_id":"35d18e14-f163-4459-976e-5f0a7c7993d6","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm.Journal of optimization theory and applications, 45(1):41–51, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:c52651a1283f95fd0541fe1cd01ac80cb1ed50ebb552cf17b46a1f8c5ea5b953","observation_id":"e543af63-1d0f-4c05-9520-4ca416b4f3ea","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Sampling from multimodal distributions using tempered transitions.Statistics and computing, 6(4):353–366, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:747d6e604d5cfc002586783e655de2315e01b2515987a8ccfaf1f40f55104674","observation_id":"3eadf987-e842-4ffa-a247-dadd6b63fd8b","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"A simulated annealing approach to the solution of job rotation scheduling problems.Applied Mathematics and Computation, 188(1):31–45, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:d09d5a0346e94ca27786b560cb848e8d0ef11cec8e0bcda53492a2b43d7904a9","observation_id":"ff9b85d0-6253-4991-91fd-4208993f1ba7","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Springer Science & Business Media, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:cd658c540cda6a67399c9a2b765b30eccc029a05066cff8e2fac7462370cd9ac","observation_id":"657263fb-8555-4ef8-b447-e88d1b0b82ff","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Sampling can be faster than optimization.Proceedings of the National Academy of Sciences, 116(42): 20881–20885, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:4629ce21d8364f59ee992cbc57b2131bafa6af91a7e56835cabd24fa402c3dbc","observation_id":"0c61ca45-1923-45fb-9413-f5aa5eb41bc1","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Replica exchange for non-convex optimization.Journal of Machine Learning Research, 22(173):1–59, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:327db7f4ce158c0623f262aecb62be6519710baa2a71ea2eb2828c3d7d1b33ba","observation_id":"8d21f60f-d3c3-4bb2-bdd3-c5e5ea8055e9","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Revisiting sampling for combinatorial optimization.International Conference on Machine Learning (ICML), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:bef6bcc61f7082585ee55349e27d615ea1c811dc5b942e70a2cacfca70bfa2bb","observation_id":"2d097d6b-069a-4db2-9552-688382775b72","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Regularized langevin dynamics for combinatorial optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:104f587b9594d896231f6ece6c71cf03eb6d39f31b4bd444a7c750d8713bd41c","observation_id":"16fcd24b-b3cc-4505-be53-065d402ddbc1","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Fractional langevin dynamics for combinatorial optimization via polynomial-time escape.Neural Information Processing Systems (NeurIPS), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:98c80380b6b3f19d2331e9857dac57a2f8a69f7f560a259aaee3670ebefdc7c5","observation_id":"dbe11b89-78b2-4cf2-a596-147bb904b3fb","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Informed proposals for local mcmc in discrete spaces.Journal of the American Statistical Association, 115(530):852–865, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:2104f100db5e6d7db7df175618533d8d15edbd727649cd8be8b62f4d53a1d0e8","observation_id":"2c4dca7f-501c-40a7-b8a8-d7e64f47d716","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:6e1e03b523b82ec6bf70053436f4a19e155c05f36222dc105d074613e33cf711","observation_id":"0f890d4a-013b-4c2d-ade6-2bac8a98d2c3","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Large neighborhood search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:e9b6c6ace2136f33113dbc27e57c90ec64437be137da5cd508c8b352d5c7461c","observation_id":"b026c9a0-6e73-44e5-bc98-89af290e71d0","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Local branching.Mathematical programming, 98(1):23–47, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:f51da49b7fb6020942d54e97dc2326c566660a14ef464a669d3227fcd6b42677","observation_id":"b5e77d4d-e37f-4ac8-9781-b165664aee21","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Equation of state calculations by fast computing machines.The journal of chemical physics, 21(6):1087–1092, 1953","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:889d340c44bc47749b6261c8191a293060a538c08b0f5f6e33a4adf04a41e0ff","observation_id":"825be914-f98d-4576-b692-b334e1f06b7e","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Monte carlo sampling methods using markov chains and their applications","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:1358e912df45ee38864576fbdaa1cb2dd29a70650670bf088f7293ef9324de96","observation_id":"d6ee79c8-c25c-4d38-8b2f-b82f7219bb14","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Springer, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:da6b9a10b49467724d74d2e9ba44fdac892e5fdcc93cb9d14efd7c916e3f4471","observation_id":"3e547986-bc56-4dc7-9b2e-93369a820528","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Optimization by simulated annealing","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:f1c04e088ac029818da028759fede771889b933b87cd0999b2d24c3c0ff9bdd1","observation_id":"445b6e25-7bcd-4e9e-8f3b-75f4ddee240f","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitioning","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:3cc2e57722df7b13ad0dc623739895471178c58bf0ce8869f629e0f28bcd99a9","observation_id":"6b3adfe9-b8e8-41dc-9c6b-62a72cbb97cd","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Optimum monte-carlo sampling using markov chains.Biometrika, 60(3): 607–612, 1973","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:41491174ab5e4e716a6df474ba10be9aae98dab7b55e5121d47a73d26ed10f70","observation_id":"edb784ac-158d-45ff-9ed0-2b4074f49134","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Oops i took a gradient: Scalable sampling for discrete distributions.International Conference on Machine Learning (ICML), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:22f5dda4e76a9f5a93b5d32472aa9c4d894ad36fc7a01bc32ad6d0f9883a82e9","observation_id":"32899038-af58-4054-85cd-c0f37b98004a","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Path auxiliary proposal for mcmc in discrete space.International Conference on Learning Representations (ICLR), 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:d910d50fb64f5788179c8bdb1e6fc54388ae5155dc38bde146a8a6a86a04b93e","observation_id":"a6665a7d-d28e-4834-9805-868d63fac682","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"A langevin-like sampler for discrete distributions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:19983f235f804bfec6350aabf4651df1b5435ee5f8f981677dc49e93a47402e6","observation_id":"92389602-b6a4-4e43-8f4b-142110e34c7d","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Non- reversible parallel tempering: a scalable highly parallel mcmc scheme.Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(2):321–350, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:668962548640571e72f638f254deae650ee1d69f1e8b78373304b23a4088e1a4","observation_id":"f22e21b4-dfa8-481b-a65a-f6c2969f6321","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning to branch","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:1f09e2f6e7f9a6ea3a842ccc528d7f4ca0da46d03ea960de7f8f0569ac692eb8","observation_id":"35c6d3c4-bfa2-452f-a7f2-6c23eae206a1","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Rethinking branching on exact combinatorial optimization solver: The first deep symbolic discovery framework.International Conference on Learning Representations (ICLR), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:1f148753eb14aca72316b9ba2c1d53534ce5d904e63fe7a579fa2b8ddf46b57a","observation_id":"a2ce9c43-2468-42bb-a6f0-ee962d0ad612","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:243f3be555ed0de954614625f8f43556b8101a6593c731b228bd1e488ddc015f","observation_id":"2c86debc-cb21-4ee9-b1f8-aed5f7c004f7","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning to cut by looking ahead: Cutting plane selection via imitation learning.International Conference on Machine Learning (ICML), 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:56b86230d8bbb6306635fb6c7257f2060871449ebf03ced2869d2dcadd1f2a8f","observation_id":"f002827b-877f-4b2b-992c-7cd78245193e","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model.International Conference on Learning Representations (ICLR), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:572b8dfb4217c0c32cd08f72b005ba48682a3fe88a56c6c52d2bddfd2d1c77bc","observation_id":"22813483-904c-4982-86e4-1bec458bb717","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"L2p-mip: Learning to presolve for mixed integer programming.International Conference on Learning Representations (ICLR), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:035fe8c57fc767c0a0c1192625e7faaddfef01c5a8b7ca419697bbedbc858705","observation_id":"cff4bacf-c546-4338-9393-f6447b8dc6be","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Neural large neighborhood search for the capacitated vehicle routing problem.European Conference on Artificial Intelligence (ECAI), 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:d9a6e1d7ea31a5a5a7c8825e11589eacd5e7a7ed1288555d8443c10924aad81c","observation_id":"486686d2-7ca4-4ad0-8095-d2a181eaac5a","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Apollo-milp: An alternating prediction-correction neural solving framework for mixed-integer linear programming.International Conference on Learning Representations (ICLR), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:eb699dbbf15a832f4c067fa8ac3d93f44f58671a8cdd055c87d7310ddf25f9c1","observation_id":"f4c21ae3-978a-4ede-8c38-797a8566301d","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.04047","last_updated":"2025-03-06T03:01:25Z","snapshot_observed_at":"2026-08-07T17:25:59.815380Z","submitted_at":"2025-03-06T03:01:25Z","title":"Reheated Gradient-based Discrete Sampling for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2503.04047","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.04047","snapshot_observed_at":"2026-06-29T09:03:15.998377Z","title":"Reheated gradient-based discrete sampling for combinatorial optimization.arXiv preprint arXiv:2503.04047, 2025","venue":null,"work_id":"71bf7626-38f6-4b9f-9f6b-e1c7c7a46add","year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"cited_paper":"/paper/2503.04047","citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:6b3bb16dbf8bc3b33ac32d67b0a6033c3cb23a3e25ee80969c71f4c321e52e9f","observation_id":"7ffa8487-f6e0-4f3e-b565-777ee929e42a","resolution":{"observed_at":"2026-06-29T09:03:15.999889Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19240","last_updated":"2025-05-20T05:41:48Z","snapshot_observed_at":"2026-08-07T17:45:50.044383Z","submitted_at":"2025-02-26T15:51:15Z","title":"Enhancing Gradient-based Discrete Sampling via Parallel Tempering","version":2},"cited_work":{"arxiv_id":"2502.19240","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19240","snapshot_observed_at":"2026-06-29T09:03:16.001027Z","title":"Enhancing gradient-based discrete sampling via parallel tempering.arXiv preprint arXiv:2502.19240, 2025","venue":null,"work_id":"e813214c-3ded-49c1-a45d-5fd21f7ae907","year":2025},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"cited_paper":"/paper/2502.19240","citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:28fa4be40e9ed629ef566f0572c61c5a71fdd433b7ed5ddb7642182760320c64","observation_id":"931a10ca-ad32-43ea-b0fa-5f0414649086","resolution":{"observed_at":"2026-06-29T09:03:16.002577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T08:57:36.281367Z","title":"PhD thesis, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:45ecadeac4d9ccd0c0c1e455a0600e35a6d55af3c7cb6b57f7788ee308f2e8fb","observation_id":"4e6c0fe6-bb38-4aaf-9ced-e8703de64c8c","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Learning a large neighborhood search algorithm for mixed integer programs.Neural Information Processing Systems (NeurIPS), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:f98dd90b5b43596cee39dbe833d911dc8708f471c0731457a66761987c84d135","observation_id":"b2323366-f1ce-4d75-86e4-1d5c937ea684","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Miplib 2017: data-driven compilation of the 6th mixed-integer programming library.Mathematical Programming Computation, 13(3):443–490, 2021","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:06c8c1a37d9bdd03eeabf6178929b7a80bbf6324bebe2dd2aa2dc6e8298aa02c","observation_id":"085cee78-f647-499a-b9c0-c2fcf93a5e51","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.04509","last_updated":"2026-07-02T02:40:37Z","snapshot_observed_at":"2026-08-08T23:03:46.734121Z","submitted_at":"2026-01-08T02:23:47Z","title":"A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention","version":2},"cited_work":{"arxiv_id":"2601.04509","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2601.04509","snapshot_observed_at":"2026-07-03T02:16:47.961396Z","title":"A general neural backbone for mixed-integer linear optimization via dual attention.arXiv preprint arXiv:2601.04509, 2026","venue":null,"work_id":"5fef759b-20dc-492d-8f47-e32719f5daeb","year":2026},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"cited_paper":"/paper/2601.04509","citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:e3559aae67a9075236ad3ffaa25fae91d0641ffb3cfbc7d3eca0743e282c6ff6","observation_id":"a268bf06-0207-4ef5-bbc9-e603160d2976","resolution":{"observed_at":"2026-07-03T02:16:47.961396Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T08:57:36.281367Z","title":"Statistical mechanics of complex networks.Reviews of modern physics, 74(1):47, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:294fe539b9c8a311087e08472485e1300a6b3fed3c41b87c1fa2bc969305df18","observation_id":"20aae277-3d24-4c72-ad08-e406fee3a5b1","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"On the evolution of random graphs.Bulletin of the Institute of International Statistics, 38:343–347, 1961","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:0ed05f369191e39fed0d45bf7c0a829b34e4b14a923e55dec00ca3769c70035e","observation_id":"0693aac3-caf9-4ee1-8145-9239135b58e1","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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-06-29T08:57:36.281367Z","title":"Towards a universal test suite for combinatorial auction algorithms","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:92a784a8a49cfb92ebacf8153956bce879d3b46d74568e0e6ee817f941852ce8","observation_id":"79e81be3-c6b1-47ea-a9f6-565d42b98233","resolution":{"observed_at":"2026-06-29T08:57:36.281367Z","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":"2443.70444","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T09:03:15.995163Z","title":"even\" and","venue":null,"work_id":"5ffcd60e-7b50-4e2e-8275-0cfcfaf4dcbf","year":2000},"citing_paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-29T08:57:36.281367Z"},"links":{"citing_paper":"/paper/2605.29366"},"observation_digest":"sha256:3816eb8f3a4017301f234dd62af82b9cb0b557109475eefbf0e21ca01899c49f","observation_id":"ba17247e-47f2-4af6-9373-7078f4e48599","resolution":{"observed_at":"2026-06-29T09:03:15.996674Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.29366","last_updated":"2026-05-28T05:09:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T16:51:06.437074Z","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":63,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":70},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2605.29366."}