{"as_of":"2026-08-19T05:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e944dd7d6a214fcad79b1458c483a7dc7e7d5dd9b4b50762181f421b3f1a255c","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:52:33.530541Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2505.08630/citation-record","integrity":"/paper/2505.08630/integrity","json":"/paper/2505.08630/citation-record.json","paper":"/paper/2505.08630"},"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-15T21:52:33.841970Z","title":"Hindsight experience replay","venue":null,"work_id":"08ae6ffc-9289-4437-97f4-c9af37fc8a5c","year":2017},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.440095Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:98fe76bababe726318bf25fbba4d6b6dcf7dc19c768895e779b920a8d6d57f84","observation_id":"8d33b721-84bd-412a-8a1d-f662866ae52e","resolution":{"observed_at":"2026-08-15T21:52:33.845118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.783617Z","title":"MASER: multi-agent rein- forcement learning with subgoals generated from experi- ence replay buffer","venue":null,"work_id":"f97254d3-ecbd-497a-945c-e593370134e8","year":2022},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.462537Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:8e333a0170831f3fa8794f25473c19d73b405afb0b58db27b4bd8b6edaf74428","observation_id":"8c9e9d1e-5b66-4c77-9e42-c9aa25e6b46d","resolution":{"observed_at":"2026-08-15T21:52:33.787734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.772740Z","title":"Fox: Formation-aware explo- ration in multi-agent reinforcement learning","venue":null,"work_id":"95dba6f5-7616-4a5e-86a3-d1033c5cfa7b","year":2024},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.465716Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:5bd503c7227e71192f46e23b1f75ccda98b0f83fafb007ec64054bc5ac636a83","observation_id":"bf7b0812-4807-43e6-be3d-2f99bf960837","resolution":{"observed_at":"2026-08-15T21:52:33.776092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.751971Z","title":"Estimating mu- tual information","venue":null,"work_id":"c0d13170-a5d6-4ccf-b0e2-b79a7669310c","year":2004},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.471674Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:5147dc5e436ee850b21dcd60cc892aeba0628f53cf3e180e007afc34037e56cf","observation_id":"7a296d3b-10bb-46df-bd0b-5d5c9e21465f","resolution":{"observed_at":"2026-08-15T21:52:33.755474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.728816Z","title":"Multi-agent actor-critic for mixed cooperative-competitive environ- ments","venue":null,"work_id":"a49ec84f-bb74-4296-83a9-182774209aea","year":2017},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.477683Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:f7801062fbc743530bf060361afd827aa015545cfbbab445bd2fa0483abef691","observation_id":"54b54c3c-8eea-42af-aa7d-d05a99853d2c","resolution":{"observed_at":"2026-08-15T21:52:33.732260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.480921Z","title":"Oliehoek and Christo- pher Amato","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.480921Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:a2df8fc691bbec860f1edb0ceb67e701952f337ebf05378d5f6c7a25714bff5a","observation_id":"ad13d294-46f9-4c79-b3cd-6651fa657bd4","resolution":{"observed_at":"2026-08-15T21:52:33.480921Z","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-15T21:52:33.696729Z","title":"Foerster, and Shimon Whiteson","venue":null,"work_id":"1ebe7f4c-11af-4577-8f7f-c8e894019b13","year":2018},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.493959Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:5ddd974e89fb540756bb4a52b25112096e53708792ca574c6a26fa46d30766b2","observation_id":"90f398cc-94ed-4c3e-b51e-ee4dcb24ec8e","resolution":{"observed_at":"2026-08-15T21:52:33.699755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.687464Z","title":"Changing the environment based on em- powerment as intrinsic motivation","venue":null,"work_id":"a996e23d-9af0-43ee-8975-e494862e43bd","year":2014},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.497140Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:799dd49594ccadea9caeb6c9d1ecb7607a14cd86e383a9c08b8af39799f48dcb","observation_id":"43e5dcd1-eeca-4d97-87c7-f3f52c19b38d","resolution":{"observed_at":"2026-08-15T21:52:33.690806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.640117Z","title":"Strehl and Michael L","venue":null,"work_id":"72206e48-3d5b-44f4-8be7-4cd37b907213","year":2008},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.512664Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:b5bc2b1390254356dc672d2c45189afcaddd298bdd30656d813188f9f51dafef","observation_id":"fc12bb86-cdf8-4737-99eb-d0717e102de0","resolution":{"observed_at":"2026-08-15T21:52:33.643027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.629830Z","title":"Sutton, Joseph Modayil, Michael Delp, Thomas Degris, Patrick M","venue":null,"work_id":"bd11e8bb-d9c9-4bc4-9587-22355aef73fb","year":2011},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.515808Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:0d033a73f782fd4ff927331eff904cd785e1d4f153b8bfce1e2527139939f366","observation_id":"95951287-c944-4b7b-91de-606143ea3300","resolution":{"observed_at":"2026-08-15T21:52:33.633340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.614917Z","title":"#exploration: A study of count-based exploration for deep reinforcement learning","venue":null,"work_id":"44861836-8869-42c1-a436-d51700c1ae30","year":2017},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.518980Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:6e52b1de9af16451edda21cf8e92161d91c71e188b8b2caff780fe261c457f54","observation_id":"dc417c25-ab75-481a-95bb-1ae0f538fd5c","resolution":{"observed_at":"2026-08-15T21:52:33.621384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.605345Z","title":"DOP: off-policy multi-agent decomposed policy gradients","venue":null,"work_id":"a97bb315-17a8-4d1f-9c81-86ef3b4afded","year":2021},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.522044Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:a56bd550f558ec5cdcea50718f418062304b3538f0f87b9ab654e0566e141f33","observation_id":"d1ee24a8-e59d-4b98-91d2-5c6f475ae71d","resolution":{"observed_at":"2026-08-15T21:52:33.608616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.585440Z","title":"Hierarchical multi- agent skill discovery","venue":null,"work_id":"791475a4-b7e9-41fc-872c-dba12899f0da","year":2024},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.527974Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:2be0d482994de68af57558f208aba3a91efd7682d160666e3bd3de7b23cdb235","observation_id":"f2e8ed37-2a3b-4d49-94b7-ff21e90df10a","resolution":{"observed_at":"2026-08-15T21:52:33.588763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.573851Z","title":"To- ward socially friendly autonomous driving using multi- agent deep reinforcement learning","venue":null,"work_id":"de47df2a-2d3d-4800-a4a0-1bffc931c53b","year":2024},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.530541Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:1f5bfc2c6e4d90ebfc9749a9ce5f6717a54b87c64c787b7e2ca0201fe088c916","observation_id":"52432704-367b-4d2c-b71f-70ad5add46ca","resolution":{"observed_at":"2026-08-15T21:52:33.578968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.648680Z","title":"QTRAN: learn- ing to factorize with transformation for cooperative multi- agent reinforcement learning","venue":null,"work_id":"e141728d-573a-43ca-85a1-886292dc9c12","year":2019},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":1959,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.509660Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:4c33c8b55d7de25c2964cb8b3d087cb98f933a79594f322a5b164aaaf56b12fc","observation_id":"bd48d811-0a9e-4bba-889e-d921efe53cc3","resolution":{"observed_at":"2026-08-15T21:52:33.651507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.823719Z","title":"Autotelic agents with intrinsically motivated goal-conditioned reinforce- ment learning: A short survey","venue":null,"work_id":"95237a64-6d0e-4abb-90b6-895a742c6e85","year":2022},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.446100Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:deacc853c013d3af08f76115e667676b614ce6db8a219d338bb91b3f84af95bd","observation_id":"6d0cf810-8b2e-4cab-a728-c8fc1ec4bada","resolution":{"observed_at":"2026-08-15T21:52:33.827388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.739708Z","title":"Taylor, Wenyuan Tao, and Zhen Wang","venue":null,"work_id":"1bf88cb8-f10f-4b71-bc07-21dc45fd6584","year":2022},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.474638Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:7bd995aa9e567acf7994dc29e3181f45a68b72419ec94828143dcaab2a809644","observation_id":"cc2d02e6-ffea-4f98-bff9-31678768c56c","resolution":{"observed_at":"2026-08-15T21:52:33.743438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.705474Z","title":"Efficient planning for factored infinite-horizon dec-pomdps","venue":null,"work_id":"71a3baf7-9e6c-4679-b000-587db432acdf","year":2011},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.487097Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:fd1a257bc8208e8da869f65c4d01d591357cfe60164ad8786c73eb52ebdff97b","observation_id":"e0f9e724-bbfd-4370-8694-06bc4bf7432f","resolution":{"observed_at":"2026-08-15T21:52:33.708714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.01072","last_updated":"2024-07-04T09:32:18Z","snapshot_observed_at":"2026-08-16T14:38:15.995170Z","submitted_at":"2023-12-02T08:49:51Z","title":"A Survey of Temporal Credit Assignment in Deep Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.01072","snapshot_observed_at":"2026-08-15T21:52:33.490521Z","title":"A survey of temporal credit assignment in deep reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.490521Z"},"links":{"cited_paper":"/paper/2312.01072","citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:0d51693e8df4881ca38b41efe4b203273fdf6d7d074a290ba61b5b0049c60406","observation_id":"b4199dbf-a63e-43ac-abaf-b87a4627bfe1","resolution":{"observed_at":"2026-08-15T21:52:33.490521Z","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-15T21:52:33.678663Z","title":null,"venue":null,"work_id":"2c9f9b2b-4e99-4ee8-8638-6a7defbd0ae4","year":2019},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.500245Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:c31520f6793a93290c03b25c67deba681a880ec49e00d4709329af6d7c816f06","observation_id":"0d41d978-e118-4580-b4bf-e0e6d54dc0e5","resolution":{"observed_at":"2026-08-15T21:52:33.682298Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.658270Z","title":"Coding theorems for a discrete source with a fidelity criterion.IRE Nat","venue":null,"work_id":"113f487d-ecf9-483d-8124-7376f6635267","year":1959},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.506566Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:26dd66b5ce46e85f493caa84743e010926949a3eb97ead73262369d8a411a61e","observation_id":"3710980e-c7ab-473f-baa2-96b0978be5ce","resolution":{"observed_at":"2026-08-15T21:52:33.662061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.714341Z","title":"Exploit- ing locality of interaction in factored dec-pomdps","venue":null,"work_id":"6ce8940d-38b0-4d4c-b857-f11ffb4c5637","year":2008},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.484057Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:819388030f06f76965b9e833738d1f86409beac14dcf9908266ecd6ef9f68382","observation_id":"3314bfcd-4cbd-48c2-a886-1d663410bf2c","resolution":{"observed_at":"2026-08-15T21:52:33.717154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.833204Z","title":"Parsing reward","venue":null,"work_id":"8951e676-6987-45e5-a525-73db08fffbb3","year":2003},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.443276Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:90b74bbe962cac7236bfc04a73e10099d455530fba27be81a6d8c7de2d86a526","observation_id":"ce8dea01-4790-4a52-9475-8eb3653678e1","resolution":{"observed_at":"2026-08-15T21:52:33.836220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.794594Z","title":"ALMA: hierarchical learning for composite multi- agent tasks","venue":null,"work_id":"069210e0-10af-4b56-b346-f1baef554680","year":2022},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.459258Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:99854cb1056a3140eb61ad51e02de4015a40c0b2b987e4ef3b5ac6b23b8453fc","observation_id":"77e69a23-7231-4d3f-b7b7-2a5e8ce06845","resolution":{"observed_at":"2026-08-15T21:52:33.797863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.669255Z","title":"Universal value function ap- proximators","venue":null,"work_id":"dffbe2d0-c88b-4648-ac96-b871c9e71be8","year":2015},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.503382Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:134056842afeff85d5a7bf2a95f5c6aac5b7d390601f1fbdf2107dd7ee2c7c7e","observation_id":"37a95d83-e900-4e1f-bf28-1387319f1dc3","resolution":{"observed_at":"2026-08-15T21:52:33.672616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.804166Z","title":"Foerster, Gregory Farquhar, Triantafyllos Afouras, Nantas Nardelli, and Shimon Whiteson","venue":null,"work_id":"c77bc03f-7843-4f83-bf75-67c6a61cca2f","year":2018},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.455860Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:eb74840bc1dd61489270624742d41c8fe16d2378b711ce2e34917ea335a7c5d6","observation_id":"acc543df-97eb-44fb-a671-4144f2569ba9","resolution":{"observed_at":"2026-08-15T21:52:33.807607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.595902Z","title":"CM3: coop- erative multi-goal multi-stage multi-agent reinforcement learning","venue":null,"work_id":"bc26ca64-1c4e-4d1b-8831-8df1ab2fda87","year":2020},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.525478Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:7f8d978d96d3634e8efc62215eb94f70d143dcc90f652ec2e5f7d05ddead331d","observation_id":"867f3fd1-1a03-427a-958d-a0970ae7871e","resolution":{"observed_at":"2026-08-15T21:52:33.599270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:52:33.813693Z","title":"An empowerment-based solution to robotic manipulation tasks with sparse rewards","venue":null,"work_id":"5f011388-b0ee-485f-9e25-2d71e0fd5da3","year":2023},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.448823Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:b36c2c5cf0d12f6746a49866030fd9ce9d735436bd73090ac481176c4d781dc1","observation_id":"aece811e-bb72-446c-ae15-667ab0db607b","resolution":{"observed_at":"2026-08-15T21:52:33.817320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.09533","last_updated":"2020-11-18T20:29:59Z","snapshot_observed_at":"2026-08-19T03:09:02.515007Z","submitted_at":"2020-11-18T20:29:59Z","title":"Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.09533","snapshot_observed_at":"2026-08-15T21:52:33.451781Z","title":"Is independent learning all you need in the starcraft multi-agent challenge? arXiv preprint arXiv:2011.09533,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.451781Z"},"links":{"cited_paper":"/paper/2011.09533","citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:65c1df9c2f71eec9e8aa54bfba9ff9373f7cdba24218be0ccf63479653230f4c","observation_id":"57df9bec-3c6f-4a60-bb62-06c076368d90","resolution":{"observed_at":"2026-08-15T21:52:33.451781Z","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-15T21:52:33.762351Z","title":"Multi- target pursuit by a decentralized heterogeneous UA V swarm using deep multi-agent reinforcement learning","venue":null,"work_id":"ee1a1364-f2c2-4e72-b8a9-f0bd2a6dda58","year":2023},"citing_paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T21:52:33.468577Z"},"links":{"citing_paper":"/paper/2505.08630"},"observation_digest":"sha256:0030ce184a6d08ee467b7fa2dac4185c4a35c9fd9be09bdae80f281a44732a8e","observation_id":"f24a31fb-8c09-4cb1-bc21-53a4affc4404","resolution":{"observed_at":"2026-08-15T21:52:33.766162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.08630","last_updated":"2026-08-01T09:57:23Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T16:27:39.505215Z","submitted_at":"2025-05-13T14:49:26Z","title":"Credit Assignment and Efficient Exploration based on Influence Scope in Multi-agent Reinforcement Learning"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":30},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2505.08630."}