{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GOZ5FYOAK2MSXTVYKMYWROFPXN","short_pith_number":"pith:GOZ5FYOA","canonical_record":{"source":{"id":"1605.09088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-30T02:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"98c43de820276efc5ad46388e80f053060cd1dcaf5b74596edfb63d1a76fa141","abstract_canon_sha256":"804306ed34bf5b727df24ae76ce5836e6ea0819ea15bc6e27048158415321b4d"},"schema_version":"1.0"},"canonical_sha256":"33b3d2e1c056992bceb8533168b8afbb5903701d1d337850c046a2906d423084","source":{"kind":"arxiv","id":"1605.09088","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09088","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09088v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09088","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"GOZ5FYOAK2MS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GOZ5FYOAK2MSXTVY","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GOZ5FYOA","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GOZ5FYOAK2MSXTVYKMYWROFPXN","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-30T02:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"98c43de820276efc5ad46388e80f053060cd1dcaf5b74596edfb63d1a76fa141","abstract_canon_sha256":"804306ed34bf5b727df24ae76ce5836e6ea0819ea15bc6e27048158415321b4d"},"schema_version":"1.0"},"canonical_sha256":"33b3d2e1c056992bceb8533168b8afbb5903701d1d337850c046a2906d423084","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.919343Z","signature_b64":"q1NL5rkgrPj5vL2IXtmODTBHs80WgO7N1GPyLHcCEMobFAmEBwdW8Vx6+loPKUAKieShSJu8An4cgJq0z/HgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b3d2e1c056992bceb8533168b8afbb5903701d1d337850c046a2906d423084","last_reissued_at":"2026-05-18T01:01:35.918667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.918667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09088","source_version":2,"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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Op3nVre4gXNiXjLQGd7m8IRBWsRZZlFzafJ7futpdGZsuMP9XPNrxznxgA5XwnPp7btWot3xWMl6XSY2fveCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:40:52.677849Z"},"content_sha256":"9e68ad15b4670ba1e103219109546d6e542a6798e0f25d5f98b80a23706d6880","schema_version":"1.0","event_id":"sha256:9e68ad15b4670ba1e103219109546d6e542a6798e0f25d5f98b80a23706d6880"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GOZ5FYOAK2MSXTVYKMYWROFPXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Bayesian Linear Information Filtering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bangrui Chen, Peter I. Frazier","submitted_at":"2016-05-30T02:35:07Z","abstract_excerpt":"We present a Bayesian sequential decision-making formulation of the information filtering problem, in which an algorithm presents items (news articles, scientific papers, tweets) arriving in a stream, and learns relevance from user feedback on presented items. We model user preferences using a Bayesian linear model, similar in spirit to a Bayesian linear bandit. We compute a computational upper bound on the value of the optimal policy, which allows computing an optimality gap for implementable policies. We then use this analysis as motivation in introducing a pair of new Decompose-Then-Decide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09088","kind":"arxiv","version":2},"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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBj9Y7F8aQxAEmvOIcoXYE1X6M5xoTd+9eX8gorjDvO7o4HI0p9MAylRfsNYFdbnzfzzR3yTXb6Dik9eyQQ5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:40:52.678521Z"},"content_sha256":"148d3b87ce6844f71a6142d48f98780ca0995b4955046fae82b64d85364d0a4a","schema_version":"1.0","event_id":"sha256:148d3b87ce6844f71a6142d48f98780ca0995b4955046fae82b64d85364d0a4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN/bundle.json","state_url":"https://pith.science/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN/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-29T15:40:52Z","links":{"resolver":"https://pith.science/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN","bundle":"https://pith.science/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN/bundle.json","state":"https://pith.science/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOZ5FYOAK2MSXTVYKMYWROFPXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GOZ5FYOAK2MSXTVYKMYWROFPXN","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":"804306ed34bf5b727df24ae76ce5836e6ea0819ea15bc6e27048158415321b4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-30T02:35:07Z","title_canon_sha256":"98c43de820276efc5ad46388e80f053060cd1dcaf5b74596edfb63d1a76fa141"},"schema_version":"1.0","source":{"id":"1605.09088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09088","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09088v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09088","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"GOZ5FYOAK2MS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GOZ5FYOAK2MSXTVY","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GOZ5FYOA","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:148d3b87ce6844f71a6142d48f98780ca0995b4955046fae82b64d85364d0a4a","target":"graph","created_at":"2026-05-18T01:01:35Z","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 present a Bayesian sequential decision-making formulation of the information filtering problem, in which an algorithm presents items (news articles, scientific papers, tweets) arriving in a stream, and learns relevance from user feedback on presented items. We model user preferences using a Bayesian linear model, similar in spirit to a Bayesian linear bandit. We compute a computational upper bound on the value of the optimal policy, which allows computing an optimality gap for implementable policies. We then use this analysis as motivation in introducing a pair of new Decompose-Then-Decide ","authors_text":"Bangrui Chen, Peter I. Frazier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-30T02:35:07Z","title":"The Bayesian Linear Information Filtering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09088","kind":"arxiv","version":2},"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:9e68ad15b4670ba1e103219109546d6e542a6798e0f25d5f98b80a23706d6880","target":"record","created_at":"2026-05-18T01:01:35Z","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":"804306ed34bf5b727df24ae76ce5836e6ea0819ea15bc6e27048158415321b4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-30T02:35:07Z","title_canon_sha256":"98c43de820276efc5ad46388e80f053060cd1dcaf5b74596edfb63d1a76fa141"},"schema_version":"1.0","source":{"id":"1605.09088","kind":"arxiv","version":2}},"canonical_sha256":"33b3d2e1c056992bceb8533168b8afbb5903701d1d337850c046a2906d423084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33b3d2e1c056992bceb8533168b8afbb5903701d1d337850c046a2906d423084","first_computed_at":"2026-05-18T01:01:35.918667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:35.918667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q1NL5rkgrPj5vL2IXtmODTBHs80WgO7N1GPyLHcCEMobFAmEBwdW8Vx6+loPKUAKieShSJu8An4cgJq0z/HgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:35.919343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e68ad15b4670ba1e103219109546d6e542a6798e0f25d5f98b80a23706d6880","sha256:148d3b87ce6844f71a6142d48f98780ca0995b4955046fae82b64d85364d0a4a"],"state_sha256":"e86b4e38f9fce6802c65e1de970552e9a0616a14ed8eeba5f0022f252419a35a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9VsvKpuAKwaqfd/3slcTzgQplg7icg5LfWJ8Lj9sxhBsS8NIjjy1eBkek0FVsGgqj6Kiwejyq+HAL1aPW1YAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:40:52.681977Z","bundle_sha256":"482a5e93845e34980677bc43ded262261d1abde5faebe29f21290a7868cdd109"}}