{"as_of":"2026-08-16T01:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d12f7c0fb7c7da06d2eb2f2f6f6a81117d390f31487ee7dfb6afea022915fef","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:53:59.454811Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.17379/citation-record","integrity":"/paper/2505.17379/integrity","json":"/paper/2505.17379/citation-record.json","paper":"/paper/2505.17379"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:53:54.063319Z","title":"write newline","venue":null,"work_id":null,"year":null},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.063319Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:4fc995a809b53dce3b5ffdb22cf3524e601c3ee9c3abb5a91eab1a6ae939fa78","observation_id":"788edc1b-b9ee-4bd9-a2b2-4d822c35a250","resolution":{"observed_at":"2026-08-07T14:53:54.063319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:10.033160Z","title":"Dynamic pricing and learning with bayesian persuasion","venue":null,"work_id":"941acc0d-0213-48e2-b4b6-189dc2e23b97","year":2024},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.206960Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:bc69b2849cb63592c0563171a3274dc06abe897d1ed2e53473e57cd96f1f38b9","observation_id":"6ef5a47f-8354-472e-b924-967e653eebcf","resolution":{"observed_at":"2026-08-07T14:54:10.085389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:09.847871Z","title":"Contracts with private cost per unit-of-effort","venue":null,"work_id":"74c65e17-dce1-42aa-9064-33b051ef44b3","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":3,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.366175Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:63f9a36e0e86ad9378496154e98cedc857df7b2d230ae5542c3a28bc5155a443","observation_id":"74d3fc78-26a8-4589-b052-1d125108e129","resolution":{"observed_at":"2026-08-07T14:54:09.978931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:08.714690Z","title":"Learning prices for repeated auctions with strategic buyers","venue":null,"work_id":"3b6b9225-022f-40dd-8395-35f267c8cd4d","year":2013},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.417355Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:e98ac9e2350fc8ad00014d539e694d52a4aaa55c231a49ed1be02f997faaa4fe","observation_id":"f5c42002-5916-4fbe-b827-88d82112b98c","resolution":{"observed_at":"2026-08-07T14:54:09.013665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:08.494204Z","title":"On the complexity of differentially private best-arm identification with fixed confidence","venue":null,"work_id":"be475a65-2d63-40fc-9595-1b0832bfc9e4","year":2024},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.505735Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:230b9dc647d750aaec60443be89e0785d1ebde32c72f2106e5ddf4bfd35aef2b","observation_id":"656c7a3d-9ee6-4906-84a5-2fa99b81185a","resolution":{"observed_at":"2026-08-07T14:54:08.592667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03077","last_updated":"2024-03-06T12:37:20Z","snapshot_observed_at":"2026-08-13T04:26:03.787484Z","submitted_at":"2024-02-05T15:09:41Z","title":"Markov Persuasion Processes: Learning to Persuade from Scratch","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03077","snapshot_observed_at":"2026-08-07T14:53:54.590335Z","title":"E., Castiglioni, M., Marchesi, A., and Gatti, N","venue":null,"work_id":null,"year":2024},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.590335Z"},"links":{"cited_paper":"/paper/2402.03077","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:607302bcc3347879d94893562acbc535944eda486944ce78628bfed4d9dbfb55","observation_id":"fb3ffb26-d61b-4a6a-93f3-ef8be32a613a","resolution":{"observed_at":"2026-08-07T14:53:54.590335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:08.339987Z","title":null,"venue":null,"work_id":"12897e4e-d433-4328-a65d-4d735b224ace","year":2015},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.658526Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:77452aed6091c5d982e13ffcba7899a9445aea50c900001292b03cb550198f0a","observation_id":"edafbf21-ee11-4f85-85a0-baa4d94a04ce","resolution":{"observed_at":"2026-08-07T14:54:08.415650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:53:54.696207Z","title":"Principal-agent reward shaping in mdps","venue":null,"work_id":null,"year":2024},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.696207Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:185f31c0e65b17cd81d4445a543eaf8f2047b38c2e8ac8a13fa61cce4309c176","observation_id":"bae11574-7827-4e7a-bc84-7b1fca56b5c8","resolution":{"observed_at":"2026-08-07T14:53:54.696207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.03927","last_updated":"2022-09-08T17:08:12Z","snapshot_observed_at":"2026-08-14T02:05:34.355519Z","submitted_at":"2022-09-08T17:08:12Z","title":"Sequential Information Design: Learning to Persuade in the Dark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.03927","snapshot_observed_at":"2026-08-07T14:53:54.771640Z","title":"Sequential information design: Learning to persuade in the dark","venue":null,"work_id":null,"year":2022},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.771640Z"},"links":{"cited_paper":"/paper/2209.03927","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:199273733cd5e41ce3acbb5c5842f0821e7aab888a79d8b8b4a554e91585ef0f","observation_id":"da0b6a59-0709-4154-b2b3-b8eec16a8671","resolution":{"observed_at":"2026-08-07T14:53:54.771640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.01296","last_updated":"2023-03-02T14:23:13Z","snapshot_observed_at":"2026-08-13T12:33:28.254743Z","submitted_at":"2023-03-02T14:23:13Z","title":"Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion","version":1},"cited_work":{"arxiv_id":"2303.01296","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.01296","snapshot_observed_at":"2026-08-07T14:54:01.092996Z","title":"Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion","venue":"cs.GT","work_id":"55828d38-c2c8-4dc4-8990-2c86e420d43e","year":2023},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.843893Z"},"links":{"cited_paper":"/paper/2303.01296","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:46ad2fb8cab187aa4f0112ad1c32fabf605d1ca9426470d11c97bc4a3e0cd53e","observation_id":"dd74f0ef-3871-4eb3-be6f-ac6a39e1098e","resolution":{"observed_at":"2026-08-07T14:54:01.191767Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:08.189714Z","title":"Pure exploration in multi-armed bandits problems","venue":null,"work_id":"466f8459-3697-446c-b277-df3b3caae289","year":2009},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.925758Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:1bf8379fdb38636cfc21c32a721f6aecc9c13477f8b53f0da0332120416c8ca7","observation_id":"7c5f39ca-1c3d-4faf-9121-95ac8f9853d4","resolution":{"observed_at":"2026-08-07T14:54:08.252092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06210","last_updated":"2023-07-12T14:56:44Z","snapshot_observed_at":"2026-08-15T04:33:35.023173Z","submitted_at":"2023-07-12T14:56:44Z","title":"Online Information Acquisition: Hiring Multiple Agents","version":1},"cited_work":{"arxiv_id":"2307.06210","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.06210","snapshot_observed_at":"2026-08-07T14:54:00.877546Z","title":"Online Information Acquisition: Hiring Multiple Agents","venue":"cs.GT","work_id":"cdb575e8-1ecb-44e6-8b51-dcce1dd0ff3c","year":2023},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:54.999928Z"},"links":{"cited_paper":"/paper/2307.06210","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:94ecf3629cfb10de7d9b7ffc9d3ba58fe7f8191c40bd74fc436c5ac4c2e7faca","observation_id":"83e5cf82-cdc0-4e2e-8788-d6aa76e9329d","resolution":{"observed_at":"2026-08-07T14:54:00.981030Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:08.032808Z","title":"Online bayesian persuasion","venue":null,"work_id":"8fcedd69-cf6d-4772-81b6-ea5fc85d30a7","year":2020},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.069741Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:a396c93c9429ee7213917c67888fd92503191d35063e64b2a208bf4167e193d3","observation_id":"265921a5-2896-4e0d-b4cb-a0d1b150de44","resolution":{"observed_at":"2026-08-07T14:54:08.115921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06480","last_updated":"2021-06-11T16:05:31Z","snapshot_observed_at":"2026-08-15T00:05:37.512456Z","submitted_at":"2021-06-11T16:05:31Z","title":"Multi-Receiver Online Bayesian Persuasion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06480","snapshot_observed_at":"2026-08-07T14:53:55.139350Z","title":"Multi-receiver online bayesian persuasion","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":14,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.139350Z"},"links":{"cited_paper":"/paper/2106.06480","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:2e793d753b80ee9c535d4504d467f9d133f4798865891a448f0918896427e11d","observation_id":"2583756c-0858-4b21-aaca-ed1f94fec9de","resolution":{"observed_at":"2026-08-07T14:53:55.139350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00605","last_updated":"2022-09-01T14:19:13Z","snapshot_observed_at":"2026-08-13T16:48:59.778728Z","submitted_at":"2022-02-01T17:50:04Z","title":"Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00605","snapshot_observed_at":"2026-08-07T14:53:55.175690Z","title":"Bayesian persuasion meets mechanism design: Going beyond intractability with type reporting","venue":null,"work_id":null,"year":2022},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.175690Z"},"links":{"cited_paper":"/paper/2202.00605","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:0f699c44df8db6ced0ecd2fdd97cac9dc5559f8f0e2e34ea0effcfdd0c6049cf","observation_id":"5edd5ef3-ebb2-43a0-a7fe-8f5584dc057a","resolution":{"observed_at":"2026-08-07T14:53:55.175690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:07.860945Z","title":"Principal-driven reward design and agent policy alignment via bilevel-rl","venue":null,"work_id":"8e7b0e9e-a69b-41a2-ae37-74ae8d508bbc","year":null},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.242708Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:3854bb871733d162369014bb4e18f6fda61481f27403cd8ad6252140a1c6f5d5","observation_id":"17c0fcbb-90da-407b-892a-f626d14688cc","resolution":{"observed_at":"2026-08-07T14:54:07.941657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:07.714281Z","title":"Towards instance optimal bounds for best arm identification","venue":null,"work_id":"0a2e4477-fb88-4fc5-97b5-2f1bbce77257","year":2016},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.302426Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:f3fa4d74e77cc68e0507d1e194df7ddddd9986a633e5487ffcae2974d7f456f9","observation_id":"8dad7559-1b73-4b8d-9ebb-bb6ed7928473","resolution":{"observed_at":"2026-08-07T14:54:07.785070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:07.543472Z","title":"Learning to incentivize information acquisition: Proper scoring rules meet principal-agent model","venue":null,"work_id":"ecf77855-19aa-4723-9098-872e862b1003","year":2023},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.378915Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:5b302c717ff2abcb2e219a747b01e7a2b12d834e7d6eceeaa159679e16652ac6","observation_id":"a3cff066-625c-434a-aef9-a95a2d232137","resolution":{"observed_at":"2026-08-07T14:54:07.642602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","snapshot_observed_at":"2026-08-14T04:32:36.355214Z","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:4cfa00aaca46ed52b78b9b658fab89ce7e4bc3a3fd1001d105c37922b41d71f3","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:07.342168Z","title":"Learning approximately optimal contracts","venue":null,"work_id":"55030329-8e61-4d40-91a2-743ada7ac094","year":2022},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.484618Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:425b72b14fad1f0cce7e623574397cc6e5742465473eaa69a1bad6034b1a13fe","observation_id":"1e6ea4ec-82cf-431e-9c2e-31732686597a","resolution":{"observed_at":"2026-08-07T14:54:07.437634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:07.190531Z","title":"On stackelberg mixed strategies","venue":null,"work_id":"61b33f54-834d-4c9f-a0c2-d97c42efafd0","year":2015},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.545565Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:f516e6b838917b7a5a94453f7364499599f9f095750c192ab4b2efacb01db3d2","observation_id":"cd4710c2-ce6d-46c2-b943-2cd49c0cfb63","resolution":{"observed_at":"2026-08-07T14:54:07.260520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:07.011655Z","title":"Pac bounds for multi-armed bandit and markov decision processes","venue":null,"work_id":"14a9e925-6fa7-4519-9959-212dd02175e1","year":2002},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.610575Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:13bcde1fc170286c12338436bde0b1937a8ccfac2e97ef7466043e9151d0c2e8","observation_id":"d3d76c3a-8b75-4d17-bc7a-cf96034c70d1","resolution":{"observed_at":"2026-08-07T14:54:07.109497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:06.851697Z","title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","venue":null,"work_id":"27d70c1a-b11e-4078-a8fb-a321a953aaab","year":2006},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.694887Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:017baad8fd351c95ff4d70de908fb91b32c6b2697823995e42ef68cd7d4b659e","observation_id":"33c182b3-d0fb-4f7d-8066-255a0b685909","resolution":{"observed_at":"2026-08-07T14:54:06.914600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:06.675868Z","title":"Learning to bid without knowing your value","venue":null,"work_id":"2c494366-d049-4e33-838d-27677e16a5ab","year":2018},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.740825Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:fe3386e066887c888b7b89427ea768da50d3f7f25d593a1c7c0311568d6524bf","observation_id":"13f4bf98-38a8-49d6-a285-cb2132a03728","resolution":{"observed_at":"2026-08-07T14:54:06.764500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:06.518754Z","title":"Multi-bandit best arm identification","venue":null,"work_id":"0511a4b0-073b-451f-8a06-8af9b10db48d","year":2011},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.829997Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:be55d5389daea95f41235ec3eda4d1e9a9af45d62c45ddf87ee2803af6f7b086","observation_id":"cef894ad-a6f9-4cca-9671-d37049a4ffc4","resolution":{"observed_at":"2026-08-07T14:54:06.581655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:06.395520Z","title":"Best arm identification: A unified approach to fixed budget and fixed confidence","venue":null,"work_id":"d99aaa0b-a7fb-4461-b80a-fb199a33f2a5","year":2012},"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":26,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:55.915782Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:de3c77a3a394acc4a861db043c32c856682ca7783f358d5dd7ce7b8cc5197dc9","observation_id":"ec616a4f-bf3c-4338-94b7-589e1ecca8e3","resolution":{"observed_at":"2026-08-07T14:54:06.441922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05137","last_updated":"2022-05-24T15:25:44Z","snapshot_observed_at":"2026-08-10T12:42:32.874138Z","submitted_at":"2021-06-09T15:21:41Z","title":"Bayesian Persuasion in Sequential Decision-Making","version":2},"cited_work":{"arxiv_id":"2106.05137","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.05137","snapshot_observed_at":"2026-08-07T14:54:00.629642Z","title":"Bayesian Persuasion in Sequential Decision-Making","venue":"cs.GT","work_id":"a1777d1b-9126-4cd5-b9e1-041de35362a7","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":27,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.024692Z"},"links":{"cited_paper":"/paper/2106.05137","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:726f024b188d4bd11ccef808c538d68816133c8517ecc2fa23fb52d8848357b1","observation_id":"416eb8f0-a097-4afa-a041-547e4e6580bd","resolution":{"observed_at":"2026-08-07T14:54:00.706975Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:06.228649Z","title":"and Kaufmann, E","venue":null,"work_id":"581f3d46-1a42-49fb-8ff3-151a9306dd1d","year":2016},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.076778Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:9030597540b6121854df460ef62d59a956518ec932987434e9f853bc1d25f820","observation_id":"609fa0ca-59c9-4ceb-a40f-0ebaec59565c","resolution":{"observed_at":"2026-08-07T14:54:06.299423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:06.068853Z","title":null,"venue":null,"work_id":"8ba295e8-d10d-469c-91ba-46376a7bf6d4","year":2018},"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":29,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.184528Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:56a0322010024a4e482e785f436f471cb66cedf083c3b431957ef07518b7d5a3","observation_id":"ca3e0666-afa5-48a7-8961-5cd5bdfbf00d","resolution":{"observed_at":"2026-08-07T14:54:06.152094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:05.886252Z","title":"I., and Vitercik, E","venue":null,"work_id":"b29d2d20-d7d6-4d3e-b547-3a9bd4f44817","year":2022},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.258260Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:c529a39ffedeff88ad196a7a40a456e40aa305dcaa8d8e471cc7088a6d0727b2","observation_id":"924366ec-ec3a-4a80-910f-21c2cce71e12","resolution":{"observed_at":"2026-08-07T14:54:05.968635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:05.619110Z","title":"Learning in stackelberg games with non-myopic agents","venue":null,"work_id":"237d82e9-42bd-4059-9c8b-e108ccd11ff7","year":2022},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.402422Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:1f5dd7630146cf925d699983af75dbc677599c6961fa63156997a8ee4d2b2975","observation_id":"2c522927-c8e8-4e47-a4ef-fbab8423d1ed","resolution":{"observed_at":"2026-08-07T14:54:05.798878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:05.315451Z","title":"Learning in online principal-agent interactions: The power of menus","venue":null,"work_id":"3a26f8f4-f552-47f9-a2fd-06d5b24747d3","year":2024},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.483613Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:d1efb5cb856f62b74e10f3fd511681bf0b5680fa3ffd3a01314a75f83aebc70e","observation_id":"f6ace387-1c95-484a-bef8-fa87c95a9bb4","resolution":{"observed_at":"2026-08-07T14:54:05.470516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:05.145593Z","title":"D., Shan, L., Li, Y., and Wu, Y","venue":null,"work_id":"44057d6d-9439-46e4-99ea-c165ef293007","year":2023},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.552691Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:8603ba088fca0f2574610fef321cc2e6657bf4e8e052637b46a43c65d20682d0","observation_id":"b26fd731-2e9a-4fb9-bbf1-cecd057e837c","resolution":{"observed_at":"2026-08-07T14:54:05.253210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:53:56.709932Z","title":null,"venue":null,"work_id":null,"year":2014},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.709932Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:d431a1260d3c59f5e7b7251439fe300101d1b0bc495837453da15b0ff484958c","observation_id":"ac21d92b-efa9-4acd-b6a8-e4604b971a62","resolution":{"observed_at":"2026-08-07T14:53:56.709932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18074","last_updated":"2024-10-07T16:46:42Z","snapshot_observed_at":"2026-08-12T23:14:50.090966Z","submitted_at":"2024-07-25T14:28:58Z","title":"Principal-Agent Reinforcement Learning: Orchestrating AI Agents with Contracts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18074","snapshot_observed_at":"2026-08-07T14:53:56.861783Z","title":null,"venue":null,"work_id":null,"year":2024},"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":35,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.861783Z"},"links":{"cited_paper":"/paper/2407.18074","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:c737a1bf9ede8c277c32ff6b91ef79cf6160493db16c0dad346fb2a69063851a","observation_id":"e77fd1d1-d101-4307-981e-d7c0825b57df","resolution":{"observed_at":"2026-08-07T14:53:56.861783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.08843","last_updated":"2023-01-31T22:35:43Z","snapshot_observed_at":"2026-08-13T18:25:43.670913Z","submitted_at":"2021-08-19T17:59:28Z","title":"Learning Equilibria in Matching Markets from Bandit Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.08843","snapshot_observed_at":"2026-08-07T14:53:56.997108Z","title":"I., and Steinhardt, J","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":36,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:56.997108Z"},"links":{"cited_paper":"/paper/2108.08843","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:2f5d6fb42337f24b45b14cc60f18b77290e3818b5b83297b07013d9723f4b13b","observation_id":"d4ea4499-ec8e-43b7-8c2f-4d2b21dda6d1","resolution":{"observed_at":"2026-08-07T14:53:56.997108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.7308","last_updated":"2013-12-27T18:20:09Z","snapshot_observed_at":"2026-08-14T23:50:12.975686Z","submitted_at":"2013-12-27T18:20:09Z","title":"lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.7308","snapshot_observed_at":"2026-08-07T14:53:57.140828Z","title":"G., Malloy, M., Nowak, R","venue":null,"work_id":null,"year":2013},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.140828Z"},"links":{"cited_paper":"/paper/1312.7308","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:279bdf7713d51d5add374f158301aa7debe7969eeab96bbcde5af2a707ffbaf4","observation_id":"6f5c3b11-046f-4a1f-a08a-661adb49a78d","resolution":{"observed_at":"2026-08-07T14:53:57.140828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:04.826720Z","title":null,"venue":null,"work_id":"99560c9f-d9df-4cdb-a5a0-7aebee9cd081","year":2018},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.222452Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:09dcfa7f25dc6ae35640727efddc41e2201fd29e146c9af2ce5e7ebbcc2bbaaa","observation_id":"665679ef-c710-4f45-95cc-da6ca02736f9","resolution":{"observed_at":"2026-08-07T14:54:04.953636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:04.541285Z","title":"Pac subset selection in stochastic multi-armed bandits","venue":null,"work_id":"29230a00-cd22-4d03-8ced-3fb4fd7eb65e","year":2012},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.265358Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:4b6b96047b50978a24870f86992591e87b546be7ec6c08121040241e702c7c4c","observation_id":"47d6570e-7c5d-463a-bd57-5e8f14a81e13","resolution":{"observed_at":"2026-08-07T14:54:04.692984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:04.238564Z","title":"and Maskin, E","venue":null,"work_id":"645380b8-1724-4cd0-9408-ef74e8e4af7d","year":1981},"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":40,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.295189Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:ff1d687c1b14e3adc32393d18c6a41ade8c103fdee25a4fd0ff4e9cc7aa2bc65","observation_id":"488b3ba1-357a-4ec7-b844-6dcd7f91c994","resolution":{"observed_at":"2026-08-07T14:54:04.359658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:03.859763Z","title":"D., Shan, L., and Wu, Y","venue":null,"work_id":"efab5f57-5f16-4915-9929-2dd8068c2e8c","year":2022},"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":41,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.425603Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:7cfb197457876c53c53014347ef99bae2d45e6934869b40ed1047fe70e578287","observation_id":"1d8a99af-5e4a-4116-b18c-e29aa1f77b9d","resolution":{"observed_at":"2026-08-07T14:54:04.023846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:03.553742Z","title":"and Tsitsiklis, J","venue":null,"work_id":"cbb22aca-d5f0-47b1-9ffd-94121b5f34d6","year":2004},"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":42,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.480554Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:122243ad497c734177dde9f39fd249ec5d9eb51b11eb318607b3b3ccdfe526a6","observation_id":"30c4b0e4-7143-4d1b-ba23-2d3c6ec4e852","resolution":{"observed_at":"2026-08-07T14:54:03.714553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.06522","last_updated":"2019-10-19T01:12:40Z","snapshot_observed_at":"2026-08-14T18:27:06.291190Z","submitted_at":"2018-09-18T04:01:55Z","title":"Concentration Inequalities for the Empirical Distribution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.06522","snapshot_observed_at":"2026-08-07T14:53:57.615210Z","title":"D., and Weissman, T","venue":null,"work_id":null,"year":2018},"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":43,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.615210Z"},"links":{"cited_paper":"/paper/1809.06522","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:2771c7f3c40720c12163b707f2f00468ed355d8797da687b982b1bf51150c3a3","observation_id":"8c2fc87a-e3cf-473d-99d1-fd21b4b0e6ef","resolution":{"observed_at":"2026-08-07T14:53:57.615210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:03.305919Z","title":null,"venue":null,"work_id":"990d19a3-e6e0-4700-9af0-b5714e6b34e3","year":1979},"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":44,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.771371Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:50456ed525c66f8e2149d2480f5dd0ce60d23b71a94b3ba181fa85c71e347bf3","observation_id":"bae789d3-0447-4b27-87c4-9f74e25d8181","resolution":{"observed_at":"2026-08-07T14:54:03.437201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:03.068807Z","title":null,"venue":null,"work_id":"72e62d38-97fe-4775-82cb-ca8d590ab45d","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":45,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:57.932126Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:4d437bc19c3b6e164e4cd66b08c37720ef447f7bbbad458b138b33f8cc30ea6b","observation_id":"e4825131-1323-4909-97ce-ccd40da78486","resolution":{"observed_at":"2026-08-07T14:54:03.142066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:02.899770Z","title":"and Conitzer, V","venue":null,"work_id":"68f05a22-1d4b-4063-9126-fa888a295647","year":2020},"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":46,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.071650Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:cf29008d5ddc245b362a38de186095d3fb840c8a039978217ed5698fefd4b458","observation_id":"668c0baa-b9e0-4364-95c8-9d84b0dc27d6","resolution":{"observed_at":"2026-08-07T14:54:02.982513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:02.712317Z","title":"and Waggoner, B","venue":null,"work_id":"08a890b7-89bd-4c24-9136-88b633fc78d8","year":2022},"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":47,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.222263Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:a0a7efd781f44554b6e9e23b0025ac7f0f66bf676374f05f1fc532a871585775","observation_id":"4a8b3c69-a71a-4b28-9c51-8a0b6ebfe279","resolution":{"observed_at":"2026-08-07T14:54:02.815632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:02.473370Z","title":null,"venue":null,"work_id":"187924ee-e12b-4670-86a0-32b8bc24bc10","year":1971},"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":48,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.320581Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:02d1097ff011484412d3a0101ac55eaa82f0e870917177cb9e6e6c6be57e2054","observation_id":"3af0da42-36bd-456c-97ca-9bd79ca640f0","resolution":{"observed_at":"2026-08-07T14:54:02.642248Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03811","last_updated":"2024-03-06T16:00:46Z","snapshot_observed_at":"2026-08-13T04:02:08.408029Z","submitted_at":"2024-03-06T16:00:46Z","title":"Incentivized Learning in Principal-Agent Bandit Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03811","snapshot_observed_at":"2026-08-07T14:53:58.415367Z","title":null,"venue":null,"work_id":null,"year":2024},"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":49,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.415367Z"},"links":{"cited_paper":"/paper/2403.03811","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:a30c8593d0395422cc69d7b3efa2d76c7394305e57c698f4c2f5c93068a0e9ab","observation_id":"d717a5c1-c573-4be8-85ab-8b6131661045","resolution":{"observed_at":"2026-08-07T14:53:58.415367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05271","last_updated":"2020-07-10T09:33:05Z","snapshot_observed_at":"2026-08-08T13:13:30.433242Z","submitted_at":"2020-07-10T09:33:05Z","title":"Learning to Play Sequential Games versus Unknown Opponents","version":1},"cited_work":{"arxiv_id":"2007.05271","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.05271","snapshot_observed_at":"2026-08-07T14:54:00.301152Z","title":"Learning to Play Sequential Games versus Unknown Opponents","venue":"cs.LG","work_id":"b5bebbee-5563-4fe7-8953-86c8e6cc686f","year":2020},"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":50,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.534198Z"},"links":{"cited_paper":"/paper/2007.05271","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:5dcd5c79cd9ed156297a58cce06fc771c20976b6516a57e4ebf20a22bc009a06","observation_id":"1f4ca6bc-325a-4e85-a7f7-a707d56b40e3","resolution":{"observed_at":"2026-08-07T14:54:00.424941Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11015","last_updated":"2024-09-30T00:21:39Z","snapshot_observed_at":"2026-08-15T07:14:44.773985Z","submitted_at":"2023-10-17T06:04:00Z","title":"Pure Exploration in Asynchronous Federated Bandits","version":2},"cited_work":{"arxiv_id":"2310.11015","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.11015","snapshot_observed_at":"2026-08-07T14:54:00.101316Z","title":"Pure Exploration in Asynchronous Federated Bandits","venue":"cs.LG","work_id":"3efe9006-0e42-4f01-b489-0e34173b260d","year":2023},"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":51,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.714608Z"},"links":{"cited_paper":"/paper/2310.11015","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:6c0074919ead1513272a6c89669773c8fb9a2c2e6cd83d1ce00f3f766ee244de","observation_id":"47c227d6-f8bc-42ec-bc71-24ca4380a6b5","resolution":{"observed_at":"2026-08-07T14:54:00.176526Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:02.118661Z","title":"I., and Xu, H","venue":null,"work_id":"5403e93e-a996-4385-afac-2d7507aa2f8e","year":2022},"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":52,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.808305Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:f9dbb2ff93a3eec097961eac83fadcb23262b7965643121950e16d288708dc39","observation_id":"6f847e54-9309-4933-b492-480356a9bf4c","resolution":{"observed_at":"2026-08-07T14:54:02.331262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01458","last_updated":"2024-07-02T15:17:50Z","snapshot_observed_at":"2026-08-12T23:31:06.813847Z","submitted_at":"2024-07-01T16:53:00Z","title":"Contractual Reinforcement Learning: Pulling Arms with Invisible Hands","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01458","snapshot_observed_at":"2026-08-07T14:53:58.959421Z","title":"Contractual reinforcement learning: Pulling arms with invisible hands","venue":null,"work_id":null,"year":2024},"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":53,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.959421Z"},"links":{"cited_paper":"/paper/2407.01458","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:8abc89fc2986167f38509f3fee168fa9fd58932772f1b3c6509d0b0e9a2e2882","observation_id":"475dff40-5cf1-4c99-9a6c-962f66fa311a","resolution":{"observed_at":"2026-08-07T14:53:58.959421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:01.730519Z","title":null,"venue":null,"work_id":"cae6b186-70cc-4102-95ab-572b4fe018f3","year":2022},"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":54,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:59.156830Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:4ab286024c389c396adc12abb2897e807e61dd5f6d87ec89062557edea43d739","observation_id":"735bcf7d-7cda-4444-a264-968f553255f2","resolution":{"observed_at":"2026-08-07T14:54:01.904755Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:01.387096Z","title":"Learning to persuade on the fly: Robustness against ignorance","venue":null,"work_id":"50dc6feb-fe92-4b15-b143-56311bc6ff32","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":55,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:59.303065Z"},"links":{"citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:3d590578747c589a83fe81f2ae9282511cb2c0da38628ce6ad9cd96729452297","observation_id":"3729b70e-ccdf-468a-b7b7-a968e4768099","resolution":{"observed_at":"2026-08-07T14:54:01.535204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07143","last_updated":"2025-06-09T20:49:17Z","snapshot_observed_at":"2026-08-13T00:57:16.049003Z","submitted_at":"2024-03-11T20:28:23Z","title":"Harnessing the Continuous Structure: Utilizing the First-order Approach in Online Contract Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07143","snapshot_observed_at":"2026-08-07T14:53:59.344695Z","title":"New perspectives in online contract design: Heterogeneous, homogeneous, non-myopic agents and team production","venue":null,"work_id":null,"year":2024},"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":56,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:59.344695Z"},"links":{"cited_paper":"/paper/2403.07143","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:81f3f73e09f1072ac7173437b8b98bd9b58f56a3ff82286c39af5da4d9d9b2d4","observation_id":"f67e8374-aee0-4c00-9e08-b588d1635948","resolution":{"observed_at":"2026-08-07T14:53:59.344695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20642","last_updated":"2026-04-27T17:27:51Z","snapshot_observed_at":"2026-07-06T18:23:10.807498Z","submitted_at":"2024-05-31T07:01:49Z","title":"Learning Under Moral Hazard with Instrumental Regression and Generalized Method of Moments","version":3},"cited_work":{"arxiv_id":"2405.20642","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.20642","snapshot_observed_at":"2026-08-07T14:53:59.583458Z","title":"Learning Under Moral Hazard with Instrumental Regression and Generalized Method of Moments","venue":"cs.LG","work_id":"6c6024a8-fedd-4206-99af-e8ee67a530f8","year":2024},"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":57,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:59.454811Z"},"links":{"cited_paper":"/paper/2405.20642","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:0937735de2c19ceeb834bca4152b256fc203bc3da5e898085bade4f233f0d80b","observation_id":"78376ab8-4b1a-41b4-82ef-c87cc17315d2","resolution":{"observed_at":"2026-08-07T14:53:59.806320Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17379","last_updated":"2025-05-23T01:30:37Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":22,"verified_exact":4,"verified_fuzzy":29},"total_outbound_references":57},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2505.17379."}