{"as_of":"2026-08-10T21:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5072c772b24411b312c65e8dba221c3904365499e893f3955964513297c90e9e","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-10T06:31:04.303077+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-08T18:50:49.915082Z","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-05T15:18:58.163791Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.06205","last_updated":"2023-02-26T17:13:07Z","snapshot_observed_at":"2026-08-03T18:39:55.192330Z","submitted_at":"2023-02-13T09:24:34Z","title":"Order Matters: Agent-by-agent Policy Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06205","snapshot_observed_at":"2026-08-08T18:50:49.915082Z","title":"Order matters: Agent-by-agent policy optimization, 2023 b","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05573","last_updated":"2025-02-08T13:57:53Z","snapshot_observed_at":"2026-08-09T08:31:49.330723Z","submitted_at":"2025-02-08T13:57:53Z","title":"Low-Rank Agent-Specific Adaptation (LoRASA) for Multi-Agent Policy Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T18:50:49.915082Z"},"links":{"cited_paper":"/paper/2302.06205","citing_paper":"/paper/2502.05573"},"observation_digest":"sha256:14f1db4add04d38a519fb2ac30f68a55e3e39d7131f3908b7cb12e54e71eaa6c","observation_id":"afd257ff-eef9-42ae-935a-30db4eb535cb","resolution":{"observed_at":"2026-08-08T18:50:49.915082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06205","last_updated":"2023-02-26T17:13:07Z","snapshot_observed_at":"2026-08-03T18:39:55.192330Z","submitted_at":"2023-02-13T09:24:34Z","title":"Order Matters: Agent-by-agent Policy Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06205","snapshot_observed_at":"2026-08-05T20:31:03.774416Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.10340","last_updated":"2025-08-14T04:48:46Z","snapshot_observed_at":"2026-08-09T20:51:22.713388Z","submitted_at":"2025-08-14T04:48:46Z","title":"Multi-Agent Trust Region Policy Optimisation: A Joint Constraint Approach","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T20:31:03.774416Z"},"links":{"cited_paper":"/paper/2302.06205","citing_paper":"/paper/2508.10340"},"observation_digest":"sha256:b0b380243c17806e7aacf000bfdb569665f205eaa582160f645fadbf09432378","observation_id":"a20d0ba8-6acd-4400-9c7d-6cf0bcdc0e3f","resolution":{"observed_at":"2026-08-05T20:31:03.774416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06205","last_updated":"2023-02-26T17:13:07Z","snapshot_observed_at":"2026-08-03T18:39:55.192330Z","submitted_at":"2023-02-13T09:24:34Z","title":"Order Matters: Agent-by-agent Policy Optimization","version":2},"cited_work":{"arxiv_id":"2302.06205","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.06205","snapshot_observed_at":"2026-08-05T15:18:58.163791Z","title":"Order Matters: Agent-by-agent Policy Optimization","venue":"cs.AI","work_id":"d6130689-c197-4ed2-9137-b64ab5dd84c2","year":2023},"citing_paper":{"arxiv_id":"2508.20018","last_updated":"2025-08-27T16:27:19Z","snapshot_observed_at":"2026-08-08T06:36:18.346761Z","submitted_at":"2025-08-27T16:27:19Z","title":"SWIRL: A Staged Workflow for Interleaved Reinforcement Learning in Mobile GUI Control","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T15:18:57.147045Z"},"links":{"cited_paper":"/paper/2302.06205","citing_paper":"/paper/2508.20018"},"observation_digest":"sha256:d5bed1c69a2e6c9177333037c93933802c0d8a758109721b8236d0ae6ed2e44e","observation_id":"c4aa2014-ce7f-4a6d-bfa6-8d1e0746810c","resolution":{"observed_at":"2026-08-05T15:18:58.169804Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.06205/citation-record","integrity":"/paper/2302.06205/integrity","json":"/paper/2302.06205/citation-record.json","paper":"/paper/2302.06205"},"outbound":[],"paper":{"arxiv_id":"2302.06205","last_updated":"2023-02-26T17:13:07Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-03T18:39:55.192330Z","submitted_at":"2023-02-13T09:24:34Z","title":"Order Matters: Agent-by-agent Policy Optimization"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2302.06205."}