{"as_of":"2026-08-15T03:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7da18ba5b515bb553d9d0ffa31a1e9164691778f0c63c11def34d539280f6c72","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:30:55.685027Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.13333/citation-record","integrity":"/paper/2608.13333/integrity","json":"/paper/2608.13333/citation-record.json","paper":"/paper/2608.13333"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s1471068414000179","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.933155Z","title":"SUNNY: a lazy portfolio approach for constraint solving","venue":null,"work_id":"88b9f133-1c77-412f-9a4f-f39c6cb85888","year":2014},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.564080Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:d09033f11b936145adb89e248003bb65dd9e5b13a152cca42ece5bf3b24fb279","observation_id":"ccb86d8c-340a-4725-a22b-7d0985af9d11","resolution":{"observed_at":"2026-08-14T13:30:55.938146Z","resolver_source":"doi","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":"10.24963/ijcai.2025/1115","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.917311Z","title":"Large language model meets constraint propagation","venue":null,"work_id":"58e3cfb8-55cc-4bb0-95ac-e4be334feb6f","year":2025},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.569428Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:8de1864d259ff4a47c90d3d132a9941ad96110c3c47de0e32213f8f5c804c573","observation_id":"c93b9727-f8cf-4686-8f5e-cf5bf4ef6c6d","resolution":{"observed_at":"2026-08-14T13:30:55.922845Z","resolver_source":"doi","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":"10.1016/0004-3702(89)90037-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.901845Z","title":"Tree clustering for constraint networks","venue":null,"work_id":"48ac1ef6-c886-41b9-8a66-03588df9e33b","year":1989},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.574519Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:76d1cfbb7cfdafe75a978c5b160282bb422353a44a1b5ba38c5b99a14ab87804","observation_id":"97999970-55af-463a-95a1-7b08f84d4e78","resolution":{"observed_at":"2026-08-14T13:30:55.906682Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.580867Z","title":"SAT -based local improvement for finding tree decompositions of small width","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.580867Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:fdd8763d9893ecbcebdebcef60f5e9b3553c42b87282bc54dd2b34c8f902f10d","observation_id":"ff8da600-7300-4751-b078-7d6f49a8afde","resolution":{"observed_at":"2026-08-14T13:30:55.580867Z","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-14T13:30:56.367663Z","title":"Exact combinatorial optimization with graph convolutional neural networks","venue":null,"work_id":"17323613-6147-47fa-9b34-c2b2dec15abf","year":2019},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.586097Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:edaf209f95066a2b8074ed2a6a08c4adcd74c39099979ff61ed867bad10ed6a3","observation_id":"74ea18b3-c068-436e-9ce9-e97f46d29726","resolution":{"observed_at":"2026-08-14T13:30:56.372677Z","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-14T13:30:55.591835Z","title":"Hypertree decompositions and tractable queries","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.591835Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:35e53bd577b8e8a614d58354451201d1f1e1fa6d123e7ba0d50d4071957a0b40","observation_id":"296f5cc9-37da-4ba6-94af-fe84ca786db7","resolution":{"observed_at":"2026-08-14T13:30:55.591835Z","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-14T13:30:55.597217Z","title":"Neural large neighborhood search for routing problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.597217Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:636956cf820c8574af6f5b9c56e68f8e1e17ee449fe6893bc2c66ce85b27a10b","observation_id":"734e9375-8d38-44ab-b13a-fe2a52a81134","resolution":{"observed_at":"2026-08-14T13:30:55.597217Z","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-031-3402","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.877541Z","title":"GRAPH reinforcement learning for operator selection in the ALNS metaheuristic","venue":null,"work_id":"f9950088-b780-4158-9689-4be951cf68ed","year":2023},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.601824Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:0bf30fc8d9307ebaddf1660745396d81685ebf968a46363e9b141a59eb523b1b","observation_id":"7f21113b-0b58-4157-8da5-3167cc004680","resolution":{"observed_at":"2026-08-14T13:30:55.882591Z","resolver_source":"doi","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":"10.1613/jair.4726","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.861200Z","title":"Hoos, Frank Hutter, and Torsten Schaub","venue":null,"work_id":"1a734407-1393-4233-a7c0-1190ff0c713b","year":2015},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.606526Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:9f917f7524c3dddcce6cdbae3783d0686094e6aabfa8dc758145d569f44f6eca","observation_id":"ba406c80-172f-45f1-962b-2c9c6fad770f","resolution":{"observed_at":"2026-08-14T13:30:55.866182Z","resolver_source":"doi","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":"10.1145/3326159","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.845798Z","title":"A SAT approach to branchwidth","venue":null,"work_id":"30019598-0009-4d6f-b029-a80bea240c74","year":2019},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.611273Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:b7c8fa539154e52c4021a2ba4dd225bd0b0f4ec9b38b5901553b5fa86dbfd7d6","observation_id":"734a67bc-7a7f-4090-a081-2a54c038cc44","resolution":{"observed_at":"2026-08-14T13:30:55.850426Z","resolver_source":"doi","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-14T13:30:56.352130Z","title":"Learning large Bayesian networks with expert constraints","venue":null,"work_id":"f203943d-26b1-44d6-b2f5-e1a8833d5586","year":2022},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.615932Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:4276988fa5edabb5b4db1764ec62e3f23e90ebe05ecc4f8d227852b1d53f5704","observation_id":"1cc5f2d9-d63f-40fc-a4d3-c03e25915994","resolution":{"observed_at":"2026-08-14T13:30:56.357108Z","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-14T13:30:55.620906Z","title":"Large neighborhood search","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.620906Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:44c1dc05160faa57b8a7aaf43b59301cfde89f532568a3d41b64c68b529a2f42","observation_id":"1e56912b-8aa0-4733-85de-9e25b84ee356","resolution":{"observed_at":"2026-08-14T13:30:55.620906Z","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-14T13:30:55.625659Z","title":"MaxSAT-Based postprocessing for treedepth","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.625659Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:c9761631500a8a42ea8ce3f90d6f1aab75d10c4c10f4b362d7f5bcbbaf2f1db3","observation_id":"4b8d116c-f3a2-4c23-813d-e3216093fe3d","resolution":{"observed_at":"2026-08-14T13:30:55.625659Z","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.1609/aaai.v35i5.16508","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.810393Z","title":"Turbocharging treewidth-bounded bayesian network structure learning","venue":null,"work_id":"2eb7eaf7-cf76-402f-8681-6443e07e7361","year":2021},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.631305Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:5b13f3e24edd885d9b1f59457e2d8e5d4aa2f713f51a35091790787ebf30326a","observation_id":"45fedd24-ae71-412e-abe1-6dc5002c495a","resolution":{"observed_at":"2026-08-14T13:30:55.816231Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.636009Z","title":"The power of collaboration: Learning large bayesian networks at scale","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.636009Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:1a640eccce7f1c65caaa095ce17d98bfad1c8b1baa82aeb6ccc09d117e1cab4e","observation_id":"f5d381d4-75a8-4abb-95aa-d09533e201dc","resolution":{"observed_at":"2026-08-14T13:30:55.636009Z","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-14T13:30:55.640842Z","title":"Pawan Kumar, Emilien Dupont, Francisco J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.640842Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:18d10e796976d55d618655d8e183da820dc403dd68bcb3779d1edcc21f1033f5","observation_id":"91490db1-959e-4d5a-bebb-8892490876e0","resolution":{"observed_at":"2026-08-14T13:30:55.640842Z","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-14T13:30:55.646327Z","title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.646327Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:26a814369b49117d7a941b8ac8f18c1053124c9516a3402c218c0251d480c3ec","observation_id":"4eb6b54a-f98e-4658-85a7-544530ff881f","resolution":{"observed_at":"2026-08-14T13:30:55.646327Z","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.1145/3603112","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.784623Z","title":"Sat-boosted tabu search for coloring massive graphs","venue":null,"work_id":"0b551d07-2ea6-47ed-9066-85b2c46e6661","year":2023},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.651015Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:2c4593358bb9dba8a8c6478ad91e44539ed396e399b7db649fecb30eb6be9e4d","observation_id":"32094757-5d6e-4e21-ac46-f78a0f6697c5","resolution":{"observed_at":"2026-08-14T13:30:55.789549Z","resolver_source":"doi","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":"10.4230/lipics.cp.2024.26","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.768842Z","title":"Structure-guided local improvement for maximum satisfiability","venue":null,"work_id":"efac6bdc-7659-45b8-87c9-1aa7aece827b","year":2024},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.656381Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:cef87d71cb85730993547fc5f0477992c7f3a90599e5352c7c366de0f081595f","observation_id":"cfb9e0e1-9204-48b5-a668-f58b6a81cc01","resolution":{"observed_at":"2026-08-14T13:30:55.773572Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.661782Z","title":"SAT -based decision tree learning for large data sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.661782Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:b2b8c9b9b6bb5600a72a676ffebd0a2be4b68470d008137521b750902cac6e24","observation_id":"78c9a0a1-37fd-49c9-8414-1afa8bf47deb","resolution":{"observed_at":"2026-08-14T13:30:55.661782Z","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/3-540-49481-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.741426Z","title":"Using constraint programming and local search methods to solve vehicle routing problems","venue":null,"work_id":"b6c9be06-0ae8-4541-8ce6-a302141189ec","year":1998},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.666534Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:4c0c577876d614bf705a59d8be5f96c7eab602b56b7c31ef57bd51b4475a0ae4","observation_id":"24e688bb-9607-43fc-ad44-3a4661b537a2","resolution":{"observed_at":"2026-08-14T13:30:55.748404Z","resolver_source":"doi","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":"2503.10642","last_updated":"2025-02-22T04:13:53Z","snapshot_observed_at":"2026-08-13T13:34:44.660389Z","submitted_at":"2025-02-22T04:13:53Z","title":"Text2Zinc: A Cross-Domain Dataset for Modeling Optimization and Satisfaction Problems in MiniZinc","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.10642","snapshot_observed_at":"2026-08-14T13:30:55.671259Z","title":"Text2zinc: A cross-domain dataset for modeling optimization and satisfaction problems in minizinc","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.671259Z"},"links":{"cited_paper":"/paper/2503.10642","citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:be98330b2dc9ca74f2800fc017c053d7fd9e5524138ecda432eec220b3ac656c","observation_id":"75d741e3-6c22-44f8-b6bf-02707606e1ad","resolution":{"observed_at":"2026-08-14T13:30:55.671259Z","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.1609/aaai.v38i8.28659","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:56.337736Z","title":"SAT-Based tree decomposition with iterative cascading policy selection","venue":null,"work_id":"589c1132-a6f4-40d7-8999-9bde466daedc","year":2024},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.675880Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:269607024dd567dbf334fdc8dcb837b72fadc30558115791ba83d757f0f17610","observation_id":"0284afe4-9ae2-4410-ba85-4c06cf8f138e","resolution":{"observed_at":"2026-08-14T13:30:56.342314Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:55.680429Z","title":"Hoos, and Kevin Leyton - Brown","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.680429Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:145ba4e494eb26607e60701f4a03721cc217a5a27194d86ef934270d916c5a8c","observation_id":"ab412a5c-7166-439d-b2e3-b5c09ac6a96e","resolution":{"observed_at":"2026-08-14T13:30:55.680429Z","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-14T13:30:56.321867Z","title":"Le, Denny Zhou, and Xinyun Chen","venue":null,"work_id":"d8d33da3-464b-4c30-a8fe-dacac95ef73a","year":2024},"citing_paper":{"arxiv_id":"2608.13333","last_updated":"2026-08-13T15:01:03Z","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T13:30:55.685027Z"},"links":{"citing_paper":"/paper/2608.13333"},"observation_digest":"sha256:37300d378c8d6a054bfa1f110372a25d84894dfc44c70f843cc4d074c09db496","observation_id":"c952cd8b-fa56-4a77-8f50-2811f004cf94","resolution":{"observed_at":"2026-08-14T13:30:56.326480Z","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":"2608.13333","last_updated":"2026-08-13T15:01:03Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T03:18:09.550016Z","submitted_at":"2026-08-13T15:01:03Z","title":"LLM-Guided Graph Generation for Structure-Based Local Improvement Methods"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":11,"verified_fuzzy":3},"total_outbound_references":25},"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 15 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.13333."}