{"as_of":"2026-08-17T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:89d6ee9413d51cc9dccdd47fbaba7b37c65800342aa5d2046d745c238ad9b93c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:35:07.707797Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T06:56:32.217055Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-11T12:19:17.773549Z","title":"arXiv preprint arXiv:2410.08288 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14409","last_updated":"2025-06-11T21:30:19Z","snapshot_observed_at":"2026-08-14T07:12:30.570656Z","submitted_at":"2024-12-18T23:33:32Z","title":"Multi-task Representation Learning for Mixed Integer Linear Programming","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T12:19:17.773549Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2412.14409"},"observation_digest":"sha256:4f66a6300779051642e035b16eccf7c0a6818e1c3a57c15449c677476df12ea4","observation_id":"9f32f5a7-8ab8-4a38-af13-c1e95e232fb1","resolution":{"observed_at":"2026-08-11T12:19:17.773549Z","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":"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-15T20:50:08.189115Z","title":"Towards foundation models for mixed integer linear programming,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01988","last_updated":"2025-05-17T09:44:37Z","snapshot_observed_at":"2026-08-15T20:42:25.580973Z","submitted_at":"2025-05-17T09:44:37Z","title":"Surrogate Interpretable Graph for Random Decision Forests","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T20:50:08.189115Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2506.01988"},"observation_digest":"sha256:d01c34625ea8245c49ba045c3d5e8a07caacb77b98df03f56488b6d50c247feb","observation_id":"c58a3b52-b1d9-438f-a8e2-f215d444498b","resolution":{"observed_at":"2026-08-15T20:50:08.189115Z","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-05T21:27:14.324255Z","title":"Towards foundation models for mixed integer linear programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10047","last_updated":"2025-08-12T06:55:33Z","snapshot_observed_at":"2026-08-07T18:11:04.367840Z","submitted_at":"2025-08-12T06:55:33Z","title":"A Survey of Optimization Modeling Meets LLMs: Progress and Future Directions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T21:27:14.324255Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2508.10047"},"observation_digest":"sha256:2861223951afbf641917635dd102a15d2376f30accd135df981973bdb32a6f1d","observation_id":"c470ed46-23be-46ce-97d4-e9e3c1465a4f","resolution":{"observed_at":"2026-08-05T21:27:14.324255Z","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-05T04:50:31.927408Z","title":"Towards foundation models for mixed integer linear programming,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05946","last_updated":"2025-09-07T06:46:03Z","snapshot_observed_at":"2026-08-16T09:15:45.036338Z","submitted_at":"2025-09-07T06:46:03Z","title":"Large Language Models for Next-Generation Wireless Network Management: A Survey and Tutorial","version":1},"reference_index":118,"source":"pdf_text","source_observed_at":"2026-08-05T04:50:31.927408Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2509.05946"},"observation_digest":"sha256:4df5056514b3b6c79dcd44bc6be8e1608b39a57e6cb128b1cc2f8e3b448ba4bb","observation_id":"21589e5f-d90e-40eb-b1b3-9bd2e00861cf","resolution":{"observed_at":"2026-08-05T04:50:31.927408Z","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":"2410.08288","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08288","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards foundation models for mixed integer linear programming","venue":null,"work_id":"8548346f-a3ac-477c-b70b-74bec972cde8","year":2024},"citing_paper":{"arxiv_id":"2605.10598","last_updated":"2026-05-11T14:01:52Z","snapshot_observed_at":"2026-08-14T11:55:58.205041Z","submitted_at":"2026-05-11T14:01:52Z","title":"Budget-Efficient Automatic Algorithm Design via Code Graph","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-12T03:46:09.715264Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2605.10598"},"observation_digest":"sha256:e71829f0922353c8552d30b01b394d99de44c44d07973b53d2482ba32abf7186","observation_id":"cabe4e7c-1f3b-41d2-9664-d7a049939c22","resolution":{"observed_at":"2026-05-12T06:56:32.220586Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-02T14:20:13.273601Z","title":"arXiv preprint arXiv:2410.08288 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18252","last_updated":"2026-05-12T09:03:05Z","snapshot_observed_at":"2026-08-10T02:50:58.267956Z","submitted_at":"2026-05-12T09:03:05Z","title":"MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T14:20:13.273601Z"},"links":{"cited_paper":"/paper/2410.08288","citing_paper":"/paper/2607.18252"},"observation_digest":"sha256:ad5a80f10e59e9f4bad1614e4daad9ad5b91e43a7eeec3f693718c8402d06355","observation_id":"b25e55b9-d1be-4858-ae1f-2a88fee31612","resolution":{"observed_at":"2026-08-02T14:20:13.273601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.08288/citation-record","integrity":"/paper/2410.08288/integrity","json":"/paper/2410.08288/citation-record.json","paper":"/paper/2410.08288"},"outbound":[],"paper":{"arxiv_id":"2410.08288","last_updated":"2025-02-21T18:00:52Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2410.08288."}