{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PKZAB3FK5RF5LZXM2CTLDX3YWY","short_pith_number":"pith:PKZAB3FK","canonical_record":{"source":{"id":"1408.1234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-06T10:14:39Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"50dd387461ea2168c69e705706cf8c73401fc5e14ba7b8b0c30e858369b2b6fe","abstract_canon_sha256":"53264c9dbccf74b4117615c6f62bc8ea002701f0d62bd587481826ee2df175ab"},"schema_version":"1.0"},"canonical_sha256":"7ab200ecaaec4bd5e6ecd0a6b1df78b637c84dfc299de71a4da0c05b149c1425","source":{"kind":"arxiv","id":"1408.1234","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1234","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1234v3","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1234","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"PKZAB3FK5RF5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKZAB3FK5RF5LZXM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKZAB3FK","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PKZAB3FK5RF5LZXM2CTLDX3YWY","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-06T10:14:39Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"50dd387461ea2168c69e705706cf8c73401fc5e14ba7b8b0c30e858369b2b6fe","abstract_canon_sha256":"53264c9dbccf74b4117615c6f62bc8ea002701f0d62bd587481826ee2df175ab"},"schema_version":"1.0"},"canonical_sha256":"7ab200ecaaec4bd5e6ecd0a6b1df78b637c84dfc299de71a4da0c05b149c1425","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:30.114538Z","signature_b64":"Knm+Fy65jpibhOqMVyJWVDOodyctB+nkGw3JHCejZgSt130T8s3nW5YbAD1HPrQXUQ6eCVnNYWZ3a3NKBA9SCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ab200ecaaec4bd5e6ecd0a6b1df78b637c84dfc299de71a4da0c05b149c1425","last_reissued_at":"2026-05-18T00:22:30.113726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:30.113726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1234","source_version":3,"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-05-18T00:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8V91b5d0rnX3UTFa9khTo6rFNkQEH5AsMnagN4vmD4s8hwlLFfA9RrFSzcVxfu0+b6AlEYS9PUoz86XmynMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:53:18.291379Z"},"content_sha256":"72bfbf842f56b127970282e510961657bf72957ae638738fe5a429164f656e6b","schema_version":"1.0","event_id":"sha256:72bfbf842f56b127970282e510961657bf72957ae638738fe5a429164f656e6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PKZAB3FK5RF5LZXM2CTLDX3YWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Model Averaging with Exponentiated Least Square Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Dong Dai, Lei Han, Ting Yang, Tong Zhang","submitted_at":"2014-08-06T10:14:39Z","abstract_excerpt":"The model averaging problem is to average multiple models to achieve a prediction accuracy not much worse than that of the best single model in terms of mean squared error. It is known that if the models are misspecified, model averaging is superior to model selection. Specifically, let $n$ be the sample size, then the worst case regret of the former decays at a rate of $O(1/n)$ while the worst case regret of the latter decays at a rate of $O(1/\\sqrt{n})$. The recently proposed $Q$-aggregation algorithm \\citep{DaiRigZhang12} solves the model averaging problem with the optimal regret of $O(1/n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1234","kind":"arxiv","version":3},"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"},"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-05-18T00:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"550eqQRYvJ47Gm9i/n+W7cNs2FfnKlg1lJWvRw/H00EuHAd8x7+IKJ0poBOf88csSdmnHQxr27m43YokrAvlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:53:18.291797Z"},"content_sha256":"9f4cdd5e9ed83f91a7547927904047db1431b064808c28a0eb6bc74a3f649a17","schema_version":"1.0","event_id":"sha256:9f4cdd5e9ed83f91a7547927904047db1431b064808c28a0eb6bc74a3f649a17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY/bundle.json","state_url":"https://pith.science/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY/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-05-25T08:53:18Z","links":{"resolver":"https://pith.science/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY","bundle":"https://pith.science/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY/bundle.json","state":"https://pith.science/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKZAB3FK5RF5LZXM2CTLDX3YWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PKZAB3FK5RF5LZXM2CTLDX3YWY","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":"53264c9dbccf74b4117615c6f62bc8ea002701f0d62bd587481826ee2df175ab","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-06T10:14:39Z","title_canon_sha256":"50dd387461ea2168c69e705706cf8c73401fc5e14ba7b8b0c30e858369b2b6fe"},"schema_version":"1.0","source":{"id":"1408.1234","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1234","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1234v3","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1234","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"PKZAB3FK5RF5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKZAB3FK5RF5LZXM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKZAB3FK","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:9f4cdd5e9ed83f91a7547927904047db1431b064808c28a0eb6bc74a3f649a17","target":"graph","created_at":"2026-05-18T00:22:30Z","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"},"paper":{"abstract_excerpt":"The model averaging problem is to average multiple models to achieve a prediction accuracy not much worse than that of the best single model in terms of mean squared error. It is known that if the models are misspecified, model averaging is superior to model selection. Specifically, let $n$ be the sample size, then the worst case regret of the former decays at a rate of $O(1/n)$ while the worst case regret of the latter decays at a rate of $O(1/\\sqrt{n})$. The recently proposed $Q$-aggregation algorithm \\citep{DaiRigZhang12} solves the model averaging problem with the optimal regret of $O(1/n)","authors_text":"Dong Dai, Lei Han, Ting Yang, Tong Zhang","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-06T10:14:39Z","title":"Bayesian Model Averaging with Exponentiated Least Square Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1234","kind":"arxiv","version":3},"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:72bfbf842f56b127970282e510961657bf72957ae638738fe5a429164f656e6b","target":"record","created_at":"2026-05-18T00:22:30Z","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":"53264c9dbccf74b4117615c6f62bc8ea002701f0d62bd587481826ee2df175ab","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-06T10:14:39Z","title_canon_sha256":"50dd387461ea2168c69e705706cf8c73401fc5e14ba7b8b0c30e858369b2b6fe"},"schema_version":"1.0","source":{"id":"1408.1234","kind":"arxiv","version":3}},"canonical_sha256":"7ab200ecaaec4bd5e6ecd0a6b1df78b637c84dfc299de71a4da0c05b149c1425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ab200ecaaec4bd5e6ecd0a6b1df78b637c84dfc299de71a4da0c05b149c1425","first_computed_at":"2026-05-18T00:22:30.113726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:30.113726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Knm+Fy65jpibhOqMVyJWVDOodyctB+nkGw3JHCejZgSt130T8s3nW5YbAD1HPrQXUQ6eCVnNYWZ3a3NKBA9SCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:30.114538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1234","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72bfbf842f56b127970282e510961657bf72957ae638738fe5a429164f656e6b","sha256:9f4cdd5e9ed83f91a7547927904047db1431b064808c28a0eb6bc74a3f649a17"],"state_sha256":"5b184e85a0af14fba57666eeeee73f45f5d7c81276fa633cd8ba54e5a548a24a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/lYPu8aMHm7GUMQ6dRogOc4pZyjnS6L13yZzgnkjB4qfvQDBPOcPacnGzVLloWTbOpplii71yQfpBKovAqDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:53:18.294844Z","bundle_sha256":"7dc1a925ee4567bc41fabcc0580a2d64cc8b82810df71ddc8320f77d19292b62"}}