{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GMMI3CX2OIWIONRROBFOCII2KU","short_pith_number":"pith:GMMI3CX2","canonical_record":{"source":{"id":"1606.05693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-17T22:31:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffb6c25a6a64235521e2d7e03a95ae09f9628e29932083624bfb02df1a52f19e","abstract_canon_sha256":"9edbb5be43247130391a3b28bf7c0d1935ab73fe4f79e2fdef1177df7a60e985"},"schema_version":"1.0"},"canonical_sha256":"33188d8afa722c873631704ae1211a551ef14c05017a19289ec7bba7a7395f35","source":{"kind":"arxiv","id":"1606.05693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05693","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05693v1","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05693","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"GMMI3CX2OIWI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMMI3CX2OIWIONRR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMMI3CX2","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GMMI3CX2OIWIONRROBFOCII2KU","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-17T22:31:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffb6c25a6a64235521e2d7e03a95ae09f9628e29932083624bfb02df1a52f19e","abstract_canon_sha256":"9edbb5be43247130391a3b28bf7c0d1935ab73fe4f79e2fdef1177df7a60e985"},"schema_version":"1.0"},"canonical_sha256":"33188d8afa722c873631704ae1211a551ef14c05017a19289ec7bba7a7395f35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:16.277337Z","signature_b64":"VdCczHmtJMfq4eaZnr58MXzKtfpp5RNVbsGrMlNJ5oePcvby9EKUOtZCJA1LPSWPpaiPiw2oyzfefnYBzwc4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33188d8afa722c873631704ae1211a551ef14c05017a19289ec7bba7a7395f35","last_reissued_at":"2026-05-18T01:12:16.277002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:16.277002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05693","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-18T01:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EzjQaw6A48a+zaHMT+OxeWwLIJutNHor9DAVct4FhkDEC6WN8rtSsXPCnKuCByRsnVrixOAjkAQiP+97bD9bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:44:36.618595Z"},"content_sha256":"1b67dfe8e022725e5fd898488a2b77497a75e67e0bb9c04a12a40e72d1d6a7d4","schema_version":"1.0","event_id":"sha256:1b67dfe8e022725e5fd898488a2b77497a75e67e0bb9c04a12a40e72d1d6a7d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GMMI3CX2OIWIONRROBFOCII2KU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Stochastic Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arindam Banerjee, Nicholas Johnson, Vidyashankar Sivakumar","submitted_at":"2016-06-17T22:31:01Z","abstract_excerpt":"The stochastic linear bandit problem proceeds in rounds where at each round the algorithm selects a vector from a decision set after which it receives a noisy linear loss parameterized by an unknown vector. The goal in such a problem is to minimize the (pseudo) regret which is the difference between the total expected loss of the algorithm and the total expected loss of the best fixed vector in hindsight. In this paper, we consider settings where the unknown parameter has structure, e.g., sparse, group sparse, low-rank, which can be captured by a norm, e.g., $L_1$, $L_{(1,2)}$, nuclear norm. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05693","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-18T01:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWbD9EJV3REmacogeYhrFtpV5+HpE4iv6lLw9DSr6A94fagi01x8u0UfauVAfp/5JdUmxZ4LHOTQzHNweuwMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:44:36.618951Z"},"content_sha256":"6f2a2ce026f96865c2a536ee0bcc5407f108ae8861af864b593d7749597d3ac2","schema_version":"1.0","event_id":"sha256:6f2a2ce026f96865c2a536ee0bcc5407f108ae8861af864b593d7749597d3ac2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMMI3CX2OIWIONRROBFOCII2KU/bundle.json","state_url":"https://pith.science/pith/GMMI3CX2OIWIONRROBFOCII2KU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMMI3CX2OIWIONRROBFOCII2KU/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-28T12:44:36Z","links":{"resolver":"https://pith.science/pith/GMMI3CX2OIWIONRROBFOCII2KU","bundle":"https://pith.science/pith/GMMI3CX2OIWIONRROBFOCII2KU/bundle.json","state":"https://pith.science/pith/GMMI3CX2OIWIONRROBFOCII2KU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMMI3CX2OIWIONRROBFOCII2KU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GMMI3CX2OIWIONRROBFOCII2KU","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":"9edbb5be43247130391a3b28bf7c0d1935ab73fe4f79e2fdef1177df7a60e985","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-17T22:31:01Z","title_canon_sha256":"ffb6c25a6a64235521e2d7e03a95ae09f9628e29932083624bfb02df1a52f19e"},"schema_version":"1.0","source":{"id":"1606.05693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05693","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05693v1","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05693","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"GMMI3CX2OIWI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMMI3CX2OIWIONRR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMMI3CX2","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:6f2a2ce026f96865c2a536ee0bcc5407f108ae8861af864b593d7749597d3ac2","target":"graph","created_at":"2026-05-18T01:12:16Z","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":"The stochastic linear bandit problem proceeds in rounds where at each round the algorithm selects a vector from a decision set after which it receives a noisy linear loss parameterized by an unknown vector. The goal in such a problem is to minimize the (pseudo) regret which is the difference between the total expected loss of the algorithm and the total expected loss of the best fixed vector in hindsight. In this paper, we consider settings where the unknown parameter has structure, e.g., sparse, group sparse, low-rank, which can be captured by a norm, e.g., $L_1$, $L_{(1,2)}$, nuclear norm. W","authors_text":"Arindam Banerjee, Nicholas Johnson, Vidyashankar Sivakumar","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-17T22:31:01Z","title":"Structured Stochastic Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05693","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:1b67dfe8e022725e5fd898488a2b77497a75e67e0bb9c04a12a40e72d1d6a7d4","target":"record","created_at":"2026-05-18T01:12:16Z","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":"9edbb5be43247130391a3b28bf7c0d1935ab73fe4f79e2fdef1177df7a60e985","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-17T22:31:01Z","title_canon_sha256":"ffb6c25a6a64235521e2d7e03a95ae09f9628e29932083624bfb02df1a52f19e"},"schema_version":"1.0","source":{"id":"1606.05693","kind":"arxiv","version":1}},"canonical_sha256":"33188d8afa722c873631704ae1211a551ef14c05017a19289ec7bba7a7395f35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33188d8afa722c873631704ae1211a551ef14c05017a19289ec7bba7a7395f35","first_computed_at":"2026-05-18T01:12:16.277002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:16.277002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VdCczHmtJMfq4eaZnr58MXzKtfpp5RNVbsGrMlNJ5oePcvby9EKUOtZCJA1LPSWPpaiPiw2oyzfefnYBzwc4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:16.277337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b67dfe8e022725e5fd898488a2b77497a75e67e0bb9c04a12a40e72d1d6a7d4","sha256:6f2a2ce026f96865c2a536ee0bcc5407f108ae8861af864b593d7749597d3ac2"],"state_sha256":"55612c4bc4240d68c3330be44a719f8b91dc69175b77a6e97cd0846c2f73d251"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Y0jniDROzoI2AKO1wTOdM+EP9YZydKjQSfbzPmu2GUad/3O08wof46q2lU2ctkB4C+j81sjO3TTN7X8ytaeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:44:36.620952Z","bundle_sha256":"13dcef07ce2119c5622657aea4b5b0ca8ffe2ab056cf8279de8945ea35c49505"}}