{"as_of":"2026-08-10T01:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c3966a16e24b95a3a70486318038fd707f7ff5cac78ae93ead85af03b2618eb","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:20:47.802679Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2507.03300/citation-record","integrity":"/paper/2507.03300/integrity","json":"/paper/2507.03300/citation-record.json","paper":"/paper/2507.03300"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.05405","last_updated":"2024-04-08T11:11:31Z","snapshot_observed_at":"2026-08-05T03:30:28.158531Z","submitted_at":"2024-04-08T11:11:31Z","title":"Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05405","snapshot_observed_at":"2026-08-06T20:20:40.991429Z","title":"Physics of language models: Part 3.3, knowledge capacity scaling laws","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:40.991429Z"},"links":{"cited_paper":"/paper/2404.05405","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:af6f04680fe7ec6ffc5e9947757507506b284f53bd672b9714501c024e58cd0d","observation_id":"12765b3c-a70b-4027-b554-92f4ff607306","resolution":{"observed_at":"2026-08-06T20:20:40.991429Z","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-06T20:20:41.057267Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.057267Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:891d0fec88da662b26c8b052c65ab37c9a0d8689da07fc6412fb847eef62d648","observation_id":"50a7c496-fa4b-4e43-808f-2fb4fffc505a","resolution":{"observed_at":"2026-08-06T20:20:41.057267Z","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-06T20:20:54.947440Z","title":"Routefinder: Towards foundation models for vehicle routing problems","venue":null,"work_id":"5ad5f5b1-f5fa-4e8f-8325-5f7bf0075500","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.199733Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:11b082d6afbc8fc766738fa9b8026ae786e857e776ca32d7ec25335f68b925ee","observation_id":"60e08898-587f-46bb-9f4c-84fae9d81d3b","resolution":{"observed_at":"2026-08-06T20:20:55.007102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:54.797279Z","title":"Learning generalizable models for vehicle routing problems via knowledge distillation","venue":null,"work_id":"1e8848ec-859d-4873-ad8f-ad8373b79d0f","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.324907Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:ede32bf6a8722b3c0cc13cfa70de87f567d85a09a8c3f55ccac3a53a87b6b07f","observation_id":"094944b8-4cdf-4f93-b3df-e7204188007f","resolution":{"observed_at":"2026-08-06T20:20:54.859838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:54.671152Z","title":"Towards deeper deep reinforcement learning with spectral normalization","venue":null,"work_id":"f8201861-4b6b-45e8-8339-882e0c4660a0","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.444380Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:72665656d653fd34bd48164cb2de29a375494d61b5cf7bec6b5f6e085ef947eb","observation_id":"4e6c04e0-40ad-4900-ae72-886b80f1eb05","resolution":{"observed_at":"2026-08-06T20:20:54.715694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:54.543032Z","title":"Machine learning to solve vehicle routing problems: A survey","venue":null,"work_id":"99f955c9-82f4-4d59-9efb-12bb34ad97f9","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.590993Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:bcea5cd530870193fb1a9848ac7a19be2eaf16eb21e1a602e728806419caa500","observation_id":"a61da1e9-ce77-4cf4-a061-9b0213a54e49","resolution":{"observed_at":"2026-08-06T20:20:54.598024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:41.734370Z","title":"Evolving diverse tsp instances by means of novel and creative mutation operators","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.734370Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:df9162c226adbbb3db588ff7b21bdb4f86e4657bea6826ba66ec5ae29303bfb9","observation_id":"3fb6a591-8cac-4b47-9d0c-ceafdd9c50b7","resolution":{"observed_at":"2026-08-06T20:20:41.734370Z","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-06T20:20:41.875882Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:41.875882Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:398f811dd40650ab73938333a88140f198d0bf3310e8934270cedc7dd464dcc3","observation_id":"56191433-4964-4bc7-a685-411a2d3790ba","resolution":{"observed_at":"2026-08-06T20:20:41.875882Z","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-06T20:20:54.358322Z","title":"Combining reinforcement learning and constraint programming for combinatorial optimization","venue":null,"work_id":"30d79df9-4215-4bf8-b187-c73db748cafa","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.022612Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:8b7716226b269a37ed1791702f09b08fdd89b32015e8ac5e15be3b74f14df4f7","observation_id":"82f8ede9-c344-4544-9e3d-e7b08b488607","resolution":{"observed_at":"2026-08-06T20:20:54.437468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-06T20:20:42.154684Z","title":"Flashattention-2: Faster attention with better parallelism and work partitioning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.154684Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:11475f44cef75f5a7b887d4cad66cb8e2871709ec88563efac2388925a3f27dd","observation_id":"5e8289b8-a77b-407d-a9d2-37d15661ab4e","resolution":{"observed_at":"2026-08-06T20:20:42.154684Z","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-06T20:20:54.160376Z","title":"The case for 4-bit precision: k-bit inference scaling laws","venue":null,"work_id":"72db0ab5-2de8-43ca-abff-1f6edc240a5a","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.301257Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:bf505825b7b25a9fa48a5ce9789bd8add0076f3c50ec4714832cbb6875ec38f1","observation_id":"d3c02aa2-d2ab-4976-983d-59f5ae096db5","resolution":{"observed_at":"2026-08-06T20:20:54.231206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-06T20:20:42.435294Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.435294Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:1541b1e36a8837d54f1e0ae9f16a4d9088f36dcca2168a6132ccc782027212c4","observation_id":"2490eabc-9adf-490e-9126-a04667f6c866","resolution":{"observed_at":"2026-08-06T20:20:42.435294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08539","last_updated":"2020-02-20T02:39:02Z","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-20T02:39:02Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","version":1},"cited_work":{"arxiv_id":"2002.08539","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.08539","snapshot_observed_at":"2026-08-06T20:20:48.233889Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","venue":"cs.NE","work_id":"df5e0872-5e44-41d3-8105-28f6735584c9","year":2020},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.568961Z"},"links":{"cited_paper":"/paper/2002.08539","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:e1eb8a57be99497ebb50ea78cb92abe7ed3e2bcd268ce296bf5e98f041f791e3","observation_id":"baed7630-f33b-4232-8c02-c391425b8961","resolution":{"observed_at":"2026-08-06T20:20:48.277923Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:53.990002Z","title":"Generalization of neural combinatorial solvers through the lens of adversarial robustness","venue":null,"work_id":"bf4989d0-e431-445a-a131-9b724734ec24","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.712563Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b1f47e4172448a47efa2b22b0c5bba4d05ddca45dd1f97e11be70cb42a691d23","observation_id":"9252f4e0-1b55-4890-88e2-feadb43770c4","resolution":{"observed_at":"2026-08-06T20:20:54.069415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:53.809862Z","title":"Data and parameter scaling laws for neural machine translation","venue":null,"work_id":"a82665e3-82b2-4d40-a685-1d72991a9793","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.881179Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:06c4590ea96e0dfbe0b95d41b1275a46892503b534e5d8b772bb2789919bcf53","observation_id":"373b96f3-f5c5-4a59-ba24-9e95a4889d25","resolution":{"observed_at":"2026-08-06T20:20:53.893342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01293","last_updated":"2021-02-02T04:07:38Z","snapshot_observed_at":"2026-08-01T22:46:19.170916Z","submitted_at":"2021-02-02T04:07:38Z","title":"Scaling Laws for Transfer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.01293","snapshot_observed_at":"2026-08-06T20:20:43.003697Z","title":"Scaling laws for transfer","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.003697Z"},"links":{"cited_paper":"/paper/2102.01293","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b75eae5fc126d438fd6c77e7fda66f28490a01b55323f60d5f48bab0650ac302","observation_id":"effe07a5-6938-4881-bdae-b0e9d7c6d261","resolution":{"observed_at":"2026-08-06T20:20:43.003697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-08-09T19:52:33.533277Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-06T20:20:43.173249Z","title":"Training compute-optimal large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.173249Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:9cda84c2622876ff5cfd4c4fc73211e9870445be30a97806a1f12b1f58f33908","observation_id":"b5c186fe-a9cc-481e-b1db-f18bd75369b0","resolution":{"observed_at":"2026-08-06T20:20:43.173249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10989","last_updated":"2025-01-24T00:14:55Z","snapshot_observed_at":"2026-07-06T19:33:26.078722Z","submitted_at":"2024-10-14T18:17:01Z","title":"Liger Kernel: Efficient Triton Kernels for LLM Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10989","snapshot_observed_at":"2026-08-06T20:20:43.285732Z","title":"Liger kernel: Efficient triton kernels for llm training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.285732Z"},"links":{"cited_paper":"/paper/2410.10989","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:60e7ca792a1ade8bfffbe9274ceed126c64035ae45a8342050d453d79f3761a8","observation_id":"2b0c78f3-aa11-4ebd-a459-c7f7bb0faca0","resolution":{"observed_at":"2026-08-06T20:20:43.285732Z","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-06T20:20:53.610710Z","title":"Learning to solve routing problems via distributionally robust optimization","venue":null,"work_id":"ea35c7c0-e4c4-4329-8dfe-30f56d3a24e7","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.532765Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:368fac271e060cd8f9bb981fcf397bda9b394081cdbc1d6e8207238970a5e0d5","observation_id":"0b556422-2c38-4d61-bbf1-1315036ed7d2","resolution":{"observed_at":"2026-08-06T20:20:53.686026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-06T20:20:43.656180Z","title":"Scaling laws for neural language models","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.656180Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:3349216cf5645fee27518d40f16b99f029c9e098f0061edb6ee52be555036c24","observation_id":"e185c1a4-3882-47a2-9da5-3bb56221f846","resolution":{"observed_at":"2026-08-06T20:20:43.656180Z","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-06T20:20:53.433025Z","title":"Learning collaborative policies to solve np-hard routing problems","venue":null,"work_id":"c7c6d4d7-2a4d-4482-92f5-b05733a91e04","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.754269Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:73d21e9232d15dd59435cb7d67ab3a68f43389c269b87cfdf6507dd080c15bb1","observation_id":"3ad60c5d-7334-4b9c-a959-8b2644bccfc2","resolution":{"observed_at":"2026-08-06T20:20:53.521500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:53.276920Z","title":"Sym-nco: Leveraging symmetricity for neural combinatorial optimization","venue":null,"work_id":"fc815c0c-a5cc-42d9-9311-b67601dab51b","year":1936},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.819196Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b2976d9ea265389d9ec1058818e118a7fb8fb7bae9ef56b625eefeea6f094963","observation_id":"f544f3bc-34f3-4096-ac99-c43f0a13a6a1","resolution":{"observed_at":"2026-08-06T20:20:53.339492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:43.919874Z","title":"Attention, learn to solve routing problems! In International Conference on Learning Representations, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:43.919874Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:6e8e68084d7a1d74216879745d1fffd024d5ac1a7cf98a803b7de7462ec7c861","observation_id":"50f238c7-24f0-42c2-8e99-b02187ee00f0","resolution":{"observed_at":"2026-08-06T20:20:43.919874Z","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-06T20:20:53.081975Z","title":"Deep policy dynamic programming for vehicle routing problems","venue":null,"work_id":"7ceda02b-3fb8-423c-b78c-961821769c76","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.032541Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:82888e609da8e0e906e452424814a135339491b1aa3a4cd1e144860c9537136e","observation_id":"41234771-a171-483f-b593-37daeb041ea2","resolution":{"observed_at":"2026-08-06T20:20:53.169030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04330","last_updated":"2024-11-30T02:42:31Z","snapshot_observed_at":"2026-08-04T07:47:22.112536Z","submitted_at":"2024-11-07T00:10:10Z","title":"Scaling Laws for Precision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04330","snapshot_observed_at":"2026-08-06T20:20:44.174979Z","title":"Scaling laws for precision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.174979Z"},"links":{"cited_paper":"/paper/2411.04330","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:08ac965c940b08413af072ac99ddd1b5e86a530b30c2de6b7cdf7ae4e96283f0","observation_id":"896b51bb-cf59-40a2-ac90-ec1d324084a8","resolution":{"observed_at":"2026-08-06T20:20:44.174979Z","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-06T20:20:52.949086Z","title":"Pomo: Policy optimization with multiple optima for reinforcement learning","venue":null,"work_id":"c511f79c-b047-4b6f-aec6-6542b4c5d3cd","year":2020},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.343313Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:f946e87d40cfc4a147d6218339037ec8d1d471e1350904a7024c30db7c18cca0","observation_id":"0807e4b7-810b-4f5b-a95d-57ea27a51505","resolution":{"observed_at":"2026-08-06T20:20:53.017307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:52.785711Z","title":"An inverse scaling law for clip training","venue":null,"work_id":"5d18a716-e0e3-4420-87fe-fdb627d5ac30","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.529668Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:6c76dc356e3d163f7b3dbc116facd2fedf6baaec13142e67ca5898bbe664368b","observation_id":"6b08b9fe-6c85-4f06-819c-f4968e478821","resolution":{"observed_at":"2026-08-06T20:20:52.870064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:52.590486Z","title":"Cross-problem learning for solving vehicle routing problems","venue":null,"work_id":"ccb3b9be-172b-4c1d-ad96-04c3389d05e5","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.665256Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:140ec1cc40191133b2b6f507ce76d2df14eec2d0b487190147ce7d456ad2cee6","observation_id":"2faa44fd-c46b-4a19-99f4-9a6f33b1cf3b","resolution":{"observed_at":"2026-08-06T20:20:52.710938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:52.400393Z","title":"Why spectral normalization stabilizes gans: Analysis and improvements","venue":null,"work_id":"358ba957-6778-4a34-a373-fecb8b5724c9","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.796756Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:ae5c0f9e76a4fbeeff17111a410a9ca1f1765f2c090f9fd1faeb5404d3e95fb3","observation_id":"983617a7-aa77-4d88-a8c7-48e0570a85d6","resolution":{"observed_at":"2026-08-06T20:20:52.485638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:52.154483Z","title":"Multi- task learning for routing problem with cross-problem zero-shot generalization","venue":null,"work_id":"11994a29-a233-4c28-9103-6214b90f2bc1","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:44.924790Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b62c98144192055150922626956371166d664f1fb4bd0588bdadc1cbf1c0f9ee","observation_id":"5132edd0-00a2-437b-b404-3ce110e5cfde","resolution":{"observed_at":"2026-08-06T20:20:52.276330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:51.826150Z","title":"Neural combinatorial optimization with heavy decoder: Toward large scale generalization","venue":null,"work_id":"93d9851a-4c73-44e7-81cb-0986ab03454b","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.056685Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b33ac4a3ecd01a4de8614df642d2385e10b05603ed37ad164da1e7317515f3d9","observation_id":"8acc19b4-d2ea-448f-96b6-a9b210643578","resolution":{"observed_at":"2026-08-06T20:20:52.007940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.05957","last_updated":"2018-02-16T14:41:39Z","snapshot_observed_at":"2026-08-02T11:02:36.392878Z","submitted_at":"2018-02-16T14:41:39Z","title":"Spectral Normalization for Generative Adversarial Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.05957","snapshot_observed_at":"2026-08-06T20:20:45.217498Z","title":"Spectral normalization for generative adversarial networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.217498Z"},"links":{"cited_paper":"/paper/1802.05957","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:bff4f6203c3e67dd96802627e8b820bb1b4b49873c65586823a68efce17d4ffe","observation_id":"5fb4c41e-17d5-49d8-8596-8cc638d54446","resolution":{"observed_at":"2026-08-06T20:20:45.217498Z","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-06T20:20:51.566671Z","title":"A deep reinforcement learning algorithm using dynamic attention model for vehicle routing problems","venue":null,"work_id":"99ae0991-1685-4686-8287-d1ddec668b35","year":2019},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.405992Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:0794fc46cfd7af3b08a0247169fc02e7e73fd46245979183efe3940fb7e3af33","observation_id":"7f4f27cc-0345-476a-bacc-71ad54f9964d","resolution":{"observed_at":"2026-08-06T20:20:51.686201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:45.568639Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.568639Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:19bc4605759f11509f897d947e080bc8aa00d5cf8c9228d94c8871fa095c0ecd","observation_id":"d6a30581-04cc-4090-966b-098af62fd1e9","resolution":{"observed_at":"2026-08-06T20:20:45.568639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.11446","last_updated":"2022-01-21T18:39:38Z","snapshot_observed_at":"2026-08-09T14:52:01.161814Z","submitted_at":"2021-12-08T19:41:47Z","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.11446","snapshot_observed_at":"2026-08-06T20:20:45.648809Z","title":"Scaling language models: Methods, analysis & insights from training gopher","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.648809Z"},"links":{"cited_paper":"/paper/2112.11446","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:5530228aa592a98b82df811f4722670d14ba709b1bba33c7f168d94622c30e54","observation_id":"ee85b70f-96ab-4274-af2f-f04100867211","resolution":{"observed_at":"2026-08-06T20:20:45.648809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05202","last_updated":"2020-02-12T19:57:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-12T19:57:13Z","title":"GLU Variants Improve Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05202","snapshot_observed_at":"2026-08-06T20:20:45.730918Z","title":"Glu variants improve transformer","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.730918Z"},"links":{"cited_paper":"/paper/2002.05202","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:a9d74e5a1df6df7c9d103d0505cce83c00ef4546af2cd52e39ec708666ab8a1b","observation_id":"8bea5e76-6dd2-4aa3-856b-ab375ea9af5f","resolution":{"observed_at":"2026-08-06T20:20:45.730918Z","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-06T20:20:45.805667Z","title":"Adafactor: Adaptive learning rates with sublinear memory cost","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.805667Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:2c4e780f24f06d89438f2cda260e6386c0474234d8a82fbcc15a24a1de623247","observation_id":"126e2c8e-ae27-4e5a-ae17-edeed347ecf1","resolution":{"observed_at":"2026-08-06T20:20:45.805667Z","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-06T20:20:51.421074Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","venue":null,"work_id":"98608863-26c1-4a81-b164-74a910678cdc","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.880987Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:96bd81d08faa9d30b00efa4a056d99c89e67dabdb967b423b83d32eae5ae17b2","observation_id":"f6101f01-bbca-4ad0-be9a-9aed6a6dcc56","resolution":{"observed_at":"2026-08-06T20:20:51.474855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:51.274029Z","title":"Learning heuristic selection using a time delay neural network for open vehicle routing","venue":null,"work_id":"35aa4c7d-1e6b-4e16-a521-eb8acb15f54e","year":2017},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:45.943289Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:ac96e76192aad7d1a958a521e4e480ea0c8a417232faf76d4a7285485a71abed","observation_id":"7f869424-b45f-4215-9189-0b62a2bc001e","resolution":{"observed_at":"2026-08-06T20:20:51.325134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:46.013627Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.013627Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b85dbc3ac34f0046cb4501f6dcb5f7cd8d30a80530ec67df228da193ce097628","observation_id":"7306cc45-c1d5-425f-8c30-1019325a7ee1","resolution":{"observed_at":"2026-08-06T20:20:46.013627Z","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-06T20:20:46.097061Z","title":"Hybrid genetic search for the cvrp: Open-source implementation and swap* neighborhood","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.097061Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:c51f508de02eacd7e103b7582fc09481b5f2da10b60a7babd6509405e790293d","observation_id":"442a1ce5-78d6-4c73-b752-f53dad14f77c","resolution":{"observed_at":"2026-08-06T20:20:46.097061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06361","last_updated":"2025-05-25T14:09:07Z","snapshot_observed_at":"2026-07-06T15:25:43.815339Z","submitted_at":"2023-05-10T14:20:34Z","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","version":5},"cited_work":{"arxiv_id":"2305.06361","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.06361","snapshot_observed_at":"2026-08-06T20:20:47.957783Z","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","venue":"cs.LG","work_id":"818a23cb-c6f5-44d1-9219-c3689bdc52e0","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.180272Z"},"links":{"cited_paper":"/paper/2305.06361","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:35f60ce7fcae5c538547a7b8f29a95fba5b452d2e8729a60e064b5eba797876d","observation_id":"02f62262-5b18-434c-8cb1-083e7c0da726","resolution":{"observed_at":"2026-08-06T20:20:48.039138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:51.051942Z","title":"A game-theoretic approach for improving generalization ability of tsp solvers","venue":null,"work_id":"9a2bdc80-7384-4e7d-aad4-7322bd807469","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.259271Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:ba8c97c0c728307abf702b8ee8fbeb5e1e9e7676ecd11d6b10f856d943f0ee74","observation_id":"0e2b1f76-883f-42b8-9ddc-6cd74f785bf8","resolution":{"observed_at":"2026-08-06T20:20:51.153387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:50.868024Z","title":"Simple statistical gradient-following algorithms for connectionist reinforce- ment learning","venue":null,"work_id":"925de0a8-ffe9-4ccb-aeec-874c0243bc80","year":1992},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.342460Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:e3b9f23ebc6e4aa557a68456957d090feef62fb4595116ea490662da700eb79f","observation_id":"f9cbff85-31a5-4ed0-aa74-7b14af90c2a2","resolution":{"observed_at":"2026-08-06T20:20:50.950846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:50.686681Z","title":"Pyvrp: A high-performance vrp solver package","venue":null,"work_id":"805a6cfb-ab5f-4edd-8696-85f9854bfc91","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.404185Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:51222aaaac2afaff0911b89aeb45ab4e4f0151b3bb2fa39c1279a5d7d824c407","observation_id":"13839bab-7c08-4fea-a651-a64f5ff798c1","resolution":{"observed_at":"2026-08-06T20:20:50.772288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:50.505732Z","title":"Multi-decoder attention model with embedding glimpse for solving vehicle routing problems","venue":null,"work_id":"166de351-61d1-48d8-8148-e270905d37a4","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.461992Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:71850e18f9412da2dff238046dd2f88bf3b1376bcb01b8a25f628120440ee09c","observation_id":"e786fd79-49d5-48c0-a365-fa1fd0512848","resolution":{"observed_at":"2026-08-06T20:20:50.583710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:50.300775Z","title":"Generative adversarial training for neural combinatorial optimization models, 2022","venue":null,"work_id":"2622c08a-7054-46a8-a521-c5f6c4e52e83","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.532782Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:194281d7141368bc50c3895c6c63219775224d42387fa483c4a22b504a8c2f0b","observation_id":"1b6b29c3-be17-4919-be9c-7618a47e7ad4","resolution":{"observed_at":"2026-08-06T20:20:50.380292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.10941","last_updated":"2017-05-31T04:56:25Z","snapshot_observed_at":"2026-08-05T12:22:57.956907Z","submitted_at":"2017-05-31T04:56:25Z","title":"Spectral Norm Regularization for Improving the Generalizability of Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.10941","snapshot_observed_at":"2026-08-06T20:20:46.587902Z","title":"Spectral norm regularization for improving the generaliz- ability of deep learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.587902Z"},"links":{"cited_paper":"/paper/1705.10941","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b04ba3262256726b038ac853e594ea8ba38296ea442d4aeaa595f8143170c749","observation_id":"f24aa1a8-ed14-4a36-942b-1e0cd82580e8","resolution":{"observed_at":"2026-08-06T20:20:46.587902Z","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-06T20:20:50.139370Z","title":"Stabilizing transformer training by preventing attention entropy collapse","venue":null,"work_id":"972205f4-8f88-48b5-839b-eafe2c46ba26","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.629116Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:ca2c87626833c1ea8b028d28f96fae1612ac8853d782b27e6a9cfaae60e6142f","observation_id":"98ec0f67-8510-4fa9-9ba2-463a8116c304","resolution":{"observed_at":"2026-08-06T20:20:50.230886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.964477Z","title":"Scaling vision transform- ers","venue":null,"work_id":"e173191d-5af3-4f83-a1d8-1882fe4fa6a9","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.706249Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:432818393bf4dd3b20b72ee1622645be6a6829530acb0bbccdc0dc744e17f709","observation_id":"b9a2f358-599e-45b6-a845-1c600dcaa499","resolution":{"observed_at":"2026-08-06T20:20:50.007407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:46.769827Z","title":"Root mean square layer normalization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.769827Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:95a91fb99022ea791148a089b75e408e359f99cc3093a409bd3ca3464c9a4dd9","observation_id":"be1ab63c-82c2-4e75-b7b1-8a3a5005cdac","resolution":{"observed_at":"2026-08-06T20:20:46.769827Z","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-06T20:20:49.781601Z","title":"Examining scaling and transfer of language model architectures for machine translation","venue":null,"work_id":"058d1919-9935-4acb-a7c9-23b7a97dfbe8","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.825239Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:d08b898d1a6de817333f2cd1f1ae8b0b426d3b0289212de4293f9adfaad09ccd","observation_id":"8b8b5bde-b092-49aa-ad97-875c61c9b1a5","resolution":{"observed_at":"2026-08-06T20:20:49.848687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.628322Z","title":"Learning to solve travelling salesman problem with hardness-adaptive curriculum","venue":null,"work_id":"066c22f5-100c-4d65-ad73-572199eb80ba","year":2022},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.890507Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:cbcf4bd20b98ba1598c9f37b8d88b0e28de8ace565c3831142b234ef6aa35ecd","observation_id":"df0147e5-1e09-4d36-9402-03911a0d4f4c","resolution":{"observed_at":"2026-08-06T20:20:49.709047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.463418Z","title":"A hybrid of deep reinforcement learning and local search for the vehicle routing problems","venue":null,"work_id":"f0413d5b-71ce-43b7-849b-23a56a168a4b","year":2021},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.955160Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:5429fd079f08f6209c6695cf893e05920e9a0594e51d1b7f5f0ea5bcc06aac3b","observation_id":"e0db2b90-c7ec-4ca7-9653-57d13d31d3e8","resolution":{"observed_at":"2026-08-06T20:20:49.534974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.345330Z","title":"Towards omni-generalizable neural methods for vehicle routing problems","venue":null,"work_id":"8f62f246-797b-4c08-8fa6-237d09eec474","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.037373Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:f6ba14f5d4152f9f2fa2f8e50bc55e565a4c33c271fdd093ebc656e16a277aa4","observation_id":"e253fd75-e374-4065-9e26-b9512182c690","resolution":{"observed_at":"2026-08-06T20:20:49.390413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.234284Z","title":"Mvmoe: Multi-task vehicle routing solver with mixture-of-experts","venue":null,"work_id":"bb5073cd-7251-43b8-b902-54eb24c6c92e","year":2024},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.140683Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:271ff09f1eeadf4abbbeda9fef8d5da406371718d064af179b5ff1260ab8f4d6","observation_id":"71621e68-700f-4421-a7cb-3e0e010fb1b7","resolution":{"observed_at":"2026-08-06T20:20:49.280090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.143556Z","title":"Scaling law for document neural machine translation","venue":null,"work_id":"c03713cd-d231-4c7b-8f32-106dfc9ed966","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.216437Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:b367ee120e4e5b4b9103c2dcf02f5833efab2b4eca9b4215d2d6da8a001db6c5","observation_id":"5d7f90f2-5337-4374-80f4-05b2e3148da1","resolution":{"observed_at":"2026-08-06T20:20:49.189321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:49.045966Z","title":"A customer must be served only once, and if the last visited node was the depot, the next move cannot immediately return to the depot (this prevents trivial loops)","venue":null,"work_id":"357ddf69-006d-4a0e-837e-eabbcc1b96ec","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.293680Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:d1545f1835fa7da46ef8652b2571ab53bf1ec12bff1d0c9665db4b4489404d30","observation_id":"1ee35cc2-5c3a-4b00-b8e0-cf42b370f5eb","resolution":{"observed_at":"2026-08-06T20:20:49.087681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:48.929963Z","title":"In problems without an open-route option, every tour segment must eventually return to the depot within both its time-window and distance limits","venue":null,"work_id":"54bf0927-7eb0-440a-aa97-f224e8d9919a","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.355262Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:7faa997f7d424fa34c5d5e12baf2e6345700c967b83ca484f933f0224db1f59d","observation_id":"e4ba39dc-bd2e-498f-8b53-9b97186ea7f1","resolution":{"observed_at":"2026-08-06T20:20:48.989388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:48.833542Z","title":"Whenever time windows apply, a customer cannot be chosen if the earliest possible arrival (plus service) would fall after its window closes","venue":null,"work_id":"a6adad3d-c109-493f-b06f-152d49352676","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.413134Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:465a09dcc024c0cf6419d17d4c4862038487e9a7f2e685a6f1c8a6d7641bc681","observation_id":"f4b26fdc-c843-4418-9845-0c8ebcbd8c80","resolution":{"observed_at":"2026-08-06T20:20:48.885332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:48.742494Z","title":"When backhaul visits are required, they are deferred until all linehaul services are completed","venue":null,"work_id":"31821e3f-9fb7-4f6f-b7f8-c035d26649c7","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.514229Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:e8fa7bc1af06b5569051fce08995d7c3ac940f09f872b66d5c84cd8feaebc069","observation_id":"26b73753-d222-432e-a743-0b6346fb26e6","resolution":{"observed_at":"2026-08-06T20:20:48.778661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:48.640933Z","title":"A node is only feasible if its demand can be loaded on the vehicle without exceeding the remaining capacity (for pickups) or the available backhaul capacity (for drop-offs)","venue":null,"work_id":"101c4110-5986-4cc8-afa0-50a439503ad2","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.616978Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:52ae81c1d2e94f10a480850b914cc1c0fa44efbbcf08fb93e682a3de73592ec2","observation_id":"072add1d-7ba6-43a3-8b23-4268b421fdf7","resolution":{"observed_at":"2026-08-06T20:20:48.694401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:48.526428Z","title":"Every node coordinate is drawn from the uniform distribution ⃗ xi ∼ U (0, 1)2","venue":null,"work_id":"67ae6356-50a7-4ab4-933b-e76f785b4712","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.710858Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:dceb59184123474758c893cf8fab61e7584470c3a25760b352ae1d4dd5cc0205","observation_id":"54dc88a8-cf16-4e52-b750-70c5146c9461","resolution":{"observed_at":"2026-08-06T20:20:48.576175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T20:20:48.404524Z","title":"This distribution is parameterized by the number of clusters m and a scale factor c","venue":null,"work_id":"c232058a-6fd9-4fce-9940-0d401316b7fe","year":null},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:47.802679Z"},"links":{"citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:8bc68cc9593d8bf9b890ab4198a54fc390d6746bd9f20260257497fdfa97538c","observation_id":"d8616544-2a37-49f8-96bd-856b28204b74","resolution":{"observed_at":"2026-08-06T20:20:48.466528Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T21:21:24.114593Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":2,"verified_fuzzy":40},"total_outbound_references":64},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2507.03300."}