{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3YGWAYAK65Y4BACDC56Y6RD3IN","short_pith_number":"pith:3YGWAYAK","canonical_record":{"source":{"id":"1407.8186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-30T20:00:11Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3277413c4170461c9f3566f061972560041f33ffadc4ac6e5eb017020468d9df","abstract_canon_sha256":"b715ab600d5910b9de2ad593a618de81db8745d3eaada31c75e0f18613f34ef8"},"schema_version":"1.0"},"canonical_sha256":"de0d60600af771c08043177d8f447b4356054105aa5cc59b3ccb4fc71b0f3ac4","source":{"kind":"arxiv","id":"1407.8186","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8186","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8186v3","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8186","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"3YGWAYAK65Y4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YGWAYAK65Y4BACD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YGWAYAK","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3YGWAYAK65Y4BACDC56Y6RD3IN","target":"record","payload":{"canonical_record":{"source":{"id":"1407.8186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-30T20:00:11Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3277413c4170461c9f3566f061972560041f33ffadc4ac6e5eb017020468d9df","abstract_canon_sha256":"b715ab600d5910b9de2ad593a618de81db8745d3eaada31c75e0f18613f34ef8"},"schema_version":"1.0"},"canonical_sha256":"de0d60600af771c08043177d8f447b4356054105aa5cc59b3ccb4fc71b0f3ac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:44.366325Z","signature_b64":"5vIZdmCXoEGi7xGbWT4LGcD7f45o5wVIN5R7+0hk9OfbGxDtLXtDGLFSEhAh1PCLfyCZvm2m0nDdeKjExG8ICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0d60600af771c08043177d8f447b4356054105aa5cc59b3ccb4fc71b0f3ac4","last_reissued_at":"2026-05-18T02:27:44.365917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:44.365917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.8186","source_version":3,"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-18T02:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFMeVmufCBKFpxQ+GlJ0DOeEOiIH277IPyANfgWNlDarcvFpD4BVxDBIr9IGoQx2M6FKwGtSO9dTGzwYgAHZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:55:34.709413Z"},"content_sha256":"bd20ead012c7638113918fedd18541ec0c8af0390e1e0fd76dbbaf0858b07788","schema_version":"1.0","event_id":"sha256:bd20ead012c7638113918fedd18541ec0c8af0390e1e0fd76dbbaf0858b07788"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3YGWAYAK65Y4BACDC56Y6RD3IN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploration vs. Exploitation in the Information Filtering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"math.OC","authors_text":"Peter I. Frazier, Xiaoting Zhao","submitted_at":"2014-07-30T20:00:11Z","abstract_excerpt":"We consider information filtering, in which we face a stream of items too voluminous to process by hand (e.g., scientific articles, blog posts, emails), and must rely on a computer system to automatically filter out irrelevant items. Such systems face the exploration vs. exploitation tradeoff, in which it may be beneficial to present an item despite a low probability of relevance, just to learn about future items with similar content. We present a Bayesian sequential decision-making model of this problem, show how it may be solved to optimality using a decomposition to a collection of two-arme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8186","kind":"arxiv","version":3},"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-18T02:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYHYMs4ZzfrfmApFH5AaB+BPYpj6HdHsGD9E8HLZWK7mMxhgxi0w7wyjboLzVoh+Tcp9BixQvKzarAtxSOm3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:55:34.709778Z"},"content_sha256":"9e22eb005d1962381d83803df82c6685f1fcc854b552740c156dce2610794822","schema_version":"1.0","event_id":"sha256:9e22eb005d1962381d83803df82c6685f1fcc854b552740c156dce2610794822"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YGWAYAK65Y4BACDC56Y6RD3IN/bundle.json","state_url":"https://pith.science/pith/3YGWAYAK65Y4BACDC56Y6RD3IN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YGWAYAK65Y4BACDC56Y6RD3IN/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-30T18:55:34Z","links":{"resolver":"https://pith.science/pith/3YGWAYAK65Y4BACDC56Y6RD3IN","bundle":"https://pith.science/pith/3YGWAYAK65Y4BACDC56Y6RD3IN/bundle.json","state":"https://pith.science/pith/3YGWAYAK65Y4BACDC56Y6RD3IN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YGWAYAK65Y4BACDC56Y6RD3IN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3YGWAYAK65Y4BACDC56Y6RD3IN","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":"b715ab600d5910b9de2ad593a618de81db8745d3eaada31c75e0f18613f34ef8","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-30T20:00:11Z","title_canon_sha256":"3277413c4170461c9f3566f061972560041f33ffadc4ac6e5eb017020468d9df"},"schema_version":"1.0","source":{"id":"1407.8186","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8186","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8186v3","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8186","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"3YGWAYAK65Y4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YGWAYAK65Y4BACD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YGWAYAK","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:9e22eb005d1962381d83803df82c6685f1fcc854b552740c156dce2610794822","target":"graph","created_at":"2026-05-18T02:27:44Z","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 consider information filtering, in which we face a stream of items too voluminous to process by hand (e.g., scientific articles, blog posts, emails), and must rely on a computer system to automatically filter out irrelevant items. Such systems face the exploration vs. exploitation tradeoff, in which it may be beneficial to present an item despite a low probability of relevance, just to learn about future items with similar content. We present a Bayesian sequential decision-making model of this problem, show how it may be solved to optimality using a decomposition to a collection of two-arme","authors_text":"Peter I. Frazier, Xiaoting Zhao","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-30T20:00:11Z","title":"Exploration vs. Exploitation in the Information Filtering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8186","kind":"arxiv","version":3},"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:bd20ead012c7638113918fedd18541ec0c8af0390e1e0fd76dbbaf0858b07788","target":"record","created_at":"2026-05-18T02:27:44Z","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":"b715ab600d5910b9de2ad593a618de81db8745d3eaada31c75e0f18613f34ef8","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-30T20:00:11Z","title_canon_sha256":"3277413c4170461c9f3566f061972560041f33ffadc4ac6e5eb017020468d9df"},"schema_version":"1.0","source":{"id":"1407.8186","kind":"arxiv","version":3}},"canonical_sha256":"de0d60600af771c08043177d8f447b4356054105aa5cc59b3ccb4fc71b0f3ac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0d60600af771c08043177d8f447b4356054105aa5cc59b3ccb4fc71b0f3ac4","first_computed_at":"2026-05-18T02:27:44.365917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:44.365917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vIZdmCXoEGi7xGbWT4LGcD7f45o5wVIN5R7+0hk9OfbGxDtLXtDGLFSEhAh1PCLfyCZvm2m0nDdeKjExG8ICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:44.366325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.8186","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd20ead012c7638113918fedd18541ec0c8af0390e1e0fd76dbbaf0858b07788","sha256:9e22eb005d1962381d83803df82c6685f1fcc854b552740c156dce2610794822"],"state_sha256":"dde570a9a494e9d3b6d4fe56ca9013ac22a89de01a446b9701104a71061d79c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoWYFaxBGAuSyR1XSdydg++vQiGrWy14tMYZ3q72cn+JLc6gGuDYVO71+ziFYrNfRVc0aAyeiGYDU06D8xE1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:55:34.719217Z","bundle_sha256":"1395ed0b2e263f98e2684f1f4108c4bfb148e004704f8820824195def485ed90"}}