{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RSBQAZS4H6KGK5UHY4ITPLKOOS","short_pith_number":"pith:RSBQAZS4","canonical_record":{"source":{"id":"1308.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-08T09:24:24Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"b70c27a47d907c571dc9f4162eb9ed33f0a67e7667931483f302bf04fd0adcf7","abstract_canon_sha256":"8a4845c87cb5a3cecb55c346a430a6308a1bac81eceac38e22c08c6fad5e0aac"},"schema_version":"1.0"},"canonical_sha256":"8c8300665c3f94657687c71137ad4e74b60da3f847d96ac784e0fef1410ff0f5","source":{"kind":"arxiv","id":"1308.1792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1792","created_at":"2026-05-18T03:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1792v1","created_at":"2026-05-18T03:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1792","created_at":"2026-05-18T03:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"RSBQAZS4H6KG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RSBQAZS4H6KGK5UH","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RSBQAZS4","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RSBQAZS4H6KGK5UHY4ITPLKOOS","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-08T09:24:24Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"b70c27a47d907c571dc9f4162eb9ed33f0a67e7667931483f302bf04fd0adcf7","abstract_canon_sha256":"8a4845c87cb5a3cecb55c346a430a6308a1bac81eceac38e22c08c6fad5e0aac"},"schema_version":"1.0"},"canonical_sha256":"8c8300665c3f94657687c71137ad4e74b60da3f847d96ac784e0fef1410ff0f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:27.662937Z","signature_b64":"bsGiTxAOHG3BopNxlKtoPBrOSJ1xGafVLYJ5lRNxnNttr5GtlF5phhH/pUHJlKn4S314b2XtU/ockf+z5lpRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c8300665c3f94657687c71137ad4e74b60da3f847d96ac784e0fef1410ff0f5","last_reissued_at":"2026-05-18T03:16:27.662321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:27.662321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1792","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-18T03:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ehv50aOj665vBGvZbTRATCUtL3cT+E6aiGzC8M2HszJPZsqvNfJ/eyClCWgKQ6rScfM8gIQ1NR177S4697sCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:33:24.927086Z"},"content_sha256":"bb4e9b515c021cf5d3c4070191e659b2e96de4d5cc9cae5054e30df6caa68afe","schema_version":"1.0","event_id":"sha256:bb4e9b515c021cf5d3c4070191e659b2e96de4d5cc9cae5054e30df6caa68afe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RSBQAZS4H6KGK5UHY4ITPLKOOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OFF-Set: One-pass Factorization of Feature Sets for Online Recommendation in Persistent Cold Start Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Edward Bortnikov, Liron Levin, Michal Aharon, Natalie Aizenberg, Ohad Serfaty, Ran Roth, Roi Adadi, Ronny Lempel, Tomer Benyamini","submitted_at":"2013-08-08T09:24:24Z","abstract_excerpt":"One of the most challenging recommendation tasks is recommending to a new, previously unseen user. This is known as the 'user cold start' problem. Assuming certain features or attributes of users are known, one approach for handling new users is to initially model them based on their features.\n  Motivated by an ad targeting application, this paper describes an extreme online recommendation setting where the cold start problem is perpetual. Every user is encountered by the system just once, receives a recommendation, and either consumes or ignores it, registering a binary reward.\n  We introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1792","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-18T03:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90JMXBJ6v0f0VbI3jnvWN5sIiKnzk7HqL5GciNHAmOJVWXbtosfW16iflMxxURJtNy6XHO8SteUiXPJy/awqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:33:24.927445Z"},"content_sha256":"4c99b37143028d2b3f59600068b878bd6cbc38af9ba70d2fa9083063beeddd7c","schema_version":"1.0","event_id":"sha256:4c99b37143028d2b3f59600068b878bd6cbc38af9ba70d2fa9083063beeddd7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS/bundle.json","state_url":"https://pith.science/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS/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-27T03:33:24Z","links":{"resolver":"https://pith.science/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS","bundle":"https://pith.science/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS/bundle.json","state":"https://pith.science/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSBQAZS4H6KGK5UHY4ITPLKOOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RSBQAZS4H6KGK5UHY4ITPLKOOS","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":"8a4845c87cb5a3cecb55c346a430a6308a1bac81eceac38e22c08c6fad5e0aac","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-08T09:24:24Z","title_canon_sha256":"b70c27a47d907c571dc9f4162eb9ed33f0a67e7667931483f302bf04fd0adcf7"},"schema_version":"1.0","source":{"id":"1308.1792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1792","created_at":"2026-05-18T03:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1792v1","created_at":"2026-05-18T03:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1792","created_at":"2026-05-18T03:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"RSBQAZS4H6KG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RSBQAZS4H6KGK5UH","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RSBQAZS4","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4c99b37143028d2b3f59600068b878bd6cbc38af9ba70d2fa9083063beeddd7c","target":"graph","created_at":"2026-05-18T03:16:27Z","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":"One of the most challenging recommendation tasks is recommending to a new, previously unseen user. This is known as the 'user cold start' problem. Assuming certain features or attributes of users are known, one approach for handling new users is to initially model them based on their features.\n  Motivated by an ad targeting application, this paper describes an extreme online recommendation setting where the cold start problem is perpetual. Every user is encountered by the system just once, receives a recommendation, and either consumes or ignores it, registering a binary reward.\n  We introduce","authors_text":"Edward Bortnikov, Liron Levin, Michal Aharon, Natalie Aizenberg, Ohad Serfaty, Ran Roth, Roi Adadi, Ronny Lempel, Tomer Benyamini","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-08T09:24:24Z","title":"OFF-Set: One-pass Factorization of Feature Sets for Online Recommendation in Persistent Cold Start Settings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1792","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:bb4e9b515c021cf5d3c4070191e659b2e96de4d5cc9cae5054e30df6caa68afe","target":"record","created_at":"2026-05-18T03:16:27Z","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":"8a4845c87cb5a3cecb55c346a430a6308a1bac81eceac38e22c08c6fad5e0aac","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-08-08T09:24:24Z","title_canon_sha256":"b70c27a47d907c571dc9f4162eb9ed33f0a67e7667931483f302bf04fd0adcf7"},"schema_version":"1.0","source":{"id":"1308.1792","kind":"arxiv","version":1}},"canonical_sha256":"8c8300665c3f94657687c71137ad4e74b60da3f847d96ac784e0fef1410ff0f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c8300665c3f94657687c71137ad4e74b60da3f847d96ac784e0fef1410ff0f5","first_computed_at":"2026-05-18T03:16:27.662321Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:27.662321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsGiTxAOHG3BopNxlKtoPBrOSJ1xGafVLYJ5lRNxnNttr5GtlF5phhH/pUHJlKn4S314b2XtU/ockf+z5lpRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:27.662937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb4e9b515c021cf5d3c4070191e659b2e96de4d5cc9cae5054e30df6caa68afe","sha256:4c99b37143028d2b3f59600068b878bd6cbc38af9ba70d2fa9083063beeddd7c"],"state_sha256":"66f15ce3e145bd7814dc5d83834302cec521d38815c9ab60218d51570a198590"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpAYbrxnIJ7w/oYS1xMvJS4d/aJFsIJ/0yAEtOZY82EU7UhCldSixXXuF7R4I+ei3l3ceesukWGQHJk567+qCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:33:24.929278Z","bundle_sha256":"fa441be6e7fae96d6f725240e3344e60f0d80c24e6ceacdcd326c760315a5190"}}