{"as_of":"2026-08-08T07:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:104fbd62863376470da627d38dc5bc3b6d57d8beb0f44912dfc2e74b20f8bcae","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:18:10.990898Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2607.17708/citation-record","integrity":"/paper/2607.17708/integrity","json":"/paper/2607.17708/citation-record.json","paper":"/paper/2607.17708"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:18:10.905490Z","title":"We evaluate intervals of250,500, and750epochs on 50-node multi-task VRPs using the same LaT-POMO-MTL backbone, training configuration, and evaluation protocol","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.905490Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:93ab0658449ff5bf4a70827fcbd9e61c0568d192761197a54f3b4118791d9626","observation_id":"e9a4681a-71f2-4563-924b-fab34d602d77","resolution":{"observed_at":"2026-08-01T17:18:10.905490Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12214","last_updated":"2024-12-15T09:20:31Z","snapshot_observed_at":"2026-08-07T23:50:09.552455Z","submitted_at":"2024-08-22T08:42:44Z","title":"Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12214","snapshot_observed_at":"2026-08-01T17:18:09.501483Z","title":"Unco: Towards unifying neural combina- torial optimization through large language model.arXiv preprint arXiv:2408.12214,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.501483Z"},"links":{"cited_paper":"/paper/2408.12214","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:e31f66fa1626b047f02d25b2004ef73556aae364b81cd9849f8e91a21b56c669","observation_id":"39d5095d-bc73-48d2-8154-90093ed32f2d","resolution":{"observed_at":"2026-08-01T17:18:09.501483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","snapshot_observed_at":"2026-08-06T10:54:26.264740Z","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-01T17:18:09.677845Z","title":"Joshi, Thomas Laurent, and Xavier Bresson","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.677845Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:c3475fb275401af6bf0556a88d105a42ca662e9939c7e6c1ba979b559891067c","observation_id":"6d4dfcbe-e0da-494f-be00-41dd948d1f3e","resolution":{"observed_at":"2026-08-01T17:18:09.677845Z","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-01T17:18:09.929618Z","title":"Multi-task learning for routing problem with cross-problem zero-shot generalization","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.929618Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:603d441206c79cc21b85bd3a78931cb170856bf5a02fec6510d9c9db8336d77a","observation_id":"0867b3c3-20f2-44ae-9608-ea6f687cb4ee","resolution":{"observed_at":"2026-08-01T17:18:09.929618Z","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-01T17:18:10.492221Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.492221Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:cff2edf6025286ca00dab0282f7c2f44f2e9336b560e7b197cd7a7abe97ec007","observation_id":"30dc808d-9656-4431-bee4-025dd39d4f47","resolution":{"observed_at":"2026-08-01T17:18:10.492221Z","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-01T17:18:10.766310Z","title":"LaT retains the backbone operations described below and adds a lightweight side branch to the outputh ℓ i of each encoder layer","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.766310Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:5f2478780febe6a18858314cfff49ebdb8af4e56b758d83ad9de3cdb0233f794","observation_id":"e00760ae-618d-43db-896c-1f53fe810244","resolution":{"observed_at":"2026-08-01T17:18:10.766310Z","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-01T17:18:10.990898Z","title":"The best results are shown in bold","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.990898Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:eac30c6952d4fab2778c615a342a7877ce6732d8303e2ffd13266792954db77f","observation_id":"f57ad188-7d83-4299-8c36-3cd388b6a734","resolution":{"observed_at":"2026-08-01T17:18:10.990898Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.02999","last_updated":"2018-10-22T16:11:14Z","snapshot_observed_at":"2026-08-05T12:53:31.632675Z","submitted_at":"2018-03-08T08:29:38Z","title":"On First-Order Meta-Learning Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.02999","snapshot_observed_at":"2026-08-01T17:18:10.035556Z","title":"On first-order meta-learning algorithms.arXiv preprint arXiv:1803.02999,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.035556Z"},"links":{"cited_paper":"/paper/1803.02999","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:baaa0644ba4c0b4219020914349af55b2625371c097f093e26b0d5159e99f2ca","observation_id":"08bf70f7-c4a4-49af-8a76-91565f829149","resolution":{"observed_at":"2026-08-01T17:18:10.035556Z","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-01T17:18:09.824448Z","title":"Konstantakopoulos, Sotiris P","venue":null,"work_id":null,"year":2033},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.824448Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:af7a75401af16a4b0f31262c06aef62765ec9c9e88dcc88a467d3bc815f2b4c7","observation_id":"dba84b00-3612-42c5-aafd-2393ae889cad","resolution":{"observed_at":"2026-08-01T17:18:09.824448Z","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-01T17:18:10.172654Z","title":"Large language models as optimizers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.172654Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:e92d7f4469d9d5e06c0ec9f4bdd58e74145521f81abf124fe3577b6502e33a7b","observation_id":"8bb19405-778e-4cf1-98f3-b8d410e9a99d","resolution":{"observed_at":"2026-08-01T17:18:10.172654Z","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-01T17:18:09.299755Z","title":"Neural large neighborhood search for the capacitated vehicle routing problem","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.299755Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:ee6c975326e0abd36b006a2a4201f2cb9833cd725e558550111039f233a7de14","observation_id":"b7b242d8-17c6-43cd-827b-2212ecd85a43","resolution":{"observed_at":"2026-08-01T17:18:09.299755Z","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-01T17:18:09.196142Z","title":"Aligning llms with graph neural solvers for combinatorial optimization.arXiv preprint arXiv:2603.27169,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.196142Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:f859becd42ceb7bf47560f62be49e30a166ab2359d67c8711adc9af679e79627","observation_id":"693175d1-7662-460d-ab8e-9dc3e5441031","resolution":{"observed_at":"2026-08-01T17:18:09.196142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09100","last_updated":"2020-06-16T12:08:10Z","snapshot_observed_at":"2026-08-05T03:29:01.983924Z","submitted_at":"2020-06-16T12:08:10Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09100","snapshot_observed_at":"2026-08-01T17:18:09.121874Z","title":"Falkner and Lars Schmidt-Thieme","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.121874Z"},"links":{"cited_paper":"/paper/2006.09100","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:d3e2c8d4c26b9d78aee0aaefda79fd7ea917ee5b4e6fcd983ebdd170c444ee80","observation_id":"41d0f356-214f-4d41-a161-f9fc718f41e3","resolution":{"observed_at":"2026-08-01T17:18:09.121874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06290","last_updated":"2025-05-07T12:39:33Z","snapshot_observed_at":"2026-08-07T15:49:09.900762Z","submitted_at":"2025-05-07T12:39:33Z","title":"UniCO: Towards a Unified Model for Combinatorial Optimization Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06290","snapshot_observed_at":"2026-08-01T17:18:10.335307Z","title":"Unico: Towards a unified model for combinatorial optimization problems.arXiv preprint arXiv:2505.06290,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.335307Z"},"links":{"cited_paper":"/paper/2505.06290","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:3e2fd1afe9eea950d24795445e1169cc18feeacaa6ca271367c436c18fbc3f36","observation_id":"b715863e-6b27-4f1b-937e-ec63c3a52819","resolution":{"observed_at":"2026-08-01T17:18:10.335307Z","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-01T17:18:10.608789Z","title":"Its variation should therefore not be interpreted as a decision made by the LLM","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":4501,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:10.608789Z"},"links":{"citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:8ad5161d976f5977ac799145116a0cbf71d466041828bc0aa7be492849f46b4b","observation_id":"1a4f40f4-c994-4a3c-970a-ad3dad13af40","resolution":{"observed_at":"2026-08-01T17:18:10.608789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":15},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.17708."}