{"as_of":"2026-08-17T04:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08a94df6cf4695f15eb2b062995ba0cd8f4d72cb7dedace9fe60757587fc1ebc","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:08:54.742942Z","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-11T10:25:59.462033Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","snapshot_observed_at":"2026-08-16T18:09:46.519164Z","submitted_at":"2021-07-15T16:05:48Z","title":"Optimal Scoring Rule Design under Partial Knowledge","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07420","snapshot_observed_at":"2026-08-11T10:43:25.943216Z","title":"Optimal scoring rule design","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-14T16:32:58.468451Z","submitted_at":"2024-12-20T22:40:02Z","title":"Algorithmic Contract Theory: A Survey","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T10:43:25.943216Z"},"links":{"cited_paper":"/paper/2107.07420","citing_paper":"/paper/2412.16384"},"observation_digest":"sha256:b4fd57c4c27c827618fdc9c07704d989e8ff6caff8314f0635c11d300d705389","observation_id":"1904e0cb-2bba-4b36-80ca-d47a7dae948d","resolution":{"observed_at":"2026-08-11T10:43:25.943216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","snapshot_observed_at":"2026-08-16T18:09:46.519164Z","submitted_at":"2021-07-15T16:05:48Z","title":"Optimal Scoring Rule Design under Partial Knowledge","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07420","snapshot_observed_at":"2026-08-07T14:53:55.434808Z","title":"and Yu, F.-Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17379","last_updated":"2025-05-23T01:30:37Z","snapshot_observed_at":"2026-08-14T07:33:22.459305Z","submitted_at":"2025-05-23T01:30:37Z","title":"Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.434808Z"},"links":{"cited_paper":"/paper/2107.07420","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:099b0257b28b79b59cd9d7337d28106032e13eddfe3c4a61b7f56e6ec1586f4f","observation_id":"eb9d2bfc-0a61-4378-9ea0-593a844ac480","resolution":{"observed_at":"2026-08-07T14:53:55.434808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","snapshot_observed_at":"2026-08-16T18:09:46.519164Z","submitted_at":"2021-07-15T16:05:48Z","title":"Optimal Scoring Rule Design under Partial Knowledge","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07420","snapshot_observed_at":"2026-08-15T19:08:54.742942Z","title":"Optimal scoring rule design under partial knowledge","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17880","last_updated":"2025-06-22T02:54:51Z","snapshot_observed_at":"2026-08-16T20:31:14.312450Z","submitted_at":"2025-06-22T02:54:51Z","title":"Choice of Scoring Rules for Indirect Elicitation of Properties with Parametric Assumptions","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T19:08:54.742942Z"},"links":{"cited_paper":"/paper/2107.07420","citing_paper":"/paper/2506.17880"},"observation_digest":"sha256:c846ec04347a02924d221d9ef01a048ef0ccb134769f48a2482bcc6389a2f5ee","observation_id":"d57cc19f-c5c8-41a4-8555-a889bd40e86e","resolution":{"observed_at":"2026-08-15T19:08:54.742942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","snapshot_observed_at":"2026-08-16T18:09:46.519164Z","submitted_at":"2021-07-15T16:05:48Z","title":"Optimal Scoring Rule Design under Partial Knowledge","version":3},"cited_work":{"arxiv_id":"2107.07420","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.07420","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2024 , bdsk-file-1 =","venue":null,"work_id":"977037d0-f80b-47f2-ae6d-9f591e5c1323","year":2024},"citing_paper":{"arxiv_id":"2605.01936","last_updated":"2026-05-03T15:32:51Z","snapshot_observed_at":"2026-08-15T01:15:08.708046Z","submitted_at":"2026-05-03T15:32:51Z","title":"Pandora's Regret: A Proper Scoring Rule for Evaluating Sequential Search","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-10T15:31:09.276548Z"},"links":{"cited_paper":"/paper/2107.07420","citing_paper":"/paper/2605.01936"},"observation_digest":"sha256:e5a74131264337402a89a824894730381562f60285e7e17b1abdf1814cbae633","observation_id":"698de3ee-de9b-4146-9bbf-9e88cebf4706","resolution":{"observed_at":"2026-05-11T10:25:59.463933Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.07420/citation-record","integrity":"/paper/2107.07420/integrity","json":"/paper/2107.07420/citation-record.json","paper":"/paper/2107.07420"},"outbound":[],"paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","latest_version":3,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T18:09:46.519164Z","submitted_at":"2021-07-15T16:05:48Z","title":"Optimal Scoring Rule Design under Partial Knowledge"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2107.07420."}