{"as_of":"2026-08-14T07:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:517611634d7090f929a48d8b186fd8455e8f13cd6353cb8f256e25d13214cb96","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:58:28.925570Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T04:47:47.691913Z","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-07-04T13:59:51.928527Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2506.11057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.11057","snapshot_observed_at":"2026-07-04T13:59:51.928527Z","title":"arXiv preprint arXiv:2506.11057 (2025)","venue":null,"work_id":"4e645fb3-2f1e-4156-89a4-8725f8fb1d4e","year":2025},"citing_paper":{"arxiv_id":"2605.20849","last_updated":"2026-05-20T07:40:05Z","snapshot_observed_at":"2026-08-14T06:24:24.052688Z","submitted_at":"2026-05-20T07:40:05Z","title":"Large Language Models for Operations Research: A Comprehensive Survey","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-21T03:56:29.983335Z"},"links":{"cited_paper":"/paper/2506.11057","citing_paper":"/paper/2605.20849"},"observation_digest":"sha256:d1cd6746b58ad8662f3f2ce088aeaa5be4cab4278bab716cfaa62cbbc8457f0e","observation_id":"e36ba57f-d37f-47c3-9864-d1f6867ce168","resolution":{"observed_at":"2026-05-21T03:59:32.526860Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2506.11057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.11057","snapshot_observed_at":"2026-07-04T13:59:51.928527Z","title":"arXiv preprint arXiv:2506.11057 (2025)","venue":null,"work_id":"4e645fb3-2f1e-4156-89a4-8725f8fb1d4e","year":2025},"citing_paper":{"arxiv_id":"2606.27369","last_updated":"2026-06-25T17:59:36Z","snapshot_observed_at":"2026-08-14T02:54:31.610293Z","submitted_at":"2026-06-25T17:59:36Z","title":"Reinforcement Learning without Ground-Truth Solutions can Improve LLMs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-26T04:47:47.691913Z"},"links":{"cited_paper":"/paper/2506.11057","citing_paper":"/paper/2606.27369"},"observation_digest":"sha256:77689767b98a7dd3d30e68559740848af594e490ce4c6264f8308164d02627f2","observation_id":"d1f29771-3440-4c40-b6b0-6edd1a877073","resolution":{"observed_at":"2026-07-04T13:59:51.929887Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.11057/citation-record","integrity":"/paper/2506.11057/integrity","json":"/paper/2506.11057/citation-record.json","paper":"/paper/2506.11057"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:58:34.560362Z","title":"An integer programming approach to scheduling.Computer scheduling of public transport urban passenger vehicle and crew scheduling, pages 269–280, 1981","venue":null,"work_id":"183b3b90-be07-4a53-a43f-b326da1158d0","year":1981},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:24.598162Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:8b6f86e77de9035957774687f29cc882e2c8f1479ac9d9e439da9df72ae11a90","observation_id":"eedc734c-1a57-4d84-ba66-b1f24625180a","resolution":{"observed_at":"2026-08-07T14:58:34.637822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:34.322606Z","title":"A data-driven three-layer algorithm for split delivery vehicle routing problem with 3d container loading constraint","venue":null,"work_id":"6feb9b54-d19b-49b4-8554-53f42f6e5c50","year":2018},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:24.690776Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:c4d46595707becfb9b2a5278dc19c8eeb526cd3287f396c6a206c794dea79589","observation_id":"84fc1016-bf5a-4838-b916-f0547374923f","resolution":{"observed_at":"2026-08-07T14:58:34.433257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11477","last_updated":"2023-09-27T07:29:44Z","snapshot_observed_at":"2026-08-12T21:21:48.006892Z","submitted_at":"2023-04-22T20:34:03Z","title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11477","snapshot_observed_at":"2026-08-07T14:58:24.781430Z","title":"Llm+ p: Empowering large language models with optimal planning proficiency.arXiv preprint arXiv:2304.11477, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:24.781430Z"},"links":{"cited_paper":"/paper/2304.11477","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:75280ed40ed51864b14a633f74713d6c1deb43ab2e70250536e03daa28935499","observation_id":"d6cbe11b-f07e-4828-b23c-3a8d1623283d","resolution":{"observed_at":"2026-08-07T14:58:24.781430Z","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-07T14:58:34.085073Z","title":"Exploiting special structure in semidefinite programming: A survey of theory and applications.European Journal of Operational Research, 201(1):1–10, 2010","venue":null,"work_id":"adc9745d-c558-4429-a94a-a714f17cc41a","year":2010},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:24.862988Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:f41b5ea38568a0dd8cfaec5c2a3067543d24e2f4234a3ed2b7bdabc56c15bbc9","observation_id":"abb1f5d6-01a4-4465-b507-3add383f7c53","resolution":{"observed_at":"2026-08-07T14:58:34.208249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:33.820068Z","title":"PhD thesis, Citeseer, 2011","venue":null,"work_id":"6aa001cc-af24-49e6-9903-a64ea9dbfbec","year":2011},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:24.937923Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:61bed8423e79c3580f35d46f2da8374c0b703363e19409dda1387e56cc12fbe1","observation_id":"a3828e1c-ac6a-4c8f-9c14-2345e928b8e8","resolution":{"observed_at":"2026-08-07T14:58:33.925717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:33.584350Z","title":"The molecule problem: Exploiting structure in global optimization.SIAM Journal on Optimization, 5(4):835–857, 1995","venue":null,"work_id":"0dc5cf1f-5f1f-4fb8-b70f-f0cf150acb7d","year":1995},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.014131Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:3f05e34f94f07f4f6731a56e369406126c7511c45495b4a07ccbe22d36d4e939","observation_id":"5480eac3-27e3-4c57-8ff4-ec69e4e8c41f","resolution":{"observed_at":"2026-08-07T14:58:33.715900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:25.103164Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon.European Journal of Operational Research, 290(2):405–421, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.103164Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:8bea48bf154fafff114f201bccf8f4e9526ed2df1edd86986115a847f230a776","observation_id":"85e1117f-9a7d-4f68-ba18-f34b7ab06ac3","resolution":{"observed_at":"2026-08-07T14:58:25.103164Z","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-07T14:58:25.148344Z","title":"Attention is all you need.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.148344Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:3103e4eb7553461cb322d4fdee6b147e6d74db95a0a77ddff4e008c1947401f4","observation_id":"513e41c9-a0cf-4aec-98ad-71a7d7930143","resolution":{"observed_at":"2026-08-07T14:58:25.148344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09940","last_updated":"2017-01-12T23:55:36Z","snapshot_observed_at":"2026-08-11T22:02:29.962183Z","submitted_at":"2016-11-29T23:22:39Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09940","snapshot_observed_at":"2026-08-07T14:58:25.252026Z","title":"Neural combina- torial optimization with reinforcement learning.arXiv preprint arXiv:1611.09940, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.252026Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:d629ca5d2468f5ba4d563e457d652b0b7940f217c3f6f83d253a974f3cf8f543","observation_id":"0de96ab1-4f44-402c-8252-d7c3a24d52d3","resolution":{"observed_at":"2026-08-07T14:58:25.252026Z","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-07T14:58:25.325576Z","title":"Mip-gnn: A data-driven framework for guiding combinatorial solvers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.325576Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:27f849c683866abb46518e56426de529733a9a0327a57c671fdae843a2c6b57c","observation_id":"86bf162d-3b0a-4037-af8c-ba44deee4ac5","resolution":{"observed_at":"2026-08-07T14:58:25.325576Z","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-07T14:58:33.247558Z","title":"Hyper- reactive tabu search for maxsat","venue":null,"work_id":"a1414798-f23e-468d-b341-ec5b9d5bf2f9","year":2018},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.426069Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:3db8fd21ab0a769aa84ba86555d61a19057fc31a53ce2cfc9f8483024a9f4d08","observation_id":"c3d8f518-93c8-4f75-837a-fa7ec73a9daf","resolution":{"observed_at":"2026-08-07T14:58:33.387266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:32.998579Z","title":"Learning when to use a decompo- sition","venue":null,"work_id":"5ca63045-fed9-48fc-946f-a1e19214a794","year":null},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.582904Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:2192339b81d99ab627087e99fd0adb0c873270962fadd620cd3b746869068e67","observation_id":"ca316e91-40da-4818-9200-32768e4ee154","resolution":{"observed_at":"2026-08-07T14:58:33.154256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:32.700691Z","title":"Learning a classification of mixed-integer quadratic programming problems","venue":null,"work_id":"0159ae9a-bcf3-4d4d-a79d-cb208cfc6400","year":2018},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.675620Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:89ddd60bd232dd1bd3e38619b24030114309cda344829d13223def05fd26ffe2","observation_id":"4e172898-6bf9-4c7e-a751-44dafe06fa68","resolution":{"observed_at":"2026-08-07T14:58:32.822919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01629","last_updated":"2019-10-30T15:21:45Z","snapshot_observed_at":"2026-08-14T05:46:54.902368Z","submitted_at":"2019-06-04T17:59:40Z","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01629","snapshot_observed_at":"2026-08-07T14:58:25.769906Z","title":"Ex- act combinatorial optimization with graph convolutional neural networks.arXiv preprint arXiv:1906.01629, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.769906Z"},"links":{"cited_paper":"/paper/1906.01629","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:4949cbc6adef38d07a953c474ad66f8b2faf9eba80aa4e4de6c4eef3408398a0","observation_id":"fac73ad3-7de1-4221-be6b-91502baabd67","resolution":{"observed_at":"2026-08-07T14:58:25.769906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-13T12:53:44.100358Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-08-07T14:58:25.834542Z","title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model.arXiv preprint arXiv:2302.00244, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.834542Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:e0e31edb5e56638a8d80061c093c005e0040eda54979b95d45a1677a82da6a59","observation_id":"4da25c35-3555-4eff-92a5-d6ef4e4b7d5a","resolution":{"observed_at":"2026-08-07T14:58:25.834542Z","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-07T14:58:32.414757Z","title":"Learning to cut via hierarchical sequence/set model for efficient mixed-integer programming.IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024","venue":null,"work_id":"39bd0ae5-88ab-406e-a4bc-a13a99bc0ef4","year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.932427Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:776ef29008cbe710e4b56d3dd977663d40cde5a523760aa8c240fdce51240dad","observation_id":"504c93e6-5d67-4b1f-a94f-285ae74a2f17","resolution":{"observed_at":"2026-08-07T14:58:32.532441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","snapshot_observed_at":"2026-08-10T14:03:30.979941Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04310","snapshot_observed_at":"2026-08-07T14:58:26.006959Z","title":"Co-bench: Benchmarking lan- guage model agents in algorithm search for combinatorial optimization.arXiv preprint arXiv:2504.04310, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.006959Z"},"links":{"cited_paper":"/paper/2504.04310","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:94e26a8eb607a306841e952c6fffbb1901519ee211385070e63cd005f50ad044","observation_id":"6fde0ca0-e85f-4893-aa23-b711dded1da8","resolution":{"observed_at":"2026-08-07T14:58:26.006959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.03409","last_updated":"2024-04-15T07:50:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-07T00:07:15Z","title":"Large Language Models as Optimizers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.03409","snapshot_observed_at":"2026-08-07T14:58:26.104810Z","title":"Large language models as optimizers.arXiv preprint arXiv:2309.03409, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.104810Z"},"links":{"cited_paper":"/paper/2309.03409","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:c463968a37eb509f07d2724157b23c728366310c01299355a9f4b4962f52a61d","observation_id":"fe808437-5ddf-43ca-9f30-16c956eb5dca","resolution":{"observed_at":"2026-08-07T14:58:26.104810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01757","last_updated":"2024-03-04T06:24:21Z","snapshot_observed_at":"2026-08-13T04:04:22.661868Z","submitted_at":"2024-03-04T06:24:21Z","title":"How Multimodal Integration Boost the Performance of LLM for Optimization: Case Study on Capacitated Vehicle Routing Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01757","snapshot_observed_at":"2026-08-07T14:58:26.204993Z","title":"How multimodal integration boost the performance of llm for optimization: Case study on capacitated vehicle routing problems.arXiv preprint arXiv:2403.01757, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.204993Z"},"links":{"cited_paper":"/paper/2403.01757","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:9357f5fda8ff9144716eec5015447fde5004817c0eb225d350a92f024ee07d5e","observation_id":"721858bc-9fdc-4fd4-be8e-6e24ebf41f79","resolution":{"observed_at":"2026-08-07T14:58:26.204993Z","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-07T14:58:26.290819Z","title":"Mathematical discoveries from program search with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.290819Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:d6ea4323fd48859db371225e1f66892434d3368e0b849cf2d7608332afc8e9af","observation_id":"03256996-f358-4d3d-8a04-be59d282bdfe","resolution":{"observed_at":"2026-08-07T14:58:26.290819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02051","last_updated":"2024-06-01T16:48:37Z","snapshot_observed_at":"2026-08-13T04:49:16.029963Z","submitted_at":"2024-01-04T04:11:59Z","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02051","snapshot_observed_at":"2026-08-07T14:58:26.411739Z","title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model.arXiv preprint arXiv:2401.02051, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.411739Z"},"links":{"cited_paper":"/paper/2401.02051","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:3b9547d630692beaaa6a189029e86bd8cf8189d4262f0815d045d61b90503a0b","observation_id":"cb992b3b-57d5-4e9e-b5af-ae04dc0dc782","resolution":{"observed_at":"2026-08-07T14:58:26.411739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01145","last_updated":"2024-10-14T13:50:46Z","snapshot_observed_at":"2026-08-13T04:28:42.402172Z","submitted_at":"2024-02-02T05:04:51Z","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01145","snapshot_observed_at":"2026-08-07T14:58:26.477683Z","title":"Reevo: Large language models as hyper-heuristics with reflective evolution.arXiv preprint arXiv:2402.01145, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.477683Z"},"links":{"cited_paper":"/paper/2402.01145","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:3298ceb3bef03ca3e6b28154451df5b1a4db1d47e909d33ccf9d57dde63b4c22","observation_id":"a38f7215-d266-4709-b724-55e7a667f8cc","resolution":{"observed_at":"2026-08-07T14:58:26.477683Z","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-07T14:58:32.105160Z","title":"The Second Half.https://ysymyth.github.io/The-Second-Half/, 2025","venue":null,"work_id":"dac97fee-8f3b-47c6-9612-29dc615df409","year":2025},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.545958Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:a1502e6077932d9725557667d15124bd922dc32cd54bb56d3038389a4e9c99f1","observation_id":"fd9f4270-a89f-4fde-a92e-bcab327388bc","resolution":{"observed_at":"2026-08-07T14:58:32.259148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:31.865512Z","title":"Accelerating linear programming solving by exploiting the performance variability via reinforcement learning","venue":null,"work_id":"84a104ab-13e4-4ebb-8dbd-3237cb34ec37","year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.612447Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:f66050e106aed1a960234cb26200ce5496d7e8203d37fd907cb7e5bd7f868002","observation_id":"e53b1b0b-d3c3-4bea-9436-e8884e8b42cb","resolution":{"observed_at":"2026-08-07T14:58:31.977084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:26.682603Z","title":"Pointer networks.Advances in neural information processing systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.682603Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:ccee71c6c93819b648dba0758cd5edb1d68e6f52c8be4ffba0659e1488d27b27","observation_id":"37896434-0e2f-4f0f-88e9-e781a3769d80","resolution":{"observed_at":"2026-08-07T14:58:26.682603Z","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-07T14:58:26.737597Z","title":"Sequence to sequence learning with neural networks.Advances in neural information processing systems, 27, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.737597Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:4d08d00d6b64b32d48107eae16a6d038f1bd1e15bed41223ac5b2950f8f3143c","observation_id":"40a396d1-074c-4368-989d-c2eac9dc2eeb","resolution":{"observed_at":"2026-08-07T14:58:26.737597Z","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-07T14:58:31.745580Z","title":"A theoretical and com- putational analysis of full strong-branching.Mathematical Programming, 205(1):303–336, 2024","venue":null,"work_id":"fde3097b-5152-465b-bf16-9c2ec0b67fbe","year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.794739Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:8f51c21f7137816b3b6a4e3a36df6df95c8db28c167f6dd9530f11b29cd62ed0","observation_id":"536f4059-3fa2-44d9-8603-231a922c3c91","resolution":{"observed_at":"2026-08-07T14:58:31.789893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:26.839092Z","title":"A systematic survey on large language models for algorithm design.arXiv preprint arXiv:2410.14716, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.839092Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:1b4c86962c6bbd453c644ad19349551a7e450368ecdba3100ca7a4b5e72f61b5","observation_id":"82e1122c-6744-4f90-92d2-ad5e299653f8","resolution":{"observed_at":"2026-08-07T14:58:26.839092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10705","last_updated":"2024-11-13T15:46:08Z","snapshot_observed_at":"2026-08-13T04:17:33.172024Z","submitted_at":"2024-02-16T14:04:56Z","title":"AutoSAT: Automatically Optimize SAT Solvers via Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-07T14:58:26.912495Z","title":"Autosat: Automatically optimize sat solvers via large language models.arXiv preprint arXiv:2402.10705, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.912495Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:0e4cfa9d5cd1042a349e53215e735516119aa908a5c527edee973a69066faf43","observation_id":"ce1d5194-f6be-40b1-bd60-47776fbb0987","resolution":{"observed_at":"2026-08-07T14:58:26.912495Z","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-07T14:58:31.618358Z","title":"Llm4solver: Large language model for efficient algorithm design of combinatorial optimization solver","venue":null,"work_id":"abf1ffd8-58bc-4a9a-84ef-79b7de65460d","year":null},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.984436Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:04ddd100929e0505d00afb31f35da13f99b911cd4ce6267575e11c609f7e92ec","observation_id":"42e92391-31f8-4ccf-9712-c7301a2c0d9e","resolution":{"observed_at":"2026-08-07T14:58:31.668188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.02328","last_updated":"2024-08-05T09:11:52Z","snapshot_observed_at":"2026-08-12T23:08:37.746612Z","submitted_at":"2024-08-05T09:11:52Z","title":"Past and future of the cap set problem","version":1},"cited_work":{"arxiv_id":"2408.02328","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.02328","snapshot_observed_at":"2026-08-07T14:58:29.133064Z","title":"Past and future of the cap set problem","venue":"math.CO","work_id":"0e8a8d8b-8fb6-4801-8d27-e8571035bfec","year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.041249Z"},"links":{"cited_paper":"/paper/2408.02328","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:e937ef5514aad726ce896c507cbbf20cae43d74f45966041fed5fe62bb902b05","observation_id":"a801f64d-5d89-4db3-9006-357b7e0835e2","resolution":{"observed_at":"2026-08-07T14:58:29.251091Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:31.523537Z","title":"Bin packing optimization via deep reinforcement learning.IEEE Robotics and Automation Letters, 2025","venue":null,"work_id":"eb18c167-82f4-4a53-8dbe-24d8479b1613","year":2025},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.093369Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:323447270c3875d7ef02852cfdcbc0aaa2b6b4b52d867d0ca46e36e36456a147","observation_id":"e80e231f-9262-4a87-aaea-f93fb997069b","resolution":{"observed_at":"2026-08-07T14:58:31.560462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:27.153765Z","title":"Courier Corporation, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.153765Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:be0ac3d5ffb678d746701b09012dc29aacee8a691bf832b38d3c3ed9bd9f8742","observation_id":"381804ee-ae3b-40d5-90eb-d0bc5df62987","resolution":{"observed_at":"2026-08-07T14:58:27.153765Z","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-07T14:58:31.385165Z","title":"Traveling salesman problem","venue":null,"work_id":"f5580a31-da7f-4e19-80a6-5be2d47a8823","year":2013},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.228792Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:af8b1c004d267b1cafdcf496d865b20bf8c4864a85a0fd0b6987f35aa24f9983","observation_id":"67c8a76a-ef23-4de7-896e-dbccae19d50d","resolution":{"observed_at":"2026-08-07T14:58:31.454287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:31.243953Z","title":"Production planning: a review.European Journal of Operational Research, 7(2):101–110, 1981","venue":null,"work_id":"a2399a2b-cd45-443a-8d0f-2f240abc5d27","year":1981},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.297362Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:b7cebe409bb17b2f4cbe92372c04324d27eb8fbd1cbc9cc3c0fdc03a4be4f545","observation_id":"ddc530b6-7d8c-48a8-8f49-4c1f07dffc90","resolution":{"observed_at":"2026-08-07T14:58:31.299910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:27.364405Z","title":"SIAM, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.364405Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:6acaa112ae43a6803d18d0393d7281462a1b56429a8b14dd213e5d9b3fc6d0d1","observation_id":"aef5b9b0-6c90-4946-bd33-77a6e712f85e","resolution":{"observed_at":"2026-08-07T14:58:27.364405Z","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-07T14:58:27.431458Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.431458Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:6b7477de1b250f6213e79a3aef6828a214232c1a323304503ee4146af17643ba","observation_id":"a62c3209-f023-4665-970e-db3e3b3275e8","resolution":{"observed_at":"2026-08-07T14:58:27.431458Z","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-07T14:58:27.528279Z","title":"Courier Corporation, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.528279Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:0169984c7822e0ee1c9064f6350e43d0918ec0318e1aa97ce730a7339070ce19","observation_id":"3304cf9f-2773-471a-ae45-638e442ea1cb","resolution":{"observed_at":"2026-08-07T14:58:27.528279Z","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-07T14:58:31.030282Z","title":"Foundations of multimodal co- learning.Information Fusion, 64:188–193, 2020","venue":null,"work_id":"9b8bc452-ff39-4b80-93a7-6f66c958358b","year":2020},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.614697Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:0294d4febc499b4341ab49f27f9bd6af7b0a6787e7b0f5581805782c8ac63198","observation_id":"6820b6b2-db46-41ed-bee0-b527d7f37b49","resolution":{"observed_at":"2026-08-07T14:58:31.105850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03685","last_updated":"2019-03-12T00:56:48Z","snapshot_observed_at":"2026-08-01T01:23:29.214436Z","submitted_at":"2018-02-11T03:04:28Z","title":"Learning a SAT Solver from Single-Bit Supervision","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03685","snapshot_observed_at":"2026-08-07T14:58:27.720416Z","title":"Learning a sat solver from single-bit supervision.arXiv preprint arXiv:1802.03685, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.720416Z"},"links":{"cited_paper":"/paper/1802.03685","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:68a3c094be681e44a9d5d390fedb70412f0ad0cd8b50bc06a63e1c1dbb34c52e","observation_id":"2ac97e95-cdbd-4e2b-9092-7e1b7e2d569c","resolution":{"observed_at":"2026-08-07T14:58:27.720416Z","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-07T14:58:30.911145Z","title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","venue":null,"work_id":"dc71a3f5-0ad2-4354-9206-53910b79232a","year":1980},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.810439Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:ebb24c59bd2922dd5500bfd8dbaa65c114d19a1a5125dd70688a2cbe54b6a977","observation_id":"f4d94a8d-874c-4e1e-86c8-4d038f11e9d2","resolution":{"observed_at":"2026-08-07T14:58:30.954343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:27.909031Z","title":"Springer, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.909031Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:14b993ebcfa28c424450f0222cb76282e62fea27e0bb8a5068a0afbee0a24f6c","observation_id":"365f5283-0b52-4c80-b0a8-8dcff87b45ae","resolution":{"observed_at":"2026-08-07T14:58:27.909031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11107","last_updated":"2022-10-13T13:37:42Z","snapshot_observed_at":"2026-08-13T15:39:04.925735Z","submitted_at":"2022-05-23T07:57:32Z","title":"Learning to branch with Tree MDPs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11107","snapshot_observed_at":"2026-08-07T14:58:27.990784Z","title":"Learning to branch with tree mdps.arXiv preprint arXiv:2205.11107, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:27.990784Z"},"links":{"cited_paper":"/paper/2205.11107","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:ae5ac241f88b92a728a78e15bad37de3869ca595726557f7583182d838931a65","observation_id":"346d5815-76a8-45c3-94a5-9d95413a785a","resolution":{"observed_at":"2026-08-07T14:58:27.990784Z","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-07T14:58:28.084043Z","title":"Exact com- binatorial optimization with graph convolutional neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.084043Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:1696ba55abbcda6fd8b939e664cf7a13f238167ab4966d7ac8c461939c7d0e8c","observation_id":"ef5aefda-a020-4895-be79-a03927d58673","resolution":{"observed_at":"2026-08-07T14:58:28.084043Z","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-07T14:58:30.769696Z","title":"Improving learning to branch via reinforcement learning","venue":null,"work_id":"26104f70-a028-4f05-8b42-7a94eedc8a1a","year":2020},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.172692Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:ca69205e80b3c3c988bfaf1fa4974dda3d9ad37f6c0428506c0e941e78c818e8","observation_id":"8cd52492-df70-4851-b639-1094bc289e80","resolution":{"observed_at":"2026-08-07T14:58:30.824220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:30.667292Z","title":"On the facets of the mixed–integer knapsack polyhedron.Mathematical Programming, 98(1):145–175, 2003","venue":null,"work_id":"c280184b-593b-43be-b3b6-a58bdc2f0827","year":2003},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.251131Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:970d5adb5fc149a79ede6cb3a4a3722021d46c339439996d51f86ff4aa8ea955","observation_id":"786bcc7a-efe2-4e98-8d0c-04444e8bbe57","resolution":{"observed_at":"2026-08-07T14:58:30.702086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:30.565877Z","title":"Connections in networks: A hybrid approach","venue":null,"work_id":"b9ac0fbc-817f-4e59-9d65-fa8c6405a0ce","year":2008},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.337982Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:127d42b33027df7048b7949559106cbc3c36f861730b8c6276390ecc10fe8d4f","observation_id":"b7714827-752e-466f-bb55-951db871b434","resolution":{"observed_at":"2026-08-07T14:58:30.600630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:30.469692Z","title":"Machine learning for combinatorial optimization, 2021","venue":null,"work_id":"053e10c4-4a5d-44f5-b837-cc9281f822e9","year":2021},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.413077Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:daa34496d4c006646979d67fef6b5d9c7ef031cc5f2faa97febf0fdc58f7ffc2","observation_id":"1f9b025b-41f7-4e9a-9325-ffe523eb6a3a","resolution":{"observed_at":"2026-08-07T14:58:30.506857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:30.323278Z","title":"Proceedings of sat competition 2023: Solver, benchmark and proof checker descriptions","venue":null,"work_id":"5c5fd5d2-6e16-44df-adfa-98fd247fe320","year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.487315Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:b411d8d2e2d4a6722403772d63d8d439d1a684bf5d8f5be8f609b1776d11e8a7","observation_id":"c461b1e7-2220-4efe-914f-49ac695b888e","resolution":{"observed_at":"2026-08-07T14:58:30.399879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.06069","last_updated":"2020-11-24T21:06:00Z","snapshot_observed_at":"2026-08-13T21:04:17.375889Z","submitted_at":"2020-11-11T20:59:36Z","title":"Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.06069","snapshot_observed_at":"2026-08-07T14:58:28.553690Z","title":"Ecole: A gym-like library for machine learning in combinatorial optimization solvers.arXiv preprint arXiv:2011.06069, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.553690Z"},"links":{"cited_paper":"/paper/2011.06069","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:54948696a3c27052487d12a14924d93e7665a850bf15dc674851f65553f8525c","observation_id":"eb410981-91d4-445e-a4bb-203de9d6b19a","resolution":{"observed_at":"2026-08-07T14:58:28.553690Z","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-07T14:58:30.173964Z","title":"Hardsatgen: Understanding the difficulty of hard sat formula generation and a strong structure-hardness-aware baseline","venue":null,"work_id":"2d0091c3-6a3f-4014-84e2-6b43085bacf3","year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.631408Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:5093793410a7ef2c8cdef396a7fb7e0885c43492f4a65b6e9caf7f8b9e45039b","observation_id":"f7856e0d-c201-454f-8a74-bafd713d29ff","resolution":{"observed_at":"2026-08-07T14:58:30.240829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.08872","last_updated":"2021-12-16T13:34:32Z","snapshot_observed_at":"2026-08-13T17:14:01.231995Z","submitted_at":"2021-12-16T13:34:32Z","title":"The SCIP Optimization Suite 8.0","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.08872","snapshot_observed_at":"2026-08-07T14:58:28.687749Z","title":"The scip optimization suite 8.0.arXiv preprint arXiv:2112.08872, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.687749Z"},"links":{"cited_paper":"/paper/2112.08872","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:ba259e870e024473699043dfa4d8ef268e5d32b2219aa20d9496531f15e162d7","observation_id":"c939a651-126e-4b8d-aef2-b296ba3b1795","resolution":{"observed_at":"2026-08-07T14:58:28.687749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13349","last_updated":"2021-07-29T13:41:25Z","snapshot_observed_at":"2026-08-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-07T14:58:28.770514Z","title":"Solving mixed integer programs using neural networks.arXiv preprint arXiv:2012.13349, 2020","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.770514Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:9f34393897bde2330b37b4238db650e76a77197f73d7b1c61053a5bf2392b4f7","observation_id":"ae781948-96f9-48f8-9c69-3c3998bb44fe","resolution":{"observed_at":"2026-08-07T14:58:28.770514Z","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-07T14:58:29.968733Z","title":"Learning to search in branch and bound algorithms","venue":null,"work_id":"62e70be2-3b8f-4ec6-b9ba-2f6cf4ad25a6","year":2014},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.846081Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:20a6036f4accaabaa4599a577271671716d0d73a5ea1edbb6382ad5619a7a2ea","observation_id":"c53c1bf2-740e-4a5d-8dad-c7de2c9ae3dd","resolution":{"observed_at":"2026-08-07T14:58:30.056531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T14:58:29.674850Z","title":"Automated configuration of mixed in- teger programming solvers","venue":null,"work_id":"b8f376ac-6703-4664-8562-38975745d804","year":2010},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:28.925570Z"},"links":{"citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:b3ad12077fbf2fedae56549d17dc83cbedff830ad81eee6f06197bfb4a06fc53","observation_id":"06f6f06b-64ed-4908-85f0-63ecf81e7756","resolution":{"observed_at":"2026-08-07T14:58:29.779767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T17:41:23.957421Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":55},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 2 inbound Pith citation observations for arXiv:2506.11057."}