{"as_of":"2026-08-14T01:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed4d748705663d7c6a7999f797a800ebf7e02083cf431d5e1707e00b3049ef10","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-13T06:32:02.005865+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-11T10:43:25.910417Z","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-10T09:18:31.670737Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.13520","last_updated":"2024-10-17T13:09:08Z","snapshot_observed_at":"2026-08-13T22:17:46.401167Z","submitted_at":"2024-10-17T13:09:08Z","title":"Contracting With a Reinforcement Learning Agent by Playing Trick or Treat","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13520","snapshot_observed_at":"2026-08-11T10:43:25.910417Z","title":"Contracting with a reinforcement learning agent by playing trick or treat","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16384","last_updated":"2024-12-20T22:40:02Z","snapshot_observed_at":"2026-08-11T23:02:33.966426Z","submitted_at":"2024-12-20T22:40:02Z","title":"Algorithmic Contract Theory: A Survey","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-11T10:43:25.910417Z"},"links":{"cited_paper":"/paper/2410.13520","citing_paper":"/paper/2412.16384"},"observation_digest":"sha256:c695c269b2b798a89ffba9cbb884924fa7da92ffe7caa7a8e0809cef93dd93b0","observation_id":"0bf2ae70-93f1-4ed1-b8c1-22f67097799d","resolution":{"observed_at":"2026-08-11T10:43:25.910417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13520","last_updated":"2024-10-17T13:09:08Z","snapshot_observed_at":"2026-08-13T22:17:46.401167Z","submitted_at":"2024-10-17T13:09:08Z","title":"Contracting With a Reinforcement Learning Agent by Playing Trick or Treat","version":1},"cited_work":{"arxiv_id":"2410.13520","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13520","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b9354965-f567-4aee-91af-0abbf173c6fa","year":2024},"citing_paper":{"arxiv_id":"2604.15636","last_updated":"2026-04-17T02:31:46Z","snapshot_observed_at":"2026-08-02T20:48:05.127239Z","submitted_at":"2026-04-17T02:31:46Z","title":"The Power of Information for Intermediate States in Contract Design","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T08:03:47.774614Z"},"links":{"cited_paper":"/paper/2410.13520","citing_paper":"/paper/2604.15636"},"observation_digest":"sha256:c0b8eef63834e628ccc62f1ba8bd9df168d474ce7f8dc039094996691439668e","observation_id":"074878bf-14ba-4eac-9c30-d15e037bf97d","resolution":{"observed_at":"2026-05-10T09:18:31.672708Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.13520/citation-record","integrity":"/paper/2410.13520/integrity","json":"/paper/2410.13520/citation-record.json","paper":"/paper/2410.13520"},"outbound":[],"paper":{"arxiv_id":"2410.13520","last_updated":"2024-10-17T13:09:08Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-13T22:17:46.401167Z","submitted_at":"2024-10-17T13:09:08Z","title":"Contracting With a Reinforcement Learning Agent by Playing Trick or Treat"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.13520."}