{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2NKMLTMQ7ZFTZVNPDCDSSFBXQM","short_pith_number":"pith:2NKMLTMQ","canonical_record":{"source":{"id":"1603.01870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T20:26:41Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"8059b413fc4181d45099a02476bdb5ec223ff8868b1652513580e49ecf9f5b95","abstract_canon_sha256":"aeb09534e2111b6f9b76ed01aaea89ac57b117a08107a6bc9e40ccece66ed557"},"schema_version":"1.0"},"canonical_sha256":"d354c5cd90fe4b3cd5af188729143783009ee23cb1d92858161a3762d8f8946b","source":{"kind":"arxiv","id":"1603.01870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01870","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01870v1","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01870","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"2NKMLTMQ7ZFT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NKMLTMQ7ZFTZVNP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NKMLTMQ","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2NKMLTMQ7ZFTZVNPDCDSSFBXQM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T20:26:41Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"8059b413fc4181d45099a02476bdb5ec223ff8868b1652513580e49ecf9f5b95","abstract_canon_sha256":"aeb09534e2111b6f9b76ed01aaea89ac57b117a08107a6bc9e40ccece66ed557"},"schema_version":"1.0"},"canonical_sha256":"d354c5cd90fe4b3cd5af188729143783009ee23cb1d92858161a3762d8f8946b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.484860Z","signature_b64":"ZKLzX7lk21sDoYSfz3/cFff3L4+Wi+ccsZr1st6lzyzsAx7Q24mfvTz5p90Od3zj3FpXZj6UoQvUbiq2mYuMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d354c5cd90fe4b3cd5af188729143783009ee23cb1d92858161a3762d8f8946b","last_reissued_at":"2026-05-18T01:19:33.484407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.484407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01870","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:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z47DQw+ywAaguIBYrrVJS1A/17giK55k7awLNa/MMAOilfxnsjN485aiv3taPoUsq/WuCrJkWJF7w3qnCBacBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:14:38.759608Z"},"content_sha256":"a2470a72211240fb46917c5620e0cc344496837fd10267dd531edf1edf2d5e29","schema_version":"1.0","event_id":"sha256:a2470a72211240fb46917c5620e0cc344496837fd10267dd531edf1edf2d5e29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2NKMLTMQ7ZFTZVNPDCDSSFBXQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Personalized Advertisement Recommendation: A Ranking Approach to Address the Ubiquitous Click Sparsity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Georgios Theocharous, Mohammad Ghavamzadeh, Sougata Chaudhuri","submitted_at":"2016-03-06T20:26:41Z","abstract_excerpt":"We study the problem of personalized advertisement recommendation (PAR), which consist of a user visiting a system (website) and the system displaying one of $K$ ads to the user. The system uses an internal ad recommendation policy to map the user's profile (context) to one of the ads. The user either clicks or ignores the ad and correspondingly, the system updates its recommendation policy. PAR problem is usually tackled by scalable \\emph{contextual bandit} algorithms, where the policies are generally based on classifiers. A practical problem in PAR is extreme click sparsity, due to very few "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01870","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:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CD9YaPIagJ1a65761APvGT9hE7bk0eoGf6+7JTTjbFEolQGSUP4SgABBH0tcM4lAZeyIEcOv3Ft/OPRiDRC8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:14:38.759951Z"},"content_sha256":"5b9844cd4b397b07b8a7dac471be75dcb84f3c0407ff5da7e7696aa635f22341","schema_version":"1.0","event_id":"sha256:5b9844cd4b397b07b8a7dac471be75dcb84f3c0407ff5da7e7696aa635f22341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM/bundle.json","state_url":"https://pith.science/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM/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-06-02T16:14:38Z","links":{"resolver":"https://pith.science/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM","bundle":"https://pith.science/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM/bundle.json","state":"https://pith.science/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NKMLTMQ7ZFTZVNPDCDSSFBXQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2NKMLTMQ7ZFTZVNPDCDSSFBXQM","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":"aeb09534e2111b6f9b76ed01aaea89ac57b117a08107a6bc9e40ccece66ed557","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T20:26:41Z","title_canon_sha256":"8059b413fc4181d45099a02476bdb5ec223ff8868b1652513580e49ecf9f5b95"},"schema_version":"1.0","source":{"id":"1603.01870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01870","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01870v1","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01870","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"2NKMLTMQ7ZFT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NKMLTMQ7ZFTZVNP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NKMLTMQ","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:5b9844cd4b397b07b8a7dac471be75dcb84f3c0407ff5da7e7696aa635f22341","target":"graph","created_at":"2026-05-18T01:19:33Z","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 study the problem of personalized advertisement recommendation (PAR), which consist of a user visiting a system (website) and the system displaying one of $K$ ads to the user. The system uses an internal ad recommendation policy to map the user's profile (context) to one of the ads. The user either clicks or ignores the ad and correspondingly, the system updates its recommendation policy. PAR problem is usually tackled by scalable \\emph{contextual bandit} algorithms, where the policies are generally based on classifiers. A practical problem in PAR is extreme click sparsity, due to very few ","authors_text":"Georgios Theocharous, Mohammad Ghavamzadeh, Sougata Chaudhuri","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T20:26:41Z","title":"Personalized Advertisement Recommendation: A Ranking Approach to Address the Ubiquitous Click Sparsity Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01870","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:a2470a72211240fb46917c5620e0cc344496837fd10267dd531edf1edf2d5e29","target":"record","created_at":"2026-05-18T01:19:33Z","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":"aeb09534e2111b6f9b76ed01aaea89ac57b117a08107a6bc9e40ccece66ed557","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T20:26:41Z","title_canon_sha256":"8059b413fc4181d45099a02476bdb5ec223ff8868b1652513580e49ecf9f5b95"},"schema_version":"1.0","source":{"id":"1603.01870","kind":"arxiv","version":1}},"canonical_sha256":"d354c5cd90fe4b3cd5af188729143783009ee23cb1d92858161a3762d8f8946b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d354c5cd90fe4b3cd5af188729143783009ee23cb1d92858161a3762d8f8946b","first_computed_at":"2026-05-18T01:19:33.484407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:33.484407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKLzX7lk21sDoYSfz3/cFff3L4+Wi+ccsZr1st6lzyzsAx7Q24mfvTz5p90Od3zj3FpXZj6UoQvUbiq2mYuMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:33.484860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2470a72211240fb46917c5620e0cc344496837fd10267dd531edf1edf2d5e29","sha256:5b9844cd4b397b07b8a7dac471be75dcb84f3c0407ff5da7e7696aa635f22341"],"state_sha256":"e8404ab8dc7aa523f76e8743cf4e5b61e4d8c6f5fd1509be450d784187cf4070"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kz0+6B+FY+dvBOEkhzSevwfrsSNa1/8WWAC4gJ4LU/0xTs0rThv1m+cq/dycFQy3juLKuSWW9WpYySDWxNXiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:14:38.761904Z","bundle_sha256":"0466f76435a88245b3f885c6c223843d65b7ad872bfa3e78ccccf6b872a821e6"}}