{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XG6ZY5JYFV44DY5XFPPT5MMZ4W","short_pith_number":"pith:XG6ZY5JY","canonical_record":{"source":{"id":"2402.09152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T13:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"6358f87b4b08c2e40a09ee3aed748a35c29ac2706f6698e133d6034017c3fab7","abstract_canon_sha256":"c1f38c7fd3d74d03e028bf919dd5baa6e097175298375a0ca9da02de95367e63"},"schema_version":"1.0"},"canonical_sha256":"b9bd9c75382d79c1e3b72bdf3eb199e5994058d3659289da601886c902856f9c","source":{"kind":"arxiv","id":"2402.09152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09152","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09152v2","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09152","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"XG6ZY5JYFV44","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"pith_short_16","alias_value":"XG6ZY5JYFV44DY5X","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"pith_short_8","alias_value":"XG6ZY5JY","created_at":"2026-07-05T08:35:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XG6ZY5JYFV44DY5XFPPT5MMZ4W","target":"record","payload":{"canonical_record":{"source":{"id":"2402.09152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T13:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"6358f87b4b08c2e40a09ee3aed748a35c29ac2706f6698e133d6034017c3fab7","abstract_canon_sha256":"c1f38c7fd3d74d03e028bf919dd5baa6e097175298375a0ca9da02de95367e63"},"schema_version":"1.0"},"canonical_sha256":"b9bd9c75382d79c1e3b72bdf3eb199e5994058d3659289da601886c902856f9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:41.855979Z","signature_b64":"j8KBD9rbpobPAzz8AJKF/B4GNmFtNZwYSWw7xg9GQpkaefSDsoREFw6XTbAa4FMFonra8mwI400TDIr0O8e1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9bd9c75382d79c1e3b72bdf3eb199e5994058d3659289da601886c902856f9c","last_reissued_at":"2026-07-05T08:35:41.855550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:41.855550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.09152","source_version":2,"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-07-05T08:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0Qhwpntv7YIUZWp7qH7AuTuAearKXxVPdJzmSIiODUEC2VY0NoXf410Gla4qtce7ofQKc19qI75Bu5r+ZSwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:25:54.593228Z"},"content_sha256":"54569a3592e01f5156162c77cd2162c52735c836819ebe1410019b6090f752cc","schema_version":"1.0","event_id":"sha256:54569a3592e01f5156162c77cd2162c52735c836819ebe1410019b6090f752cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XG6ZY5JYFV44DY5XFPPT5MMZ4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Regret for Bandit Convex Optimization with Delayed Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chang Yao, Lijun Zhang, Mingli Song, Yuanyu Wan","submitted_at":"2024-02-14T13:08:26Z","abstract_excerpt":"We investigate bandit convex optimization (BCO) with delayed feedback, where only the loss value of the action is revealed under an arbitrary delay. Let $n,T,\\bar{d}$ denote the dimensionality, time horizon, and average delay, respectively. Previous studies have achieved an $O(\\sqrt{n}T^{3/4}+(n\\bar{d})^{1/3}T^{2/3})$ regret bound for this problem, whose delay-independent part matches the regret of the classical non-delayed bandit gradient descent algorithm. However, there is a large gap between its delay-dependent part, i.e., $O((n\\bar{d})^{1/3}T^{2/3})$, and an existing $\\Omega(\\sqrt{\\bar{d}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09152","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.09152/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tcr1anwIK2KVikViRYRoZ6LhWku9pAnMSDtXeqc/Vsy2+iTVXNYkOXrwFYnxflXUlBgdDyVAnUuXxHgumWSBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:25:54.593824Z"},"content_sha256":"63ccfbe4f62e687cf7ff58c839922328499cc3c6221c9e4d3868bfeeba47e1fa","schema_version":"1.0","event_id":"sha256:63ccfbe4f62e687cf7ff58c839922328499cc3c6221c9e4d3868bfeeba47e1fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W/bundle.json","state_url":"https://pith.science/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W/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-08-11T11:25:54Z","links":{"resolver":"https://pith.science/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W","bundle":"https://pith.science/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W/bundle.json","state":"https://pith.science/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XG6ZY5JYFV44DY5XFPPT5MMZ4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XG6ZY5JYFV44DY5XFPPT5MMZ4W","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":"c1f38c7fd3d74d03e028bf919dd5baa6e097175298375a0ca9da02de95367e63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T13:08:26Z","title_canon_sha256":"6358f87b4b08c2e40a09ee3aed748a35c29ac2706f6698e133d6034017c3fab7"},"schema_version":"1.0","source":{"id":"2402.09152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09152","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09152v2","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09152","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"XG6ZY5JYFV44","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"pith_short_16","alias_value":"XG6ZY5JYFV44DY5X","created_at":"2026-07-05T08:35:41Z"},{"alias_kind":"pith_short_8","alias_value":"XG6ZY5JY","created_at":"2026-07-05T08:35:41Z"}],"graph_snapshots":[{"event_id":"sha256:63ccfbe4f62e687cf7ff58c839922328499cc3c6221c9e4d3868bfeeba47e1fa","target":"graph","created_at":"2026-07-05T08:35:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.09152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate bandit convex optimization (BCO) with delayed feedback, where only the loss value of the action is revealed under an arbitrary delay. Let $n,T,\\bar{d}$ denote the dimensionality, time horizon, and average delay, respectively. Previous studies have achieved an $O(\\sqrt{n}T^{3/4}+(n\\bar{d})^{1/3}T^{2/3})$ regret bound for this problem, whose delay-independent part matches the regret of the classical non-delayed bandit gradient descent algorithm. However, there is a large gap between its delay-dependent part, i.e., $O((n\\bar{d})^{1/3}T^{2/3})$, and an existing $\\Omega(\\sqrt{\\bar{d}","authors_text":"Chang Yao, Lijun Zhang, Mingli Song, Yuanyu Wan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T13:08:26Z","title":"Improved Regret for Bandit Convex Optimization with Delayed Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09152","kind":"arxiv","version":2},"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:54569a3592e01f5156162c77cd2162c52735c836819ebe1410019b6090f752cc","target":"record","created_at":"2026-07-05T08:35:41Z","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":"c1f38c7fd3d74d03e028bf919dd5baa6e097175298375a0ca9da02de95367e63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T13:08:26Z","title_canon_sha256":"6358f87b4b08c2e40a09ee3aed748a35c29ac2706f6698e133d6034017c3fab7"},"schema_version":"1.0","source":{"id":"2402.09152","kind":"arxiv","version":2}},"canonical_sha256":"b9bd9c75382d79c1e3b72bdf3eb199e5994058d3659289da601886c902856f9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9bd9c75382d79c1e3b72bdf3eb199e5994058d3659289da601886c902856f9c","first_computed_at":"2026-07-05T08:35:41.855550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:35:41.855550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j8KBD9rbpobPAzz8AJKF/B4GNmFtNZwYSWw7xg9GQpkaefSDsoREFw6XTbAa4FMFonra8mwI400TDIr0O8e1AA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:35:41.855979Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.09152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54569a3592e01f5156162c77cd2162c52735c836819ebe1410019b6090f752cc","sha256:63ccfbe4f62e687cf7ff58c839922328499cc3c6221c9e4d3868bfeeba47e1fa"],"state_sha256":"1475d9ea85b9d3955ce5e766d68777ec089a9f8311ee41488246e3949cd5b898"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ANMqS0zmmc9QkxiR4M5i4NkT6TciwTP51a09yVNxKhBMHlEGZl3ESWybDKtki64aDtPbgmtKK+RCovrRx7mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:25:54.600346Z","bundle_sha256":"2b40fdd4a6b49318636027b2d52c1b96b10b224a010ba4299c5f3dd9a5cd1ef8"}}