{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:65CNNNUS3J6S7SSTWM3YELHANZ","short_pith_number":"pith:65CNNNUS","canonical_record":{"source":{"id":"1811.09955","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T05:58:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0baf8e72409c82b03cc0b60ee7454ca2a5d8689fe00dfdd2ec0c521760796028","abstract_canon_sha256":"ae7964ad6d2a89225d0221912890f12bb2ba52332fffd81a41de7f3ec679c67b"},"schema_version":"1.0"},"canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","source":{"kind":"arxiv","id":"1811.09955","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09955","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09955v3","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09955","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"65CNNNUS3J6S","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65CNNNUS3J6S7SST","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65CNNNUS","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:65CNNNUS3J6S7SSTWM3YELHANZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09955","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T05:58:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0baf8e72409c82b03cc0b60ee7454ca2a5d8689fe00dfdd2ec0c521760796028","abstract_canon_sha256":"ae7964ad6d2a89225d0221912890f12bb2ba52332fffd81a41de7f3ec679c67b"},"schema_version":"1.0"},"canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:13.989573Z","signature_b64":"Kl+GipjqRl6M41IjCX9k7BhkJax0bs7GXaENLP2glN4P3uFQwRUJR1TStigdCcMArwP3SS6QV4FpsSDveD+UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","last_reissued_at":"2026-05-17T23:51:13.989038Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:13.989038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09955","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-17T23:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VAv0+EZqUnUS+BkAwU2LzT7XdD5HpHgAx2ke0ARZU79RHSdbU3Raqn8oUv2dvIfmIjrVZ5CxGnTb0d5PgZMiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:36:52.987971Z"},"content_sha256":"7822cc60129e64eb33f3fcf5621fc8b7a382d730a0c5301c8fad732145a54414","schema_version":"1.0","event_id":"sha256:7822cc60129e64eb33f3fcf5621fc8b7a382d730a0c5301c8fad732145a54414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:65CNNNUS3J6S7SSTWM3YELHANZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Newton Step Algorithm with Estimated Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Binbin Liu, Huan Liu, Jundong Li, Ling Jian, Xijun Liang, Yunquan Song","submitted_at":"2018-11-25T05:58:57Z","abstract_excerpt":"Online learning with limited information feedback (bandit) tries to solve the problem where an online learner receives partial feedback information from the environment in the course of learning. Under this setting, Flaxman et al.[8] extended Zinkevich's classical Online Gradient Descent (OGD) algorithm [29] by proposing the Online Gradient Descent with Expected Gradient (OGDEG) algorithm. Specifically, it uses a simple trick to approximate the gradient of the loss function $f_t$ by evaluating it at a single point and bounds the expected regret as $\\mathcal{O}(T^{5/6})$ [8], where the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09955","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-17T23:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ba6lBL1BipXrgYLOaERCX8OodtLClgAH9GAN1iEpqXVdN6dpvwCeVhaIvrIW1UQVd/rRMtvM8b2LEDhX4tPfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:36:52.988313Z"},"content_sha256":"1b61bb0be3bdcdd25e39c95ee1cc4dbcfc1a7271d974101e9ea13fd4e62adc49","schema_version":"1.0","event_id":"sha256:1b61bb0be3bdcdd25e39c95ee1cc4dbcfc1a7271d974101e9ea13fd4e62adc49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/bundle.json","state_url":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65CNNNUS3J6S7SSTWM3YELHANZ/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-30T08:36:52Z","links":{"resolver":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ","bundle":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/bundle.json","state":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65CNNNUS3J6S7SSTWM3YELHANZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:65CNNNUS3J6S7SSTWM3YELHANZ","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":"ae7964ad6d2a89225d0221912890f12bb2ba52332fffd81a41de7f3ec679c67b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T05:58:57Z","title_canon_sha256":"0baf8e72409c82b03cc0b60ee7454ca2a5d8689fe00dfdd2ec0c521760796028"},"schema_version":"1.0","source":{"id":"1811.09955","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09955","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09955v3","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09955","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"65CNNNUS3J6S","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65CNNNUS3J6S7SST","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65CNNNUS","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:1b61bb0be3bdcdd25e39c95ee1cc4dbcfc1a7271d974101e9ea13fd4e62adc49","target":"graph","created_at":"2026-05-17T23:51:13Z","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":"Online learning with limited information feedback (bandit) tries to solve the problem where an online learner receives partial feedback information from the environment in the course of learning. Under this setting, Flaxman et al.[8] extended Zinkevich's classical Online Gradient Descent (OGD) algorithm [29] by proposing the Online Gradient Descent with Expected Gradient (OGDEG) algorithm. Specifically, it uses a simple trick to approximate the gradient of the loss function $f_t$ by evaluating it at a single point and bounds the expected regret as $\\mathcal{O}(T^{5/6})$ [8], where the number o","authors_text":"Binbin Liu, Huan Liu, Jundong Li, Ling Jian, Xijun Liang, Yunquan Song","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T05:58:57Z","title":"Online Newton Step Algorithm with Estimated Gradient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09955","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:7822cc60129e64eb33f3fcf5621fc8b7a382d730a0c5301c8fad732145a54414","target":"record","created_at":"2026-05-17T23:51:13Z","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":"ae7964ad6d2a89225d0221912890f12bb2ba52332fffd81a41de7f3ec679c67b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T05:58:57Z","title_canon_sha256":"0baf8e72409c82b03cc0b60ee7454ca2a5d8689fe00dfdd2ec0c521760796028"},"schema_version":"1.0","source":{"id":"1811.09955","kind":"arxiv","version":3}},"canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","first_computed_at":"2026-05-17T23:51:13.989038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:13.989038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kl+GipjqRl6M41IjCX9k7BhkJax0bs7GXaENLP2glN4P3uFQwRUJR1TStigdCcMArwP3SS6QV4FpsSDveD+UAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:13.989573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09955","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7822cc60129e64eb33f3fcf5621fc8b7a382d730a0c5301c8fad732145a54414","sha256:1b61bb0be3bdcdd25e39c95ee1cc4dbcfc1a7271d974101e9ea13fd4e62adc49"],"state_sha256":"ed937e184ea33defd723359aa0dc4a40bc8ffe63d34bc1b1dccd12c0f3a3e1fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNUMgkI7rMLB9/m9CIcKipTUdMTniKHCKvABNJR6riANG7hUnnO7s7zVoUwx2Jp+5mvereTxbyBj1KBFxZf2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:36:52.990239Z","bundle_sha256":"7862f67701bcd18057c51fb5d89b6c5485d23e04ff0bf7aea489f771d798d670"}}