{"as_of":"2026-08-18T14:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cbd63f8afa2f717407648e31bea03c8514efd39980b1e5a3a7b07e2c39bdfae9","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:35:07.849672Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2505.11526/citation-record","integrity":"/paper/2505.11526/integrity","json":"/paper/2505.11526/citation-record.json","paper":"/paper/2505.11526"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:35:07.505470Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.505470Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:20753258da9ef65425f7ee29b0f73612a7b96ba867f3c089524d9ee646814762","observation_id":"221f6993-3fd4-4f0d-9fe6-de01d936815e","resolution":{"observed_at":"2026-08-15T22:35:07.505470Z","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-15T22:35:08.886819Z","title":"and Ho, A","venue":null,"work_id":"8246e8de-a6de-4393-865d-7f8dad7d2907","year":1980},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.512741Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:fbcae575cff1309f8ebd13e7f0aaab32787f209e23b208926fd610a4eec5f7ce","observation_id":"5dec0ecb-f22d-4ca7-a141-78499c9bb190","resolution":{"observed_at":"2026-08-15T22:35:08.892102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.867943Z","title":"Generating hard instances for maxsat","venue":null,"work_id":"2e9c5f1d-dbb9-4af3-85b4-e52ad994efa3","year":2009},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.518629Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:b44ceb8581717605f658e81d4696b33c8a8448eeb369b1eaf6f48a8cdd680635","observation_id":"ae591385-5d97-4689-8d80-4dfcccfe9f20","resolution":{"observed_at":"2026-08-15T22:35:08.874016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:07.525293Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.525293Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:a5ea7032656cf3b9823f227639d41fa64127c76aaa778ed2a767934f350f6b3a","observation_id":"3a3b74b6-ba09-47b1-a59d-43b73dab07cf","resolution":{"observed_at":"2026-08-15T22:35:07.525293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:35:07.531050Z","title":"A., Van Hoeve, W.-J., and Hooker, J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.531050Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:51a393a641e4ff514b2c37a0944c10f5a831930f432444261cf14d4865071a9d","observation_id":"569cb821-2791-46ec-afa7-2cfa7072434b","resolution":{"observed_at":"2026-08-15T22:35:07.531050Z","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-15T22:35:08.825839Z","title":"u hmer, E., Pfetsch, M. E., Schl \\","venue":null,"work_id":"7451bc9e-3c87-4dda-ace6-a2d674d33ea4","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.536409Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:ae4f4e9efc966bb9ceebc5a4bc1abb647c12f11e17eea13d0b02c178b71ff0ad","observation_id":"447671c1-352b-4000-a6e6-c88e956613f6","resolution":{"observed_at":"2026-08-15T22:35:08.831212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.808039Z","title":"Generation techniques for linear programming instances with controllable properties","venue":null,"work_id":"b50a3d23-31f5-4f36-a762-ff4b816b1706","year":2020},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.541536Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:025f2d887da683468b6673f1a39d216a1efaad10329840b040a88432f2adf75c","observation_id":"5e03eaaa-8642-469c-ad58-4a8e9472d463","resolution":{"observed_at":"2026-08-15T22:35:08.813380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.791182Z","title":"The vehicle routing problem: State of the art classification and review","venue":null,"work_id":"313409a0-ece9-4f5f-8be4-85b8acd95917","year":2016},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.547624Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:516b14b0d0650b9eb13a93f78311bf51ada5490635b6082e8bac3fb35235b003","observation_id":"63bb1be3-a7f2-4373-aef2-9ebe7dbe6a81","resolution":{"observed_at":"2026-08-15T22:35:08.796703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.774249Z","title":null,"venue":null,"work_id":"30bf19de-58b1-4844-b907-a8d9fe36a90a","year":1992},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.553007Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:446bcbf643bc74e7d60f2cd4604254c9744712972d1e787c6ca2259851e1e424","observation_id":"4aa77dde-aad4-4583-a535-c2b04014ebd1","resolution":{"observed_at":"2026-08-15T22:35:08.779598Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.754438Z","title":"An milp for scheduling problems in an fms with one vehicle","venue":null,"work_id":"86777531-4ec1-4198-abf9-dad3362b1221","year":2009},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.558958Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:183e6ccd0c6db7afa7753621ea87371acb2153c3a3c47982b4bcc1e715f6226d","observation_id":"30a5b8a2-cb05-45fe-b97e-aed0158a101e","resolution":{"observed_at":"2026-08-15T22:35:08.761350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.735962Z","title":"The generalized independent set problem: Polyhedral analysis and solution approaches","venue":null,"work_id":"ba09e75a-16a4-4dc9-8943-707eeef1e348","year":2017},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.564670Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:919da13345ad18170a9d6a574665c06eefc681ee1f32f3e7e6f9f881a7582efd","observation_id":"01a5ea22-0a31-4ebc-8e0a-578a0932253e","resolution":{"observed_at":"2026-08-15T22:35:08.741274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.718413Z","title":"Xtuner: A toolkit for efficiently fine-tuning llm","venue":null,"work_id":"33d7be47-4f45-4f47-bc3d-7e94af775e03","year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.570756Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:8ae49bad5abf9d24a0afe20dac2bb7b5e5aebd3874c133bb14fd16e58130ddca","observation_id":"aacabb74-02b0-49c3-b672-6cc09d1ea4d9","resolution":{"observed_at":"2026-08-15T22:35:08.724281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.700723Z","title":"A comparison of heuristics and relaxations for the capacitated plant location problem","venue":null,"work_id":"8f406de2-08bc-47f7-b9dd-81ea6d1b3836","year":1991},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.576261Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:b56da1ecf99b1dcee7608bfff4820357047467b1c43e0e776e5cbad7d8b9ce3f","observation_id":"b038ddde-50a8-44a1-8c00-5a846429110a","resolution":{"observed_at":"2026-08-15T22:35:08.706041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-15T22:35:07.582107Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.582107Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:f2b339ff5959d55902750a8ddfec51c84d56ea8d560727bebfb1b0b66b2795f6","observation_id":"d9787013-f7cf-4adf-8372-19c5660c10cb","resolution":{"observed_at":"2026-08-15T22:35:07.582107Z","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-15T22:35:08.683052Z","title":null,"venue":null,"work_id":"aa10a1ea-75dd-4db9-ba45-ea3a8a5e2c6e","year":2005},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.587979Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:dcf92a8d0e165c6b957f945312155bf0963848d83f0763ba0e59f5aede80dd52","observation_id":"38b4095f-1e95-4d83-9319-07fe1af119d4","resolution":{"observed_at":"2026-08-15T22:35:08.688280Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.664571Z","title":"Reverse logistics network design for a biogas plant: An approach based on milp optimization and analytical hierarchical process (ahp)","venue":null,"work_id":"fcf34782-a3ab-4915-a2c1-ce98ea451365","year":2015},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.593459Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:7d5b4e59e7b012c979e343131809f3d31b4b7a86f5dfa167402a65da102f9317","observation_id":"e3e46ab6-993e-496a-b322-78b7d707d676","resolution":{"observed_at":"2026-08-15T22:35:08.670313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:07.600178Z","title":"Exact combinatorial optimization with graph convolutional neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.600178Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:ef4718976d0c9f5df618ef7204e0245f15f6c0c3ceb48fd8b05dd310a6bb58eb","observation_id":"f2ff9923-a707-4641-b995-b0af90752be4","resolution":{"observed_at":"2026-08-15T22:35:07.600178Z","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-15T22:35:08.636005Z","title":"A deep instance generative framework for milp solvers under limited data availability","venue":null,"work_id":"58636989-8078-4f42-a8ab-a31a01a2f677","year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.606231Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:17db728f583403e4f250ba03b7bffae4a31fe491f743967bb795d863438d82ec","observation_id":"53a8bd59-f9ca-439b-b555-9f7c9d9ce8c7","resolution":{"observed_at":"2026-08-15T22:35:08.642070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.618536Z","title":"Miplib 2017: data-driven compilation of the 6th mixed-integer programming library","venue":null,"work_id":"f9ff250c-51cc-447c-9e0e-6afca1a3150c","year":2017},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.612722Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:7ed87b40d37611c76bc84c54906d3e40941ce8d3cb471f69ccba700e1b3c7d82","observation_id":"df365ef5-fe36-472e-9262-d57affb2e6b8","resolution":{"observed_at":"2026-08-15T22:35:08.623985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.600336Z","title":"Acm-milp: Adaptive constraint modification via grouping and selection for hardness-preserving milp instance generation","venue":null,"work_id":"b91d969e-436e-455f-992d-224e7eea17fb","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.622155Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:11e57f3271b34aacbfe5f2d187c4c451f0a132691d303e85221295d5e75eb150","observation_id":"58fba5bb-087d-4951-aebb-41953c72ff74","resolution":{"observed_at":"2026-08-15T22:35:08.606560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.583070Z","title":"Hybrid models for learning to branch","venue":null,"work_id":"1f0a092c-044b-4b69-99c2-facb55e28e58","year":2020},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.627224Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:c3065580149f2a5c0998b3ebfbfcaeb3edba16596cd5409d576d59f35555558f","observation_id":"4cfb2173-7d90-4b43-98e8-b1f102c6e2a8","resolution":{"observed_at":"2026-08-15T22:35:08.588606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.14987","last_updated":"2022-12-29T08:08:04Z","snapshot_observed_at":"2026-08-16T16:49:22.663577Z","submitted_at":"2022-06-30T02:33:32Z","title":"Lookback for Learning to Branch","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.14987","snapshot_observed_at":"2026-08-15T22:35:07.632737Z","title":"B., Chet \\'e lat, D., Gasse, M., Bengio, Y., Lodi, A., and Kumar, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.632737Z"},"links":{"cited_paper":"/paper/2206.14987","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:238eaa37baad3d94b43a0815074aecfe0a955f8ff8f3e7437ee438176ceae339","observation_id":"a0e511d7-a57e-4a25-83d3-8c99f7d0a66c","resolution":{"observed_at":"2026-08-15T22:35:07.632737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:35:07.637980Z","title":"Gurobi Optimizer Reference Manual , 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.637980Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:7d07629a63352e7225c29dc76903412a57c315f4eff7360b4d2cbfb46bc04ad2","observation_id":"6d756fb2-0465-4a63-b11a-8ca4c994e4c4","resolution":{"observed_at":"2026-08-15T22:35:07.637980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05636","last_updated":"2023-03-06T08:03:03Z","snapshot_observed_at":"2026-08-16T15:56:05.279662Z","submitted_at":"2023-02-11T09:38:26Z","title":"A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05636","snapshot_observed_at":"2026-08-15T22:35:07.643231Z","title":"A gnn-guided predict-and-search framework for mixed-integer linear programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.643231Z"},"links":{"cited_paper":"/paper/2302.05636","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:fe78471747018ced860d8cdbbfc3914799a0499b5ba63515a82e51669d64d38e","observation_id":"bf1f6ae9-aa7f-4175-b611-e05408390887","resolution":{"observed_at":"2026-08-15T22:35:07.643231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:35:07.649331Z","title":"Gans trained by a two time-scale update rule converge to a local nash equilibrium","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.649331Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:4f4e9f28dfb4c6c65c9b4fb41ad6917016c08bdaa19c160a2d0ae3c7c1294537","observation_id":"aefae100-b081-48e6-af1a-578bd7bb1b0d","resolution":{"observed_at":"2026-08-15T22:35:07.649331Z","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-15T22:35:08.543449Z","title":"L., and Savelsbergh, M","venue":null,"work_id":"626e6380-7aea-4364-8b73-02189b946def","year":2010},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.654684Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:549a4a97fe6eb02c59e3adee03d5423ed077f79edd0fa243a58a7e9a2c9a932b","observation_id":"e00ef3c9-05ea-44cd-92f0-9bfb100dfbd6","resolution":{"observed_at":"2026-08-15T22:35:08.548746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.526953Z","title":"o m, K., G \\","venue":null,"work_id":"f3af1d14-fd57-4cbc-829e-f3ca0f69d600","year":2017},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.660407Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:60d4d38b9cc7fbfa771bfccae987d221d93fe1ec17f4a256bb5d834aeb732570","observation_id":"0f2ea07e-1928-4f2a-945e-4c26f79f715b","resolution":{"observed_at":"2026-08-15T22:35:08.531952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.509900Z","title":"M., Tian, Y., Dilkina, B., and Steiner, B","venue":null,"work_id":"363493e2-2e50-4502-8e15-74ae506f9205","year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.666773Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:4813e2b334148ea5aff80310eebb4695874f28f7811344cb7ff8c9cbafdb54e4","observation_id":"e9b88416-511d-4547-ac9a-15c1ce1b1e62","resolution":{"observed_at":"2026-08-15T22:35:08.515523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-08-15T14:02:47.366139Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-15T22:35:07.673125Z","title":"P., Perelman, A., Ramesh, A., Clark, A., Ostrow, A., Welihinda, A., Hayes, A., Radford, A., et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.673125Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:e45ff82feae9abe36f3eda8da4f93862fd9da64cfa72e60ad5534b3d0f4729f2","observation_id":"0cc815d3-ebdc-4dab-a11a-fe312c6f325c","resolution":{"observed_at":"2026-08-15T22:35:07.673125Z","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-15T22:35:08.493259Z","title":"and Pardalos, P","venue":null,"work_id":"135685f4-0591-4974-a5c9-1a5aa17b2df1","year":1999},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.679130Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:ae0b7d36ba63236a35974863b1811d456c8cfa257344cc86d546ac09079295c2","observation_id":"797bd7b5-8d68-491f-b0da-b6e8055ad609","resolution":{"observed_at":"2026-08-15T22:35:08.498675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:07.684325Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.684325Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:69a94a50c6781e58d33aff2ae4bc193f483657756aa11726555c525c589acc04","observation_id":"66042b17-c52d-48b7-9406-8b7d1300ea59","resolution":{"observed_at":"2026-08-15T22:35:07.684325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11845","last_updated":"2023-10-18T09:51:59Z","snapshot_observed_at":"2026-08-16T14:51:07.213611Z","submitted_at":"2023-10-18T09:51:59Z","title":"Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11845","snapshot_observed_at":"2026-08-15T22:35:07.689711Z","title":"Accelerate presolve in large-scale linear programming via reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.689711Z"},"links":{"cited_paper":"/paper/2310.11845","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:2ded524476ed64c0701a68fc41e800b170cf84cd98ef0e6d3359cf51e1ec0717","observation_id":"1be45a1a-0021-4bf6-a5b8-acb845a635da","resolution":{"observed_at":"2026-08-15T22:35:07.689711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17428","last_updated":"2025-02-25T00:35:18Z","snapshot_observed_at":"2026-08-14T08:11:36.232487Z","submitted_at":"2024-05-27T17:59:45Z","title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17428","snapshot_observed_at":"2026-08-15T22:35:07.695811Z","title":"Nv-embed: Improved techniques for training llms as generalist embedding models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.695811Z"},"links":{"cited_paper":"/paper/2405.17428","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:e2eb74acb9e5da76c51eeef32a21cd05d00b2a6bddc20f1d1381029c34610267","observation_id":"c8197033-0ed1-405d-a80c-96f023e0c4a7","resolution":{"observed_at":"2026-08-15T22:35:07.695811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:35:07.702632Z","title":"Towards a universal test suite for combinatorial auction algorithms","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.702632Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:ed4148fd6ac057397d530fd9f9cfcc619a2ab741f67673dc64c7be6c799e55ac","observation_id":"b87fb9be-377c-40ca-9270-8f3db3436e50","resolution":{"observed_at":"2026-08-15T22:35:07.702632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08288","last_updated":"2025-02-21T18:00:52Z","snapshot_observed_at":"2026-08-16T13:10:33.980567Z","submitted_at":"2024-10-10T18:20:44Z","title":"Towards Foundation Models for Mixed Integer Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08288","snapshot_observed_at":"2026-08-15T22:35:07.707797Z","title":"Towards foundation models for mixed integer linear programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.707797Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:a8cc27bfd8bf0e13b16f43ae5d6daece6f1d4970fcfd1052f056ea499d4f0b23","observation_id":"981b0ca6-f777-4b56-baa7-16d53f932cc9","resolution":{"observed_at":"2026-08-15T22:35:07.707797Z","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-08-16T14:28:12.110479Z","submitted_at":"2024-01-11T15:02:15Z","title":"Machine Learning Insides OptVerse AI Solver: Design Principles and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.05960","snapshot_observed_at":"2026-08-15T22:35:07.713319Z","title":"Machine learning insides optverse ai solver: Design principles and applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.713319Z"},"links":{"cited_paper":"/paper/2401.05960","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:5b1c3dd0eee445235a3304f111fec02491943b3497d3416e01f28dc5c65dd7a6","observation_id":"8b0e19f9-8742-4e5e-812e-38985a5d5e89","resolution":{"observed_at":"2026-08-15T22:35:07.713319Z","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-15T22:35:08.452329Z","title":"Divergence measures based on the shannon entropy","venue":null,"work_id":"87fa1d51-92e0-4b02-a2e1-5258a98c16a6","year":1991},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.718756Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:1b29dfc710842e4db73a3358d920ca0c89d86316f9a486e74e6e650054d504b5","observation_id":"cfe29235-8100-48cf-b5ec-0740f5c9f5e6","resolution":{"observed_at":"2026-08-15T22:35:08.458319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.432871Z","title":"L2p-mip: Learning to presolve for mixed integer programming","venue":null,"work_id":"0261faba-4c0a-42b5-b504-e9f9d23b4bd3","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.723961Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:7ecbf5ec8fccea7d461ee161798dc617bccb6925a90458a7dbfd8cb64de67dec","observation_id":"7a61ec41-e190-4c68-8a7e-2389ef8f19a2","resolution":{"observed_at":"2026-08-15T22:35:08.438649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22806","last_updated":"2024-10-31T07:03:13Z","snapshot_observed_at":"2026-08-18T12:00:35.148586Z","submitted_at":"2024-10-30T08:33:27Z","title":"MILP-StuDio: MILP Instance Generation via Block Structure Decomposition","version":2},"cited_work":{"arxiv_id":"2410.22806","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.22806","snapshot_observed_at":"2026-08-15T22:35:07.946148Z","title":"MILP-StuDio: MILP Instance Generation via Block Structure Decomposition","venue":"cs.LG","work_id":"0428bd4e-30e5-479b-b8c5-a9706ec6e25d","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.728896Z"},"links":{"cited_paper":"/paper/2410.22806","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:459b626617542da2fc45c0ed6422dbe4445cf45577720a86b1e6b0e1ef369c83","observation_id":"d899f980-5186-4160-8361-8b49c4d929c0","resolution":{"observed_at":"2026-08-15T22:35:07.954658Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.415473Z","title":"P., and Mittal, M","venue":null,"work_id":"70b8bde1-c9c8-4b3a-aa06-6d8ecf0172eb","year":2010},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.734305Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:a73d5c98a7f5b8d891faa5bba398c2b8a3fe31b638a172300c6683b95ccab6fd","observation_id":"e83406dd-05ec-4fea-9d25-55f42d4fca26","resolution":{"observed_at":"2026-08-15T22:35:08.420611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.395940Z","title":"M., and Ramos, A","venue":null,"work_id":"d27cc7b0-cd36-41b5-8379-da8b55c0c37c","year":2013},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.739114Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:0ed5abefb57cc2e64f6a533b2e0ef685b21cf1081193cdc2158e15adc06e1597","observation_id":"304ce957-cc8b-4474-af6f-c9528ee9d39d","resolution":{"observed_at":"2026-08-15T22:35:08.402189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.377329Z","title":"G., and Manzolini, G","venue":null,"work_id":"6bc080bc-1271-4752-ae7e-0de6e6a26385","year":2021},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.744120Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:76b347aa37c8d3f2e5fe4710ecb5c9d51fd2c9373ab12f3e9716e9529d99379f","observation_id":"8b956cf6-b168-4c43-b79a-1c58f3a6e7ab","resolution":{"observed_at":"2026-08-15T22:35:08.382892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.359592Z","title":"An exact algorithm for large multiple knapsack problems","venue":null,"work_id":"2075f707-8394-46ff-afd2-97adb192f0f1","year":1999},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.749404Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:14d9803a1c86f9ea12212dda85dcf749fa8310f6161bb993191e3b9dbd9f98d4","observation_id":"237c4c5f-6bdf-4172-802a-637195dd321c","resolution":{"observed_at":"2026-08-15T22:35:08.365102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:07.754638Z","title":"W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.754638Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:2b47aecaae67dbdbb9526d3fae45bb067d48229dfab1fed83f3add5ce500d00b","observation_id":"d3f09c37-2631-481a-83c3-49a264285795","resolution":{"observed_at":"2026-08-15T22:35:07.754638Z","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-15T22:35:08.328814Z","title":"and Pinto, J","venue":null,"work_id":"6bf7760b-7f49-4670-95c6-b5bf22d2beb2","year":2004},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.760130Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:4862fe99bf225807afc6dd009e36301cce9c48c3f5f72e872f6ce7f7f6a25d32","observation_id":"20d33f90-73b4-4663-8c85-3563e5976ed4","resolution":{"observed_at":"2026-08-15T22:35:08.335702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.310265Z","title":"and Gao, W","venue":null,"work_id":"cc519bcb-cdeb-489b-9587-eb3356864209","year":2010},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.767421Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:4d08636a9cfb9431dc001d8d4d4d78958668d4b7ef2698480727fe21273f8b9d","observation_id":"d3ee7c02-c372-4ea8-a8e0-d947ce2b8159","resolution":{"observed_at":"2026-08-15T22:35:08.315928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:07.779503Z","title":"Improved techniques for training gans","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.779503Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:d26ed752edcdd21f00786357a36935ff02f51f693a1ba6f95e94bbabac9123ad","observation_id":"daa244bf-030f-4102-ac9c-fc7428005afe","resolution":{"observed_at":"2026-08-15T22:35:07.779503Z","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-15T22:35:08.280535Z","title":"and Bowly, S","venue":null,"work_id":"85a7cafc-0934-4093-ad18-c028695f36ca","year":2015},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.785993Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:633a5923f9246c00ceec1387b0b95e26115c637d46df356a507bd67327be3cc7","observation_id":"e21f74d3-c337-4cfc-9ab2-61b5b947f33d","resolution":{"observed_at":"2026-08-15T22:35:08.286197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.261949Z","title":"D., Park, K., and Kim, J","venue":null,"work_id":"7033090d-1c7a-417f-b2d4-ffb026403f8b","year":2018},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.791529Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:afe5ae829d4ddd3226e9b22ffe5bc19310838e7b6933e6a5607683e53670c2ee","observation_id":"328e0614-5721-44b9-a763-0a98732e243c","resolution":{"observed_at":"2026-08-15T22:35:08.267693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:08:26.289584Z","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-15T22:35:07.798230Z","title":"Learning a large neighborhood search algorithm for mixed integer programs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.798230Z"},"links":{"cited_paper":"/paper/2107.10201","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:eadb650f35d3f25f42961806bf274887b3cc2f694119607fb9ffe5c532808479","observation_id":"90156ab0-dd15-4c1d-99ce-180a185f5ba4","resolution":{"observed_at":"2026-08-15T22:35:07.798230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:35:07.805067Z","title":"Rethinking the inception architecture for computer vision","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.805067Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:0d1a1f2f13d626c40ff7f50ddd9379cb04502d9d5b29f3fbfe41a4aa5d3c68cb","observation_id":"a8116c7e-1f88-4e1c-a3e3-d03cab64f961","resolution":{"observed_at":"2026-08-15T22:35:07.805067Z","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-15T22:35:08.228657Z","title":"Reinforcement learning for integer programming: Learning to cut","venue":null,"work_id":"e5e48a06-23c5-4c7f-8de8-82c2abdeadf8","year":2020},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.811990Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:c32acdc24444ab7b48b4f90999d6bfa826f217afc9374685e205af6bf283ace1","observation_id":"187803fd-459f-432f-89bb-956aa1c88ccd","resolution":{"observed_at":"2026-08-15T22:35:08.234458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.209204Z","title":"P., Liu, J., Chen, X., Wang, X., Li, P., and Yin, W","venue":null,"work_id":"a4f39b91-63df-4417-8f60-04158fd1a374","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.817912Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:361c8aef934770f8afa5a1af9844cef26d7a73f54296bc3897a47ae40e55cc50","observation_id":"2a3fb72f-ffa5-447d-bf1c-107b61c50f23","resolution":{"observed_at":"2026-08-15T22:35:08.215507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-16T15:58:37.086518Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-08-15T22:35:07.823890Z","title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.823890Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:fed4e7591155ee2c5f62989d0c1ac7d073d1705a7f1207996ec658a686f257be","observation_id":"58a0ca64-08a6-4248-99f8-e5a9e50f3f7a","resolution":{"observed_at":"2026-08-15T22:35:07.823890Z","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-15T22:35:08.189698Z","title":"Learning to generate scalable milp instances","venue":null,"work_id":"30e9b36d-b7fb-45d4-9544-2ba1a735cdb6","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.830150Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:b333d5a2cf40ebd33ce98d674bf542f0778bc005a763cff8248caf611d33bbec","observation_id":"48deafaa-5c1f-4085-99d9-c917433360ec","resolution":{"observed_at":"2026-08-15T22:35:08.196226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.169525Z","title":"Gnn&gbdt-guided fast optimizing framework for large-scale integer programming","venue":null,"work_id":"6fdbe63b-8df9-4581-aa94-ed367b94fbaf","year":2023},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.836083Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:8c9c087f59920d6165bf052d5b444e066dae6d8b286fd6de39435b2f8ad15c69","observation_id":"613cc0f5-eaf2-4bdd-b45f-3b82716f0a36","resolution":{"observed_at":"2026-08-15T22:35:08.175201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.149188Z","title":"Light- MILP opt: Solving large-scale mixed integer linear programs with lightweight optimizer and small-scale training dataset","venue":null,"work_id":"d687b3a8-0a0f-47a1-b18c-c723dd9ecc68","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.842974Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:c2c21474c412877036dcc015d3b81035ccb9f24932bf0894445e835b81f36533","observation_id":"b115db3b-33f3-4eee-b0ff-1a40ac3223e2","resolution":{"observed_at":"2026-08-15T22:35:08.155047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T22:35:08.130253Z","title":"Milp-fbgen: Lp/milp instance generation with feasibility/boundedness","venue":null,"work_id":"e453b50d-fa9e-475f-86ae-9d4cd73352aa","year":2024},"citing_paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:07.849672Z"},"links":{"citing_paper":"/paper/2505.11526"},"observation_digest":"sha256:925cdc6e713c4ad8eafa7045c19fe74c0ce89f9e87fcb7b389adbafe3cfbad04","observation_id":"c84494e9-f2b9-4ff5-a5e0-d05f4dd351e5","resolution":{"observed_at":"2026-08-15T22:35:08.136115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.11526","last_updated":"2025-05-11T10:41:44Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T22:26:59.014828Z","submitted_at":"2025-05-11T10:41:44Z","title":"Code Retrieval for MILP Instance Generation"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":58},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2505.11526."}