{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6PKITAI5AHX6XATZV3FB7Z5E5V","short_pith_number":"pith:6PKITAI5","canonical_record":{"source":{"id":"1207.0136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-06-30T20:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"d053aef2f2f201edf69ce0676cae9dece26489690c312f45e1a2c1e903f4d944","abstract_canon_sha256":"e3f69e3c4211f21f29949865d167c1d9def2d14773c61f3c18e235480c9de5a1"},"schema_version":"1.0"},"canonical_sha256":"f3d489811d01efeb8279aeca1fe7a4ed5bde4ecf0adb4667f67c324de3937087","source":{"kind":"arxiv","id":"1207.0136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0136","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0136v1","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0136","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"6PKITAI5AHX6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6PKITAI5AHX6XATZ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6PKITAI5","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6PKITAI5AHX6XATZV3FB7Z5E5V","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-06-30T20:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"d053aef2f2f201edf69ce0676cae9dece26489690c312f45e1a2c1e903f4d944","abstract_canon_sha256":"e3f69e3c4211f21f29949865d167c1d9def2d14773c61f3c18e235480c9de5a1"},"schema_version":"1.0"},"canonical_sha256":"f3d489811d01efeb8279aeca1fe7a4ed5bde4ecf0adb4667f67c324de3937087","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:00.234235Z","signature_b64":"X/Gbf1Ut8W0JoJgLu2h4M+5nGDRGyWKQBp1oOCKNeXbq4hZlYLF+RjkR+W1m8lcW9eUXFiAp029iMqvwtyzkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3d489811d01efeb8279aeca1fe7a4ed5bde4ecf0adb4667f67c324de3937087","last_reissued_at":"2026-05-18T03:52:00.233570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:00.233570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0136","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:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rExWVDCIyStgGislyy5CAT427eXCNDG/gsoc4dIXLai2W+gckyJx9Q5+4/2qlYAl9gZxwEG4osuFuNUIfhIGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:55.614449Z"},"content_sha256":"235a2e75578d61d10a6f7f2f8cb4a79795631cd3756e1a49634e34cdcbca2262","schema_version":"1.0","event_id":"sha256:235a2e75578d61d10a6f7f2f8cb4a79795631cd3756e1a49634e34cdcbca2262"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6PKITAI5AHX6XATZV3FB7Z5E5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supercharging Recommender Systems using Taxonomies for Learning User Purchase Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amr Ahmed, Bhargav Kanagal, Jeff Yuan, Lluis Garcia-Pueyo, Sandeep Pandey, Vanja Josifovski","submitted_at":"2012-06-30T20:17:05Z","abstract_excerpt":"Recommender systems based on latent factor models have been effectively used for understanding user interests and predicting future actions. Such models work by projecting the users and items into a smaller dimensional space, thereby clustering similar users and items together and subsequently compute similarity between unknown user-item pairs. When user-item interactions are sparse (sparsity problem) or when new items continuously appear (cold start problem), these models perform poorly. In this paper, we exploit the combination of taxonomies and latent factor models to mitigate these issues "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0136","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:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xg8gPYK9/g6HdVtfUcPqJTG2IX9y5HWf5Ar2MI5a50XEtkFmd4uwH2+SYbDnE+kPPdeZHE4CxtuAPu70iIkVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:55.615102Z"},"content_sha256":"59bb20d245d92938130bd914e8e9bcb8d4db08a9d05c733aed8ae0305f97d41a","schema_version":"1.0","event_id":"sha256:59bb20d245d92938130bd914e8e9bcb8d4db08a9d05c733aed8ae0305f97d41a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PKITAI5AHX6XATZV3FB7Z5E5V/bundle.json","state_url":"https://pith.science/pith/6PKITAI5AHX6XATZV3FB7Z5E5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PKITAI5AHX6XATZV3FB7Z5E5V/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-29T17:53:55Z","links":{"resolver":"https://pith.science/pith/6PKITAI5AHX6XATZV3FB7Z5E5V","bundle":"https://pith.science/pith/6PKITAI5AHX6XATZV3FB7Z5E5V/bundle.json","state":"https://pith.science/pith/6PKITAI5AHX6XATZV3FB7Z5E5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PKITAI5AHX6XATZV3FB7Z5E5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6PKITAI5AHX6XATZV3FB7Z5E5V","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":"e3f69e3c4211f21f29949865d167c1d9def2d14773c61f3c18e235480c9de5a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-06-30T20:17:05Z","title_canon_sha256":"d053aef2f2f201edf69ce0676cae9dece26489690c312f45e1a2c1e903f4d944"},"schema_version":"1.0","source":{"id":"1207.0136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0136","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0136v1","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0136","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"6PKITAI5AHX6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6PKITAI5AHX6XATZ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6PKITAI5","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:59bb20d245d92938130bd914e8e9bcb8d4db08a9d05c733aed8ae0305f97d41a","target":"graph","created_at":"2026-05-18T03:52:00Z","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":"Recommender systems based on latent factor models have been effectively used for understanding user interests and predicting future actions. Such models work by projecting the users and items into a smaller dimensional space, thereby clustering similar users and items together and subsequently compute similarity between unknown user-item pairs. When user-item interactions are sparse (sparsity problem) or when new items continuously appear (cold start problem), these models perform poorly. In this paper, we exploit the combination of taxonomies and latent factor models to mitigate these issues ","authors_text":"Amr Ahmed, Bhargav Kanagal, Jeff Yuan, Lluis Garcia-Pueyo, Sandeep Pandey, Vanja Josifovski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-06-30T20:17:05Z","title":"Supercharging Recommender Systems using Taxonomies for Learning User Purchase Behavior"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0136","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:235a2e75578d61d10a6f7f2f8cb4a79795631cd3756e1a49634e34cdcbca2262","target":"record","created_at":"2026-05-18T03:52:00Z","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":"e3f69e3c4211f21f29949865d167c1d9def2d14773c61f3c18e235480c9de5a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-06-30T20:17:05Z","title_canon_sha256":"d053aef2f2f201edf69ce0676cae9dece26489690c312f45e1a2c1e903f4d944"},"schema_version":"1.0","source":{"id":"1207.0136","kind":"arxiv","version":1}},"canonical_sha256":"f3d489811d01efeb8279aeca1fe7a4ed5bde4ecf0adb4667f67c324de3937087","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3d489811d01efeb8279aeca1fe7a4ed5bde4ecf0adb4667f67c324de3937087","first_computed_at":"2026-05-18T03:52:00.233570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:00.233570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/Gbf1Ut8W0JoJgLu2h4M+5nGDRGyWKQBp1oOCKNeXbq4hZlYLF+RjkR+W1m8lcW9eUXFiAp029iMqvwtyzkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:00.234235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:235a2e75578d61d10a6f7f2f8cb4a79795631cd3756e1a49634e34cdcbca2262","sha256:59bb20d245d92938130bd914e8e9bcb8d4db08a9d05c733aed8ae0305f97d41a"],"state_sha256":"7d0387aa98f759bb8c5a1eaa5c77f4cdc6329a6631bd827d8436b5dc68972d97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yimpgQ4E7DVQ5qBZfPc9XrPUcet6UE+v5NMBW0Awl5ERTGSWQRN+cNbj6NVo5lfLdFABynqwR5XnzI6q6GO5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:53:55.618425Z","bundle_sha256":"894041795692df5f862eaf312d230a72bc2f58ce3f57eefe916e176b2b76c990"}}