{"as_of":"2026-08-10T03:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8576fcaf3476ce6b55e8e3199bd28df6dd0915c5df3c161bc770d8b7caa37fed","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:42:52.720686Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"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/2509.05084/citation-record","integrity":"/paper/2509.05084/integrity","json":"/paper/2509.05084/citation-record.json","paper":"/paper/2509.05084"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:53.892571Z","title":"Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding","venue":null,"work_id":"5423b197-8110-47f5-a517-1bf0daf4092d","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:50.722883Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:e3a3983de2113a27b6917ac3be13f6d578f88194a9094724daaa740cf5ac5bb3","observation_id":"cafb97b0-e616-4c44-af34-8decbc32ebbd","resolution":{"observed_at":"2026-08-05T05:42:53.897319Z","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-05T05:42:53.876758Z","title":null,"venue":null,"work_id":"89995238-456a-4eec-bc17-69f202f7d039","year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:50.800204Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:29f1566510c90aeedfeabc8f790e00c345c9dc51a69bfe3e5e0b225e2d95a277","observation_id":"10a77ffc-4646-429c-b408-f566e7670408","resolution":{"observed_at":"2026-08-05T05:42:53.882208Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T05:42:53.862000Z","title":null,"venue":null,"work_id":"e445408e-f88a-48c7-a8b5-8a8957b5d9d8","year":1935},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:50.881376Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:a85818d1d5b5e6d45cb71f47db07b41434c09faeab4a22fda36e139e75681072","observation_id":"475516a6-d429-45cf-9d55-181860d99e0c","resolution":{"observed_at":"2026-08-05T05:42:53.866565Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T05:42:53.846639Z","title":"RL4CO: An Extensive Reinforcement Learning for Combinatorial Optimization Benchmark, June 2024","venue":null,"work_id":"9969d1ae-eb51-4e16-bed1-62c2f604cbe0","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:50.965020Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:7366d92b5cb6fbd31697ed96049284c19e7562b66b59a5e2ce95fadff1dbbb47","observation_id":"e4306a27-feed-461d-8ac5-02e3905f2998","resolution":{"observed_at":"2026-08-05T05:42:53.851252Z","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":"10.48550/arxiv.2406.15007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:52.962684Z","title":"Wouda, Leon Lan, Kevin Tierney, and Jinkyoo Park","venue":null,"work_id":"4bda93b5-1f7d-45bb-b4c9-efeaacb66903","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.034301Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:0a0134678354f3b5a6afea571b2629b280f7cc9d3734c1fafb8702aa62e334c5","observation_id":"4ea0d311-3e69-4ebb-b67e-f865b7200e90","resolution":{"observed_at":"2026-08-05T05:42:52.967386Z","resolver_source":"doi","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":{"arxiv_id":"2302.01318","last_updated":"2023-02-02T18:44:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-02T18:44:11Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01318","snapshot_observed_at":"2026-08-05T05:42:51.113776Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling.CoRR, abs/2302.01318, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.113776Z"},"links":{"cited_paper":"/paper/2302.01318","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:3892f947ff779de77545380673a5c34722573501f6cc5e31688546d69426c9b9","observation_id":"768dbb1c-1dad-4ebd-9ed4-61f4beb9c189","resolution":{"observed_at":"2026-08-05T05:42:51.113776Z","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-05T05:42:53.831638Z","title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","venue":null,"work_id":"d8fae255-6ad1-469c-9b07-d6cdfd0cb12b","year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.285668Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:9802cde062ef60efa6ecefc0bebce2cf38836caeaefc1101948d0970c2a285b5","observation_id":"c738d972-1b68-4af6-b054-90c5febf6126","resolution":{"observed_at":"2026-08-05T05:42:53.835970Z","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-05T05:42:53.817391Z","title":"Simulation-guided Beam Search for Neural Combinatorial Optimization","venue":null,"work_id":"1f011845-5056-4323-81e0-9183cc0238b9","year":2022},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.387960Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:ee40e117957d31d43b0e3b6fbe31b5bd99203224960871253ac09d26542b1936","observation_id":"2762eeb6-3f2b-4373-b7d4-7b0f4d18a4ee","resolution":{"observed_at":"2026-08-05T05:42:53.821992Z","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-05T05:42:53.801921Z","title":"Applegate, Robert E","venue":null,"work_id":"b3493290-d0ed-4c84-ad2e-fee8ae7a4793","year":2003},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.523028Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:fdcebff4f9efa45731a2c8054ac8728e2e942f73df83eea049655a5b7985630b","observation_id":"acee56b8-ea32-4acf-9b81-333c5f0905ae","resolution":{"observed_at":"2026-08-05T05:42:53.806171Z","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-05T05:42:53.786139Z","title":"The Road Less Scheduled","venue":null,"work_id":"e9a20d77-1252-471a-b1d1-27a90d400608","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.690105Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:823eca3bb2d29d09a335be29594e5cf0b1e9559bd24ed9fbcd4432ee9a172a35","observation_id":"becf474e-ce91-4f2e-8ba3-b829f40e0734","resolution":{"observed_at":"2026-08-05T05:42:53.790772Z","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-05T05:42:53.768785Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","venue":null,"work_id":"0ae2e83f-3a9e-4656-91da-005c2e0fb6ee","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.790699Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:fc7b90a1c0cd419c03a63f783cb7ca1b4e822743b2c3d2060a65ee4ad8263f5d","observation_id":"cb1bd0af-e6f2-4216-bc4d-5237bda02b49","resolution":{"observed_at":"2026-08-05T05:42:53.773648Z","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-05T05:42:53.753414Z","title":"GOAL: A Generalist Combinato- rial Optimization Agent Learner","venue":null,"work_id":"85b64847-18b6-46e5-a2b8-9c6c7e4eafb9","year":2025},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:51.941437Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:c9cf22b476c9d21ef116054e068252580239ef43e9ca98a6db7ac567c4ad3fc3","observation_id":"d3c44595-4adc-4a81-a8da-ae38477c86f5","resolution":{"observed_at":"2026-08-05T05:42:53.757964Z","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":"2006.09100","last_updated":"2020-06-16T12:08:10Z","snapshot_observed_at":"2026-08-09T14:12:18.650441Z","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":"2006.09100","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.09100","snapshot_observed_at":"2026-08-05T05:42:53.298118Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","venue":"cs.LG","work_id":"04f8cad7-4f88-4ebc-9138-76e351c8a9b8","year":2020},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.114995Z"},"links":{"cited_paper":"/paper/2006.09100","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:a03839d65aa39608f2a8c3ff856453c9c07121497dec95237753c63d367e64a4","observation_id":"1d643fd6-af5f-477c-b7ee-2292b59103ed","resolution":{"observed_at":"2026-08-05T05:42:53.303649Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2309.17089","last_updated":"2023-09-29T09:36:37Z","snapshot_observed_at":"2026-08-08T22:40:32.511928Z","submitted_at":"2023-09-29T09:36:37Z","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","version":1},"cited_work":{"arxiv_id":"2309.17089","doi":"10.48550/arxiv.2309.17089","metadata_source":"pith","pith_arxiv_id":"2309.17089","snapshot_observed_at":"2026-08-05T06:16:20.379382Z","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","venue":"cs.LG","work_id":"ea53e037-f1e1-4817-938a-c9046c405572","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.211950Z"},"links":{"cited_paper":"/paper/2309.17089","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:4c7b2cfa1b3dcc3ad1220687fe26b7a9b51cf83d3d54cdf3accbc2aa2b3bcfad","observation_id":"8d1fc078-e815-4b22-9f2a-772c29375a32","resolution":{"observed_at":"2026-08-05T05:42:52.851199Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"10.1007/978-3-031-26419-1_22","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"Falkner, Daniela Thyssens, Ahmad Bdeir, and Lars Schmidt-Thieme","venue":"Lecture notes in computer science","work_id":"24e48218-3ca4-4b2e-97d7-b8c4bd285abe","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.367514Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:b867dbdeaf0db412e35d1f57bfe9acfc4211ff3f87195ff337f378bb9384a4e9","observation_id":"8f2bc6ba-30c4-4cc1-a6c4-c2052e86f348","resolution":{"observed_at":"2026-08-05T05:42:52.829876Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:52.543743Z","title":"Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.543743Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:78dfe3bac6f1be63f034a1fb3178c8b77c4b2c76663aa457b9db2650335b976f","observation_id":"d5761692-c006-402d-b0f6-4a8106639056","resolution":{"observed_at":"2026-08-05T05:42:52.543743Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.06527","last_updated":"2017-01-11T20:25:54Z","snapshot_observed_at":"2026-08-09T10:33:19.055285Z","submitted_at":"2015-07-23T15:16:46Z","title":"Deep Recurrent Q-Learning for Partially Observable MDPs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.06527","snapshot_observed_at":"2026-08-05T05:42:52.553567Z","title":"Hausknecht and Peter Stone","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.553567Z"},"links":{"cited_paper":"/paper/1507.06527","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:9e40a97f61acfdcb145c1efb02b6508f16fef842f65c9026d368ff5de1cf0829","observation_id":"c0b5e9a8-a486-4ed9-8689-4b0865fe13c5","resolution":{"observed_at":"2026-08-05T05:42:52.553567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.04455","last_updated":"2015-12-14T18:44:48Z","snapshot_observed_at":"2026-07-06T04:39:51.329643Z","submitted_at":"2015-12-14T18:44:48Z","title":"Memory-based control with recurrent neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.04455","snapshot_observed_at":"2026-08-05T05:42:52.557939Z","title":"Hunt, Timothy P","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.557939Z"},"links":{"cited_paper":"/paper/1512.04455","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:9951d75185463cb13440825e659fd9affa531588a10f59f1bbaf98336cbffb38","observation_id":"78635fcf-fb3d-43de-9676-cdf24b3ca29f","resolution":{"observed_at":"2026-08-05T05:42:52.557939Z","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":"2022.10378","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:53.235304Z","title":"Neural large neighborhood search for routing problems","venue":null,"work_id":"f431fa34-b789-4973-83bc-348194368bdd","year":2022},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.562822Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:d33162a908660d992f6b2cc2535b44201e2dd941b5a6d0585e166449dfbd6baa","observation_id":"dd02c1a3-82e3-48a9-913f-0827b033dcc5","resolution":{"observed_at":"2026-08-05T05:42:53.242858Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-05T05:42:53.736579Z","title":"Efficient Active Search for Combinatorial Optimization Problems","venue":null,"work_id":"c46f2aad-ac4e-48fa-9771-02a2f471f517","year":2022},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.567473Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:aa151d4b451b2ad9bf7f1a7d558f1b68b44bdea6e1cdf6c1812bb355528b8287","observation_id":"08ee1e70-dac6-4f52-b128-28ecf1184d9e","resolution":{"observed_at":"2026-08-05T05:42:53.741945Z","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-05T05:42:53.720085Z","title":"PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimization","venue":null,"work_id":"673d062a-8d2c-4f2a-b394-9328d0db9ee5","year":2025},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.571998Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:ec977816809cc61fd9ce678e6a6ba2b81e80f979250d3ad374bb02d66410a12b","observation_id":"325b89e9-ff72-4252-ae0a-c4dff95093a1","resolution":{"observed_at":"2026-08-05T05:42:53.725461Z","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-05T05:42:53.704814Z","title":"Neural Deconstruction Search for Vehicle Routing Problems, January 2025","venue":null,"work_id":"0e779846-9283-46d2-b596-15f25bba4ec3","year":2025},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.576064Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:eb7e60f9e76be3fd6582e4dd3607e6ad269f5d082f90a50022d2851da12ccc18","observation_id":"d4c5d2d1-a2a7-40b8-87ed-d03060fd8389","resolution":{"observed_at":"2026-08-05T05:42:53.709365Z","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":"10.1609/aaai.v37i7.25982","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:53.689352Z","title":"Pointerformer: Deep reinforced multi-pointer transformer for the traveling salesman problem","venue":null,"work_id":"17bdcc36-ccda-4a92-b291-9e5e1a933555","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.580732Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:f41aed0a309b66a68a1b037779396dca59f9cb2a2a687f310e600db949844b72","observation_id":"b2fe67f0-6e89-4546-bec5-e320fb9797fe","resolution":{"observed_at":"2026-08-05T05:42:53.694200Z","resolver_source":"doi","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":{"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-05T05:42:52.584945Z","title":"Joshi, Thomas Laurent, and Xavier Bresson","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.584945Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:829f53639f8e85d724d34c78df2672fee47990d7fa3f16d4c70d05d3d786dd14","observation_id":"c08f337f-87ae-45f5-9791-92e5891e6ff4","resolution":{"observed_at":"2026-08-05T05:42:52.584945Z","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-05T05:42:52.589497Z","title":"Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.589497Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:99f06d0e101a3a0f5e92d13b2e11281c6fcced1870d56f1b575b6d8cba6bd1af","observation_id":"65750e66-8dd1-4438-a918-d2637f564020","resolution":{"observed_at":"2026-08-05T05:42:52.589497Z","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-05T05:42:53.672582Z","title":"Munos, and Will Dabney","venue":null,"work_id":"aceddda6-b980-48ab-9e0f-1d8fe0c2e8ac","year":2018},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.593629Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:fe553c5edb103cfe83b2e75c35a20a30707f0ffd730b7eb3dc9bc73fb9fb779b","observation_id":"ca2f06bb-0253-43c9-86b9-3a6ad69f2a75","resolution":{"observed_at":"2026-08-05T05:42:53.676853Z","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-05T05:42:53.656630Z","title":"Learning Combinatorial Optimization Algorithms over Graphs","venue":null,"work_id":"4935b6d9-b9dc-44b7-a54c-4f12d11bbcbd","year":2017},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.597993Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:780cfb0a5dc64abcffe1ed6b1ede1ac16b7aa189ecb9d9349731936466ffc4ff","observation_id":"8fd3b54b-eade-4b42-9521-84d0bfdabff6","resolution":{"observed_at":"2026-08-05T05:42:53.661227Z","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-05T05:42:53.641451Z","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","venue":null,"work_id":"2033f4f1-a578-45ef-85e5-7410919f281f","year":2022},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.602641Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:0273fe61de14fa220c35cdb3695609d6aab6b87a3ea5691ea2ff3ff8a96ef35c","observation_id":"c25132e6-0157-424f-b1e0-f99e6267c1ce","resolution":{"observed_at":"2026-08-05T05:42:53.645912Z","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":"10.1016/j.cor.2017.09.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:46:29.746714Z","title":null,"venue":"Computers & Operations Research","work_id":"f4ad26ca-6f90-4ea6-b070-65daadcbbb63","year":2018},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.607363Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:6bdfcb851ae126f70a902cac74504b4da9679720c91574b14af69e1794ec1521","observation_id":"38426ceb-415f-4623-80d8-a97c1d831527","resolution":{"observed_at":"2026-08-05T05:42:52.793795Z","resolver_source":"doi","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-05T05:42:53.626325Z","title":"Attention, Learn to Solve Routing Problems! In7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019","venue":null,"work_id":"c99eb436-820e-49ab-b62d-eb215e1114a8","year":2019},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.611557Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:d9bf2312728bd9605231a3fd385979c3e88c8bbf0fdbb413f88e280bd0253f21","observation_id":"0e44034c-555f-4a0e-a311-39da29093175","resolution":{"observed_at":"2026-08-05T05:42:53.631521Z","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-05T05:42:53.609082Z","title":"Matrix Encoding Networks for Neural Combinatorial Optimization","venue":null,"work_id":"a7400e7f-4c03-47f5-9f22-2e05c1720028","year":null},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.615607Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:b99b5bab10259a2a3ea334172570556191fd46e6e2f0264e9ddaee294ef5ade1","observation_id":"02235d87-999a-4ba0-a89e-364f1e5a57db","resolution":{"observed_at":"2026-08-05T05:42:53.614804Z","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-05T05:42:53.593234Z","title":"POMO: Policy optimization with multiple optima for reinforcement learning","venue":null,"work_id":"4a191602-e666-4c73-939c-6ea5e44b1178","year":2020},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.619504Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:c83103428ea899afd471437afc47a8b17dae3ae404fa31e7ec074bfe54721f0e","observation_id":"31918492-caf9-45f4-a837-9e03c68e4d41","resolution":{"observed_at":"2026-08-05T05:42:53.597862Z","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-05T05:42:53.576707Z","title":"Fast Inference from Transformers via Spec- ulative Decoding","venue":null,"work_id":"9c7ecd0e-4b07-40c1-96b5-6dac90208d2a","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.623675Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:e0e78c17fd035f991eea9335a4fc0eff80dcf2afe28eb88f774424d6fd89d8fa","observation_id":"49c05138-ae3b-43c0-a293-44e96af79ebb","resolution":{"observed_at":"2026-08-05T05:42:53.581393Z","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-05T05:42:53.561295Z","title":"Learning to delegate for large-scale vehicle routing","venue":null,"work_id":"62d0c4a4-78ac-4cda-9677-23f09f00fb6a","year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.627614Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:0f457add41e1fd289965597c5064713088a73f2bc49e01b93a7f771e98fc90c3","observation_id":"12d21f31-856f-4749-991b-f7baec187137","resolution":{"observed_at":"2026-08-05T05:42:53.565703Z","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-05T05:42:53.544677Z","title":"From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization","venue":null,"work_id":"d7020b4c-a495-444b-aa72-3e191a0c0791","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.631438Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:77772f0d59612045dfca02776655350aaab2843d8d55ed558ee8a5940e40fc5d","observation_id":"018a64f5-0de3-4925-8d8d-bc85e0d5bcf5","resolution":{"observed_at":"2026-08-05T05:42:53.549501Z","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-05T05:42:53.530072Z","title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","venue":null,"work_id":"f0f616b9-dda7-485c-97d0-218e04a6b09f","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.636169Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:28f57d3aac2856424652799b331e2190d0ded5bd215fe3a1cd12acec78284db8","observation_id":"08d2ddd4-3b55-4b8a-8c0b-d8535022507a","resolution":{"observed_at":"2026-08-05T05:42:53.534721Z","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-05T05:42:53.514506Z","title":"Self- Improved Learning for Scalable Neural Combinatorial Optimization, May 2024","venue":null,"work_id":"7deb7267-1d86-4091-93d4-35dc613fd5a3","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.640667Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:aab7b10bf65d8e8294d39885aabe30c13e3b7ab8d43b4b69330775a2605aebb3","observation_id":"050263bf-20a3-4caa-b9c6-8bab81996460","resolution":{"observed_at":"2026-08-05T05:42:53.519183Z","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-05T05:42:53.499318Z","title":"Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer","venue":null,"work_id":"90fbb961-9adc-4ec4-ab17-e9974e352b5e","year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.644734Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:04715c662a71f2fb60fa3bdd0e8649d370074504c5b76129e0e519cb120e5c77","observation_id":"a18c8c98-07ef-47fe-90b3-6b061bac544d","resolution":{"observed_at":"2026-08-05T05:42:53.504425Z","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-05T05:42:53.484513Z","title":"Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt","venue":null,"work_id":"c2fe62c8-0ab3-432a-8c0d-86617e0b6c56","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.648740Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:0574b2093a0128e8b6d19ae7ce917052b6b33c0eadfade162de2b33022bb9dcb","observation_id":"40afc095-0117-456e-be4c-8b21a934bf35","resolution":{"observed_at":"2026-08-05T05:42:53.489230Z","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-05T05:42:53.470537Z","title":null,"venue":null,"work_id":"c35726aa-ee41-4e45-976f-982fb237b187","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.652909Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:5c99390a49bfb30bc08bf296c2285c2666d6ac57947513bd92c2734379f9b92b","observation_id":"4e783eab-a98c-4aa1-8313-742d24bd14b6","resolution":{"observed_at":"2026-08-05T05:42:53.474772Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T05:42:53.455571Z","title":"Recurrent Reinforcement Learning with Memoroids","venue":null,"work_id":"6bb18d71-8428-4cb3-9f05-54807068a35f","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.657407Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:e0bad949f317f8add90727b2653dcca62c1a6a25b5a7bb66419b22e8d9cf43d1","observation_id":"8254cdf6-f8d9-4180-86a1-e99e872a2308","resolution":{"observed_at":"2026-08-05T05:42:53.459832Z","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-05T05:42:53.439150Z","title":"When Do Transformers Shine in RL? Decoupling Memory from Credit Assignment","venue":null,"work_id":"9403553e-802e-4999-9892-21dd8c871c99","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.661681Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:6d5f253e2efff53b96b14435c7093cd53e899363fed87cb1f9a7a2e181f414e8","observation_id":"30b139c6-a1a8-4673-a3f8-0dc50c03d5d2","resolution":{"observed_at":"2026-08-05T05:42:53.444684Z","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":"10.1007/978-981-15-5577-0_51","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems","venue":"Communications in computer and information science","work_id":"3879bd3e-8d92-4447-94ba-795adeaa7d07","year":2020},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.666021Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:098656bc326f677544af11933f0a752aa7f8bb3f22c50238b9945490628c224e","observation_id":"882c3a74-9959-4189-ad99-76af2c7d632d","resolution":{"observed_at":"2026-08-05T05:42:52.778418Z","resolver_source":"doi","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-05T05:42:53.420214Z","title":null,"venue":null,"work_id":"a6aaf592-679a-4fcb-a17a-29bcdac6328e","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.671489Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:f7f05d37786ce4102deeaea2ab71b89ce784bf5ac36828ee1e9e9f64e369290d","observation_id":"23c6b80c-2965-40b6-95c2-60ad90a0daae","resolution":{"observed_at":"2026-08-05T05:42:53.425046Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T05:42:53.405653Z","title":null,"venue":null,"work_id":"8b392f68-0cb1-4744-b2be-b90143a0e931","year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.675575Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:07ab2bb02b272bf7875cdd2e6c3c30cbaafba93edbf32ba066c82bf94e8b9501","observation_id":"921eb84c-03ca-41f4-a258-d455a49030c9","resolution":{"observed_at":"2026-08-05T05:42:53.409985Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T05:42:53.390772Z","title":"Blockwise Parallel Decoding for Deep Autoregressive Models","venue":null,"work_id":"d4622e2c-d58a-4782-93a5-03c744cb4859","year":2018},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.679804Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:49c8b95202580ed31fa3a2efc9b14705ca3aaaf11ac4a80e4b77566bcdd26fcb","observation_id":"65cc4a36-ef98-40a8-aa9c-e3c2c7f5884a","resolution":{"observed_at":"2026-08-05T05:42:53.395513Z","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-05T05:42:53.375419Z","title":"DIFUSCO: Graph-based Diffusion Solvers for Combinato- rial Optimization","venue":null,"work_id":"b16e516f-574a-4887-a12d-a64fa7cb0545","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.684033Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:4f6af1a47e03a7421fe671c1fa68c795845cb5e92ab5de9af6e38368636074a6","observation_id":"482e92e6-4f5e-4aba-8c33-d4920eff03f0","resolution":{"observed_at":"2026-08-05T05:42:53.380400Z","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":"2012.10384","last_updated":"2021-10-12T16:27:22Z","snapshot_observed_at":"2026-08-08T18:02:26.058600Z","submitted_at":"2020-11-23T21:37:49Z","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","version":2},"cited_work":{"arxiv_id":"2012.10384","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.10384","snapshot_observed_at":"2026-08-05T05:42:53.135876Z","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","venue":"cs.NE","work_id":"133ab748-8f7f-49b4-bf0d-78306720db61","year":2020},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.688493Z"},"links":{"cited_paper":"/paper/2012.10384","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:9ed6cdb702eabf193c77817bbb0e6a2b64f91b23b097da6e927eed3b1ef234ac","observation_id":"66c8e9fd-d0a2-4c90-a196-7b998976888c","resolution":{"observed_at":"2026-08-05T05:42:53.140689Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:52.693314Z","title":"A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems.Operations Research, 60(3):611–624, June 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.693314Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:ce7d48ce5fe3ef11e9eea52b9c26d7cec6c8c23a7c54d8fa49b54534170998cc","observation_id":"6747fdd6-af85-40ad-bf4a-28a1d2c4b896","resolution":{"observed_at":"2026-08-05T05:42:52.693314Z","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-05T05:42:52.697345Z","title":"Wouda, Leon Lan, and Wouter Kool","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.697345Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:c09184aa13256a38301b5af80eb0c0925f8fdba68bdca053e700a2d1521fae8b","observation_id":"e5b4e9b3-c94a-484b-9af5-1dfaf4e48397","resolution":{"observed_at":"2026-08-05T05:42:52.697345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v35i13.17430","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:42:52.754176Z","title":null,"venue":null,"work_id":"773032b8-6339-4acf-aef3-807db3111684","year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.701822Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:e4b35b004d3fcb5eaee118bfb3842ae562a9e3cc908486681c5175fd4e3e6c48","observation_id":"42610e22-5e03-4f35-b505-23b57c8c24d5","resolution":{"observed_at":"2026-08-05T05:42:52.760354Z","resolver_source":"doi","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-05T05:42:53.359100Z","title":"NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem","venue":null,"work_id":"e7a934fb-f946-4173-bf81-20b9451536e3","year":2021},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.706547Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:0a5a2ec8f2b0bf38b92aef78e050a230520c6ad6808ef7aeb34a7c54a56a533b","observation_id":"070c5e8e-8945-4ec2-a277-d5803e9bd1b7","resolution":{"observed_at":"2026-08-05T05:42:53.364275Z","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-05T05:42:52.711070Z","title":"GLOP: Learning Global Partition and Local Construction for Solving Large-Scale Routing Problems in Real-Time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.711070Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:b9f07d726764ef3b0fb7d47b78299400313d008ead080756fa6d5e2d7b83a2dd","observation_id":"6553939f-91be-416a-8453-ac629a860712","resolution":{"observed_at":"2026-08-05T05:42:52.711070Z","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-05T05:42:53.330272Z","title":"Root mean square layer normalization","venue":null,"work_id":"2cf55b5e-062e-42a4-a41a-d52b23c4d64b","year":2019},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.715549Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:8d68b7c9072f14c1d3f494d0ae0a101db7eb191d7cb75af88ec66ab57cc0de97","observation_id":"11aabfac-1240-4313-8e22-86594e976a1d","resolution":{"observed_at":"2026-08-05T05:42:53.334918Z","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-05T05:42:53.314730Z","title":"For results with varying k, see figure 5","venue":null,"work_id":"19a94f0f-2d44-409f-94b7-30dd2ae40d93","year":null},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":1000,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.720686Z"},"links":{"citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:4e33d8590267c6f3320875a429de323b6f037c7d23dd2a9467d0152b3c68fa64","observation_id":"f9060785-814c-4509-8c72-c01eb8e61ce5","resolution":{"observed_at":"2026-08-05T05:42:53.319470Z","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"}}],"paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":13,"verified_exact":7,"verified_fuzzy":31},"total_outbound_references":55},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2509.05084."}