{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TKCK3FTNJYGFV364QAIC2ZIMTE","short_pith_number":"pith:TKCK3FTN","schema_version":"1.0","canonical_sha256":"9a84ad966d4e0c5aefdc80102d650c990834c00d08e392f5ebeec23151a72d34","source":{"kind":"arxiv","id":"1206.3381","version":1},"attestation_state":"computed","paper":{"title":"On the Cover-Hart Inequality: What's a Sample of Size One Worth?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Tilmann Gneiting","submitted_at":"2012-06-15T07:19:07Z","abstract_excerpt":"Bob predicts a future observation based on a sample of size one. Alice can draw a sample of any size before issuing her prediction. How much better can she do than Bob? Perhaps surprisingly, under a large class of loss functions, which we refer to as the Cover-Hart family, the best Alice can do is to halve Bob's risk. In this sense, half the information in an infinite sample is contained in a sample of size one. The Cover-Hart family is a convex cone that includes metrics and negative definite functions, subject to slight regularity conditions. These results may help explain the small relative"},"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":"1206.3381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-15T07:19:07Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"1937c4f0714617978b37d0ee1be4aec4f9e7144c986b94a62d1dfda3053bead7","abstract_canon_sha256":"471e392f6445c63e48c182ab67563cb0cd41d9fc969672c10d73492d1a2366ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.436385Z","signature_b64":"21LzcHj/XUteqG6JsWzjGgy8TgnIshOehotCt4kTnEB2cfwaTJIunx0V5AVzKcHWXpMD6L5pc5+KPxM1lD4dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a84ad966d4e0c5aefdc80102d650c990834c00d08e392f5ebeec23151a72d34","last_reissued_at":"2026-05-18T03:53:30.435662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.435662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Cover-Hart Inequality: What's a Sample of Size One Worth?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Tilmann Gneiting","submitted_at":"2012-06-15T07:19:07Z","abstract_excerpt":"Bob predicts a future observation based on a sample of size one. Alice can draw a sample of any size before issuing her prediction. How much better can she do than Bob? Perhaps surprisingly, under a large class of loss functions, which we refer to as the Cover-Hart family, the best Alice can do is to halve Bob's risk. In this sense, half the information in an infinite sample is contained in a sample of size one. The Cover-Hart family is a convex cone that includes metrics and negative definite functions, subject to slight regularity conditions. These results may help explain the small relative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3381","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":"1206.3381","created_at":"2026-05-18T03:53:30.435751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3381v1","created_at":"2026-05-18T03:53:30.435751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3381","created_at":"2026-05-18T03:53:30.435751+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKCK3FTNJYGF","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKCK3FTNJYGFV364","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKCK3FTN","created_at":"2026-05-18T12:27:23.164592+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/TKCK3FTNJYGFV364QAIC2ZIMTE","json":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE.json","graph_json":"https://pith.science/api/pith-number/TKCK3FTNJYGFV364QAIC2ZIMTE/graph.json","events_json":"https://pith.science/api/pith-number/TKCK3FTNJYGFV364QAIC2ZIMTE/events.json","paper":"https://pith.science/paper/TKCK3FTN"},"agent_actions":{"view_html":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE","download_json":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE.json","view_paper":"https://pith.science/paper/TKCK3FTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3381&json=true","fetch_graph":"https://pith.science/api/pith-number/TKCK3FTNJYGFV364QAIC2ZIMTE/graph.json","fetch_events":"https://pith.science/api/pith-number/TKCK3FTNJYGFV364QAIC2ZIMTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE/action/storage_attestation","attest_author":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE/action/author_attestation","sign_citation":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE/action/citation_signature","submit_replication":"https://pith.science/pith/TKCK3FTNJYGFV364QAIC2ZIMTE/action/replication_record"}},"created_at":"2026-05-18T03:53:30.435751+00:00","updated_at":"2026-05-18T03:53:30.435751+00:00"}