{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5NLATAN5TCF5DURNNDDM3R3RLX","short_pith_number":"pith:5NLATAN5","canonical_record":{"source":{"id":"1804.00335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T19:56:10Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"5c5f5f5b52b4815bc0a5b188ac29604c783293a6025d9dc9400009e7cf7f1d19","abstract_canon_sha256":"8ce60dc7fdc4e634debe2c8487d0ffba2202f6e5c94ba5e786e93f3ac11add7f"},"schema_version":"1.0"},"canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","source":{"kind":"arxiv","id":"1804.00335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00335","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00335v1","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00335","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"5NLATAN5TCF5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5NLATAN5TCF5DURN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5NLATAN5","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5NLATAN5TCF5DURNNDDM3R3RLX","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T19:56:10Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"5c5f5f5b52b4815bc0a5b188ac29604c783293a6025d9dc9400009e7cf7f1d19","abstract_canon_sha256":"8ce60dc7fdc4e634debe2c8487d0ffba2202f6e5c94ba5e786e93f3ac11add7f"},"schema_version":"1.0"},"canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:37.590749Z","signature_b64":"0x34z8dXtra3Vzh2phFlzsmqeR1tnd3xKVxcZyjoTcFyhO9UyT8Lmt+VfTPWbGYLgvZlwzXSEHturdtm1vMADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","last_reissued_at":"2026-05-18T00:19:37.590039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:37.590039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00335","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-18T00:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6epEJNi9aBJOEE96l+4F6NlDnP9d8Y7EKd3f1CLhCEnlTzdIIdcP3DBQXwHmrSjMmj5yGXGPo/IegYCLoa6VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:14:28.284914Z"},"content_sha256":"d3ce02574cc9f5746c8fa26a201dca55d2a4c47e744507af05a7ab54956109fc","schema_version":"1.0","event_id":"sha256:d3ce02574cc9f5746c8fa26a201dca55d2a4c47e744507af05a7ab54956109fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5NLATAN5TCF5DURNNDDM3R3RLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online learning with graph-structured feedback against adaptive adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Po-Ling Loh, Zhili Feng","submitted_at":"2018-04-01T19:56:10Z","abstract_excerpt":"We derive upper and lower bounds for the policy regret of $T$-round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of $\\widetilde O(T^{2/3})$ and $\\widetilde O(T^{3/4})$ for strongly-observable and weakly-observable graphs, respectively, based on analyzing a variant of the Exp3 algorithm. When the adversary is allowed a bounded memory of size 1, we show that a matching lower bound of $\\widetilde\\Omega(T^{2/3})$ is achieved in the case of full-information feedback. We also study the partic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00335","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-18T00:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9z9bmp6KLE1hSwVkki2YhN39SfP0AarO8PegXlheQU79tvlOzWFsp3pCcDXogtqlpp22pKEzjolegcQn3qUAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:14:28.285661Z"},"content_sha256":"af651cd3a9cf9e47ab0b861654011ffd967c687ce39fffaec10301ed8df8a6d2","schema_version":"1.0","event_id":"sha256:af651cd3a9cf9e47ab0b861654011ffd967c687ce39fffaec10301ed8df8a6d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/bundle.json","state_url":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NLATAN5TCF5DURNNDDM3R3RLX/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-26T11:14:28Z","links":{"resolver":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX","bundle":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/bundle.json","state":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NLATAN5TCF5DURNNDDM3R3RLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5NLATAN5TCF5DURNNDDM3R3RLX","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":"8ce60dc7fdc4e634debe2c8487d0ffba2202f6e5c94ba5e786e93f3ac11add7f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T19:56:10Z","title_canon_sha256":"5c5f5f5b52b4815bc0a5b188ac29604c783293a6025d9dc9400009e7cf7f1d19"},"schema_version":"1.0","source":{"id":"1804.00335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00335","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00335v1","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00335","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"5NLATAN5TCF5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5NLATAN5TCF5DURN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5NLATAN5","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:af651cd3a9cf9e47ab0b861654011ffd967c687ce39fffaec10301ed8df8a6d2","target":"graph","created_at":"2026-05-18T00:19:37Z","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":"We derive upper and lower bounds for the policy regret of $T$-round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of $\\widetilde O(T^{2/3})$ and $\\widetilde O(T^{3/4})$ for strongly-observable and weakly-observable graphs, respectively, based on analyzing a variant of the Exp3 algorithm. When the adversary is allowed a bounded memory of size 1, we show that a matching lower bound of $\\widetilde\\Omega(T^{2/3})$ is achieved in the case of full-information feedback. We also study the partic","authors_text":"Po-Ling Loh, Zhili Feng","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T19:56:10Z","title":"Online learning with graph-structured feedback against adaptive adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00335","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:d3ce02574cc9f5746c8fa26a201dca55d2a4c47e744507af05a7ab54956109fc","target":"record","created_at":"2026-05-18T00:19:37Z","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":"8ce60dc7fdc4e634debe2c8487d0ffba2202f6e5c94ba5e786e93f3ac11add7f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T19:56:10Z","title_canon_sha256":"5c5f5f5b52b4815bc0a5b188ac29604c783293a6025d9dc9400009e7cf7f1d19"},"schema_version":"1.0","source":{"id":"1804.00335","kind":"arxiv","version":1}},"canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","first_computed_at":"2026-05-18T00:19:37.590039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:37.590039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0x34z8dXtra3Vzh2phFlzsmqeR1tnd3xKVxcZyjoTcFyhO9UyT8Lmt+VfTPWbGYLgvZlwzXSEHturdtm1vMADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:37.590749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3ce02574cc9f5746c8fa26a201dca55d2a4c47e744507af05a7ab54956109fc","sha256:af651cd3a9cf9e47ab0b861654011ffd967c687ce39fffaec10301ed8df8a6d2"],"state_sha256":"08b740b443f9732ff15c56ccfbf74df520a7f7f28f981f6fd9d912758a56541b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WI81mz8vjverVbtd66elOZ1QFSuH5Zu4LlwjPXwfW4nhrgbBuURKOYC+vTIK03OONXp3PuF5dMGLUFrnCWadCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:14:28.289633Z","bundle_sha256":"f88a94947a6e1a0a933fedd7f9753052191f93f40da16b68e0a33937fe7bc9d0"}}