{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4HMNTUH6HTWWX3KDBSA65L7MSN","short_pith_number":"pith:4HMNTUH6","canonical_record":{"source":{"id":"1812.02962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T09:58:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"258d944c303d6b5d0a1de28a6b9772c10c922fa9de91fe1c9969c7ed45688a8a","abstract_canon_sha256":"acfdb4849206d8fc4722e7bccb815a63c7de6a5d73841830d43c83c992f0004b"},"schema_version":"1.0"},"canonical_sha256":"e1d8d9d0fe3ced6bed430c81eeafec9351734ed93655dc8452df4e35af838afa","source":{"kind":"arxiv","id":"1812.02962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02962","created_at":"2026-05-17T23:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02962v1","created_at":"2026-05-17T23:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02962","created_at":"2026-05-17T23:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"4HMNTUH6HTWW","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4HMNTUH6HTWWX3KD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4HMNTUH6","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4HMNTUH6HTWWX3KDBSA65L7MSN","target":"record","payload":{"canonical_record":{"source":{"id":"1812.02962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T09:58:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"258d944c303d6b5d0a1de28a6b9772c10c922fa9de91fe1c9969c7ed45688a8a","abstract_canon_sha256":"acfdb4849206d8fc4722e7bccb815a63c7de6a5d73841830d43c83c992f0004b"},"schema_version":"1.0"},"canonical_sha256":"e1d8d9d0fe3ced6bed430c81eeafec9351734ed93655dc8452df4e35af838afa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:51.265346Z","signature_b64":"Ztoxz3mLtvONOFj2+GMe83RGtqb7RCYzBUFImK4dq5k73AJ4b+SxGtWHpVCdtGSKaAPHdVSufirHCwzoxl4qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1d8d9d0fe3ced6bed430c81eeafec9351734ed93655dc8452df4e35af838afa","last_reissued_at":"2026-05-17T23:58:51.264902Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:51.264902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.02962","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:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsutEmarJT1mU1Xf4YM8l10YL23ORxGqqBLJ5BqLkpRo4EQfP3odJRDkczqdo+tvgUmGXNGYOelorkbpwY3MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:31:33.737842Z"},"content_sha256":"b9f3a0f49439eb329d857bc916c7ce763e130ca1ae7e4baeb8f55855ce08d2d7","schema_version":"1.0","event_id":"sha256:b9f3a0f49439eb329d857bc916c7ce763e130ca1ae7e4baeb8f55855ce08d2d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4HMNTUH6HTWWX3KDBSA65L7MSN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mike Mingcheng Wei, Tao Yao, Xue Wang","submitted_at":"2018-12-07T09:58:16Z","abstract_excerpt":"We propose a minimax concave penalized multi-armed bandit algorithm under generalized linear model (G-MCP-Bandit) for a decision-maker facing high-dimensional data in an online learning and decision-making process. We demonstrate that the G-MCP-Bandit algorithm asymptotically achieves the optimal cumulative regret in the sample size dimension T , O(log T), and further attains a tight bound in the covariate dimension d, O(log d). In addition, we develop a linear approximation method, the 2-step weighted Lasso procedure, to identify the MCP estimator for the G-MCP-Bandit algorithm under non-iid "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02962","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:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i22+0pt1rWeOaS/ehgv4JRt/24aVBwe1+apW9RYpydm8unTofbodPzAeHptxHIsqo4eY7GcKAE+jYT2mMX2HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:31:33.738198Z"},"content_sha256":"c6d87edd28fad392309e5ddfa783c9b8bed0001b8f61f7824959fb12808242aa","schema_version":"1.0","event_id":"sha256:c6d87edd28fad392309e5ddfa783c9b8bed0001b8f61f7824959fb12808242aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HMNTUH6HTWWX3KDBSA65L7MSN/bundle.json","state_url":"https://pith.science/pith/4HMNTUH6HTWWX3KDBSA65L7MSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HMNTUH6HTWWX3KDBSA65L7MSN/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-26T21:31:33Z","links":{"resolver":"https://pith.science/pith/4HMNTUH6HTWWX3KDBSA65L7MSN","bundle":"https://pith.science/pith/4HMNTUH6HTWWX3KDBSA65L7MSN/bundle.json","state":"https://pith.science/pith/4HMNTUH6HTWWX3KDBSA65L7MSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HMNTUH6HTWWX3KDBSA65L7MSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4HMNTUH6HTWWX3KDBSA65L7MSN","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":"acfdb4849206d8fc4722e7bccb815a63c7de6a5d73841830d43c83c992f0004b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T09:58:16Z","title_canon_sha256":"258d944c303d6b5d0a1de28a6b9772c10c922fa9de91fe1c9969c7ed45688a8a"},"schema_version":"1.0","source":{"id":"1812.02962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02962","created_at":"2026-05-17T23:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02962v1","created_at":"2026-05-17T23:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02962","created_at":"2026-05-17T23:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"4HMNTUH6HTWW","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4HMNTUH6HTWWX3KD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4HMNTUH6","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:c6d87edd28fad392309e5ddfa783c9b8bed0001b8f61f7824959fb12808242aa","target":"graph","created_at":"2026-05-17T23:58:51Z","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 propose a minimax concave penalized multi-armed bandit algorithm under generalized linear model (G-MCP-Bandit) for a decision-maker facing high-dimensional data in an online learning and decision-making process. We demonstrate that the G-MCP-Bandit algorithm asymptotically achieves the optimal cumulative regret in the sample size dimension T , O(log T), and further attains a tight bound in the covariate dimension d, O(log d). In addition, we develop a linear approximation method, the 2-step weighted Lasso procedure, to identify the MCP estimator for the G-MCP-Bandit algorithm under non-iid ","authors_text":"Mike Mingcheng Wei, Tao Yao, Xue Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T09:58:16Z","title":"Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02962","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:b9f3a0f49439eb329d857bc916c7ce763e130ca1ae7e4baeb8f55855ce08d2d7","target":"record","created_at":"2026-05-17T23:58:51Z","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":"acfdb4849206d8fc4722e7bccb815a63c7de6a5d73841830d43c83c992f0004b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T09:58:16Z","title_canon_sha256":"258d944c303d6b5d0a1de28a6b9772c10c922fa9de91fe1c9969c7ed45688a8a"},"schema_version":"1.0","source":{"id":"1812.02962","kind":"arxiv","version":1}},"canonical_sha256":"e1d8d9d0fe3ced6bed430c81eeafec9351734ed93655dc8452df4e35af838afa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1d8d9d0fe3ced6bed430c81eeafec9351734ed93655dc8452df4e35af838afa","first_computed_at":"2026-05-17T23:58:51.264902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:51.264902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ztoxz3mLtvONOFj2+GMe83RGtqb7RCYzBUFImK4dq5k73AJ4b+SxGtWHpVCdtGSKaAPHdVSufirHCwzoxl4qCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:51.265346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9f3a0f49439eb329d857bc916c7ce763e130ca1ae7e4baeb8f55855ce08d2d7","sha256:c6d87edd28fad392309e5ddfa783c9b8bed0001b8f61f7824959fb12808242aa"],"state_sha256":"e4bd36979c648c3bef98a54764e25d7ee506d5b92d32adecb310a563cb3898c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqTDqdBvBg87PB/PTXr3toIuHPKr+NyP2w9yYrJKTj6U50bV3tIxIdNSAcjXZ4dvcx9eLO6dtVteRsjTQEhSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:31:33.740617Z","bundle_sha256":"bca3fa21ecd6c0f85bd7bffac361d3def50ec570e7683ddd7708ef45006e8465"}}