{"as_of":"2026-08-08T09:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ce158b15d8389549a57fd2342378cae130923c1b506db5984ddf02fc9627f38","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-08T06:32:00.761636+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-07T14:45:57.354451Z","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:3890b001d85ec9f1a5552444e138ea6ce9ee38b9907048bdc817893f30fb425a","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-07T14:45:57.354451Z","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:e01e5e423c81add0bbd4f00c3d48a9cb1d645c9a06e361fe566723071351cc77","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:c07c2ad1b7f08d76eafd0ec46401dd82ea65102abd2381ba739140c375a32458","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:89465679be70d2a096ad79ab1a2f4c7d37ee761370359ce0a4b838ed6151667a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:2e2f87177b7eba294ecdfce59c57587e7c8847a3bfaf6c7f6d6a914cb20d4a32","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03077","last_updated":"2024-03-06T12:37:20Z","snapshot_observed_at":"2026-07-06T17:25:31.223077Z","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-07T14:45:57.354451Z","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:c79ed29bd5d26add28fd042f03d365a216e5f3c6cd8b443f936e9b7d3eca4073","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-07T14:45:57.354451Z","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:525147b1b046db271d7ed71421207b87c8f2c0ea78c2b76db2b022fb1514f199","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:d690d13f95148342a4f51ff7702b25986c1a6249d8c17a6abe231f4ff32b6ab0","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-07-06T13:50:18.095078Z","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-07T14:45:57.354451Z","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:245f144ff2daa3eb9869f108ae2e1121d11c0d963c452f176892e4d0fe74ed49","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-07-06T14:57:55.417565Z","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-07T14:45:57.354451Z","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:23fb07fef39c31f703ab390aed4007c0367fb62c1a87348dd1be8e515154953f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:045c34c9c66a8fbe4ab68961c123b328b987363b8c81756e7a4edddf306967fc","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06210","last_updated":"2023-07-12T14:56:44Z","snapshot_observed_at":"2026-07-06T15:53:15.562039Z","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-07T14:45:57.354451Z","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:9c0d1112baf9a76267bdb9a38653f830ca45701035a00672d9ff7d1367599ed4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:d39a3bd2e835bf7b5e1146b63da57292793913646c1a90d13565dfc0d218c974","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06480","last_updated":"2021-06-11T16:05:31Z","snapshot_observed_at":"2026-07-06T11:18:26.156978Z","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-07T14:45:57.354451Z","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:7ce2bfef9b4250e3af7a5bf7efc04ee09b774705cfe318c99571716015a5e00c","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-07-06T12:33:27.292867Z","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-07T14:45:57.354451Z","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:b0a7ad3d53fff33fc4a9a420b4059b982990c0b299fd13d57a88667e7f423149","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-07T14:45:57.354451Z","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:0e642dbae6c8f78a20ee5f977e7a9bb6ddcee300002b676853d372f810ece203","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:09e6ffcd2818f3d23333899a0e11df4b4f42a17267081776805776df83301db8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:369b066a209b4a640b63987a6b38dd9556fd8a34f45efede1c0dfa724caa7392","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07420","last_updated":"2024-10-11T19:34:17Z","snapshot_observed_at":"2026-07-06T11:29:31.187437Z","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-07T14:45:57.354451Z","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:884ffa0a8fb37417d197688128c01488dbdaa88eef8ba046250cfa692f69d896","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-07T14:45:57.354451Z","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:b839e895055c6bdeb524679bdad6cf56caf8abbb7372af81143abdf84b543ff0","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:6a7c0f41fe42845d87b7b09308cf6936da9eb5c891f84aac9419d64ead3c2fe1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:f03463a6ae9150e33d614aa04f14ea3c4ec36b2a31f6fd003c2b86f3eb875b41","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:eed577dfc1af478642ba6a162514c6eb7811b5a256521d7f14609d9d4ef44171","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:37631ab69dfb49142e11b3c10f608291d1a11c974f8e064bbb87c73268367e71","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:083e38a051bf79856ec82149dae8b19e6b42fc2ad761900ee088870aadfa57ab","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:ed057b74a24d0bffe3a1fae6253021b8a7710f51358d3f68cd67179ee55e2dad","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05137","last_updated":"2022-05-24T15:25:44Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","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-07T14:45:57.354451Z","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:0e482cad1da66e3379390f361675342a5ed9abe033482ace798989af5d2a7c22","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:e0b0025a99c072a8bcc0e48f9cb90df25857a4d1927a2a412be642186add24ce","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:62778bffed08167c870799480faeabd3a0945e82446dfcb0ba2be79690aad7d4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:e1aa0a89fafa8299a81374fb1caad041436b7a887dd613f8d87dbeabdda6a4a2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:e7be424124e63f17ff381eecd029015eb8a0c7439aa232f07d256faf9949e989","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:82c151ff1a98d40d5d542296d422205d93ec899846c0716dcc9b99c2a52ce347","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:3adf3b3bb9bec61ac1fc4156a6546455c6bb8d8db34542e34455debeec47a0de","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:047ea5a71df787b146982d5267a988fb0f1f9a624a93bbd22f036eda710d496f","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-04T23:24:01.674721Z","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-07T14:45:57.354451Z","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:813709942b3ae41d544ca680af73a16c60612b1773af0a07efe292825ed5c30d","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-07-06T11:39:44.670619Z","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-07T14:45:57.354451Z","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:e3d6398affb5e8321599a5ccc286a411d609d3c716cc9110ca479cd291c78167","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-07-06T03:32:01.065049Z","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-07T14:45:57.354451Z","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:0059063883cdcb76235461b8e9aaa64f70d5f9dd0c8b39592ace2694763ccbc1","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-07T14:45:57.354451Z","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:ae77939982c73677eb51d272f92441628a16f45a1dfbfe9f444118e590db9271","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:3ee04ee5e783083644cc9e4f5f71122358377a88d0f51afff83773398065a9fc","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:c3a43819d939c198ad9cb6df4f0dd64b8aab0d8f6be079b8bcf931d43bc12e38","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:2fe90b35058b97e1c6956ab003d9dbbb31b04018fad118e4ac5665e626ea2f7c","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:cad23c7321497aaa48a29970d8d859941b509e61ff12f75ddfa6afdf60008910","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.06522","last_updated":"2019-10-19T01:12:40Z","snapshot_observed_at":"2026-08-02T01:10:21.624628Z","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-07T14:45:57.354451Z","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:14c02b20f10061303451f17b7b9eb0a4d94afeb44279704a6829902c09f1b4ce","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-07T14:45:57.354451Z","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:c442c59f182d2e7b1d16ca23352660c0e81691a7f0d9634381908067978ee7f6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:6cb7c98c4c678cd56c205dc1d8a298eb7879e00f960da39c8eca60d26eaddcbf","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:b797c7f35443ed31bce533049ad0a2c50f9fe729ab89a0b4e123df6685c183d2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:612cb4567d92af2de9aed2bfed8e7c1ed6e347918792947b27ee84f81bb21501","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:377a09a28a8bd65c2de378924663cd4124eb0fa7239f3e25d416c526ca1cbd21","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03811","last_updated":"2024-03-06T16:00:46Z","snapshot_observed_at":"2026-07-06T17:40:29.558340Z","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-07T14:45:57.354451Z","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:79c2380739bf9b4d9f50de1fb80307e981fcf6b8395dce8ffc74ed784639754e","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-03T15:24:34.274276Z","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-07T14:45:57.354451Z","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:0482e5e6ce8ffa82f344a534ec18eb34b83eb9d6da470805a159429ccc862cfd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11015","last_updated":"2024-09-30T00:21:39Z","snapshot_observed_at":"2026-07-06T16:34:19.351760Z","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-07T14:45:57.354451Z","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:2b5069a12fa5e5974dfe33c916ac7245fd3f73feec0cab64a90a7611054135b9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:b06e1ca255676bc4b836d2b1e6dd286fb88370901b53bb2dea383e766dc0ac94","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01458","last_updated":"2024-07-02T15:17:50Z","snapshot_observed_at":"2026-07-06T18:39:43.472708Z","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-07T14:45:57.354451Z","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:524bc66463d9d31ccc581491a2095787e2e8e73c1e4c37c436e5160d49fab980","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-07T14:45:57.354451Z","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:0b91d1d54fcfa5ba48ce67a29b058606c1053cc4996eb722509e9ba7f3b35195","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:45:57.354451Z","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:3b8727ebeee1f5ebc4324beaf085d500b685f46820f17de4d3a2e6ad605cb919","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07143","last_updated":"2025-06-09T20:49:17Z","snapshot_observed_at":"2026-07-06T17:42:57.695380Z","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-07T14:45:57.354451Z","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:a0c49b5b71e5ccc9c67de9dadb3319cb7b1766e04690378968201318d01e4235","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-07T14:45:57.354451Z","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:ba3b6b37f72aa60e702a27d9cf44e0700cd6060622f5069ae997ed0e57abbb17","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17379","last_updated":"2025-05-23T01:30:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T14:45:57.354451Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2505.17379."}