{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FRBRO3XWU2GKSKAYQQQS2VK3HE","short_pith_number":"pith:FRBRO3XW","schema_version":"1.0","canonical_sha256":"2c43176ef6a68ca9281884212d555b39197c3321c24341898dffc658a7625498","source":{"kind":"arxiv","id":"2606.12763","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Weighted Averaging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aditya Bhaskara, Ashok Cutkosky, Manish Purohit, Ravi Kumar","submitted_at":"2026-06-11T00:03:10Z","abstract_excerpt":"We study the problem of selecting the largest among $n$ unknown values $x_1,\\dots,x_n$ given only a single unbiased estimate $y_i$ for each $x_i$. We design strategies that are simultaneously admissible (not uniformly dominated by any other strategy) and also never worse than a given baseline such as uniform random selection. We provide an application to stochastic optimization, where we obtain online-to-batch conversion bounds with a desirable \"no-compromise\" guarantee: they are never worse than standard random iterate selection, and yet can be significantly better in benign settings."},"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":"2606.12763","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-11T00:03:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ec3a87dcd996637d8c7d8a5cace98d2295852ca629b0d7d2c4c6c9ff69c1014f","abstract_canon_sha256":"5ae2766a733ce66abb0dde2bf3223e772176e1b1e9ff15d4befa19dd3abe25b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:49.908000Z","signature_b64":"syu+h/hrdJ5qGPeAuYsiCHBasaaSQc5phXhUJBt1zntMq7qJM3MhM2u/SNeLi7KIK2/tLv2RcIPu/lARpBdODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c43176ef6a68ca9281884212d555b39197c3321c24341898dffc658a7625498","last_reissued_at":"2026-06-12T01:08:49.907180Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:49.907180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Weighted Averaging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aditya Bhaskara, Ashok Cutkosky, Manish Purohit, Ravi Kumar","submitted_at":"2026-06-11T00:03:10Z","abstract_excerpt":"We study the problem of selecting the largest among $n$ unknown values $x_1,\\dots,x_n$ given only a single unbiased estimate $y_i$ for each $x_i$. We design strategies that are simultaneously admissible (not uniformly dominated by any other strategy) and also never worse than a given baseline such as uniform random selection. We provide an application to stochastic optimization, where we obtain online-to-batch conversion bounds with a desirable \"no-compromise\" guarantee: they are never worse than standard random iterate selection, and yet can be significantly better in benign settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12763","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/2606.12763/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":"2606.12763","created_at":"2026-06-12T01:08:49.907322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12763v1","created_at":"2026-06-12T01:08:49.907322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12763","created_at":"2026-06-12T01:08:49.907322+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRBRO3XWU2GK","created_at":"2026-06-12T01:08:49.907322+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRBRO3XWU2GKSKAY","created_at":"2026-06-12T01:08:49.907322+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRBRO3XW","created_at":"2026-06-12T01:08:49.907322+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/FRBRO3XWU2GKSKAYQQQS2VK3HE","json":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE.json","graph_json":"https://pith.science/api/pith-number/FRBRO3XWU2GKSKAYQQQS2VK3HE/graph.json","events_json":"https://pith.science/api/pith-number/FRBRO3XWU2GKSKAYQQQS2VK3HE/events.json","paper":"https://pith.science/paper/FRBRO3XW"},"agent_actions":{"view_html":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE","download_json":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE.json","view_paper":"https://pith.science/paper/FRBRO3XW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12763&json=true","fetch_graph":"https://pith.science/api/pith-number/FRBRO3XWU2GKSKAYQQQS2VK3HE/graph.json","fetch_events":"https://pith.science/api/pith-number/FRBRO3XWU2GKSKAYQQQS2VK3HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE/action/storage_attestation","attest_author":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE/action/author_attestation","sign_citation":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE/action/citation_signature","submit_replication":"https://pith.science/pith/FRBRO3XWU2GKSKAYQQQS2VK3HE/action/replication_record"}},"created_at":"2026-06-12T01:08:49.907322+00:00","updated_at":"2026-06-12T01:08:49.907322+00:00"}