{"as_of":"2026-08-20T23:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e809c11e0fe75bf67fdcfd05cc6a26103784ec2fd00b3543bcda0a39e38457a2","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:34:32.013412Z","state":"measured"},{"denominator":80,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":80,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:17:29.950976Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T11:15:06.961563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00346","snapshot_observed_at":"2026-08-10T22:08:03.335497Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02977","last_updated":"2025-02-04T09:21:37Z","snapshot_observed_at":"2026-08-16T10:08:48.783685Z","submitted_at":"2025-01-06T12:37:56Z","title":"CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:08:03.335497Z"},"links":{"cited_paper":"/paper/2412.00346","citing_paper":"/paper/2501.02977"},"observation_digest":"sha256:a4a2919bbf2f8ccf966980deb8343a0e85a92cba1d008430f1d44ff252a7e79e","observation_id":"8e004c1b-f783-4739-8270-320e76091fe6","resolution":{"observed_at":"2026-08-10T22:08:03.335497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00346","snapshot_observed_at":"2026-08-15T23:17:29.950976Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.05119","last_updated":"2025-08-25T07:02:36Z","snapshot_observed_at":"2026-08-18T21:48:19.193894Z","submitted_at":"2025-05-08T10:42:57Z","title":"USPR: Learning a Unified Solver for Profiled Routing","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T23:17:29.950976Z"},"links":{"cited_paper":"/paper/2412.00346","citing_paper":"/paper/2505.05119"},"observation_digest":"sha256:79b0d859a36b8800e883cb9aa1fde343ff9eff9371505c1ac57539ef186dfb22","observation_id":"62139473-5455-4ab7-be9b-719949120674","resolution":{"observed_at":"2026-08-15T23:17:29.950976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"cited_work":{"arxiv_id":"2412.00346","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.00346","snapshot_observed_at":"2026-08-08T11:15:06.961563Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","venue":"cs.AI","work_id":"f7170678-6cdc-44c3-aeae-8e23b3e0f79a","year":2024},"citing_paper":{"arxiv_id":"2608.05541","last_updated":"2026-08-06T02:39:10Z","snapshot_observed_at":"2026-08-19T05:26:16.990799Z","submitted_at":"2026-08-06T02:39:10Z","title":"Hyper-ES: Effective Evolution Strategies for LLM Reasoning via Descent Direction Merging","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T11:15:06.854750Z"},"links":{"cited_paper":"/paper/2412.00346","citing_paper":"/paper/2608.05541"},"observation_digest":"sha256:f8b1301208cd56a156cccf3a948b7d89734bef1e7ad22d71f9edb39ef2765d1c","observation_id":"438b3021-970c-4297-b51d-558e47076881","resolution":{"observed_at":"2026-08-08T11:15:06.966095Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00346/citation-record","integrity":"/paper/2412.00346/integrity","json":"/paper/2412.00346/citation-record.json","paper":"/paper/2412.00346"},"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-12T05:34:33.228085Z","title":"Vehicle routing problems for city logistics,","venue":null,"work_id":"3cf1ed1b-1c5e-46bd-89c7-750b31aa8a2f","year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.649825Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:b2cc56a15c060010a1b8d0bff207986e7809d1c72c61d93a1fc72f00a9c8dcc9","observation_id":"ed379a26-6983-406f-95dd-daabe3cb498c","resolution":{"observed_at":"2026-08-12T05:34:33.233281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.211164Z","title":"Rodrigue, The geography of transport systems , 5th ed","venue":null,"work_id":"e4ceb5c3-71b1-4ab0-ab1a-5a981b4ba004","year":2020},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.655244Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:d9616fc4e1d9df2c27025a09aecc314c3982f5eb9730c7fd766f98c3c74e8bd2","observation_id":"5931b67e-6da9-4051-a9e1-345aa7452be8","resolution":{"observed_at":"2026-08-12T05:34:33.216719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.195724Z","title":"Machine learning for combinato- rial optimization: a methodological tour d’horizon,","venue":null,"work_id":"53fa3deb-7a4e-4188-aecb-1b1a4f68eacb","year":2021},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.660581Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:ac73d130a65ed3c2c7d18e86776d7b7719bd0d5bb6d94ed9d64f8d4cd24d5e89","observation_id":"97f96a67-412f-41fc-b916-18df741dfdc9","resolution":{"observed_at":"2026-08-12T05:34:33.200555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:31.665443Z","title":"Attention, learn to solve routing problems!","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.665443Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:843029a8033bb76aec204dbeddad94d2fb677f283542cb893b740ad853a60e1c","observation_id":"33ceb030-0ad8-453d-a487-3a011e41a2fa","resolution":{"observed_at":"2026-08-12T05:34:31.665443Z","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-12T05:34:33.170427Z","title":"Machine learning to solve vehicle routing problems: A survey,","venue":null,"work_id":"ea265a09-8040-41c7-9f54-5e95c56d0ee7","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.670451Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:a2f01dc8fb83eb87e6b995c377070c7f463ac2469aab5e79e072ab5c80f482a2","observation_id":"ff542e33-d9ec-430d-bf85-229a13606068","resolution":{"observed_at":"2026-08-12T05:34:33.175172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.155083Z","title":"Pomo: Policy optimization with multiple optima for reinforcement learning,","venue":null,"work_id":"a852f5f3-86bf-48d9-8aa3-32c26eede86b","year":2020},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.675526Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:747fc081d3456fd9257610e5e2874c0e8f93402c7daf4f570c271fda22baf4e2","observation_id":"923d5e32-f29c-403c-9255-6ffe3486a236","resolution":{"observed_at":"2026-08-12T05:34:33.159993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.139796Z","title":"Learning to solve combinatorial optimization problems on real-world graphs in linear time,","venue":null,"work_id":"3ab29b65-3c81-4b86-b819-74bfab1fbb13","year":2020},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.681036Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:527b5deefba9676c35577f2ff761e8e4ab61127303a2c3567636a93ea243dc5a","observation_id":"c22f0a52-ee38-4d63-bdb4-f20c19cf89d4","resolution":{"observed_at":"2026-08-12T05:34:33.144992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.123572Z","title":"Efficiently solving the practical vehicle routing problem: A novel joint learning approach,","venue":null,"work_id":"4573c8fa-0f9f-4f3b-adc9-f7c65fe3d10e","year":2020},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.685905Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:860a64038b9971283e51c86a0a8b32ce52f6795e032b45893620f574de0c8432","observation_id":"ce13565f-0e7d-49e5-a763-fd7eca07ccaf","resolution":{"observed_at":"2026-08-12T05:34:33.128911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08539","last_updated":"2020-02-20T02:39:02Z","snapshot_observed_at":"2026-08-20T07:43:12.924402Z","submitted_at":"2020-02-20T02:39:02Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08539","snapshot_observed_at":"2026-08-12T05:34:31.690755Z","title":"Learn to design the heuristics for vehicle routing problem,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.690755Z"},"links":{"cited_paper":"/paper/2002.08539","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:1f2ade41a8ebe7e84b98df047360c90bf2ced3ab6cee815391ec945e1de15528","observation_id":"45351849-dcde-43a8-946c-18f112c6e0ed","resolution":{"observed_at":"2026-08-12T05:34:31.690755Z","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-12T05:34:33.106634Z","title":"Combining reinforcement learning and constraint programming for combinatorial optimization,","venue":null,"work_id":"1faaf79d-9b13-483a-9d09-929dafa1e345","year":2021},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.695817Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:1f003ad39d6993ec86e57d8b4b0748197e631a8d533b3de29517376a8c9428da","observation_id":"538a89c8-ac9d-4344-8ef3-c296b37ca6e0","resolution":{"observed_at":"2026-08-12T05:34:33.112497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.082251Z","title":"A hybrid of deep reinforcement learning and local search for the vehicle routing problems,","venue":null,"work_id":"af793824-efe3-41fe-bd0a-5f0b0a43fb62","year":2021},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.700909Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:0ab190c48d88bae1280099a9060737596211c8d6008c8670eb8b6241294928f1","observation_id":"0129a46f-9d83-4af4-9dec-f2030887c50b","resolution":{"observed_at":"2026-08-12T05:34:33.091729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.063871Z","title":"Deep policy dynamic programming for vehicle routing problems,","venue":null,"work_id":"a422a174-2ea0-4c89-bda2-8d6439e11d9d","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.705579Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:5e3ff80a78fb0456f8f1221a81846a7184810f33b2e5d1e08db36ec9cf6b7b3c","observation_id":"03f76bdd-357b-4e8a-b781-8783e6e0f41c","resolution":{"observed_at":"2026-08-12T05:34:33.069657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.046011Z","title":"Learning heuristic selection using a time delay neural network for open vehicle routing,","venue":null,"work_id":"75d8eeb3-ebe6-446b-9bd8-2d51d90dd6c4","year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.710256Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:2852b242a763917647216ecb9685c32b6d6d08f7fb36e300b3a2a47a63d332ca","observation_id":"10c9d11b-6a23-4f26-86d1-e793c65a7602","resolution":{"observed_at":"2026-08-12T05:34:33.052353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.024327Z","title":"The vehicle routing problem: State-of-the-art classification and review,","venue":null,"work_id":"e4f2c1d2-40cb-4f61-9fd4-b4cacd5798ee","year":2021},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.714609Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:000b24b14b5fe677459eb5b8d183429a978379f144abd430cf4aba044e1bcfde","observation_id":"c6dbe2fc-096a-4bf7-af30-a6512388bc09","resolution":{"observed_at":"2026-08-12T05:34:33.030312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:33.004914Z","title":"Multi-task learning for routing problem with cross-problem zero-shot generalization,","venue":null,"work_id":"249a7c80-626b-4604-880f-0cd54c5bfccb","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.719120Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:9a25314f6663daf31dc02ac6a54bab61dd5da4194bd19c127f224d408023e1ec","observation_id":"82cea1e3-4f90-4fbe-bf9b-4af03af00c8e","resolution":{"observed_at":"2026-08-12T05:34:33.010844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.987476Z","title":"Mvmoe: Multi-task vehicle routing solver with mixture-of-experts,","venue":null,"work_id":"bb156456-bed4-470e-bd26-fabdbd81203b","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.723463Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:09bc43505e74aa43993adf4fd447dc1f75381d4bce707bcd3a6c8db7a870a15a","observation_id":"d093859f-2a65-4900-85f7-39928de2bb8f","resolution":{"observed_at":"2026-08-12T05:34:32.993292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.968578Z","title":"Routefinder: Towards foundation models for vehicle routing problems,","venue":null,"work_id":"67f6d263-1736-4244-9663-c74b7b388af5","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.727795Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:fb2466ea20b5a0f56a00b8fdcc89e4c8a7467ca80e1bbb45a7dbff606a6421af","observation_id":"3ec11fb9-9607-43e4-aded-60fc77a1a714","resolution":{"observed_at":"2026-08-12T05:34:32.973832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.952654Z","title":"Cross-problem learning for solving vehicle routing problems,","venue":null,"work_id":"fe6dee98-8421-4574-882b-88ca19203bc7","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.732351Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:21563677a8f9827d08d99fd099c7a287a6773bad11225ddad64ff1a8fbf75da7","observation_id":"f6b67610-b0d7-4277-8f8b-ebb07c708f46","resolution":{"observed_at":"2026-08-12T05:34:32.957460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.936385Z","title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer,","venue":null,"work_id":"7da91442-f70c-4e3f-96bb-596171150212","year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.737152Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:a88e1fb5af3e9c70395d5760908b03e294b689002caaab31c75df4f0ec682b52","observation_id":"c62f952a-cb0c-4654-9964-def3b287a130","resolution":{"observed_at":"2026-08-12T05:34:32.942107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-13T17:20:44.002518Z","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-12T05:34:31.741767Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.741767Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:1f3753ee247b91ee9be3ec2060c1783f87085eb2638d0fced1f5e0bd87aace94","observation_id":"b4db9260-3483-447e-8c28-c944ae5ff9a8","resolution":{"observed_at":"2026-08-12T05:34:31.741767Z","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-12T05:34:31.747038Z","title":"Learning a sparse transformer network for effective image deraining,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.747038Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:018584963b0acdb72b93fd2a1ce0ed4f94285951776b6cdf1a497d330384ba68","observation_id":"5c1bc614-74cc-4deb-a241-7ab8316952f2","resolution":{"observed_at":"2026-08-12T05:34:31.747038Z","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-12T05:34:32.907379Z","title":"Adapt or perish: Adaptive sparse transformer with attentive feature refinement for image restoration,","venue":null,"work_id":"3ce072b1-03ac-455a-b021-b8556ff8b8a2","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.751663Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:be7c7ef079fa900fb20b1fe50374d27b8e6992dc4e27bcaa01bfed31ac0dea81","observation_id":"8bc47bec-d0c1-4362-877b-411e42734d55","resolution":{"observed_at":"2026-08-12T05:34:32.913229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.883489Z","title":"Reinforcement learning for solving the vehicle routing problem,","venue":null,"work_id":"5736f6b3-1c58-4986-b5a9-3605d4c7ae68","year":2018},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.756010Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:b774cd005e5788d5cf7a163066c224d8f59bfe0f166cd1f6d60182994fcfa029","observation_id":"83e374e2-6a28-47b9-8804-98e4c0bd6a82","resolution":{"observed_at":"2026-08-12T05:34:32.890257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:31.760577Z","title":"Pointer networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.760577Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:6e084bd2e69aed534dd7166a3dbeaa82f245af1f137e7412213381553a61011f","observation_id":"68e87b11-5a13-4797-a2f1-9516bdb34acc","resolution":{"observed_at":"2026-08-12T05:34:31.760577Z","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-12T05:34:31.765142Z","title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.765142Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:94cf4d2ded99310b024fce0592b3efe5f545f784fe231b805f3ffee558ba8fc4","observation_id":"253627a4-f420-4016-ac65-a5ade84371f3","resolution":{"observed_at":"2026-08-12T05:34:31.765142Z","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-12T05:34:32.841691Z","title":"Multi-decoder attention model with embedding glimpse for solving vehicle routing problems,","venue":null,"work_id":"905b308e-179b-41e3-aa57-64d959868035","year":2021},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.769830Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:f0ec66f071f793513986d893ac9ccf8ea76a4e4cd96690f94dbf000e1979c64e","observation_id":"63b1de79-0b37-4e0d-aaec-074a33338806","resolution":{"observed_at":"2026-08-12T05:34:32.846419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.826472Z","title":"Learning collaborative policies to solve np-hard routing problems,","venue":null,"work_id":"77198077-b534-4cde-93f0-a631a209f34f","year":2021},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.774738Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:0451d2ff5e14ce5f57b72447fb9e4b2c49fc5345c88e738fc7fdac765cd77fa1","observation_id":"88018f26-0833-4df3-b338-8a6dc5193bd4","resolution":{"observed_at":"2026-08-12T05:34:32.831365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.808678Z","title":"A deep reinforcement learning algorithm using dynamic attention model for vehicle routing problems,","venue":null,"work_id":"e4e32526-28d6-4bdd-87a9-cd935249d647","year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.779484Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:8bfc33419056b08362f06fec6f4e1be73fe1977c28b3294359d05f8904a7edd4","observation_id":"cb257a21-4ae9-4c4b-9d6d-6315a7b1182e","resolution":{"observed_at":"2026-08-12T05:34:32.814750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.790124Z","title":"Sym-nco: Leveraging symmetricity for neural combinatorial optimization,","venue":null,"work_id":"15e034fc-c6f1-43b1-9ae1-cd06cb8470d4","year":1936},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.784264Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:d44e47ad968502de6a757467e82cee0ecb2bbdda42b52942817de8008f89c762","observation_id":"a02ab0af-6c51-4d2f-b85e-15fde403ffd6","resolution":{"observed_at":"2026-08-12T05:34:32.796106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.768689Z","title":"Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem,","venue":null,"work_id":"d6459f88-b616-4da1-a4c7-91044f68e971","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.789145Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:019f968de985f632eaba297c9307e9195e316e291b16cbaeb5e4ba2b7fcde39b","observation_id":"a2a7b20b-1019-4dd2-966a-d00e8188f956","resolution":{"observed_at":"2026-08-12T05:34:32.774078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.02453","last_updated":"2022-05-05T05:48:16Z","snapshot_observed_at":"2026-08-20T07:43:16.587227Z","submitted_at":"2022-05-05T05:48:16Z","title":"Learning to Solve Vehicle Routing Problems: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.02453","snapshot_observed_at":"2026-08-12T05:34:31.793922Z","title":"Learning to solve vehicle routing problems: A survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.793922Z"},"links":{"cited_paper":"/paper/2205.02453","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:aa07c141422fc14179ffc7cfd569563ba978569ead8efc1c93759cccaf4b52c6","observation_id":"9c995a6a-a14d-4bc8-b89b-52e73e8ca13d","resolution":{"observed_at":"2026-08-12T05:34:31.793922Z","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-12T05:34:32.752479Z","title":"An overview and experimental study of learning-based optimization algorithms for the vehicle routing problem,","venue":null,"work_id":"e6dc54cb-c256-423f-a40b-9743e1c5cc25","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.799138Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:744e587838882e8c719c26ea101fa6ff8c6f75a6df0b5fa6b59d3fc2b653520a","observation_id":"4cbb1291-3e2f-4e69-87bf-9f78cf3da2e6","resolution":{"observed_at":"2026-08-12T05:34:32.757565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.736582Z","title":"Learning to solve travelling salesman problem with hardness-adaptive curriculum,","venue":null,"work_id":"8ea1ad88-df67-4f24-8440-0c11dbfbeb3e","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.803748Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:d477846ea4eb5227a96d3fb09f22d475f4ca828d6490e637777694255d7c1b75","observation_id":"c7672863-8713-4afa-bad3-06a363ac96fb","resolution":{"observed_at":"2026-08-12T05:34:32.741665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.718760Z","title":"Generative adversarial training for neural combinatorial optimization models,","venue":null,"work_id":"c4eb140e-e369-4779-a5dc-bba0284675e2","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.808277Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:cc9999f7037b3d167822c94b4f0cd001ae105d4314a29ddf97020017ca763109","observation_id":"5b341012-a90a-4eeb-9ce4-4ced4217b03c","resolution":{"observed_at":"2026-08-12T05:34:32.724263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.702038Z","title":"Generalization of neural combinatorial solvers through the lens of adversarial robustness,","venue":null,"work_id":"a23be9dd-8d38-481c-958a-e7d780c9aabd","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.812919Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:3ec64fdae841b501ed29f9e1fbb0332232c9ff3d62e38e353b9f7d8d15589172","observation_id":"2b4b96c8-8c1f-428b-bc55-245e3f25fd20","resolution":{"observed_at":"2026-08-12T05:34:32.707037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.683173Z","title":"A game- theoretic approach for improving generalization ability of tsp solvers,","venue":null,"work_id":"c10a7b16-0885-4793-b9ff-60386cc22851","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.818040Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:3d0bca7339a50368fb985948e419682e2045b2e5f093deae59452300a55907ce","observation_id":"3e091ae3-ac75-4213-b414-89a0e5e9519e","resolution":{"observed_at":"2026-08-12T05:34:32.689861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.666671Z","title":"Learning to solve routing problems via distributionally robust optimization,","venue":null,"work_id":"949225be-267c-4460-8ed3-ab9f8f27a7bb","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.822320Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:bb5f614a7490652cb62f3954f45afe25e22ce4c9636370a7dd1effd2b65d6547","observation_id":"512ff68b-ce3f-442b-8a2b-f14d8c260865","resolution":{"observed_at":"2026-08-12T05:34:32.672095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.651124Z","title":"Learning generalizable models for vehicle routing problems via knowl- edge distillation,","venue":null,"work_id":"af5d5bfd-cdaf-4aae-98ee-6be43d31ced3","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.826892Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:d6302ee13e850d351dddd2f706cbed161b1a2c43bcf4ac46ff6812db4e9cb3cd","observation_id":"4c15a864-61aa-42b1-ab6b-570ad32d9cdf","resolution":{"observed_at":"2026-08-12T05:34:32.656058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.635576Z","title":"Towards omni- generalizable neural methods for vehicle routing problems,","venue":null,"work_id":"af0d7e27-8bcc-4f99-9221-d581a028b0aa","year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.831611Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:24b02ea47d41a77896b65416ad4da16b54fe90aaf1ebf7187910fc66b74c8f5b","observation_id":"2c8035b9-4e47-4ea2-923f-190d43f7e5bf","resolution":{"observed_at":"2026-08-12T05:34:32.640748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06361","last_updated":"2025-05-25T14:09:07Z","snapshot_observed_at":"2026-08-20T07:43:13.482013Z","submitted_at":"2023-05-10T14:20:34Z","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06361","snapshot_observed_at":"2026-08-12T05:34:31.836080Z","title":"Efficient training of multi-task neural solver with multi-armed bandits,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.836080Z"},"links":{"cited_paper":"/paper/2305.06361","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:e1bf07e00919fa8477164012b5c1ecb67c96665dafe4d3a4dfbf6a1389feffce","observation_id":"7282092b-cab4-4039-b2cf-e9eb93126969","resolution":{"observed_at":"2026-08-12T05:34:31.836080Z","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-12T05:34:31.841085Z","title":"Language modeling with gated convolutional networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.841085Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:626b216b380a518cad5fee6bbd6332b17bb0401bd13fb91e79ee35891af83068","observation_id":"85a0403c-b3c1-41ee-b721-077b890aafe5","resolution":{"observed_at":"2026-08-12T05:34:31.841085Z","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-12T05:34:31.845488Z","title":"Root mean square layer normalization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.845488Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:93450c69fd22343779ce39bc72c2a09846d77d7eb4a3eec603682e143638c720","observation_id":"1cd77032-f44e-4916-8270-4ef1afe88bf7","resolution":{"observed_at":"2026-08-12T05:34:31.845488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10853","last_updated":"2019-02-22T23:41:46Z","snapshot_observed_at":"2026-08-14T18:22:23.244558Z","submitted_at":"2018-09-28T04:30:11Z","title":"Adaptive Input Representations for Neural Language Modeling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10853","snapshot_observed_at":"2026-08-12T05:34:31.850272Z","title":"Adaptive input representations for neural language modeling,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.850272Z"},"links":{"cited_paper":"/paper/1809.10853","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:beb369252e36f8e89d0c7532390af087b5cb33bd3c37c2dbf33fd65e75bc0ab4","observation_id":"c73a8056-8465-471f-9923-cc51e0f54e06","resolution":{"observed_at":"2026-08-12T05:34:31.850272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10509","last_updated":"2019-04-23T19:29:47Z","snapshot_observed_at":"2026-08-16T10:03:03.268538Z","submitted_at":"2019-04-23T19:29:47Z","title":"Generating Long Sequences with Sparse Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10509","snapshot_observed_at":"2026-08-12T05:34:31.855008Z","title":"Generating long sequences with sparse transformers,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.855008Z"},"links":{"cited_paper":"/paper/1904.10509","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:357ad0a123f90ce2af33f5ee2ebad25ac64c5e32b24c0d49695336fa38c16188","observation_id":"56017be3-b346-4e8f-a8cf-f2809793df86","resolution":{"observed_at":"2026-08-12T05:34:31.855008Z","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-12T05:34:31.859912Z","title":"U-net: Convolutional networks for biomedical image segmentation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.859912Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:01237b59739c79bf753544c58218097e7c02d0a8893ea997fa13dcbcfa4aa078","observation_id":"fac0a992-762a-4544-a041-e9ea17773cab","resolution":{"observed_at":"2026-08-12T05:34:31.859912Z","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-12T05:34:31.865603Z","title":"Segnext: Rethinking convolutional attention design for semantic segmentation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.865603Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:2ce69fb09a5bc4c9e093fd4d3477463c69e829bcb9c7b827345fc777accb155d","observation_id":"6742710a-bab9-4bad-a75f-789b650d7d00","resolution":{"observed_at":"2026-08-12T05:34:31.865603Z","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-12T05:34:32.579274Z","title":"Multi-scale high-resolution vision transformer for semantic segmentation,","venue":null,"work_id":"1bcd9bfb-ad6e-411b-9ade-133bc5b91da9","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.870480Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:53446bd607d9eced9ce0f12ca6d4502267f9d2cc51bf2a072e035595379800b6","observation_id":"b109039d-2c81-4a5b-9804-a6e21a5a1cd8","resolution":{"observed_at":"2026-08-12T05:34:32.584754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.04514","last_updated":"2019-04-09T08:08:16Z","snapshot_observed_at":"2026-08-14T16:49:29.551656Z","submitted_at":"2019-04-09T08:08:16Z","title":"High-Resolution Representations for Labeling Pixels and Regions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.04514","snapshot_observed_at":"2026-08-12T05:34:31.875566Z","title":"High-resolution representations for labeling pixels and regions,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.875566Z"},"links":{"cited_paper":"/paper/1904.04514","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:e73323aa4e84ca1754f5aaa452f23bec546edd9459cee082953006df80048da0","observation_id":"ef678cd8-fb9a-45f1-8f0e-40b39d27ad59","resolution":{"observed_at":"2026-08-12T05:34:31.875566Z","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-12T05:34:31.880490Z","title":"Deep high-resolution representation learning for visual recognition,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.880490Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:cd6792faeb1a2c3185a9f77015c00edd178bfa7b08e2137a2b20234da2dd58c8","observation_id":"a89f4b57-c7e5-456b-8113-3f3d54b20d82","resolution":{"observed_at":"2026-08-12T05:34:31.880490Z","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-12T05:34:31.886191Z","title":"Dual attention network for scene segmentation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.886191Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:22b0b5279c9457e954d5170c4cc9c8d85a8d50a6f5f36265c3acc65523a7b72e","observation_id":"c3f12558-62b1-47c3-84fd-8033bd61cadf","resolution":{"observed_at":"2026-08-12T05:34:31.886191Z","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-12T05:34:31.890686Z","title":"Mixste: Seq2seq mixed spatio-temporal encoder for 3d human pose estimation in video,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.890686Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:64e311a44490c6e3b088f16292ffe74f16e5ef32bc131e5627f650a8a378dbe5","observation_id":"31dab61c-32e2-49ba-9384-7144a2c91fb6","resolution":{"observed_at":"2026-08-12T05:34:31.890686Z","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-12T05:34:31.895373Z","title":"Cswin transformer: A general vision transformer backbone with cross-shaped windows,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.895373Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:c6df655a43b50f68575cc5da8afd1d370bd7d8ebaecd10528c8a25e24e854777","observation_id":"aa630b02-9ab4-49b0-b2cc-9c1380ecd9d5","resolution":{"observed_at":"2026-08-12T05:34:31.895373Z","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-12T05:34:32.520949Z","title":"Crossformer++: A versatile vision transformer hinging on cross-scale attention,","venue":null,"work_id":"4be36626-dbdd-4437-b329-e9e86a9917f2","year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.900232Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:84bf4b1b08d9d5bc1405154d7327c64ecb0b63dcd1ef9e4cd97dcd1c4068fd49","observation_id":"de3cf064-cdb4-48cc-8e38-a915831a1d2f","resolution":{"observed_at":"2026-08-12T05:34:32.526640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.503680Z","title":"Context encoding for semantic segmentation,","venue":null,"work_id":"29a75f3f-4b19-4a6a-8c3a-cb24fb84da7a","year":2018},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.904723Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:66619f484f7528816914209e8d2b6e2945bd8ed94b32004c815d55578943f679","observation_id":"b5b8469c-6bb9-46b7-af86-33f47045f15e","resolution":{"observed_at":"2026-08-12T05:34:32.509014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.11637","last_updated":"2019-12-25T10:59:31Z","snapshot_observed_at":"2026-08-20T09:04:10.852812Z","submitted_at":"2019-12-25T10:59:31Z","title":"Explicit Sparse Transformer: Concentrated Attention Through Explicit Selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.11637","snapshot_observed_at":"2026-08-12T05:34:31.909480Z","title":"Explicit sparse transformer: Concentrated attention through explicit selection,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.909480Z"},"links":{"cited_paper":"/paper/1912.11637","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:1dfb5c9e158bceb6e80d281d11c7686bb25b58ad9fdba12ad822111f98c6f5b8","observation_id":"ac0e31c3-0c95-46d0-8b03-c73f66a811c9","resolution":{"observed_at":"2026-08-12T05:34:31.909480Z","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-12T05:34:32.487580Z","title":"Kvt: k-nn attention for boosting vision transformers,","venue":null,"work_id":"605b73a0-3c25-4462-8998-65d9acfe71ab","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.914432Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:c45b1947ede9b397e73d036163cc7b59f016a10ec35609a526daba7b46d90a2a","observation_id":"754dc36e-1be8-4116-86ee-0b3254250338","resolution":{"observed_at":"2026-08-12T05:34:32.492680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.470795Z","title":"Nformer: Robust person re-identification with neighbor transformer,","venue":null,"work_id":"dd788fec-af64-4dd2-98c3-d9317837c6fd","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.919153Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:4c8883291e951eee6f40a6d82e75069b42d8a85332c808698462f565bec420fa","observation_id":"ceb78c00-1d27-47c7-ae66-a30bd63bc2f5","resolution":{"observed_at":"2026-08-12T05:34:32.475735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.455027Z","title":"Comprehensive and delicate: An efficient transformer for image restoration,","venue":null,"work_id":"92b7ceb6-8ba3-4594-a561-2eced03091e8","year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.923545Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:d7ca487c050bcd9df8419e32822fd130c2c7ce5579897ee245aae0c072afd119","observation_id":"8bc9fd7f-34fa-4def-8254-aac39104b95f","resolution":{"observed_at":"2026-08-12T05:34:32.460145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09113","last_updated":"2022-04-24T08:56:39Z","snapshot_observed_at":"2026-08-20T07:43:16.048913Z","submitted_at":"2019-02-25T07:07:38Z","title":"Star-Transformer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09113","snapshot_observed_at":"2026-08-12T05:34:31.928652Z","title":"Star- transformer,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.928652Z"},"links":{"cited_paper":"/paper/1902.09113","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:9c307fcfd63a78279df919293c19044925a3e584742b5e4086ea1f98464cb49c","observation_id":"92a36aed-c8a9-473e-a48f-48c601cf8100","resolution":{"observed_at":"2026-08-12T05:34:31.928652Z","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-12T05:34:32.439675Z","title":"En- hancing the locality and breaking the memory bottleneck of transformer on time series forecasting,","venue":null,"work_id":"c918635e-44ab-49a1-807b-98b9c4f96c7e","year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.933855Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:3be2470a361b90c4455442cbdd59c216b5d7ed2241dec621323cae281d2af1d1","observation_id":"1d474a1d-4fae-4a31-8e44-b83de933e1e0","resolution":{"observed_at":"2026-08-12T05:34:32.444162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-12T05:34:31.938635Z","title":"Longformer: The long- document transformer,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.938635Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:42c78cf15d81fed1ae6bdc52613dbaf22946fc63bfce0294904c3a8bf5579de3","observation_id":"56b98e17-4f79-4ec4-a972-7ce224d918a4","resolution":{"observed_at":"2026-08-12T05:34:31.938635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08483","last_updated":"2020-10-27T16:54:17Z","snapshot_observed_at":"2026-08-20T07:43:21.158638Z","submitted_at":"2020-04-17T23:10:18Z","title":"ETC: Encoding Long and Structured Inputs in Transformers","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08483","snapshot_observed_at":"2026-08-12T05:34:31.943369Z","title":"Etc: Encoding long and structured inputs in transformers,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.943369Z"},"links":{"cited_paper":"/paper/2004.08483","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:76c911f4ef363c3515f28db1531bbb03ca1b4e8b8573253d61f2e4815ef60097","observation_id":"841f549c-9442-47f5-98fa-6ceb68c7b681","resolution":{"observed_at":"2026-08-12T05:34:31.943369Z","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-12T05:34:31.948131Z","title":"From softmax to sparsemax: A sparse model of attention and multi-label classification,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.948131Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:dac2a120d7e6d6036255b58dae846fee1e0a125474cecc7ad5bc06a96dc22166","observation_id":"6776815a-7043-4550-a33d-5b81053fa8a6","resolution":{"observed_at":"2026-08-12T05:34:31.948131Z","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-12T05:34:32.414086Z","title":"Sparse sequence-to-sequence models,","venue":null,"work_id":"b067b60b-fcb6-4d27-862a-fb1bcc979faf","year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.952037Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:dce9b282563abaeaff94aaffc3f56a61514454a9a3c208a57359547d3231d31e","observation_id":"39166ef7-9618-4ac0-af92-4cfb0a4285cb","resolution":{"observed_at":"2026-08-12T05:34:32.419659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.398376Z","title":"Learning classifiers with fenchel-young losses: Generalized entropies, margins, and algorithms,","venue":null,"work_id":"df694409-d53b-4367-b191-65c130b22144","year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.956018Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:d124da497de7754ba604045108c56b665f4692359bc0a069bc323ce13fec06a9","observation_id":"2752c4be-e89d-4cac-8f36-6e78aed41375","resolution":{"observed_at":"2026-08-12T05:34:32.403775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.379980Z","title":"Adaptively sparse transformers,","venue":null,"work_id":"da6d12b7-6590-4230-98da-53907e98d736","year":2019},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.959972Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:fc39a3dea0949b4189b30bb5beb7f2fbb1153ea8a51892ebcd31688376bfff9e","observation_id":"cbb97df5-135c-4cd1-997a-248a78ea88ab","resolution":{"observed_at":"2026-08-12T05:34:32.385192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:31.964318Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.964318Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:1808faebe00dab91037d62cc54638d7c7e99163a4fea75a2b5207117911f8db5","observation_id":"c6e38370-48fb-4215-9b89-cc167a9aff86","resolution":{"observed_at":"2026-08-12T05:34:31.964318Z","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-12T05:34:31.968430Z","title":"Palm: Scal- ing language modeling with pathways,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.968430Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:0b2d57c361c32c0b5e27b5c7a31bbe18e4901d85017c5f19f3d6199fb32fa8e3","observation_id":"6d1002e0-894d-4c51-8ccc-9a9ee1b5c9c7","resolution":{"observed_at":"2026-08-12T05:34:31.968430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-12T05:34:31.972702Z","title":"Llama: Open and efficient foundation language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.972702Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:03dcc43a2453f6177148044cd2664c9348646a779f933e6f08ec2a5f49585e4d","observation_id":"292a5e43-ebd4-4118-a3d9-cf0b24bc6d4b","resolution":{"observed_at":"2026-08-12T05:34:31.972702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06435","last_updated":"2024-10-17T01:10:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-12T20:01:52Z","title":"A Comprehensive Overview of Large Language Models","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.06435","snapshot_observed_at":"2026-08-12T05:34:31.976996Z","title":"A comprehensive overview of large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.976996Z"},"links":{"cited_paper":"/paper/2307.06435","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:455bf56aa7d0dd984e6ed875249263cd5371e08ea4180c856882f388d3b95e96","observation_id":"24e4b8fe-e3cc-4306-a761-96b496c3b3c8","resolution":{"observed_at":"2026-08-12T05:34:31.976996Z","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-12T05:34:31.981557Z","title":"Sigmoid-weighted linear units for neural network function approximation in reinforcement learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.981557Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:7200f729a7450f1de5378b1e248e965b9c45c1a8958305087a736c5a6997dcbc","observation_id":"191c20c0-e038-46e0-b039-d8654fccbcdb","resolution":{"observed_at":"2026-08-12T05:34:31.981557Z","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-08-11T06:21:56.129166Z","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-12T05:34:31.986469Z","title":"Glu variants improve transformer,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.986469Z"},"links":{"cited_paper":"/paper/2002.05202","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:097581244c9eba8fc3086921b1ab249daef24de146fca49f618381df3a679762","observation_id":"78270c74-331b-43ab-8d54-120455883a83","resolution":{"observed_at":"2026-08-12T05:34:31.986469Z","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-12T05:34:31.991882Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.991882Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:f6e7e7e04626f3be38a955c034274e7f6ca3502ce98ea46bc62213fd8073443a","observation_id":"ad07c41c-213b-496c-a620-cf3890804328","resolution":{"observed_at":"2026-08-12T05:34:31.991882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-12T05:34:31.997077Z","title":"Decoupled weight decay regularization,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:31.997077Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:7d32acbd49dfc917994eac11dee574df846924532d5bd069727b75d84a380f2a","observation_id":"2320e92e-d6a4-47a3-b5cd-d718abf26fff","resolution":{"observed_at":"2026-08-12T05:34:31.997077Z","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-12T05:34:32.324501Z","title":"Pyvrp: A high-performance vrp solver package,","venue":null,"work_id":"14fd52de-c2a1-4465-9218-3585f0e608bf","year":2024},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:32.003122Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:b1426ca7031e4dcc850d5ea3e39d4d20df164bd53ed637ffa2ea57d2033e20bd","observation_id":"5dbe0af5-4119-412f-9ab8-ae60a793c27d","resolution":{"observed_at":"2026-08-12T05:34:32.329295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.306411Z","title":"Hybrid genetic search for the cvrp: Open-source implementa- tion and swap* neighborhood,","venue":null,"work_id":"b3d4724d-a5cf-42fe-9f25-9bfd8d906a26","year":2022},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:32.008322Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:ad1b1ffbd7d39436bc7fd8ca7e898190140dfb3493053743d050e88d03a04bd3","observation_id":"1ee2f66a-4306-4ea2-9d3b-565fdd0ccc35","resolution":{"observed_at":"2026-08-12T05:34:32.313143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T05:34:32.013412Z","title":"New benchmark instances for the capacitated vehicle routing problem,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T05:34:32.013412Z"},"links":{"citing_paper":"/paper/2412.00346"},"observation_digest":"sha256:daafa4b5e262667bbb7ec24aa68bd09aa5534d121c58145fc0456520dd17a62e","observation_id":"4ae875b0-7bc3-48b1-a932-d22bfac19691","resolution":{"observed_at":"2026-08-12T05:34:32.013412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T00:30:31.528789Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":77},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 3 inbound Pith citation observations for arXiv:2412.00346."}