{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FXHSSX2XSDPYEY4SDXFRBFFM4V","short_pith_number":"pith:FXHSSX2X","canonical_record":{"source":{"id":"1902.01903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T20:41:57Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ee8caf87f63a1779dfe7d1dd280d0dcc7503d7f4ad2b9c14570c747c6cba4836","abstract_canon_sha256":"efc06753872a74bdb947ab01c2e6852ea3b2252b7b4fae5ec86fc7cf0d942d0a"},"schema_version":"1.0"},"canonical_sha256":"2dcf295f5790df8263921dcb1094ace574a353c614e933efdb88bd6a64d82324","source":{"kind":"arxiv","id":"1902.01903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01903","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01903v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01903","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"FXHSSX2XSDPY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FXHSSX2XSDPYEY4S","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FXHSSX2X","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FXHSSX2XSDPYEY4SDXFRBFFM4V","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T20:41:57Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ee8caf87f63a1779dfe7d1dd280d0dcc7503d7f4ad2b9c14570c747c6cba4836","abstract_canon_sha256":"efc06753872a74bdb947ab01c2e6852ea3b2252b7b4fae5ec86fc7cf0d942d0a"},"schema_version":"1.0"},"canonical_sha256":"2dcf295f5790df8263921dcb1094ace574a353c614e933efdb88bd6a64d82324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.467062Z","signature_b64":"vZkFG2cX6C1L71UUXZwoOt/RxafCukOktn4p71zS2fS3a1Le5w8P9T9IzeEH5azQ96/7ZCx8kV5dVBZ56IdABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dcf295f5790df8263921dcb1094ace574a353c614e933efdb88bd6a64d82324","last_reissued_at":"2026-05-17T23:54:38.466506Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.466506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01903","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-05-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEKdYwyu1otKSVByBa53gozfbX44aOszpNGIBb7CcXjg606RON0qSm7BIXXS/5/yUqUs6H36lTlLki9hHTdXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:43:54.499311Z"},"content_sha256":"d6bd126af0c78df8db97e08709c03f8b93cbc56b87f64a65315ea37dcaca3b20","schema_version":"1.0","event_id":"sha256:d6bd126af0c78df8db97e08709c03f8b93cbc56b87f64a65315ea37dcaca3b20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FXHSSX2XSDPYEY4SDXFRBFFM4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponentiated Gradient Meets Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Udaya Ghai, Yoram Singer","submitted_at":"2019-02-05T20:41:57Z","abstract_excerpt":"The (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entropy function, which we call hypentropy. It is motivated by a natural extension of the multiplicative update to negative numbers. The hypentropy has a natural spectral counterpart which we use to derive a family of matrix-based updates that bridge gradient methods and the multipli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01903","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"},"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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfUx3cR+eKKUIzrEKHKqQzz19GYl+8Sp62MM0LVFR2kAO8RPUP/op8Ct5xGc9co0WiWRXrvc9NKlLz/oWAerBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:43:54.499962Z"},"content_sha256":"93575590b6b9153c6d4eef5a2299a80ba93b1e93d47b25249096a5a1aafb1b38","schema_version":"1.0","event_id":"sha256:93575590b6b9153c6d4eef5a2299a80ba93b1e93d47b25249096a5a1aafb1b38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V/bundle.json","state_url":"https://pith.science/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V/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-22T23:43:54Z","links":{"resolver":"https://pith.science/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V","bundle":"https://pith.science/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V/bundle.json","state":"https://pith.science/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXHSSX2XSDPYEY4SDXFRBFFM4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FXHSSX2XSDPYEY4SDXFRBFFM4V","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":"efc06753872a74bdb947ab01c2e6852ea3b2252b7b4fae5ec86fc7cf0d942d0a","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T20:41:57Z","title_canon_sha256":"ee8caf87f63a1779dfe7d1dd280d0dcc7503d7f4ad2b9c14570c747c6cba4836"},"schema_version":"1.0","source":{"id":"1902.01903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01903","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01903v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01903","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"FXHSSX2XSDPY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FXHSSX2XSDPYEY4S","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FXHSSX2X","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:93575590b6b9153c6d4eef5a2299a80ba93b1e93d47b25249096a5a1aafb1b38","target":"graph","created_at":"2026-05-17T23:54:38Z","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 (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entropy function, which we call hypentropy. It is motivated by a natural extension of the multiplicative update to negative numbers. The hypentropy has a natural spectral counterpart which we use to derive a family of matrix-based updates that bridge gradient methods and the multipli","authors_text":"Elad Hazan, Udaya Ghai, Yoram Singer","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T20:41:57Z","title":"Exponentiated Gradient Meets Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01903","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:d6bd126af0c78df8db97e08709c03f8b93cbc56b87f64a65315ea37dcaca3b20","target":"record","created_at":"2026-05-17T23:54:38Z","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":"efc06753872a74bdb947ab01c2e6852ea3b2252b7b4fae5ec86fc7cf0d942d0a","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T20:41:57Z","title_canon_sha256":"ee8caf87f63a1779dfe7d1dd280d0dcc7503d7f4ad2b9c14570c747c6cba4836"},"schema_version":"1.0","source":{"id":"1902.01903","kind":"arxiv","version":1}},"canonical_sha256":"2dcf295f5790df8263921dcb1094ace574a353c614e933efdb88bd6a64d82324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dcf295f5790df8263921dcb1094ace574a353c614e933efdb88bd6a64d82324","first_computed_at":"2026-05-17T23:54:38.466506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.466506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vZkFG2cX6C1L71UUXZwoOt/RxafCukOktn4p71zS2fS3a1Le5w8P9T9IzeEH5azQ96/7ZCx8kV5dVBZ56IdABw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.467062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6bd126af0c78df8db97e08709c03f8b93cbc56b87f64a65315ea37dcaca3b20","sha256:93575590b6b9153c6d4eef5a2299a80ba93b1e93d47b25249096a5a1aafb1b38"],"state_sha256":"bc3ccf888dea4da3ebba821433761fc2e2680b050b2478111617ebe543546102"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KF1s5Wbko16h5g2LXGmDULnf4W+tTpMeyVPEajDrUUA25Vn533PKojiQqCAqWx6FHvlloJcm9vJFoKR/l/wMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T23:43:54.503200Z","bundle_sha256":"57d8e8094e9989ae5e03e53bdfe8f6b6a8ecc1fd13c6232e3228baf9d405e7f7"}}