{"as_of":"2026-08-14T06:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a26be73afb694d94bf7e64a949c881dda42ecfab6045a99075b339d5421390a7","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:25:25.110674Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-07T04:53:58.024541Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T04:50:57.860884Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13200","snapshot_observed_at":"2026-08-07T04:53:58.024541Z","title":"Srmt: Shared memory for multi- agent lifelong pathfinding.arXiv preprint arXiv:2501.13200, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09335","last_updated":"2025-06-11T02:28:05Z","snapshot_observed_at":"2026-08-12T06:24:00.342180Z","submitted_at":"2025-06-11T02:28:05Z","title":"Intelligent System of Emergent Knowledge: A Coordination Fabric for Billions of Minds","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:53:58.024541Z"},"links":{"cited_paper":"/paper/2501.13200","citing_paper":"/paper/2506.09335"},"observation_digest":"sha256:28606321d6ae2190af73d47dbbdbe82c1680d9e20117c3ff1f505dee35bf8f8b","observation_id":"7170be84-cc64-46dd-a0f6-e6275288ac3f","resolution":{"observed_at":"2026-08-07T04:53:58.024541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13200","snapshot_observed_at":"2026-08-03T09:21:41.180269Z","title":"Srmt: shared memory for multi-agent lifelong pathfinding.arXiv preprint arXiv:2501.13200, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.14192","last_updated":"2026-07-03T11:26:58Z","snapshot_observed_at":"2026-08-13T05:52:46.252093Z","submitted_at":"2026-01-20T17:51:56Z","title":"Toward Efficient Agents: Memory, Tool learning, and Planning","version":2},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-03T09:21:41.180269Z"},"links":{"cited_paper":"/paper/2501.13200","citing_paper":"/paper/2601.14192"},"observation_digest":"sha256:ec3e4c1b5b18ad37f68592b44b802cb651bb902dc4c75c5435844ccf976c85c5","observation_id":"037115ae-afd1-4461-9fea-5a02ad58a8ec","resolution":{"observed_at":"2026-08-03T09:21:41.180269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"cited_work":{"arxiv_id":"2501.13200","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13200","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2501.13200 , year=","venue":null,"work_id":"dd32274e-29b7-4ee8-be56-07b41763bc5a","year":null},"citing_paper":{"arxiv_id":"2605.06825","last_updated":"2026-05-07T18:27:15Z","snapshot_observed_at":"2026-08-12T18:36:04.118802Z","submitted_at":"2026-05-07T18:27:15Z","title":"Randomness is sometimes necessary for coordination","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-11T01:01:38.215613Z"},"links":{"cited_paper":"/paper/2501.13200","citing_paper":"/paper/2605.06825"},"observation_digest":"sha256:1985153b0b40c6024d794b4b8bd3bd9cec99ffc708f257f2fbd824abf37de516","observation_id":"d0377c70-6739-44cd-abee-6e15769c4ade","resolution":{"observed_at":"2026-05-11T04:50:57.864283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13200/citation-record","integrity":"/paper/2501.13200/integrity","json":"/paper/2501.13200/citation-record.json","paper":"/paper/2501.13200"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.01202","last_updated":"2019-06-04T05:36:43Z","snapshot_observed_at":"2026-08-09T14:15:10.979002Z","submitted_at":"2019-06-04T05:36:43Z","title":"Learning Transferable Cooperative Behavior in Multi-Agent Teams","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01202","snapshot_observed_at":"2026-08-10T16:25:25.030440Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.030440Z"},"links":{"cited_paper":"/paper/1906.01202","citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:849839b76909f05991b838d6ad46de79846ba34d855fd23aeb2a77c84f25728e","observation_id":"e40635fe-ead3-4ce3-89f4-ed42521706ee","resolution":{"observed_at":"2026-08-10T16:25:25.030440Z","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-10T16:25:25.389313Z","title":"Multi-agent path finding with prioritized communication learning","venue":null,"work_id":"34a4c70a-4ddc-4f85-9ef9-e1372e4d0c6b","year":2022},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.067924Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:451b8ae927230dd34b9fcbafc074677ef90a0cc058aef49ade09ec23db5dd080","observation_id":"4f615eeb-48c3-40dc-a352-b7090074caf1","resolution":{"observed_at":"2026-08-10T16:25:25.394640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T16:25:25.374167Z","title":"Distributed heuristic multi-agent path finding with com- munication","venue":null,"work_id":"ca9ffb97-ead6-45f6-8c3b-4020fd7af2ef","year":2021},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.072519Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:24df48d354120f63024b06e6a9fc2c826ad8e9d95c72d2ef46c5237eabddce43","observation_id":"7ae7d7e4-0f14-4d35-a579-6eed05402bab","resolution":{"observed_at":"2026-08-10T16:25:25.378842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.02127","last_updated":"2023-05-16T15:17:46Z","snapshot_observed_at":"2026-08-13T13:49:47.086860Z","submitted_at":"2022-11-03T20:02:45Z","title":"Scalable Multi-Agent Reinforcement Learning through Intelligent Information Aggregation","version":3},"cited_work":{"arxiv_id":"2211.02127","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.02127","snapshot_observed_at":"2026-08-10T16:25:25.175975Z","title":"Scalable Multi-Agent Reinforcement Learning through Intelligent Information Aggregation","venue":"cs.MA","work_id":"3b3ec4fe-dac2-4124-91f6-ffdfe4fe195a","year":2022},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.077416Z"},"links":{"cited_paper":"/paper/2211.02127","citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:6f600b5607560face5352a385fcb7314473255fb8dfcc8150e6170a64c8d449c","observation_id":"d2833f95-661c-4e4d-9bb4-d2a6d83f4b7c","resolution":{"observed_at":"2026-08-10T16:25:25.183908Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T16:25:25.354955Z","title":"Sukhatme, and Vladlen Koltun","venue":null,"work_id":"9d5fef5b-0387-466c-80b0-9570ceba4072","year":2020},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.082285Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:76693d24ad11b4d6a03b06cdc57019c6c1a9eb305e7294511ac16612011a77a2","observation_id":"7bab9856-9ce9-4e94-9efd-a58dfc031931","resolution":{"observed_at":"2026-08-10T16:25:25.361481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.14931","last_updated":"2025-04-08T08:14:39Z","snapshot_observed_at":"2026-08-12T23:18:03.693842Z","submitted_at":"2024-07-20T16:37:21Z","title":"POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.14931","snapshot_observed_at":"2026-08-10T16:25:25.095134Z","title":"Pogema: A benchmark platform for cooperative multi-agent navigation, 2024a","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.095134Z"},"links":{"cited_paper":"/paper/2407.14931","citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:410200515856d269d47ae5202416c6face12c7b362a6d6f1fe332f9cc362b3fd","observation_id":"4cf900b7-e5d5-4744-a4d7-21a31ca794d0","resolution":{"observed_at":"2026-08-10T16:25:25.095134Z","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-10T16:25:25.339153Z","title":"Value-decomposition networks for cooperative multi-agent learning based on team reward","venue":null,"work_id":"13165543-86fe-4955-98a2-e781b95e7b9e","year":null},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.101739Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:24025acb6e1be80f95cbc68b3d9dd3941fc704de7a323223f6c10af1cbcebc7c","observation_id":"6a640576-1c96-4bb2-bb58-01fc5931ff96","resolution":{"observed_at":"2026-08-10T16:25:25.344323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T16:25:25.325103Z","title":"Reciprocal velocity obstacles for real-time multi-agent navigation","venue":null,"work_id":"ffefd33a-13e7-41dd-a415-1f93e2f33b38","year":2008},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.106090Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:54179cacd3cb500e7e31c9cd9072765d8bad7f7c4125fc713bb9e9253bfc8010","observation_id":"c9614943-5588-4e80-8712-ac3f4b1a4b6a","resolution":{"observed_at":"2026-08-10T16:25:25.329709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T16:25:25.403508Z","title":"Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun","venue":null,"work_id":"22067c0f-c0e7-4f22-8933-d2f53f360dce","year":2016},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.050890Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:cc4aaed7efb928210105b97596f0fdef1af3c87893bcc03c75d25ce06ed490bc","observation_id":"c5345dd0-8903-42ae-9854-ca314a9b86cd","resolution":{"observed_at":"2026-08-10T16:25:25.408848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T16:25:25.312005Z","title":"Jianhao Wang, Zhizhou Ren, Terry Liu, Yang Yu, and Chongjie Zhang.{QPLEX}: Duplex dueling multi-agent q-learning","venue":null,"work_id":"ec10a5d3-292e-4e94-97bd-86beccf8de26","year":2017},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.110674Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:809aa1924c974aa591c85c6858fd2e95e790d3f82a3e7a173c4035cf3fe7cc4c","observation_id":"45c2761e-0ff7-4d4a-834c-29fa0fd4b0e3","resolution":{"observed_at":"2026-08-10T16:25:25.316377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02912","last_updated":"2019-05-27T23:28:13Z","snapshot_observed_at":"2026-08-13T23:52:50.520146Z","submitted_at":"2018-10-05T23:45:14Z","title":"Actor-Attention-Critic for Multi-Agent Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02912","snapshot_observed_at":"2026-08-10T16:25:25.063464Z","title":"Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W Durham, TK Satish Kumar, and Sven Koenig","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.063464Z"},"links":{"cited_paper":"/paper/1810.02912","citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:74981f87801913f892ef7db3600003c762dcf40cabcb1432fb820e44beb3be2c","observation_id":"e1cabae5-5e99-4ad7-8c56-d3df09e14fac","resolution":{"observed_at":"2026-08-10T16:25:25.063464Z","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-10T16:25:25.438054Z","title":null,"venue":null,"work_id":"d2fdd620-7bdc-4af5-b88e-ac8f0ef0166a","year":1906},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.035437Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:d08fcdd06e2cc37675a159c3544df31735ec1bfb10427ff58d87f4053ab56bc5","observation_id":"255dc6bc-552d-45d6-a79f-2b3dfaabc61c","resolution":{"observed_at":"2026-08-10T16:25:25.442977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01822","last_updated":"2018-06-28T15:12:50Z","snapshot_observed_at":"2026-07-06T06:43:09.251512Z","submitted_at":"2018-06-05T17:24:46Z","title":"Relational recurrent neural networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01822","snapshot_observed_at":"2026-08-10T16:25:25.088931Z","title":"Rae, Mike Chrzanowski, Theophane Weber, Daan Wierstra, Oriol Vinyals, Razvan Pascanu, and Timothy P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.088931Z"},"links":{"cited_paper":"/paper/1806.01822","citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:ce9de6e66a0d63c30d94be8bd4078a948b44253cfeaeacc887b1c26c5382a282","observation_id":"30414aa8-87f8-4a09-8948-be95a5d04b64","resolution":{"observed_at":"2026-08-10T16:25:25.088931Z","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-10T16:25:25.417194Z","title":"Egor Cherepanov, Alexey Staroverov, Dmitry Yudin, Alexey K","venue":null,"work_id":"9ee80a10-ccc6-4ce0-adc7-9069ea533b0a","year":2021},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.045725Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:d7499390b6e6d566ee59e0b6bdb0b375d96a5a6319f568ef87e8eb1991e34d63","observation_id":"02844daa-3c3f-4e0e-8641-6276de177994","resolution":{"observed_at":"2026-08-10T16:25:25.421779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11527","last_updated":"2021-02-16T08:06:47Z","snapshot_observed_at":"2026-08-06T15:16:24.323857Z","submitted_at":"2020-06-20T09:06:27Z","title":"Memory Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.11527","snapshot_observed_at":"2026-08-10T16:25:25.040064Z","title":"Memory transformer","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.040064Z"},"links":{"cited_paper":"/paper/2006.11527","citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:fc552e712b69940b75d5cc62cf8b9a565f97f473eff72ad96e6958ba40aa5c4c","observation_id":"2f58ef98-16de-4205-866a-834a77060888","resolution":{"observed_at":"2026-08-10T16:25:25.040064Z","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-10T16:25:25.057593Z","title":"Shariq Iqbal and Fei Sha","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T16:25:25.057593Z"},"links":{"citing_paper":"/paper/2501.13200"},"observation_digest":"sha256:927f31ec2ff01d5fac0f89da9cd2a1b8084304d766e9a1aabba3bc51324be03a","observation_id":"38659a13-ada9-465a-9b54-479fd6ace4a4","resolution":{"observed_at":"2026-08-10T16:25:25.057593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.13200","last_updated":"2025-01-22T20:08:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T21:22:44.791806Z","submitted_at":"2025-01-22T20:08:53Z","title":"SRMT: Shared Memory for Multi-agent Lifelong Pathfinding"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":16},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 3 inbound Pith citation observations for arXiv:2501.13200."}