{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EOCLWUNY3FCQNBB5VACMJU4BOT","short_pith_number":"pith:EOCLWUNY","canonical_record":{"source":{"id":"2006.11430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-19T22:49:42Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"696162f83b5bdf945f5a06717c54578719c03a0b0932096a57f5288f8cd6f4df","abstract_canon_sha256":"1bd372267579f93d5f650ddfa719b6ace8bed8a361fd7742b3ec83a805fde8f2"},"schema_version":"1.0"},"canonical_sha256":"2384bb51b8d94506843da804c4d38174e755f3820ecb2c43b74c8f08381a2e55","source":{"kind":"arxiv","id":"2006.11430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.11430","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"2006.11430v1","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.11430","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"EOCLWUNY3FCQ","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"EOCLWUNY3FCQNBB5","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"EOCLWUNY","created_at":"2026-07-05T01:11:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EOCLWUNY3FCQNBB5VACMJU4BOT","target":"record","payload":{"canonical_record":{"source":{"id":"2006.11430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-19T22:49:42Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"696162f83b5bdf945f5a06717c54578719c03a0b0932096a57f5288f8cd6f4df","abstract_canon_sha256":"1bd372267579f93d5f650ddfa719b6ace8bed8a361fd7742b3ec83a805fde8f2"},"schema_version":"1.0"},"canonical_sha256":"2384bb51b8d94506843da804c4d38174e755f3820ecb2c43b74c8f08381a2e55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:50.179947Z","signature_b64":"roSb01I4syCOb7XJ6pAUZRXiObeax1b9wpwbhAIC2ErEReHskJJgxOs+wbkgNTxaxL1C58zvaOTC+z5aVbtjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2384bb51b8d94506843da804c4d38174e755f3820ecb2c43b74c8f08381a2e55","last_reissued_at":"2026-07-05T01:11:50.179608Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:50.179608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.11430","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0TDT1epn3QAHZZL/GV3tP3bbFF7WsnjZ7hZT3eA4T2QHDTU8CoXzkuzQdekVlp9p1eLzD+tYkDocKFl2c3xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:08:49.220185Z"},"content_sha256":"709883ee58a143aeb681a4e8903e5dd08b9af6c01c48ab1bdb0642e05abb9f54","schema_version":"1.0","event_id":"sha256:709883ee58a143aeb681a4e8903e5dd08b9af6c01c48ab1bdb0642e05abb9f54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EOCLWUNY3FCQNBB5VACMJU4BOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Minimax Estimators via Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Adarsh Prasad, Arun Sai Suggala, Kartik Gupta, Pradeep Ravikumar, Praneeth Netrapalli","submitted_at":"2020-06-19T22:49:42Z","abstract_excerpt":"We consider the problem of designing minimax estimators for estimating the parameters of a probability distribution. Unlike classical approaches such as the MLE and minimum distance estimators, we consider an algorithmic approach for constructing such estimators. We view the problem of designing minimax estimators as finding a mixed strategy Nash equilibrium of a zero-sum game. By leveraging recent results in online learning with non-convex losses, we provide a general algorithm for finding a mixed-strategy Nash equilibrium of general non-convex non-concave zero-sum games. Our algorithm requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.11430","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/2006.11430/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNSuDYs59jhPFWD7Y+3YP0dDu5526H8d0OU/jGNHbBejTYHJFnY8N0BEY09kSMnhd/h98Gxnau5Y/n1S6njXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:08:49.220791Z"},"content_sha256":"4bea8ee36e7fb9c438d8c39efff435ba8bdcc1d00215a941e8243c5bf4c5503e","schema_version":"1.0","event_id":"sha256:4bea8ee36e7fb9c438d8c39efff435ba8bdcc1d00215a941e8243c5bf4c5503e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EOCLWUNY3FCQNBB5VACMJU4BOT/bundle.json","state_url":"https://pith.science/pith/EOCLWUNY3FCQNBB5VACMJU4BOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EOCLWUNY3FCQNBB5VACMJU4BOT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T09:08:49Z","links":{"resolver":"https://pith.science/pith/EOCLWUNY3FCQNBB5VACMJU4BOT","bundle":"https://pith.science/pith/EOCLWUNY3FCQNBB5VACMJU4BOT/bundle.json","state":"https://pith.science/pith/EOCLWUNY3FCQNBB5VACMJU4BOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EOCLWUNY3FCQNBB5VACMJU4BOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EOCLWUNY3FCQNBB5VACMJU4BOT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1bd372267579f93d5f650ddfa719b6ace8bed8a361fd7742b3ec83a805fde8f2","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-19T22:49:42Z","title_canon_sha256":"696162f83b5bdf945f5a06717c54578719c03a0b0932096a57f5288f8cd6f4df"},"schema_version":"1.0","source":{"id":"2006.11430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.11430","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"2006.11430v1","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.11430","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"EOCLWUNY3FCQ","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"EOCLWUNY3FCQNBB5","created_at":"2026-07-05T01:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"EOCLWUNY","created_at":"2026-07-05T01:11:50Z"}],"graph_snapshots":[{"event_id":"sha256:4bea8ee36e7fb9c438d8c39efff435ba8bdcc1d00215a941e8243c5bf4c5503e","target":"graph","created_at":"2026-07-05T01:11:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.11430/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of designing minimax estimators for estimating the parameters of a probability distribution. Unlike classical approaches such as the MLE and minimum distance estimators, we consider an algorithmic approach for constructing such estimators. We view the problem of designing minimax estimators as finding a mixed strategy Nash equilibrium of a zero-sum game. By leveraging recent results in online learning with non-convex losses, we provide a general algorithm for finding a mixed-strategy Nash equilibrium of general non-convex non-concave zero-sum games. Our algorithm requir","authors_text":"Adarsh Prasad, Arun Sai Suggala, Kartik Gupta, Pradeep Ravikumar, Praneeth Netrapalli","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-19T22:49:42Z","title":"Learning Minimax Estimators via Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.11430","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:709883ee58a143aeb681a4e8903e5dd08b9af6c01c48ab1bdb0642e05abb9f54","target":"record","created_at":"2026-07-05T01:11:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1bd372267579f93d5f650ddfa719b6ace8bed8a361fd7742b3ec83a805fde8f2","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-19T22:49:42Z","title_canon_sha256":"696162f83b5bdf945f5a06717c54578719c03a0b0932096a57f5288f8cd6f4df"},"schema_version":"1.0","source":{"id":"2006.11430","kind":"arxiv","version":1}},"canonical_sha256":"2384bb51b8d94506843da804c4d38174e755f3820ecb2c43b74c8f08381a2e55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2384bb51b8d94506843da804c4d38174e755f3820ecb2c43b74c8f08381a2e55","first_computed_at":"2026-07-05T01:11:50.179608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:50.179608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"roSb01I4syCOb7XJ6pAUZRXiObeax1b9wpwbhAIC2ErEReHskJJgxOs+wbkgNTxaxL1C58zvaOTC+z5aVbtjBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:50.179947Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.11430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:709883ee58a143aeb681a4e8903e5dd08b9af6c01c48ab1bdb0642e05abb9f54","sha256:4bea8ee36e7fb9c438d8c39efff435ba8bdcc1d00215a941e8243c5bf4c5503e"],"state_sha256":"e16d5023b16ceaea0d75b1d1d967513583a8dbf6d7d4ca1f3d371dacf98fa039"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7/deZN0cM8KYBZR3z8gkpmgrFeaBCEKkhgiQvRuS9Ad8lOv6wLCtadIFk30mJ/ldlOH6OsbTRfucfAyXulHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T09:08:49.225985Z","bundle_sha256":"596e55aaacf501b686695efe32874115964e65e29312e6f66b5f67c3d8123f79"}}