{"as_of":"2026-08-11T16:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee32302c4826b87097fd10e8432d16f809b13e59f9766b985b3a414ee2d85684","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-11T12:00:51.178407Z","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-07T13:57:40.340365Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.17540","last_updated":"2022-10-31T17:54:51Z","snapshot_observed_at":"2026-08-11T13:57:40.233505Z","submitted_at":"2022-10-31T17:54:51Z","title":"Agent-Time Attention for Sparse Rewards Multi-Agent Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17540","snapshot_observed_at":"2026-08-11T12:00:51.178407Z","title":"Agent-time attention for sparse rewards multi-agent reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14779","last_updated":"2024-12-19T12:05:13Z","snapshot_observed_at":"2026-08-11T11:53:29.230650Z","submitted_at":"2024-12-19T12:05:13Z","title":"Agent-Temporal Credit Assignment for Optimal Policy Preservation in Sparse Multi-Agent Reinforcement Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T12:00:51.178407Z"},"links":{"cited_paper":"/paper/2210.17540","citing_paper":"/paper/2412.14779"},"observation_digest":"sha256:f40d2c41b575261d3831dd68d1975524eb2021b4df6c77e25c6d10e54387ce58","observation_id":"4e647167-2af0-4239-bca4-02e8937b152b","resolution":{"observed_at":"2026-08-11T12:00:51.178407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17540","last_updated":"2022-10-31T17:54:51Z","snapshot_observed_at":"2026-08-11T13:57:40.233505Z","submitted_at":"2022-10-31T17:54:51Z","title":"Agent-Time Attention for Sparse Rewards Multi-Agent Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17540","snapshot_observed_at":"2026-08-10T22:17:51.467579Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.02174","last_updated":"2025-01-04T03:29:15Z","snapshot_observed_at":"2026-08-11T02:15:15.609473Z","submitted_at":"2025-01-04T03:29:15Z","title":"TACTIC: Task-Agnostic Contrastive pre-Training for Inter-Agent Communication","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:51.467579Z"},"links":{"cited_paper":"/paper/2210.17540","citing_paper":"/paper/2501.02174"},"observation_digest":"sha256:2af582e70f16ad9cf6c6cedcddc8f01b5418510e6eae9ce03813c20e30941a4e","observation_id":"42bf4eb4-6e1a-4074-bb89-82e345da14b9","resolution":{"observed_at":"2026-08-10T22:17:51.467579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17540","last_updated":"2022-10-31T17:54:51Z","snapshot_observed_at":"2026-08-11T13:57:40.233505Z","submitted_at":"2022-10-31T17:54:51Z","title":"Agent-Time Attention for Sparse Rewards Multi-Agent Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2210.17540","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.17540","snapshot_observed_at":"2026-08-07T13:57:40.340365Z","title":"Agent-Time Attention for Sparse Rewards Multi-Agent Reinforcement Learning","venue":"cs.LG","work_id":"8c3e0e17-c58e-4831-8bc7-9149c2e000ea","year":2022},"citing_paper":{"arxiv_id":"2505.20579","last_updated":"2026-07-18T20:07:20Z","snapshot_observed_at":"2026-08-07T13:49:07.327912Z","submitted_at":"2025-05-26T23:28:52Z","title":"The challenge of hidden gifts in multi-agent reinforcement learning","version":7},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T13:57:39.909858Z"},"links":{"cited_paper":"/paper/2210.17540","citing_paper":"/paper/2505.20579"},"observation_digest":"sha256:936f42b3f19874709957ce8ffef6245e2a6b9d1e63d16acb9a970295c9df9ebc","observation_id":"e3603498-d8ec-4585-ae22-691096eaa45e","resolution":{"observed_at":"2026-08-07T13:57:40.393765Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.17540/citation-record","integrity":"/paper/2210.17540/integrity","json":"/paper/2210.17540/citation-record.json","paper":"/paper/2210.17540"},"outbound":[],"paper":{"arxiv_id":"2210.17540","last_updated":"2022-10-31T17:54:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T13:57:40.233505Z","submitted_at":"2022-10-31T17:54:51Z","title":"Agent-Time Attention for Sparse Rewards Multi-Agent Reinforcement Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2210.17540."}