{"as_of":"2026-08-20T05:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0c07decd7afe58852be23626835a95df3eb921c234ca890ba664e188e0749d8","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T23:13:41.427267Z","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-02T15:57:06.985043Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.11661","last_updated":"2025-02-17T10:52:24Z","snapshot_observed_at":"2026-08-16T12:57:46.770298Z","submitted_at":"2025-02-17T10:52:24Z","title":"Single-dimensional Contract Design: Efficient Algorithms and Learning","version":1},"cited_work":{"arxiv_id":"2502.11661","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11661","snapshot_observed_at":"2026-07-02T15:57:06.985043Z","title":"Single-dimensional contract design: Efficient algorithms and learning.arXiv preprint arXiv:2502.11661, 2025","venue":null,"work_id":"cae35de8-b945-4478-ab43-5007f5729947","year":2025},"citing_paper":{"arxiv_id":"2606.06125","last_updated":"2026-06-04T13:13:01Z","snapshot_observed_at":"2026-08-13T19:17:02.813100Z","submitted_at":"2026-06-04T13:13:01Z","title":"Regret Minimization in Single-Dimensional Contract-Design with Binary Actions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T23:13:41.427267Z"},"links":{"cited_paper":"/paper/2502.11661","citing_paper":"/paper/2606.06125"},"observation_digest":"sha256:d74e8cc771d788bac9bf815586dd413a4dc3ca1d1b2de33a984a58171d7010b3","observation_id":"d059d84a-8411-4de0-8ecb-ba6929de8b24","resolution":{"observed_at":"2026-07-02T15:57:06.986717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.11661/citation-record","integrity":"/paper/2502.11661/integrity","json":"/paper/2502.11661/citation-record.json","paper":"/paper/2502.11661"},"outbound":[],"paper":{"arxiv_id":"2502.11661","last_updated":"2025-02-17T10:52:24Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T12:57:46.770298Z","submitted_at":"2025-02-17T10:52:24Z","title":"Single-dimensional Contract Design: Efficient Algorithms and 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.11661."}