{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:P536427AKXAJG7LCS6WBKZ6USW","short_pith_number":"pith:P536427A","canonical_record":{"source":{"id":"2411.12154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-11-19T01:08:13Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"8577c5850993ed0f8bfbde16fad1d7d965c4241477b8cb558c945842bd37942b","abstract_canon_sha256":"2b31cceda2cb543d5488f2fa178aef83aa61fb9d49993b83f79a27046268b234"},"schema_version":"1.0"},"canonical_sha256":"7f77ee6be055c0937d6297ac1567d495a98602f6eab411d0adaa85b0501ff73f","source":{"kind":"arxiv","id":"2411.12154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12154","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12154v1","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12154","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"P536427AKXAJ","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"pith_short_16","alias_value":"P536427AKXAJG7LC","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"pith_short_8","alias_value":"P536427A","created_at":"2026-07-05T09:37:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:P536427AKXAJG7LCS6WBKZ6USW","target":"record","payload":{"canonical_record":{"source":{"id":"2411.12154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-11-19T01:08:13Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"8577c5850993ed0f8bfbde16fad1d7d965c4241477b8cb558c945842bd37942b","abstract_canon_sha256":"2b31cceda2cb543d5488f2fa178aef83aa61fb9d49993b83f79a27046268b234"},"schema_version":"1.0"},"canonical_sha256":"7f77ee6be055c0937d6297ac1567d495a98602f6eab411d0adaa85b0501ff73f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:16.827520Z","signature_b64":"pyfH2NEzNzE4qbMtbfkijjVnPKjPNd4HLU3VjoFZRfKlhA+yjfp1542CyxBHsS+odNoFES5fAzWt703C0uB+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f77ee6be055c0937d6297ac1567d495a98602f6eab411d0adaa85b0501ff73f","last_reissued_at":"2026-07-05T09:37:16.827098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:16.827098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.12154","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-05T09:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJOjDkhNGhFTjKQTFbkTnC2vTV73wSbjuIZep/9q47DAV3GgZihwCexkbAnmK8xIvyZswfjmHTyHf3Jv+lDuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:48:42.055415Z"},"content_sha256":"eebd457cc34e1000fa7b8d91f3db4d6aeac52b4ce53730c402531f7c15ea8e1d","schema_version":"1.0","event_id":"sha256:eebd457cc34e1000fa7b8d91f3db4d6aeac52b4ce53730c402531f7c15ea8e1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:P536427AKXAJG7LCS6WBKZ6USW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"stat.ML","authors_text":"Arda G\\\"u\\c{c}l\\\"u, Subhonmesh Bose","submitted_at":"2024-11-19T01:08:13Z","abstract_excerpt":"We propose and analyze TRAiL (Tangential Randomization in Linear Bandits), a computationally efficient regret-optimal forced exploration algorithm for linear bandits on action sets that are sublevel sets of strongly convex functions. TRAiL estimates the governing parameter of the linear bandit problem through a standard regularized least squares and perturbs the reward-maximizing action corresponding to said point estimate along the tangent plane of the convex compact action set before projecting back to it. Exploiting concentration results for matrix martingales, we prove that TRAiL ensures a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12154","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/2411.12154/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-05T09:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xB7JajlvBssSJTNruwnLtcZ1Rq1eTqUo2OUq2rb9eSr/BomK9sm8NQNRAdfIrIrRkYucT+mPKMRefWBm65+EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:48:42.055943Z"},"content_sha256":"8afccbec6a9ec38ea9e5aec912b4f49b67e381ea84dd9a2b9548c6b684cc355e","schema_version":"1.0","event_id":"sha256:8afccbec6a9ec38ea9e5aec912b4f49b67e381ea84dd9a2b9548c6b684cc355e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P536427AKXAJG7LCS6WBKZ6USW/bundle.json","state_url":"https://pith.science/pith/P536427AKXAJG7LCS6WBKZ6USW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P536427AKXAJG7LCS6WBKZ6USW/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-21T18:48:42Z","links":{"resolver":"https://pith.science/pith/P536427AKXAJG7LCS6WBKZ6USW","bundle":"https://pith.science/pith/P536427AKXAJG7LCS6WBKZ6USW/bundle.json","state":"https://pith.science/pith/P536427AKXAJG7LCS6WBKZ6USW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P536427AKXAJG7LCS6WBKZ6USW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:P536427AKXAJG7LCS6WBKZ6USW","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":"2b31cceda2cb543d5488f2fa178aef83aa61fb9d49993b83f79a27046268b234","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-11-19T01:08:13Z","title_canon_sha256":"8577c5850993ed0f8bfbde16fad1d7d965c4241477b8cb558c945842bd37942b"},"schema_version":"1.0","source":{"id":"2411.12154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12154","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12154v1","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12154","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"P536427AKXAJ","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"pith_short_16","alias_value":"P536427AKXAJG7LC","created_at":"2026-07-05T09:37:16Z"},{"alias_kind":"pith_short_8","alias_value":"P536427A","created_at":"2026-07-05T09:37:16Z"}],"graph_snapshots":[{"event_id":"sha256:8afccbec6a9ec38ea9e5aec912b4f49b67e381ea84dd9a2b9548c6b684cc355e","target":"graph","created_at":"2026-07-05T09:37: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.12154/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose and analyze TRAiL (Tangential Randomization in Linear Bandits), a computationally efficient regret-optimal forced exploration algorithm for linear bandits on action sets that are sublevel sets of strongly convex functions. TRAiL estimates the governing parameter of the linear bandit problem through a standard regularized least squares and perturbs the reward-maximizing action corresponding to said point estimate along the tangent plane of the convex compact action set before projecting back to it. Exploiting concentration results for matrix martingales, we prove that TRAiL ensures a","authors_text":"Arda G\\\"u\\c{c}l\\\"u, Subhonmesh Bose","cross_cats":["cs.LG","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12154","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:eebd457cc34e1000fa7b8d91f3db4d6aeac52b4ce53730c402531f7c15ea8e1d","target":"record","created_at":"2026-07-05T09:37: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":"2b31cceda2cb543d5488f2fa178aef83aa61fb9d49993b83f79a27046268b234","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-11-19T01:08:13Z","title_canon_sha256":"8577c5850993ed0f8bfbde16fad1d7d965c4241477b8cb558c945842bd37942b"},"schema_version":"1.0","source":{"id":"2411.12154","kind":"arxiv","version":1}},"canonical_sha256":"7f77ee6be055c0937d6297ac1567d495a98602f6eab411d0adaa85b0501ff73f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f77ee6be055c0937d6297ac1567d495a98602f6eab411d0adaa85b0501ff73f","first_computed_at":"2026-07-05T09:37:16.827098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:16.827098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pyfH2NEzNzE4qbMtbfkijjVnPKjPNd4HLU3VjoFZRfKlhA+yjfp1542CyxBHsS+odNoFES5fAzWt703C0uB+Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:16.827520Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eebd457cc34e1000fa7b8d91f3db4d6aeac52b4ce53730c402531f7c15ea8e1d","sha256:8afccbec6a9ec38ea9e5aec912b4f49b67e381ea84dd9a2b9548c6b684cc355e"],"state_sha256":"29aa8a550311bbb8fd96a04a21a3b53206a643d40a791b846050fe84a1905a5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wnbz1kbiMRjryGDIlD/msGlv/PuKs7rE9szi3QtreYCGR9OSjHaxYQQK5bL3kJQr/Do0ip7cNA1A95FU4JcBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:48:42.060556Z","bundle_sha256":"86a683331bc93a5c2a62643fa8784517a52dbe1a12e9cfd00629576a4407d5bc"}}