{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:K5A2OPUZIPPJT2TAXMJI6SQQFU","short_pith_number":"pith:K5A2OPUZ","schema_version":"1.0","canonical_sha256":"5741a73e9943de99ea60bb128f4a102d190dbe22dba829e724f8a47093943bac","source":{"kind":"arxiv","id":"1412.3276","version":1},"attestation_state":"computed","paper":{"title":"Generalised Entropy MDPs and Minimax Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christos Dimitrakakis, Emmanouil G. Androulakis","submitted_at":"2014-12-10T12:28:34Z","abstract_excerpt":"Bayesian methods suffer from the problem of how to specify prior beliefs. One interesting idea is to consider worst-case priors. This requires solving a stochastic zero-sum game. In this paper, we extend well-known results from bandit theory in order to discover minimax-Bayes policies and discuss when they are practical."},"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":"1412.3276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-10T12:28:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8683b4e465199a8bb8c2f9b412d2787b2e72bde77fd8ecb1bfa0f5de6ad5c7b3","abstract_canon_sha256":"f6b2e77b343fce0e62b62ed5c459132e50f761657eec88bf5bff4901906745ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:37.100882Z","signature_b64":"clCTtvopzWgac2+SRTRZ8D4mbdsHYRpSv3nYRnBZiAodDQFs29mmW/r+JQXOJiJ62igQXAH4US1uPxtTjNa+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5741a73e9943de99ea60bb128f4a102d190dbe22dba829e724f8a47093943bac","last_reissued_at":"2026-05-18T02:31:37.100255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:37.100255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised Entropy MDPs and Minimax Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christos Dimitrakakis, Emmanouil G. Androulakis","submitted_at":"2014-12-10T12:28:34Z","abstract_excerpt":"Bayesian methods suffer from the problem of how to specify prior beliefs. One interesting idea is to consider worst-case priors. This requires solving a stochastic zero-sum game. In this paper, we extend well-known results from bandit theory in order to discover minimax-Bayes policies and discuss when they are practical."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3276","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":""},"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":"1412.3276","created_at":"2026-05-18T02:31:37.100351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3276v1","created_at":"2026-05-18T02:31:37.100351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3276","created_at":"2026-05-18T02:31:37.100351+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5A2OPUZIPPJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5A2OPUZIPPJT2TA","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5A2OPUZ","created_at":"2026-05-18T12:28:35.611951+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/K5A2OPUZIPPJT2TAXMJI6SQQFU","json":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU.json","graph_json":"https://pith.science/api/pith-number/K5A2OPUZIPPJT2TAXMJI6SQQFU/graph.json","events_json":"https://pith.science/api/pith-number/K5A2OPUZIPPJT2TAXMJI6SQQFU/events.json","paper":"https://pith.science/paper/K5A2OPUZ"},"agent_actions":{"view_html":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU","download_json":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU.json","view_paper":"https://pith.science/paper/K5A2OPUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3276&json=true","fetch_graph":"https://pith.science/api/pith-number/K5A2OPUZIPPJT2TAXMJI6SQQFU/graph.json","fetch_events":"https://pith.science/api/pith-number/K5A2OPUZIPPJT2TAXMJI6SQQFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU/action/storage_attestation","attest_author":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU/action/author_attestation","sign_citation":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU/action/citation_signature","submit_replication":"https://pith.science/pith/K5A2OPUZIPPJT2TAXMJI6SQQFU/action/replication_record"}},"created_at":"2026-05-18T02:31:37.100351+00:00","updated_at":"2026-05-18T02:31:37.100351+00:00"}