{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GZOKMZK7XHVKLZN547JBDGFBGJ","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":"c4ea35c211780cb9a5be9f995f0899ba5319534cda4de0d01ceb06c0889f1c6e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:04:47Z","title_canon_sha256":"17f21726524da37745cb916201863ae106e1d9e6a3b33cffafc63b9cbd10d493"},"schema_version":"1.0","source":{"id":"2605.13346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13346","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13346v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13346","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"GZOKMZK7XHVK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GZOKMZK7XHVKLZN5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GZOKMZK7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5827d53d2c0992656a399aa415b516d98204f496789697b70e9f152c6aaa1639","target":"graph","created_at":"2026-05-18T02:44:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Off-policy evaluation on standardized synthetic CB benchmarks using the Open Bandit Pipeline shows that probabilistic HD-CB consistently outperforms binarized HD-CB at equal precision, while approaching the performance of HD-CB with as few as 3 bits per component."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the probabilistic update rule with random subset selection and time-decaying probability preserves enough learning information to match or exceed binarized HD-CB without introducing bias or instability that would appear only in full real-world deployments beyond the synthetic benchmarks."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Probabilistic HD-CB outperforms binarized HD-CB and approaches full HD-CB performance on synthetic benchmarks using as few as 3 bits per component via random partial updates with time-decaying probability."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A probabilistic update rule lets hyperdimensional contextual bandits run on low-precision hardware while outperforming binarized versions and approaching full performance with 3 bits per component."}],"snapshot_sha256":"7e2b5e86eb374cdc60d0dd88b26fe6814e1e0b8242c5d97e4449a0c521edbeb3"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"38958f8a23de0f028d5e31a3ab760284923b34f5562b53a904dd25ac85838ebc"},"paper":{"abstract_excerpt":"Contextual bandits (CB) are online sequential decision-making problems under partial feedback that underpin many adaptive services. There is a growing demand to deploy CB agents directly on-device, under strict constraints on memory, compute, and energy. However, standard linear CB algorithms are often impractical for resource-constrained devices with their unfavorable scaling in computational and memory costs. Recently, HD-CB, a CB approach based on hyperdimensional computing principles, has been proposed to model and solve CB problems by moving into high-dimensional spaces. HD-CB offers fast","authors_text":"Amy Loutfi, Antonello Rosato, Denis Kleyko, Kevin Johansson, Marco Angioli","cross_cats":[],"headline":"A probabilistic update rule lets hyperdimensional contextual bandits run on low-precision hardware while outperforming binarized versions and approaching full performance with 3 bits per component.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:04:47Z","title":"Contextual Bandits for Resource-Constrained Devices using Probabilistic Learning"},"references":{"count":30,"internal_anchors":0,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A contextual-bandit approach to personalized news article recommendation,","work_id":"c3de964a-43b8-4ade-81c2-c55cf2589ebd","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Artwork personalization at Netflix,","work_id":"018e34db-411d-4c9d-a3c2-34ff555d4beb","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Multiworld testing decision service: A system for experimentation, learning, and decision-making,","work_id":"a19299dc-6d84-43f3-8a77-7039a24e48b9","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"How The New York Times is experimenting with recommendation algorithms,","work_id":"f463b9ce-39f7-4714-8f3c-291f68524648","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"How we boosted app revenue by 10% with real-time personalization,","work_id":"3579cbbf-34c8-42c7-a0fc-49dbd861fbcd","year":2020}],"snapshot_sha256":"2cfe35fbffa60073ec65bdb48742df4c319d74dc29262bfd96fb5f3200028b9f"},"source":{"id":"2605.13346","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:05:43.806442Z","id":"75e0efb6-aa86-465d-9fed-26113c3adc81","model_set":{"reader":"grok-4.3"},"one_line_summary":"Probabilistic HD-CB outperforms binarized HD-CB and approaches full HD-CB performance on synthetic benchmarks using as few as 3 bits per component via random partial updates with time-decaying probability.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A probabilistic update rule lets hyperdimensional contextual bandits run on low-precision hardware while outperforming binarized versions and approaching full performance with 3 bits per component.","strongest_claim":"Off-policy evaluation on standardized synthetic CB benchmarks using the Open Bandit Pipeline shows that probabilistic HD-CB consistently outperforms binarized HD-CB at equal precision, while approaching the performance of HD-CB with as few as 3 bits per component.","weakest_assumption":"That the probabilistic update rule with random subset selection and time-decaying probability preserves enough learning information to match or exceed binarized HD-CB without introducing bias or instability that would appear only in full real-world deployments beyond the synthetic benchmarks."}},"verdict_id":"75e0efb6-aa86-465d-9fed-26113c3adc81"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:563942a07e817efda1b0fbb6619ff046bdd25293d0ada5896807cd551dabebf2","target":"record","created_at":"2026-05-18T02:44:48Z","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":"c4ea35c211780cb9a5be9f995f0899ba5319534cda4de0d01ceb06c0889f1c6e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:04:47Z","title_canon_sha256":"17f21726524da37745cb916201863ae106e1d9e6a3b33cffafc63b9cbd10d493"},"schema_version":"1.0","source":{"id":"2605.13346","kind":"arxiv","version":1}},"canonical_sha256":"365ca6655fb9eaa5e5bde7d21198a132494a5bd764678fb6f82bb68281503516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"365ca6655fb9eaa5e5bde7d21198a132494a5bd764678fb6f82bb68281503516","first_computed_at":"2026-05-18T02:44:48.336589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:48.336589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGBJeaSXis9sgHO9FioRPfdS2V6MiPPfE3mH2flNcbLNnlA83qacElSp1K//Ti66aE1OxXNBe2N9Ccv8GgNoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:48.337002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:563942a07e817efda1b0fbb6619ff046bdd25293d0ada5896807cd551dabebf2","sha256:5827d53d2c0992656a399aa415b516d98204f496789697b70e9f152c6aaa1639"],"state_sha256":"56e33866d1c20b9441976dfe8fa32b3ceb83f11546e0aa92d35600e260adbc98"}