{"as_of":"2026-08-09T21:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2343ada3ddfe3f900771219970faef75ed101d754f0c74157e29da9052dd411","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:56:09.110750Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.22338/citation-record","integrity":"/paper/2507.22338/integrity","json":"/paper/2507.22338/citation-record.json","paper":"/paper/2507.22338"},"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-06T11:56:09.243847Z","title":null,"venue":null,"work_id":"1245c5d1-4536-4daa-bf0f-baa8798fa0a1","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.092488Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:b3182bfef3843c8fecc1a3832c03492a3c4c2dc58dcc656173d4b39397c29ab0","observation_id":"47d2091c-6de9-4667-8993-1f9a36cebbf1","resolution":{"observed_at":"2026-08-06T11:56:09.246510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.234850Z","title":null,"venue":null,"work_id":"a5d3e447-1c4f-452a-b382-85a63c907303","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.095207Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:a06f518fc2b3ecee5103365a3824caac9ef0d02dacc9212d2e8a95c005dab9e1","observation_id":"3f3c0e7b-94bd-4fdc-a32b-cfcb0ad4fbab","resolution":{"observed_at":"2026-08-06T11:56:09.237514Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.224104Z","title":"This results in a total ofO M 2 PM k=1 M k k! operations","venue":null,"work_id":"aec9fc64-29a1-4a15-a214-3e9262d56cb1","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.098936Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:3cfcde3846495ed3bb0ae1b47ce3adf621793afa8e361acfc18f105544205525","observation_id":"2f907f6b-b436-473a-8e93-d5a5e63ceed8","resolution":{"observed_at":"2026-08-06T11:56:09.226732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.214945Z","title":"7.5 Worst case computational complexity of∇ Y Fβ via(12),(13)isO(N M 4)","venue":null,"work_id":"9ae2bce2-44f7-496c-ad81-6cb296d53252","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.101936Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:671da1a4a8ce733f69cffb42593908512b9956f9dfa1b858e824e1e095a586f9","observation_id":"a1155b3f-2820-428b-b84c-3a00e9623f46","resolution":{"observed_at":"2026-08-06T11:56:09.217667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.204247Z","title":"Multiplication with∇ yj di k +V i k+1 adds anotherO(M 2)operations for eachj","venue":null,"work_id":"7f5e14f0-47af-4bdf-ac35-4cd77e7a1b22","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.104878Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:825c13e7c50c4cf279d4dfc4c72b3d40d80f48666892894d81ea8ced63bc2072","observation_id":"a7ffb0a3-13ed-486a-a407-4c9cd928d00e","resolution":{"observed_at":"2026-08-06T11:56:09.207835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.194122Z","title":"Further, repeating these operations for each1≤k≤Mresults in a total ofO(M 4)operations","venue":null,"work_id":"a6323e9a-bf3b-43f0-956f-2ece0aa67533","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.107814Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:6719a0bb43e6213e1102189b4d2577b5f6d0df6c2e269a13959116a4afb11b4f","observation_id":"421bcda2-cc36-4e09-a871-cf0815ac7618","resolution":{"observed_at":"2026-08-06T11:56:09.197434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.184785Z","title":null,"venue":null,"work_id":"25f153dc-d029-473f-b85e-79c83e51db88","year":null},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.110750Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:afa480fa5eeded0c16a301f86f66d84bf362fba646a28567015edd1c9a28e901","observation_id":"691885c4-1d2f-4bc8-9692-9a91de72dff8","resolution":{"observed_at":"2026-08-06T11:56:09.188098Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","snapshot_observed_at":"2026-08-08T18:12:53.602154Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03012","snapshot_observed_at":"2026-08-06T11:56:09.076671Z","title":"InProceedings of the 26th An- nual International Conference on Machine Learning, ICML ’09, 41–48","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.076671Z"},"links":{"cited_paper":"/paper/2103.03012","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:6ba26c090d51763d91e011d9423f05eb31072017000415c5c74bd74856e16261","observation_id":"7dd7d721-b344-4dcc-8e95-e1013fcc2e48","resolution":{"observed_at":"2026-08-06T11:56:09.076671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09940","last_updated":"2017-01-12T23:55:36Z","snapshot_observed_at":"2026-07-06T05:20:39.825511Z","submitted_at":"2016-11-29T23:22:39Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09940","snapshot_observed_at":"2026-08-06T11:56:09.072941Z","title":"arXiv:1611.09940","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.072941Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:8b0c3e70414e735c1507548e73deca579a90a99804418a5058bd19271ae83df1","observation_id":"e09aee4e-87ae-44c0-aaa1-41387e775e64","resolution":{"observed_at":"2026-08-06T11:56:09.072941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04240","last_updated":"2018-05-21T18:25:38Z","snapshot_observed_at":"2026-07-06T06:22:59.316032Z","submitted_at":"2018-02-12T18:41:57Z","title":"Reinforcement Learning for Solving the Vehicle Routing Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04240","snapshot_observed_at":"2026-08-06T11:56:09.083912Z","title":"arXiv:1802.04240","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.083912Z"},"links":{"cited_paper":"/paper/1802.04240","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:a7ff594e4f084339f59794b6399087fecbb8bc2af8f8032aab55bc1b12a860c9","observation_id":"a901520e-3774-4572-9a5e-c0090f4012a1","resolution":{"observed_at":"2026-08-06T11:56:09.083912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03313","last_updated":"2023-09-28T21:06:39Z","snapshot_observed_at":"2026-08-04T22:41:30.396161Z","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":"2301.03313","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.03313","snapshot_observed_at":"2026-08-06T11:56:09.158088Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","venue":"cs.LG","work_id":"736b30b4-e01f-4ae7-9278-eb19a4882f74","year":2023},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.080195Z"},"links":{"cited_paper":"/paper/2301.03313","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:af760503625335167439b3e2badff9fc87071505abfe8289c24d7f6982ad232a","observation_id":"e1149fa9-f330-49b3-aeb2-406d9c41d93d","resolution":{"observed_at":"2026-08-06T11:56:09.162352Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:56:09.254612Z","title":"Basiri, S.; Tiwari, D.; Papachristos, C.; and Salapaka, S","venue":null,"work_id":"01bf6e5f-8f8d-4371-b92a-e40f9543a9eb","year":2024},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.069375Z"},"links":{"citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:bcbaeae7992ec8c07c337a1929b663dbe388a3a4800e9477c5c3b3b856d7b8cf","observation_id":"eec56a8f-186b-4b51-9288-1dca41cd6400","resolution":{"observed_at":"2026-08-06T11:56:09.257309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08224","last_updated":"2024-07-21T10:18:30Z","snapshot_observed_at":"2026-08-08T23:57:36.913591Z","submitted_at":"2023-12-13T15:46:58Z","title":"GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time","version":2},"cited_work":{"arxiv_id":"2312.08224","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.08224","snapshot_observed_at":"2026-08-06T11:56:09.134700Z","title":"GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time","venue":"cs.AI","work_id":"b4372730-f211-4e1e-a5ad-9ff1d68e46ed","year":2023},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.088319Z"},"links":{"cited_paper":"/paper/2312.08224","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:a4c5ba64e2f7b96d847beed35d7c3035135966baa19ff3248d246d84157f11c2","observation_id":"928b4658-fb04-4676-8ff5-c41ceb1196e2","resolution":{"observed_at":"2026-08-06T11:56:09.139842Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":13},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2507.22338."}