{"as_of":"2026-08-08T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:014cf7e9e6a2d100f501eff9bc07d07c8fef9a156a00c817c538ff4048d83547","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:58.056440Z","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-16T19:38:21.016173Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.05732","last_updated":"2023-05-19T23:18:55Z","snapshot_observed_at":"2026-07-06T14:16:48.496031Z","submitted_at":"2022-11-10T17:59:42Z","title":"The Sample Complexity of Online Contract Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.05732","snapshot_observed_at":"2026-08-07T13:03:58.056440Z","title":null,"venue":null,"work_id":null,"year":2022},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-07T13:03:58.056440Z"},"links":{"cited_paper":"/paper/2211.05732","citing_paper":"/paper/2505.23124"},"observation_digest":"sha256:b279690c8e391f38c9d38a1d8d59c2c2783e5f718f3b9c0195f179e6b83365ef","observation_id":"a6b3d551-4122-4822-b98e-5645994c4db2","resolution":{"observed_at":"2026-08-07T13:03:58.056440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05732","last_updated":"2023-05-19T23:18:55Z","snapshot_observed_at":"2026-07-06T14:16:48.496031Z","submitted_at":"2022-11-10T17:59:42Z","title":"The Sample Complexity of Online Contract Design","version":3},"cited_work":{"arxiv_id":"2211.05732","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.05732","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Qiushi Han, David Simchi-Levi, Renfei Tan, and Zishuo Zhao22 Appendix A Deferred Proofs A.1 Proof of Proposition 2.1 Suppose the past rounds’ report history isz 1, z2,· · ·, z𝑡−1","venue":null,"work_id":"169fe265-2e64-4ca4-b2e9-ad833603c7e6","year":2022},"citing_paper":{"arxiv_id":"2512.21794","last_updated":"2026-04-20T21:23:04Z","snapshot_observed_at":"2026-07-30T15:00:42.108767Z","submitted_at":"2025-12-25T21:59:51Z","title":"Multi-agent Adaptive Mechanism Design","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-16T19:35:07.729497Z"},"links":{"cited_paper":"/paper/2211.05732","citing_paper":"/paper/2512.21794"},"observation_digest":"sha256:e50ed4c44c2186a9d0a2968c9f55db53bd4e76a179be23af519387130ee876eb","observation_id":"04b533f3-288a-40a3-a6e7-84ef5a65082f","resolution":{"observed_at":"2026-05-16T19:38:21.018154Z","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/2211.05732/citation-record","integrity":"/paper/2211.05732/integrity","json":"/paper/2211.05732/citation-record.json","paper":"/paper/2211.05732"},"outbound":[],"paper":{"arxiv_id":"2211.05732","last_updated":"2023-05-19T23:18:55Z","latest_version":3,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T14:16:48.496031Z","submitted_at":"2022-11-10T17:59:42Z","title":"The Sample Complexity of Online Contract Design"},"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:2211.05732."}