{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5LZTV6OGDKIHLOYGLZ4N63ZW5B","short_pith_number":"pith:5LZTV6OG","schema_version":"1.0","canonical_sha256":"eaf33af9c61a9075bb065e78df6f36e85a4607ce8df385ecfc7c193b3c0d5daf","source":{"kind":"arxiv","id":"2501.14928","version":1},"attestation_state":"computed","paper":{"title":"Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Fan Chen","submitted_at":"2025-01-24T21:31:50Z","abstract_excerpt":"We study the problem of interactive decision making in which the underlying environment changes over time subject to given constraints. We propose a framework, which we call \\textit{hybrid Decision Making with Structured Observations} (hybrid DMSO), that provides an interpolation between the stochastic and adversarial settings of decision making. Within this framework, we can analyze local differentially private (LDP) decision making, query-based learning (in particular, SQ learning), and robust and smooth decision making under the same umbrella, deriving upper and lower bounds based on varian"},"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":"2501.14928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-24T21:31:50Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a72f4db6e397a6e37abe514d4f85f6e3ef30033f8f5e0cfc18aa7c930f68a162","abstract_canon_sha256":"127e374952a2f081eea7c5f092f358d61fd4583dc95c9d4b2896005fa78bd82d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:20.986211Z","signature_b64":"wW/LxphwmPgUkOTzBJFsuFWWyfdd75ocCS/a6lNqX/NvH0zWNQoOlarwDgoQqWsIA9Fl7+8QBiuzRj4q9YH7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaf33af9c61a9075bb065e78df6f36e85a4607ce8df385ecfc7c193b3c0d5daf","last_reissued_at":"2026-07-05T10:05:20.985638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:20.985638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Fan Chen","submitted_at":"2025-01-24T21:31:50Z","abstract_excerpt":"We study the problem of interactive decision making in which the underlying environment changes over time subject to given constraints. We propose a framework, which we call \\textit{hybrid Decision Making with Structured Observations} (hybrid DMSO), that provides an interpolation between the stochastic and adversarial settings of decision making. Within this framework, we can analyze local differentially private (LDP) decision making, query-based learning (in particular, SQ learning), and robust and smooth decision making under the same umbrella, deriving upper and lower bounds based on varian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14928","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/2501.14928/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":"2501.14928","created_at":"2026-07-05T10:05:20.985727+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14928v1","created_at":"2026-07-05T10:05:20.985727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14928","created_at":"2026-07-05T10:05:20.985727+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LZTV6OGDKIH","created_at":"2026-07-05T10:05:20.985727+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LZTV6OGDKIHLOYG","created_at":"2026-07-05T10:05:20.985727+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LZTV6OG","created_at":"2026-07-05T10:05:20.985727+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23096","citing_title":"Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29645","citing_title":"The Sample Complexity of Multiclass and Sparse Contextual Bandits","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B","json":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B.json","graph_json":"https://pith.science/api/pith-number/5LZTV6OGDKIHLOYGLZ4N63ZW5B/graph.json","events_json":"https://pith.science/api/pith-number/5LZTV6OGDKIHLOYGLZ4N63ZW5B/events.json","paper":"https://pith.science/paper/5LZTV6OG"},"agent_actions":{"view_html":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B","download_json":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B.json","view_paper":"https://pith.science/paper/5LZTV6OG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14928&json=true","fetch_graph":"https://pith.science/api/pith-number/5LZTV6OGDKIHLOYGLZ4N63ZW5B/graph.json","fetch_events":"https://pith.science/api/pith-number/5LZTV6OGDKIHLOYGLZ4N63ZW5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B/action/storage_attestation","attest_author":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B/action/author_attestation","sign_citation":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B/action/citation_signature","submit_replication":"https://pith.science/pith/5LZTV6OGDKIHLOYGLZ4N63ZW5B/action/replication_record"}},"created_at":"2026-07-05T10:05:20.985727+00:00","updated_at":"2026-07-05T10:05:20.985727+00:00"}