{"as_of":"2026-08-08T18:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0a2b6c63efb6c17f97708a749dda0b45f6c48f9e60f827573d56268c1f7187f","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-08T06:32:00.761636+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-07T13:03:57.238622Z","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-25T05:30:22.920064Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.13233","last_updated":"2025-05-24T01:53:41Z","snapshot_observed_at":"2026-07-06T15:45:47.517122Z","submitted_at":"2023-06-22T22:45:48Z","title":"On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.13233","snapshot_observed_at":"2026-08-07T13:03:57.238622Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23124","last_updated":"2025-08-01T22:17:13Z","snapshot_observed_at":"2026-08-07T12:50:33.760545Z","submitted_at":"2025-05-29T05:46:01Z","title":"Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T13:03:57.238622Z"},"links":{"cited_paper":"/paper/2306.13233","citing_paper":"/paper/2505.23124"},"observation_digest":"sha256:d99eb8d709385cd57b0362b76ea0fb17bd14395b5616eae5624f1d1e0b1e80a7","observation_id":"ea1f350f-e5be-44dd-9dd4-09217f4cc620","resolution":{"observed_at":"2026-08-07T13:03:57.238622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13233","last_updated":"2025-05-24T01:53:41Z","snapshot_observed_at":"2026-07-06T15:45:47.517122Z","submitted_at":"2023-06-22T22:45:48Z","title":"On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback","version":3},"cited_work":{"arxiv_id":"2306.13233","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.13233","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Logarithmic regret for matrix games against an adversary with noisy bandit feedback","venue":null,"work_id":"fd21da07-dafb-4f87-afb5-113ef22edb6b","year":2023},"citing_paper":{"arxiv_id":"2605.23351","last_updated":"2026-05-22T08:14:03Z","snapshot_observed_at":"2026-08-02T22:59:01.948830Z","submitted_at":"2026-05-22T08:14:03Z","title":"Prudent-Banker: No Extra Fees for Baseline Safety in Adversarial Bandits With and Without Delays","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-25T05:28:04.999708Z"},"links":{"cited_paper":"/paper/2306.13233","citing_paper":"/paper/2605.23351"},"observation_digest":"sha256:9d3c27d75d8ed5a40875dc5a50f17cce327cd851abaacc5ac0cac75fb0c23850","observation_id":"ce63a9ce-a487-4d98-a195-29e9198cf183","resolution":{"observed_at":"2026-05-25T05:30:22.922917Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.13233/citation-record","integrity":"/paper/2306.13233/integrity","json":"/paper/2306.13233/citation-record.json","paper":"/paper/2306.13233"},"outbound":[],"paper":{"arxiv_id":"2306.13233","last_updated":"2025-05-24T01:53:41Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:45:47.517122Z","submitted_at":"2023-06-22T22:45:48Z","title":"On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.13233."}