{"as_of":"2026-08-16T02:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5c3e630d43763e325282be592440af760c12f1738317a123121b9dd5b4cea26","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:51:23.415820Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T12:01:08.000282Z","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-10T12:05:22.431996Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"cited_work":{"arxiv_id":"2508.20330","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.20330","snapshot_observed_at":"2026-06-19T17:10:31.406495Z","title":"Forge: Foundational optimization representations from graph embeddings","venue":null,"work_id":"320a7031-b97a-4ca7-b917-e7f8113e507c","year":2025},"citing_paper":{"arxiv_id":"2604.15448","last_updated":"2026-04-16T18:07:37Z","snapshot_observed_at":"2026-08-13T21:50:49.632776Z","submitted_at":"2026-04-16T18:07:37Z","title":"Transfer Learning from Foundational Optimization Embeddings to Unsupervised SAT Representations","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-10T12:01:08.000282Z"},"links":{"cited_paper":"/paper/2508.20330","citing_paper":"/paper/2604.15448"},"observation_digest":"sha256:d5becfe8fadb2689fcf851ceb002bf5ec0594f0bad9558ad7e090567808a271a","observation_id":"30b4669a-ddf9-41a8-be6c-0aa97e44bab2","resolution":{"observed_at":"2026-06-19T17:10:31.406495Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.20330/citation-record","integrity":"/paper/2508.20330/integrity","json":"/paper/2508.20330/citation-record.json","paper":"/paper/2508.20330"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:51:23.091587Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.091587Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:49d2a93b7685f020cc1ccb1e7a393d49ecf93f6e607027b211e30d2b1c010be8","observation_id":"a42a8ee0-772e-43e9-932c-3c48b76ff2a2","resolution":{"observed_at":"2026-08-15T16:51:23.091587Z","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-15T16:51:24.565116Z","title":"strIPlib: Structured Integer Programming Library","venue":null,"work_id":"a3c69ba1-2c90-4664-bc10-32401ad9c78f","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.097365Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:ca5f6a435e0068a91efff3f12d714603088718d1526a3cc79902a3186e64fde8","observation_id":"4629a9b2-009e-49d0-b1bc-e03d84f3c33a","resolution":{"observed_at":"2026-08-15T16:51:24.569429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.102143Z","title":"Machine learning for combinatorial optimization: A methodological tour d’horizon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.102143Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:916b1d94ed10ec65ed236658a67c02c80894946c77469c1e8519eeaf4988f4e9","observation_id":"46d928ae-ef10-422b-b407-4e97c4292946","resolution":{"observed_at":"2026-08-15T16:51:23.102143Z","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-15T16:51:24.551999Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":"9b9d4d76-61a1-4219-8b0d-7cd904c43e73","year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.107074Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:2821430cc8d504c8194122647405994d28cd452c6aa16c2e4d2d0825474459cc","observation_id":"b89ea44b-2dc9-4021-b463-640a1a32606b","resolution":{"observed_at":"2026-08-15T16:51:24.556101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.538210Z","title":"Routefinder: Towards foundation models for vehicle routing problems","venue":null,"work_id":"302bfdff-7a99-465e-8bab-f64198e68339","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.111503Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:4ec4962342ad61dd7d8d37a1ebf30e9be144cc2e483d0a382d772879315adb67","observation_id":"8a3bf44b-4616-41f4-9a47-83324459937c","resolution":{"observed_at":"2026-08-15T16:51:24.542779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.115935Z","title":"Routefinder: Towards foundation models for vehicle routing problems, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.115935Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:132a3becd33b96f7a5bac2490416d919299ed927dc0085c2f353038aea2153ca","observation_id":"8245c656-799d-459f-a68e-4da51537a946","resolution":{"observed_at":"2026-08-15T16:51:23.115935Z","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-15T16:51:24.524358Z","title":"Towards a generic representation of combinatorial problems for learning-based approaches","venue":null,"work_id":"2a5819bb-fc24-4eda-8d87-ee40966fe29b","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.120510Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:2c85b38b9707f14e25f27ef810d9565cf90a5dff9fd2ddb6f278e69b70a38b0f","observation_id":"73fbc7c4-3405-4d45-8261-46f76882afae","resolution":{"observed_at":"2026-08-15T16:51:24.528850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.510479Z","title":"Tackling prevalent conditions in unsupervised combinatorial optimization: Cardinality, minimum, covering, and more","venue":null,"work_id":"d3222773-cd83-4d43-89a4-f05aacc47cad","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.125483Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:2a8438400712f4adfcd9e5ebddd8f7f2cdd66fc6fda42ad72deb22874674278b","observation_id":"ec8800ca-8084-4ad3-98bd-d5cd790f24fe","resolution":{"observed_at":"2026-08-15T16:51:24.515188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.496312Z","title":"Learning backdoors for mixed integer linear programs with contrastive learning","venue":null,"work_id":"c4902d35-c316-4287-ab8f-103e8a286a59","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.129643Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:cdf5b577bac5b3dd620c0932b2b10137a5a015c9dd734805bfce921853556afc","observation_id":"4c5ca4a2-ba3c-41ed-8e5f-503e0cc7f774","resolution":{"observed_at":"2026-08-15T16:51:24.501025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14382","last_updated":"2025-07-23T17:09:55Z","snapshot_observed_at":"2026-08-14T07:12:32.212930Z","submitted_at":"2024-12-18T22:32:13Z","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14382","snapshot_observed_at":"2026-08-15T16:51:23.133878Z","title":"Balans: Multi-armed bandits-based adaptive large neighborhood search for mixed-integer programming problem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.133878Z"},"links":{"cited_paper":"/paper/2412.14382","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:d2c57b53cf197f7d0923eeae3b7c6f94ddf914a954d46cc3fd88520a7e4539d8","observation_id":"07d4c27e-f454-45f7-af1c-f4c721beda4f","resolution":{"observed_at":"2026-08-15T16:51:23.133878Z","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-15T16:51:24.482900Z","title":"Multi-task representation learning for mixed integer linear programming","venue":null,"work_id":"ac8fbff7-70c4-4479-8758-faf039aad99a","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.138297Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:a65865b021bcb64e8ca62bb83eff4c484a1e1479af59cf7e720fdb3e1e24adc2","observation_id":"52949bcc-93bc-49f1-af00-11a8747beca8","resolution":{"observed_at":"2026-08-15T16:51:24.487322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.468407Z","title":"Balans: Multi-armed bandits-based adaptive large neighborhood search for mixed-integer programming problem","venue":null,"work_id":"fb430f34-db40-4b6f-b85f-d1516c0d614a","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.142775Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:21637b183b51362a37dc24fe04870f0cec5b82a9710b58d1f6cb541690f9d2ce","observation_id":"8ffa389c-4e6d-4e00-9147-c5e77a9cf112","resolution":{"observed_at":"2026-08-15T16:51:24.473238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.454173Z","title":"u rk, Taha Varol, Reyhan Aydo g an, and Okan \\","venue":null,"work_id":"5f1fc4fd-ea3e-47ee-bdde-75de77bb0015","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.147032Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:755a94433adbf7e5509705241562b21b7f22f9aeaeaf67c2bb41607005fa1eb9","observation_id":"539db3e8-d5fe-4ca1-a211-d79a7512b4bb","resolution":{"observed_at":"2026-08-15T16:51:24.459022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.440428Z","title":"On representing linear programs by graph neural networks","venue":null,"work_id":"2fdb3c4b-9f18-4425-9c38-12e9c19cafa8","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.151201Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:7d947b88d33182b2b597dc7a0825707c042cdb0167a14d8a7117c7c9adbe77e3","observation_id":"5755cc3b-a6ee-472a-a6c6-6d1587580e6c","resolution":{"observed_at":"2026-08-15T16:51:24.444757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.426886Z","title":"Rethinking the capacity of graph neural networks for branching strategy","venue":null,"work_id":"86c63166-ee1d-40cb-bb59-b4e76bdfafdc","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.155311Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:6f3219a07b8313c54c1d891d00fab359bc1b43a7c79aea2b4951ff8fcb395ebb","observation_id":"c4d4c07d-beef-44ce-b39d-cbe37f021c07","resolution":{"observed_at":"2026-08-15T16:51:24.431272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.412676Z","title":"Augment with care: Contrastive learning for combinatorial problems","venue":null,"work_id":"51454a1b-6f90-4de5-a3fe-b96bf2eafe57","year":2022},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.164197Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0eb4d7526d7601032b8c879e0d9310add6f4216c5d14ec1151d2e78bd849f69d","observation_id":"82eefb1d-1771-4af3-b6cb-870b54c43699","resolution":{"observed_at":"2026-08-15T16:51:24.417538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04882","last_updated":"2019-08-12T04:04:15Z","snapshot_observed_at":"2026-08-15T20:14:37.258583Z","submitted_at":"2018-10-11T08:08:40Z","title":"Towards Understanding Linear Word Analogies","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04882","snapshot_observed_at":"2026-08-15T16:51:23.167972Z","title":"Towards understanding linear word analogies","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.167972Z"},"links":{"cited_paper":"/paper/1810.04882","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:3f3abb441187d567521baa720d9ceda692e5b638d6716c9325d27d938dcf6035","observation_id":"ec704bfb-f1e5-4841-b256-de38106adcad","resolution":{"observed_at":"2026-08-15T16:51:23.167972Z","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-15T16:51:23.172280Z","title":"A comprehensive evaluation of contemporary ml-based solvers for combinatorial optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.172280Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:6825f1e967d5b9342a38ffc77dcc1d59c9535cb94e5cde8cb2aff8ffe73702b1","observation_id":"5b7532ad-01de-402b-ad88-bd0008331f70","resolution":{"observed_at":"2026-08-15T16:51:23.172280Z","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-15T16:51:24.397854Z","title":"Ferber, Jialin Song, Bistra Dilkina, and Yisong Yue","venue":null,"work_id":"5c7192d8-9411-4262-9bef-65ad1dbfd703","year":2022},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.176669Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:c95b000bd74c3dafebd71d49af8098f52eea33672d3e5d4a06f1cd74dd601e63","observation_id":"b6440312-715a-497a-b32e-d5488802c7be","resolution":{"observed_at":"2026-08-15T16:51:24.402396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.383951Z","title":"Network Design with Applications to Transportation and Logistics","venue":null,"work_id":"950fb3b9-9bf4-4ac3-a3bc-80f4f7a534c3","year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.180965Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:329586428eeefe06591d38ac2e0bd1adda606f650a5dada38c7792dbe81628e0","observation_id":"215762a4-9d41-425b-b526-774b90977a78","resolution":{"observed_at":"2026-08-15T16:51:24.388337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.370415Z","title":"Exact combinatorial optimization with graph convolutional neural networks","venue":null,"work_id":"92584cc6-e827-450e-b065-6865e22cef64","year":2019},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.185111Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:7d412b09959a4635ccea2d182f67a3e80d4c200e9728e9c5e122cc68601b0bf6","observation_id":"01d3d189-7af4-43bf-b304-970f4f459772","resolution":{"observed_at":"2026-08-15T16:51:24.374816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.356612Z","title":"Deep learning in search heuristics","venue":null,"work_id":"f28a0a2f-c6d8-40d0-926d-9bf1123146ff","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.190096Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:118a6389fe87446642babab491cf1bb325a21b9ab7cfd2ac6641742616eacff6","observation_id":"5c8bfa9c-b2de-4b6a-ac69-76b8b41d0979","resolution":{"observed_at":"2026-08-15T16:51:24.361227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.343165Z","title":"Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco L\\\"ubbecke, Hans D","venue":null,"work_id":"e2997257-4003-4edc-8d12-690c474fbc2c","year":2017},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.194760Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:ee4bf7955f9187b2f6a044d3005415d9554102acf77db7390cca35453692135c","observation_id":"e539c79f-19fb-45b6-b4af-5df35e754bd5","resolution":{"observed_at":"2026-08-15T16:51:24.347604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.198830Z","title":"Gurobi Optimizer Reference Manual , 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.198830Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:7deaf07eb4eb5b3b7305e980ac54324a197909d6c75ff69c3374c3f6ec5e15e7","observation_id":"3d63fc1a-d0ea-4158-ad4a-90ea2e6eb95e","resolution":{"observed_at":"2026-08-15T16:51:23.198830Z","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-15T16:51:24.320519Z","title":"Hamilton, Zhitao Ying, and Jure Leskovec","venue":null,"work_id":"f436e2d4-f5c1-4ad6-befb-f1d9cf65a860","year":2017},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.202983Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:3316f585f6600c796274f71e23e27770a5110c0f73424bdf66e33bfae68e73f1","observation_id":"dc430b25-26c5-43aa-80c3-472305babc08","resolution":{"observed_at":"2026-08-15T16:51:24.324802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.307530Z","title":"A gnn-guided predict-and-search framework for mixed-integer linear programming","venue":null,"work_id":"63e1d31b-9e5b-4427-8eaa-0cdca624c2f9","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.207033Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:aedaca3c363549ca6fb7c614e67c900e8b97630da11d11170be1131efc43a1a6","observation_id":"b5dbcc83-e6a7-46c8-9d32-12566990f11b","resolution":{"observed_at":"2026-08-15T16:51:24.311896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.294434Z","title":"Learning to search in branch and bound algorithms","venue":null,"work_id":"118e55ff-9522-4d8b-bf73-e965b6431f22","year":2014},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.211432Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:43ac6cccc97aa881d880c925111315c5c37f8b1686f7df24842ffd20b85ffc88","observation_id":"cfebb4e9-1bde-4da7-9ac1-8ed3d1731fb4","resolution":{"observed_at":"2026-08-15T16:51:24.298775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.281257Z","title":"Learning to search in branch and bound algorithms","venue":null,"work_id":"2f951c1d-9ce6-44c6-84d1-e3fce0b36a61","year":2014},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.215748Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:7d0e17d2369a4fedb6004b03f056a96c74e19979e0c855933beced6089e111d4","observation_id":"4cdb51ff-b0b6-487e-8321-59dc073f3f30","resolution":{"observed_at":"2026-08-15T16:51:24.285527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.268336Z","title":"Automatic milp solver configuration by learning problem similarities","venue":null,"work_id":"8e30e1f2-bee4-4c70-9929-3337a0296807","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.220041Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:d0a8eb63b8fcb05a27c90f7b1889a7a5ee760bb8817e0d077bd11376a706e22f","observation_id":"d73433ba-84f4-4cde-a2ae-0b70663f4901","resolution":{"observed_at":"2026-08-15T16:51:24.272533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.254253Z","title":"Neural large neighborhood search for routing problems","venue":null,"work_id":"6528946b-c2bf-4702-8b68-98861f97f7e8","year":2022},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.224119Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:213af923dd0fffd044af00eb52452ff9219d1c8175b934f982419edc572fa18c","observation_id":"0c669fc5-9fb3-45de-b2c3-349332a2984f","resolution":{"observed_at":"2026-08-15T16:51:24.259493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.240796Z","title":"Ferber, Yuandong Tian, Bistra Dilkina, and Benoit Steiner","venue":null,"work_id":"a25d35b1-643c-43a7-bd1d-5725de147d3a","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.228141Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:b09272783309a5f59f43685185cd14a51c7155e11d05bb8f6351547d0a5403bd","observation_id":"293c92a0-f987-4988-89b6-3a0c4b25c96b","resolution":{"observed_at":"2026-08-15T16:51:24.245152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06954","last_updated":"2024-10-27T01:54:10Z","snapshot_observed_at":"2026-08-13T15:08:44.793623Z","submitted_at":"2024-06-11T05:25:38Z","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06954","snapshot_observed_at":"2026-08-15T16:51:23.232201Z","title":"Distributional miplib: a multi-domain library for advancing ml-guided milp methods","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.232201Z"},"links":{"cited_paper":"/paper/2406.06954","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0061a14461da1044d9e7220882c9e32757e214776821eebeb5fb7e9153008dd7","observation_id":"be9140d0-1167-4535-83c7-8367391cf61c","resolution":{"observed_at":"2026-08-15T16:51:23.232201Z","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-15T16:51:23.236540Z","title":"ISAC - instance-specific algorithm configuration","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.236540Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:a3e3d855e31a9775d7f565873d7fb629962c4e8ff39a81ef809830c950bbd79e","observation_id":"3ade3dc5-d169-407a-9ef4-0c5c95582362","resolution":{"observed_at":"2026-08-15T16:51:23.236540Z","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":"10.1007/978-3-642-23786-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:51:23.474703Z","title":"Algorithm selection and scheduling","venue":null,"work_id":"5d5bad46-34e5-400d-bac9-4ad4667664c7","year":2011},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.240760Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:88cb687e5e7816456319625a678945d99243b8b75ff3cbc502a034ee25cda4b1","observation_id":"f75e95f4-7547-4d8d-ab27-4103217639c6","resolution":{"observed_at":"2026-08-15T16:51:23.478999Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.227579Z","title":"Incorporating variance in impact-based search","venue":null,"work_id":"0d5fc033-5afa-46d3-ba6a-8bc4220f3f3f","year":2011},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.245175Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:bf28b6c1bb69024bbd42dfbfbb56d7c20176176027b166ba139f5b1dffb1fe0f","observation_id":"69ef860a-d102-457f-aec4-dc8962c18f5e","resolution":{"observed_at":"2026-08-15T16:51:24.231751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.213768Z","title":"Non-model-based search guidance for set partitioning problems","venue":null,"work_id":"64bbb1dd-5e1c-4173-9d9f-8d53689db489","year":2012},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.249246Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:5b85fd2cfe811aab4744f87b9aa635542e839faa02c8bb79ce7b50ea0bb6663d","observation_id":"cf688280-39dc-4554-9e25-bf5bf554bd2c","resolution":{"observed_at":"2026-08-15T16:51:24.218097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.200165Z","title":"Learning a reactive restart strategy to improve stochastic search","venue":null,"work_id":"48edaabf-b025-4a38-95c3-05f10eb1e02c","year":2017},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.254061Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:77d00991aed751186c5bd5988b6a11744726e6a4aaafcee703ad5b360a51e1c4","observation_id":"bce42d3c-e1c1-45db-82cb-ec528f18c941","resolution":{"observed_at":"2026-08-15T16:51:24.204844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.186822Z","title":"Integrating optimized item selection with active learning for continuous exploration in recommender systems","venue":null,"work_id":"f4538785-5744-4c16-8e12-de9bd2b6c219","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.258269Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:3f8633cc3a2ae2c690a6a08cb8c9d95efc2b6f980bb67fbe730bf2b0d4c31d86","observation_id":"80ddd002-2626-4c2a-a23b-91c621dc37e9","resolution":{"observed_at":"2026-08-15T16:51:24.191222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.172212Z","title":"Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs","venue":null,"work_id":"f61dae75-3afb-4d33-922c-a441de59f24e","year":2020},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.263498Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:b0b9e7416e9f687081cfb33fcb2a917b2b070144fe9a64699073e23d04808dd5","observation_id":"448f3542-6d59-4f5e-be08-6b1f0a8e7845","resolution":{"observed_at":"2026-08-15T16:51:24.177013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.157741Z","title":"Configuring mixed-integer programming solvers for large-scale instances","venue":null,"work_id":"7bf578a0-d41b-44db-ad96-b575f0aba1b9","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.267882Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:b5c941f55dfb52444fce4e7805f956ff9276491e896714c2c4eeb58b9760ffd0","observation_id":"5a807567-3f26-4f9a-aa3b-67c4cbacc355","resolution":{"observed_at":"2026-08-15T16:51:24.162272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.143817Z","title":"Learning to branch in mixed integer programming","venue":null,"work_id":"8edf7ba6-d4d0-4ac4-a010-d5b9654ef64c","year":2016},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.271818Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:c1b1d945322203e5c3d8d36170bb2623f219456d29f6b54052432df5a2e511ef","observation_id":"5623c9ba-2fc2-45c3-a1d8-dafed24885b1","resolution":{"observed_at":"2026-08-15T16:51:24.148439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.130175Z","title":"Khalil, Bistra Dilkina, George L","venue":null,"work_id":"03f3024c-ca12-4a4b-a777-256c142fd0e3","year":2017},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.275807Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:ca19b5d6ada6829902690eb289738300b296c03dde57db0f4ca12c6d983fd761","observation_id":"0efeb076-2739-47a1-8c6f-c8b2a8b78a84","resolution":{"observed_at":"2026-08-15T16:51:24.134598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.116498Z","title":"Autoregressive image generation using residual quantization","venue":null,"work_id":"5fa963a0-08d0-4ec9-a4b1-d10b7160ff88","year":2022},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.280024Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:803d91f83f188ad52e3f9539a25b27297ebaca8fa755ae56f0a19027ccdf3df5","observation_id":"c248a4fd-f6e7-49c0-9af6-138c97281832","resolution":{"observed_at":"2026-08-15T16:51:24.120932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.102456Z","title":"Towards foundation models for mixed integer linear programming","venue":null,"work_id":"edc60dca-c942-4eea-a4bc-381e488e74de","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.284080Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:bd36a7235f0249650c0e221685e4095494bb878022445f5a0e4919a8d9fef557","observation_id":"3f839a6e-0cdf-429b-a3c9-ae8b162cb475","resolution":{"observed_at":"2026-08-15T16:51:24.106812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.288151Z","title":"Di Liberto, Serdar Kadioglu, Kevin Leo, and Yuri Malitsky","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.288151Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:6305dba46775f76cc5da3a933b3b16c31d4ee836892167c9f18ea7c24675a15e","observation_id":"cd185d07-cd9f-45f4-977a-1cc45bbfea0b","resolution":{"observed_at":"2026-08-15T16:51:23.288151Z","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-15T16:51:23.293031Z","title":"On learning and branching: a survey","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.293031Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:b30b2d679438c3a074051bbe3cb6b7f0fbf918451d63a00833e2f565525c6ab5","observation_id":"5092d0c5-86fd-4a2e-9bf8-924c67c1c993","resolution":{"observed_at":"2026-08-15T16:51:23.293031Z","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-15T16:51:24.080354Z","title":"Attacking shortest paths by cutting edges","venue":null,"work_id":"3605ddb6-ad46-4ffd-b49e-c8ae9dc9436e","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.297516Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:8d2ab5fbc53da1916a4111ce62f5f162f6e1ec90e7f14d22ec82fdfb6f6a01b1","observation_id":"74d7077d-38c4-44ae-aa97-8f853077cb4c","resolution":{"observed_at":"2026-08-15T16:51:24.084740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.301810Z","title":"Solving mixed integer programs using neural networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.301810Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:fedbe9a3ae8e8825eed44b22291a73e0db2fdbe841f30179f49c14ea32f60a29","observation_id":"69470f91-33fd-459a-99f4-f33b26616895","resolution":{"observed_at":"2026-08-15T16:51:23.301810Z","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-15T16:51:23.307308Z","title":"Learning to cut by looking ahead: Cutting plane selection via imitation learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.307308Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0f6aaac8f93ff9812bcf6ccefe100f761fbb4468701f7b7aa087696f3f45196f","observation_id":"465cf76c-14d6-47d5-962b-fd16c6da136c","resolution":{"observed_at":"2026-08-15T16:51:23.307308Z","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-15T16:51:24.057863Z","title":"A diffusion model framework for unsupervised neural combinatorial optimization","venue":null,"work_id":"3080655b-040f-4954-a6db-c34a9a40792d","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.311486Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:28c6ac7487690a89b656b7e9f419b60d1dc8aa1aa817a194e99436f61c2dce7e","observation_id":"70063ed1-c383-43c7-8cf1-c4e7483f3037","resolution":{"observed_at":"2026-08-15T16:51:24.062149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.043239Z","title":"Deep reinforcement learning for instance-specific algorithm configuration","venue":null,"work_id":"1a706a3e-4719-4853-95f9-3212a37a8f62","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.315679Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0b687614cfd2eb482e7e1275ff189e7c5df10c712a11d1c246f2ab49d70d0cb0","observation_id":"f3c8e111-ae46-4069-9b5a-8b15d5a39fda","resolution":{"observed_at":"2026-08-15T16:51:24.048280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.028723Z","title":"Facenet: A unified embedding for face recognition and clustering","venue":null,"work_id":"ba34c811-900d-4299-9d28-db83f6a153a5","year":2015},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.319920Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:41659e45ab4034f1662c236f5837ce7977385bc030781a67d07fc2bcdaf9e206","observation_id":"b060aacc-3b80-4cd4-a706-ac0011f5dbd4","resolution":{"observed_at":"2026-08-15T16:51:24.033134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.014821Z","title":"Accelerated discovery of set cover solutions via graph neural networks","venue":null,"work_id":"efd7a753-ca6f-41d6-ba2e-2a8ca877774b","year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.324014Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:73f0bb3f15aaf273f6e7ee7eca69c44c4f39abc234f34129c6fa7555659065f2","observation_id":"c82f278c-afc1-44af-b681-86e0e7e0f74d","resolution":{"observed_at":"2026-08-15T16:51:24.019333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:24.000428Z","title":"A general large neighborhood search framework for solving integer linear programs","venue":null,"work_id":"4b316ee4-0018-4f45-b1a5-6ed3af682f96","year":2020},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.328092Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:d7682ea54df819085d0017b50074c7aab195ba59aec1bb534b2c3401cf27b287","observation_id":"e76eee75-095b-4a49-97b7-ba29caf1c889","resolution":{"observed_at":"2026-08-15T16:51:24.005034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.332864Z","title":"Mabwiser: A parallelizable contextual multi-armed bandit library for python","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.332864Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:e26ef6cc5a562682457809f0507fc1ada25c3e21effa9bf04936675b1917fdfc","observation_id":"ffd3ff45-a80d-4d0e-8285-cdb76abd1417","resolution":{"observed_at":"2026-08-15T16:51:23.332864Z","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":"10.1142/s0218213021500214","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:51:23.448352Z","title":"MABWiser: parallelizable contextual multi-armed bandits","venue":null,"work_id":"8eb8be2c-0719-4698-997c-25ea0fe05a6c","year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.337607Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:92a93c92927a1eb184fc276d4d2c3c1bd2ecd297617fb9fedcab70d514d58174","observation_id":"990cf20e-a14f-4e00-b4d0-70782096c6a5","resolution":{"observed_at":"2026-08-15T16:51:23.455137Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.986833Z","title":"Reinforcement learning for integer programming: Learning to cut","venue":null,"work_id":"dfbd6a24-3878-4f40-8c35-e810cbcf2b96","year":2020},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.341682Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:274a70cd474919ed552be2a315b62379df87fe185bbc3d488b627104c7c7b030","observation_id":"ac560c0e-e6d0-4d6a-9265-1d2949f59e93","resolution":{"observed_at":"2026-08-15T16:51:23.991212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.972934Z","title":"One model, any CSP: graph neural networks as fast global search heuristics for constraint satisfaction","venue":null,"work_id":"81f60220-0bd2-4e07-978f-83018e537769","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.346400Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:c24b6e062e9fedc4a20934c30d18cff2ae6eacdd5e57aee97ea63df2897464fb","observation_id":"c0b49d91-be4b-4f1e-b701-532e4df664a3","resolution":{"observed_at":"2026-08-15T16:51:23.977510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.352649Z","title":"Neural discrete representation learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.352649Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:3442e6b5bc6c73967caaa28053f6515b6094c27cb059f9f3c0f9835e1ba5b124","observation_id":"151676b7-9b42-4d95-b359-0bfa8414dd8b","resolution":{"observed_at":"2026-08-15T16:51:23.352649Z","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-15T16:51:23.948077Z","title":"Understanding how dimension reduction tools work: an empirical approach to deciphering t-sne, umap, trimap, and pacmap for data visualization","venue":null,"work_id":"bfb62294-5144-46be-a9ae-2e444039686a","year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.356651Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:ce2873b6a6aa8b9fc4d3efa37f2d375ed3b10e4b930a5078bc8a867596ffb5ee","observation_id":"af9da2b1-81c9-4f7f-84d5-118fbfa1c109","resolution":{"observed_at":"2026-08-15T16:51:23.953461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.932854Z","title":"Learning large neighborhood search policy for integer programming","venue":null,"work_id":"5985e2b2-e92c-41fa-a848-7577154b16c2","year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.360851Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:50d8430c5e7ef96b8f141f21c6b400ceed8cf34a3999a5bb86c3315fff8138ac","observation_id":"b0399acd-58cf-4ca9-9c6d-3deb03f867ff","resolution":{"observed_at":"2026-08-15T16:51:23.937662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.918959Z","title":"Hoos, and Kevin Leyton-Brown","venue":null,"work_id":"0dadddbe-6bea-4b76-9c61-3e99c55b44f8","year":2008},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.365456Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0c3c4034b1027525abcae497108e4767dd37789fb40e31591aa3c42e4cb456e2","observation_id":"142a4738-59e0-4d47-b563-69aa6711c80f","resolution":{"observed_at":"2026-08-15T16:51:23.923259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.905069Z","title":"Vqgraph: Rethinking graph representation space for bridging gnns and mlps","venue":null,"work_id":"c8b3eaa2-04c8-4859-abe5-a49cc89a6651","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.369726Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:55702d46eec349425119a6dbe89427d5b5bf4735d06b4282e1ee98e568052d55","observation_id":"e40fdb3a-e3e8-4825-acef-8f41996bf071","resolution":{"observed_at":"2026-08-15T16:51:23.909397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.890396Z","title":"Are graph neural networks optimal approximation algorithms? Neural Information Processing Systems, 37: 0 73124--73181, 2024","venue":null,"work_id":"20c0fb13-08c4-4fc7-bf38-84b9c11dd960","year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.373882Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:808285ecaa8f8467463dce1450515ecce78fdaa74830291b6792f793198f40af","observation_id":"1b57b764-5975-41ad-9782-2eeae39a5128","resolution":{"observed_at":"2026-08-15T16:51:23.895027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06736","last_updated":"2025-08-08T22:30:19Z","snapshot_observed_at":"2026-08-13T14:48:22.614050Z","submitted_at":"2025-08-08T22:30:19Z","title":"ParBalans: Parallel Multi-Armed Bandits-based Adaptive Large Neighborhood Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06736","snapshot_observed_at":"2026-08-15T16:51:23.379122Z","title":"Parbalans: Parallel multi-armed bandits-based adaptive large neighborhood search","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.379122Z"},"links":{"cited_paper":"/paper/2508.06736","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:cbcaf8c76f67eef82b29db0ae1516f73b6f85ac04be79de01f7501ce0d31b718","observation_id":"2627a3ba-331c-430b-9ad6-7c7d87117054","resolution":{"observed_at":"2026-08-15T16:51:23.379122Z","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-15T16:51:23.876887Z","title":"Vector-quantized image modeling with improved vqgan","venue":null,"work_id":"0cc14c12-54a9-44f6-9c5b-4e1061732419","year":2022},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.383598Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:086b5a12f4f4b6c0e1ab71d2a4970a43694d1a0e3e9b6d3ac7aa7bfd13d116ed","observation_id":"cf78e65b-ea50-4f24-94b8-fe01f75a24f3","resolution":{"observed_at":"2026-08-15T16:51:23.881267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.387987Z","title":"Soundstream: An end-to-end neural audio codec","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.387987Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:d359c2561bfc6ae500ca034f42afa7ef38b7bf6ed663c50358a1a7b4a5dc84fd","observation_id":"4c3354f6-ece2-4eef-8926-4e47c05c1882","resolution":{"observed_at":"2026-08-15T16:51:23.387987Z","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-15T16:51:23.854137Z","title":"A survey for solving mixed integer programming via machine learning","venue":null,"work_id":"f6d93b58-681d-4e74-a551-ec773587746d","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.392727Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0aebd38bce4b6fa10c0509244ecec83df484295e82e5e8405621af13d4c46e4b","observation_id":"5e0e82ee-10a2-4256-8c6c-7440737e447f","resolution":{"observed_at":"2026-08-15T16:51:23.858630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.840396Z","title":"Towards omni-generalizable neural methods for vehicle routing problems","venue":null,"work_id":"d4d24d80-2bc0-495c-b897-0b82176484a9","year":2023},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.397536Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:81b705b7d27e8233f3d66cd178f7e429d46e6ac830a57ccefbbaf7f41165c6c3","observation_id":"aa60ec97-55a0-4092-8395-a94b9f9c804f","resolution":{"observed_at":"2026-08-15T16:51:23.844761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.825817Z","title":"Learning from labeled and unlabeled data with label propagation","venue":null,"work_id":"d500f5e8-fcfd-41c9-b644-089b2005dc6c","year":2002},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.401986Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:6f00f96de7c94e71ac81bd2b0f2a2dc9e7d39cca9b164a8439fdfd61954a9b47","observation_id":"e71510ff-a2c6-47c1-a041-d0b070423403","resolution":{"observed_at":"2026-08-15T16:51:23.830815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:51:23.406783Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.406783Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:a229687606ebe744307f0394c0d5fb8184c2e6a2b13d63fb2194b367dcffd812","observation_id":"7672931b-a00a-4b37-9d66-30d208923a6c","resolution":{"observed_at":"2026-08-15T16:51:23.406783Z","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-15T16:51:23.411469Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.411469Z"},"links":{"citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:46213a5f85667e606380e7a0bdd81a4830be27dc075b206c7aaa12dd52cb3af8","observation_id":"c165e943-0adb-4739-adee-ccb3f6f37dee","resolution":{"observed_at":"2026-08-15T16:51:23.411469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-12T23:37:35.682504Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-08-15T16:51:23.415820Z","title":"https://www.gurobi.com","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.415820Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:e0df894f1b75ecf7c44a4b700c03315941828868c59d841aa1de845581f51ff5","observation_id":"fde5d254-6a20-44c9-89c2-26c5b18d000a","resolution":{"observed_at":"2026-08-15T16:51:23.415820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T16:44:27.305725Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":2,"verified_fuzzy":51},"total_outbound_references":73},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 1 inbound Pith citation observation for arXiv:2508.20330."}