{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WZYSSKVHRVABKQJJJLPWN7VFPU","short_pith_number":"pith:WZYSSKVH","schema_version":"1.0","canonical_sha256":"b671292aa78d401541294adf66fea57d3e43c62a40b0cff1f35d3273c00b0760","source":{"kind":"arxiv","id":"2307.05953","version":1},"attestation_state":"computed","paper":{"title":"Reward Selection with Noisy Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, Aranyak Mehta, Kamyar Azizzadenesheli, Qian Zhang, Trung Dang","submitted_at":"2023-07-12T06:50:07Z","abstract_excerpt":"We study a fundamental problem in optimization under uncertainty. There are $n$ boxes; each box $i$ contains a hidden reward $x_i$. Rewards are drawn i.i.d. from an unknown distribution $\\mathcal{D}$. For each box $i$, we see $y_i$, an unbiased estimate of its reward, which is drawn from a Normal distribution with known standard deviation $\\sigma_i$ (and an unknown mean $x_i$). Our task is to select a single box, with the goal of maximizing our reward. This problem captures a wide range of applications, e.g. ad auctions, where the hidden reward is the click-through rate of an ad. Previous work"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2307.05953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-07-12T06:50:07Z","cross_cats_sorted":[],"title_canon_sha256":"9aa41054230943440e0919f8fb8cf3736be5a75059025f4eddabada68c2463c6","abstract_canon_sha256":"aad1b32f718534a8e697d0ac0ce5bd7b87273fc25a3e5db4955b5613d864f25f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:14.601703Z","signature_b64":"2JqsVv5wo2oM+jys8QBb8PLysRRX6UhOXjC66ZCdFY/CMVSGqiNqjKJPylJAl/ITqSG4IaJ0In/b6S/XucRmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b671292aa78d401541294adf66fea57d3e43c62a40b0cff1f35d3273c00b0760","last_reissued_at":"2026-07-05T06:30:14.601351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:14.601351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reward Selection with Noisy Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, Aranyak Mehta, Kamyar Azizzadenesheli, Qian Zhang, Trung Dang","submitted_at":"2023-07-12T06:50:07Z","abstract_excerpt":"We study a fundamental problem in optimization under uncertainty. There are $n$ boxes; each box $i$ contains a hidden reward $x_i$. Rewards are drawn i.i.d. from an unknown distribution $\\mathcal{D}$. For each box $i$, we see $y_i$, an unbiased estimate of its reward, which is drawn from a Normal distribution with known standard deviation $\\sigma_i$ (and an unknown mean $x_i$). Our task is to select a single box, with the goal of maximizing our reward. This problem captures a wide range of applications, e.g. ad auctions, where the hidden reward is the click-through rate of an ad. Previous work"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.05953","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.05953/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.05953","created_at":"2026-07-05T06:30:14.601416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.05953v1","created_at":"2026-07-05T06:30:14.601416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.05953","created_at":"2026-07-05T06:30:14.601416+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZYSSKVHRVAB","created_at":"2026-07-05T06:30:14.601416+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZYSSKVHRVABKQJJ","created_at":"2026-07-05T06:30:14.601416+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZYSSKVH","created_at":"2026-07-05T06:30:14.601416+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU","json":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU.json","graph_json":"https://pith.science/api/pith-number/WZYSSKVHRVABKQJJJLPWN7VFPU/graph.json","events_json":"https://pith.science/api/pith-number/WZYSSKVHRVABKQJJJLPWN7VFPU/events.json","paper":"https://pith.science/paper/WZYSSKVH"},"agent_actions":{"view_html":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU","download_json":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU.json","view_paper":"https://pith.science/paper/WZYSSKVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.05953&json=true","fetch_graph":"https://pith.science/api/pith-number/WZYSSKVHRVABKQJJJLPWN7VFPU/graph.json","fetch_events":"https://pith.science/api/pith-number/WZYSSKVHRVABKQJJJLPWN7VFPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU/action/storage_attestation","attest_author":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU/action/author_attestation","sign_citation":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU/action/citation_signature","submit_replication":"https://pith.science/pith/WZYSSKVHRVABKQJJJLPWN7VFPU/action/replication_record"}},"created_at":"2026-07-05T06:30:14.601416+00:00","updated_at":"2026-07-05T06:30:14.601416+00:00"}