{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WBTYSNBJOFKENEX4RSFSK7CWRC","short_pith_number":"pith:WBTYSNBJ","canonical_record":{"source":{"id":"2107.04518","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T16:04:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"37f0227eb2ee03c8ce4af63abd1756a45fd0d4f8877c65f669331ebb85a6f2de","abstract_canon_sha256":"33dc99c3a5096b7fc124cb5ba27d88085f337a12be6d064ae3034a8f5aad5ba4"},"schema_version":"1.0"},"canonical_sha256":"b06789342971544692fc8c8b257c5688b63eb5ee6d39c24020a216895b540f32","source":{"kind":"arxiv","id":"2107.04518","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04518","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04518v1","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04518","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"WBTYSNBJOFKE","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"pith_short_16","alias_value":"WBTYSNBJOFKENEX4","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"pith_short_8","alias_value":"WBTYSNBJ","created_at":"2026-07-05T02:56:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WBTYSNBJOFKENEX4RSFSK7CWRC","target":"record","payload":{"canonical_record":{"source":{"id":"2107.04518","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T16:04:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"37f0227eb2ee03c8ce4af63abd1756a45fd0d4f8877c65f669331ebb85a6f2de","abstract_canon_sha256":"33dc99c3a5096b7fc124cb5ba27d88085f337a12be6d064ae3034a8f5aad5ba4"},"schema_version":"1.0"},"canonical_sha256":"b06789342971544692fc8c8b257c5688b63eb5ee6d39c24020a216895b540f32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:34.201793Z","signature_b64":"9wSYEah+f4ZN3L84RYQcCW59iXJMtXOLYjDm9t7HkXXCEjy/B0sedR/+i1XtdUiulXJH+IeYGieXjOnxN63EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b06789342971544692fc8c8b257c5688b63eb5ee6d39c24020a216895b540f32","last_reissued_at":"2026-07-05T02:56:34.201374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:34.201374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.04518","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-07-05T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hg0c6QIQLlCkI4KExW3GRqy/JUJE5zT4S0egKX4fsgR2BADhIEHlZcLvazQ9Q4+UH7UEIhsTWzJjEAJcbNXrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:57:58.353264Z"},"content_sha256":"653f16130d5b361af80c168c1af54c491aaec9f8ff61440e670c36e046374df2","schema_version":"1.0","event_id":"sha256:653f16130d5b361af80c168c1af54c491aaec9f8ff61440e670c36e046374df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WBTYSNBJOFKENEX4RSFSK7CWRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Gradient-based Algorithms for Non-concave Bandit Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baihe Huang, Jason D. Lee, Jiaqi Yang, Kaixuan Huang, Qi Lei, Runzhe Wang, Sham M. Kakade","submitted_at":"2021-07-09T16:04:24Z","abstract_excerpt":"Bandit problems with linear or concave reward have been extensively studied, but relatively few works have studied bandits with non-concave reward. This work considers a large family of bandit problems where the unknown underlying reward function is non-concave, including the low-rank generalized linear bandit problems and two-layer neural network with polynomial activation bandit problem. For the low-rank generalized linear bandit problem, we provide a minimax-optimal algorithm in the dimension, refuting both conjectures in [LMT21, JWWN19]. Our algorithms are based on a unified zeroth-order o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04518","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.04518/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-05T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dM4EP5sVo2viAcxuCwEn4Tliu8F54/ft3hQLsJYtbeX1tVEDFLuK2wMeK/07CvlWcY9bAhqtKEy4uMlvGPNFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:57:58.353767Z"},"content_sha256":"cdc0204f59c4f33e0a7c366bf515cde0b736904c2658a8b1b8bf70759369ef95","schema_version":"1.0","event_id":"sha256:cdc0204f59c4f33e0a7c366bf515cde0b736904c2658a8b1b8bf70759369ef95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBTYSNBJOFKENEX4RSFSK7CWRC/bundle.json","state_url":"https://pith.science/pith/WBTYSNBJOFKENEX4RSFSK7CWRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBTYSNBJOFKENEX4RSFSK7CWRC/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-11T04:57:58Z","links":{"resolver":"https://pith.science/pith/WBTYSNBJOFKENEX4RSFSK7CWRC","bundle":"https://pith.science/pith/WBTYSNBJOFKENEX4RSFSK7CWRC/bundle.json","state":"https://pith.science/pith/WBTYSNBJOFKENEX4RSFSK7CWRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBTYSNBJOFKENEX4RSFSK7CWRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WBTYSNBJOFKENEX4RSFSK7CWRC","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":"33dc99c3a5096b7fc124cb5ba27d88085f337a12be6d064ae3034a8f5aad5ba4","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T16:04:24Z","title_canon_sha256":"37f0227eb2ee03c8ce4af63abd1756a45fd0d4f8877c65f669331ebb85a6f2de"},"schema_version":"1.0","source":{"id":"2107.04518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04518","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04518v1","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04518","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"WBTYSNBJOFKE","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"pith_short_16","alias_value":"WBTYSNBJOFKENEX4","created_at":"2026-07-05T02:56:34Z"},{"alias_kind":"pith_short_8","alias_value":"WBTYSNBJ","created_at":"2026-07-05T02:56:34Z"}],"graph_snapshots":[{"event_id":"sha256:cdc0204f59c4f33e0a7c366bf515cde0b736904c2658a8b1b8bf70759369ef95","target":"graph","created_at":"2026-07-05T02:56:34Z","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/2107.04518/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bandit problems with linear or concave reward have been extensively studied, but relatively few works have studied bandits with non-concave reward. This work considers a large family of bandit problems where the unknown underlying reward function is non-concave, including the low-rank generalized linear bandit problems and two-layer neural network with polynomial activation bandit problem. For the low-rank generalized linear bandit problem, we provide a minimax-optimal algorithm in the dimension, refuting both conjectures in [LMT21, JWWN19]. Our algorithms are based on a unified zeroth-order o","authors_text":"Baihe Huang, Jason D. Lee, Jiaqi Yang, Kaixuan Huang, Qi Lei, Runzhe Wang, Sham M. Kakade","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T16:04:24Z","title":"Optimal Gradient-based Algorithms for Non-concave Bandit Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04518","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:653f16130d5b361af80c168c1af54c491aaec9f8ff61440e670c36e046374df2","target":"record","created_at":"2026-07-05T02:56:34Z","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":"33dc99c3a5096b7fc124cb5ba27d88085f337a12be6d064ae3034a8f5aad5ba4","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T16:04:24Z","title_canon_sha256":"37f0227eb2ee03c8ce4af63abd1756a45fd0d4f8877c65f669331ebb85a6f2de"},"schema_version":"1.0","source":{"id":"2107.04518","kind":"arxiv","version":1}},"canonical_sha256":"b06789342971544692fc8c8b257c5688b63eb5ee6d39c24020a216895b540f32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b06789342971544692fc8c8b257c5688b63eb5ee6d39c24020a216895b540f32","first_computed_at":"2026-07-05T02:56:34.201374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:56:34.201374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9wSYEah+f4ZN3L84RYQcCW59iXJMtXOLYjDm9t7HkXXCEjy/B0sedR/+i1XtdUiulXJH+IeYGieXjOnxN63EAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:56:34.201793Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.04518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:653f16130d5b361af80c168c1af54c491aaec9f8ff61440e670c36e046374df2","sha256:cdc0204f59c4f33e0a7c366bf515cde0b736904c2658a8b1b8bf70759369ef95"],"state_sha256":"8318badd651e04e4af232729223c6def04826f9d44c43de494929e041e1e3fb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ta/BBu36hG+6u3O3WVjyMiyk54xOkHeAxLUTAiwbz75+aZzs78J8pSv3we/5x6T7LZQDCq4Cr+DfgKOa0YQRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:57:58.357392Z","bundle_sha256":"8389682feebca8274f29f72b9d56c2db9cd3544f5bd713aab4f49ea0be8da207"}}