{"as_of":"2026-08-11T09:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa4c3ade619b6a0375bd1a79e0dfd5e600f920d8e922db46ff982ff4a335182f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:34:10.697605Z","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-07-02T13:16:58.857110Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.10740","last_updated":"2024-10-04T16:08:52Z","snapshot_observed_at":"2026-08-05T10:46:58.423676Z","submitted_at":"2024-04-16T17:13:08Z","title":"N-Agent Ad Hoc Teamwork","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.10740","snapshot_observed_at":"2026-08-09T12:34:10.697605Z","title":"arXiv:2404.10740 [cs.AI] APPENDIX A ALGORITHMS We provide an implementation for solving the maximin utility/minimax regret problems when the game is unknown, in Algorithm 2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02377","last_updated":"2025-02-04T14:57:54Z","snapshot_observed_at":"2026-08-10T07:39:15.177961Z","submitted_at":"2025-02-04T14:57:54Z","title":"A Minimax Approach to Ad Hoc Teamwork","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T12:34:10.697605Z"},"links":{"cited_paper":"/paper/2404.10740","citing_paper":"/paper/2502.02377"},"observation_digest":"sha256:3cc9f54d1dfdc5039ff688c8a3a5d9f608bd0c79a91aa9306b23a3245c6a7412","observation_id":"b1ecec82-8927-43af-833c-fe92a44d8e29","resolution":{"observed_at":"2026-08-09T12:34:10.697605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10740","last_updated":"2024-10-04T16:08:52Z","snapshot_observed_at":"2026-08-05T10:46:58.423676Z","submitted_at":"2024-04-16T17:13:08Z","title":"N-Agent Ad Hoc Teamwork","version":3},"cited_work":{"arxiv_id":"2404.10740","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.10740","snapshot_observed_at":"2026-07-02T13:16:58.857110Z","title":"arXiv preprint arXiv:2404.10740 , year=","venue":null,"work_id":"afa6b72c-5a0a-4845-838c-9341c8dd9241","year":null},"citing_paper":{"arxiv_id":"2606.06399","last_updated":"2026-06-06T00:36:15Z","snapshot_observed_at":"2026-08-03T06:53:51.298015Z","submitted_at":"2026-06-04T17:06:22Z","title":"CollabSim: A CSCW-Grounded Methodology for Investigating Collaborative Competence of LLM Agents through Controlled Multi-Agent Experiments","version":2},"reference_index":117,"source":"arxiv_source","source_observed_at":"2026-06-28T01:25:51.788544Z"},"links":{"cited_paper":"/paper/2404.10740","citing_paper":"/paper/2606.06399"},"observation_digest":"sha256:5f3a6f834d498901b99dfdb20de017d340e6a334633043ae7c0cb49c47d75349","observation_id":"4169f370-7ce4-4a62-a174-a86b57a4ee2c","resolution":{"observed_at":"2026-07-02T13:16:58.858494Z","resolver_source":"arxiv_id","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/2404.10740/citation-record","integrity":"/paper/2404.10740/integrity","json":"/paper/2404.10740/citation-record.json","paper":"/paper/2404.10740"},"outbound":[],"paper":{"arxiv_id":"2404.10740","last_updated":"2024-10-04T16:08:52Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T10:46:58.423676Z","submitted_at":"2024-04-16T17:13:08Z","title":"N-Agent Ad Hoc Teamwork"},"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 2 inbound Pith citation observations for arXiv:2404.10740."}