{"as_of":"2026-08-13T04:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea8fde2b4d6d36e7a4bfb2fe49d5d9507a9c0fd5528c32f5b582ead85f9f33ee","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:22:10.576350Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.18321/citation-record","integrity":"/paper/2411.18321/integrity","json":"/paper/2411.18321/citation-record.json","paper":"/paper/2411.18321"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:22:10.955835Z","title":"Balas and A","venue":null,"work_id":"d9c776c6-56ac-41e6-b919-8dfa76883b58","year":1980},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.470672Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:c563fd0a4a789b309f108c96dfc41e428bd3685616457a41d07d17cf4ca09b41","observation_id":"9bfc1a11-4589-46ed-94ab-ab9aa640ba25","resolution":{"observed_at":"2026-08-12T11:22:10.960857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.939207Z","title":"Berthold, G","venue":null,"work_id":"93394753-2b6f-468d-be32-3793f4718ee4","year":2018},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.476590Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:07dbb6b632cbfaa6d392ee7b0e8d3f558dc7314966efb6d75d54798d1f49ac74","observation_id":"123eddeb-2a73-4506-a3a6-324ecac16299","resolution":{"observed_at":"2026-08-12T11:22:10.944195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.923219Z","title":"Bestuzheva, M","venue":null,"work_id":"e80f8f80-50f5-4a5e-97cf-1b138c975415","year":2021},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.482153Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:1242e188bac336d15f6b12737b3adac45b06b2cfc3fd7e67796e0edcc0ee9039","observation_id":"9d9148da-42cc-4d61-bcda-542fc1c576be","resolution":{"observed_at":"2026-08-12T11:22:10.928349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.907309Z","title":"Chmiela, E","venue":null,"work_id":"858abcc1-ad6d-471b-ba2d-8c4b253d6bbd","year":2021},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.487320Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:e42d2b91f4e57cdcd7577a966e75b0bcee4eb1f421cc1be6d328d98607298490","observation_id":"4360fae8-d9d4-48f0-ac6e-cef498fa4f5d","resolution":{"observed_at":"2026-08-12T11:22:10.912295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.891027Z","title":"Colombi, R","venue":null,"work_id":"03c00fda-6a90-4054-b455-a664f89d3e3d","year":2017},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.492850Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:0bb93be846d7922195120652a5c25ad19cd8ae6a385a7889f41a42f15a6edf23","observation_id":"d0d13fcf-51ea-4ed4-90da-c5ca5969f86e","resolution":{"observed_at":"2026-08-12T11:22:10.896210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.873663Z","title":null,"venue":null,"work_id":"383c5cfb-fcd7-44cd-a67d-38b4a3f2e9d2","year":2020},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.498754Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:d15bf8f85d66b4844803571001661d34cff36dc3cfd32b679a26bbf64d754df3","observation_id":"53c5ad36-e5d6-4d71-a6e6-d5ebcc018b97","resolution":{"observed_at":"2026-08-12T11:22:10.878785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.857406Z","title":"Efthymiou and N","venue":null,"work_id":"2ed9b35c-d1ba-4716-9803-76928c071346","year":2023},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.504927Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:712f0e98806585ffca1ec05720b1f741bfd822b8d17b90b50f9a97b14d20ad5a","observation_id":"184c6cb7-f7d8-412b-9ca8-35e36e9d8e5e","resolution":{"observed_at":"2026-08-12T11:22:10.862412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.840907Z","title":"Fischetti, A","venue":null,"work_id":"cf2cd7b1-98e9-4eea-bf08-0cc6a9e73071","year":2019},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.510563Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:157c39b12ec3866daa82841737b95dd9fb578577ee7f57bba68f4690dd2ac99c","observation_id":"680c8d8a-c795-40f0-a5a0-d252012f4c2a","resolution":{"observed_at":"2026-08-12T11:22:10.846043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.824311Z","title":"Gasse, D","venue":null,"work_id":"b057d373-8b05-4994-a911-09a30ee9f56a","year":2019},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.515954Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:87a06816e3b783fbb365d76576cfd3fcfabf9937a4565613f4602ea61ba5fa9e","observation_id":"62d93277-f2ec-4422-a4aa-7fb3a15040fa","resolution":{"observed_at":"2026-08-12T11:22:10.829711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.807922Z","title":null,"venue":null,"work_id":"af185209-b530-47f1-ae03-1a4f16083659","year":null},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.520957Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:989ea24ed59a2720f17d1356134111d64ef69475145dc3c0431656374187dbfd","observation_id":"b80cca32-3a0e-4009-9983-8e3857808ed0","resolution":{"observed_at":"2026-08-12T11:22:10.813065Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.773128Z","title":"Hendel, D","venue":null,"work_id":"443dc4bb-d136-47b4-a917-e26cb1aaf37d","year":2022},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.531448Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:820bb213baa288a64537e40d7a64e691ad19ee1a8417d98912a949e0653eb925","observation_id":"c0c8e570-367d-410b-a034-2ad1128e2547","resolution":{"observed_at":"2026-08-12T11:22:10.778944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.755281Z","title":null,"venue":null,"work_id":"02012f79-119c-4c38-b435-1a80ef70d5e9","year":2022},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.536287Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:2864c35d5b08dba8cb3ac2e2626158f0817a8ab953b54e1fa10341fba3c33e35","observation_id":"e3256b4e-6537-414d-a0dd-f86a2d0699f9","resolution":{"observed_at":"2026-08-12T11:22:10.760896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.736731Z","title":"Kilby, J","venue":null,"work_id":"035b7690-edde-4b91-bb91-82cc9f03b264","year":2006},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.541478Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:5e3ff1360c4d863fdb6dd9e136a61fb26b0b331288b5ec986cbec59a8b9b75f1","observation_id":"cc73a298-0b79-4802-8a5b-8299c8572da0","resolution":{"observed_at":"2026-08-12T11:22:10.742388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.719103Z","title":"Leyton-Brown, M","venue":null,"work_id":"d53a0dcc-bb6b-4342-a6ce-001b3f975aa7","year":2000},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.546460Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:6308fd12c9f2f3fb5475d56ee6a56bbd4438e485fbe5e0252137749635ad705d","observation_id":"bafe2e78-900d-46df-b453-c7828766834e","resolution":{"observed_at":"2026-08-12T11:22:10.724050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13349","last_updated":"2021-07-29T13:41:25Z","snapshot_observed_at":"2026-08-11T20:01:24.342838Z","submitted_at":"2020-12-23T09:33:11Z","title":"Solving Mixed Integer Programs Using Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13349","snapshot_observed_at":"2026-08-12T11:22:10.551272Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.551272Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:e7754a13e9a26e061f8b62184f23d556732f2ee7f17bc6b03a79b9f6023c823f","observation_id":"ed55e54d-d972-44ee-b5a6-11058079603c","resolution":{"observed_at":"2026-08-12T11:22:10.551272Z","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-12T11:22:10.701673Z","title":null,"venue":null,"work_id":"d529d327-e8f6-4f91-aeb6-0ca8eabe07bc","year":2022},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.556652Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:946975721b81ff9c1fa29f0da8651e851b3720c3dd8d712e9956fa993ecc492d","observation_id":"528a0b31-7776-46d1-b919-c93703ce5deb","resolution":{"observed_at":"2026-08-12T11:22:10.707038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.682475Z","title":"Learning optimal objective values for MILP","venue":null,"work_id":"1fc1cfe4-6fe0-4a1c-b426-78ca409b9e75","year":2024},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.561460Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:780567c5902b88126f1a19e7b511d3a580b4e930f9ddefb3edcc4f6dc09c7ef9","observation_id":"7d5a58db-1dea-401c-a306-3ed58252471a","resolution":{"observed_at":"2026-08-12T11:22:10.689415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.665902Z","title":"Scavuzzo, K","venue":null,"work_id":"8fdc0af6-9aeb-4cc8-871e-cdb3a3cc0985","year":2024},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.566330Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:dfff3b74b08554fecc9ef2c114a3af6de22ecfa13f06fd598237307bd60b6e89","observation_id":"bf4dc798-cda1-47c5-9af8-d3fcaedf5153","resolution":{"observed_at":"2026-08-12T11:22:10.671071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:22:10.647296Z","title":null,"venue":null,"work_id":"8c8fcca1-30dd-4642-8696-da2c480226aa","year":2022},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.571270Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:49e00ee04bdb70ff5f074e999f8293ae35307088e83d4f57858579512b0719e4","observation_id":"d5c16ebd-bc83-43e3-99b3-47dea940a96a","resolution":{"observed_at":"2026-08-12T11:22:10.653716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.10201","last_updated":"2022-05-20T16:31:03Z","snapshot_observed_at":"2026-08-11T05:46:10.044576Z","submitted_at":"2021-07-21T16:43:46Z","title":"Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.10201","snapshot_observed_at":"2026-08-12T11:22:10.576350Z","title":"Sonnerat, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.576350Z"},"links":{"cited_paper":"/paper/2107.10201","citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:92e9ddc84a3a90ae1d602d0cb134c675180451b78104702e8bc95e6761184d29","observation_id":"ec6a410b-b4f6-4d7c-b1cd-47861ba09d73","resolution":{"observed_at":"2026-08-12T11:22:10.576350Z","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-12T11:22:10.790163Z","title":null,"venue":null,"work_id":"9951c291-4b08-4f23-8938-d083854b5e5c","year":null},"citing_paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T11:22:10.526483Z"},"links":{"citing_paper":"/paper/2411.18321"},"observation_digest":"sha256:22844519a2a560410953184cc85d0cb3f5aff2f7a217bd04dea7264f91d34b91","observation_id":"ff0f2e60-7f73-4cef-b278-9c2d7e1bdd25","resolution":{"observed_at":"2026-08-12T11:22:10.795627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.18321","last_updated":"2024-11-27T13:22:31Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T02:11:23.425496Z","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":21},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2411.18321."}