{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OKM6S2AZELJRWPCX2JSFUWXISC","short_pith_number":"pith:OKM6S2AZ","canonical_record":{"source":{"id":"1612.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-12-17T10:50:41Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e41adce6d8e46384c818af251385ad1214b5192ab7cf9537825ec7d266d19674","abstract_canon_sha256":"f74eac77488f5cbd1aee0d638c6822188fbad9d1c322164d522960483225043d"},"schema_version":"1.0"},"canonical_sha256":"7299e9681922d31b3c57d2645a5ae89082bb7c2948fa1277bd2b9e3ccf6d5d80","source":{"kind":"arxiv","id":"1612.05729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05729","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05729v1","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05729","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"OKM6S2AZELJR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OKM6S2AZELJRWPCX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OKM6S2AZ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OKM6S2AZELJRWPCX2JSFUWXISC","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-12-17T10:50:41Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e41adce6d8e46384c818af251385ad1214b5192ab7cf9537825ec7d266d19674","abstract_canon_sha256":"f74eac77488f5cbd1aee0d638c6822188fbad9d1c322164d522960483225043d"},"schema_version":"1.0"},"canonical_sha256":"7299e9681922d31b3c57d2645a5ae89082bb7c2948fa1277bd2b9e3ccf6d5d80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:46.847474Z","signature_b64":"S2RUmibYOyohAUg1I/Zh+xwpUOINif6Xz03JDDvhZ+idQLuFR6Lzz3ixydEQpdksdIwiOGb7dlluHKN4SNQHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7299e9681922d31b3c57d2645a5ae89082bb7c2948fa1277bd2b9e3ccf6d5d80","last_reissued_at":"2026-05-18T00:54:46.846880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:46.846880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05729","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-18T00:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoLxZtmYKJNcB5fj2eOxilRpYWbXn9ktDE9ZzgAQHUqP7LlIIvX6dCIUs3HFeos0cGil8MqOdySZF1oN8fq2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:11:00.240035Z"},"content_sha256":"5754af9dd56caa9bcfc9fa13877555870c38761556464368d4c8a252b9e735cd","schema_version":"1.0","event_id":"sha256:5754af9dd56caa9bcfc9fa13877555870c38761556464368d4c8a252b9e735cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OKM6S2AZELJRWPCX2JSFUWXISC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting sparsity to build efficient kernel based collaborative filtering for top-N item recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Fabio Aiolli, Mirko Polato","submitted_at":"2016-12-17T10:50:41Z","abstract_excerpt":"The increasing availability of implicit feedback datasets has raised the interest in developing effective collaborative filtering techniques able to deal asymmetrically with unambiguous positive feedback and ambiguous negative feedback. In this paper, we propose a principled kernel-based collaborative filtering method for top-N item recommendation with implicit feedback. We present an efficient implementation using the linear kernel, and we show how to generalize it to kernels of the dot product family preserving the efficiency. We also investigate on the elements which influence the sparsity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05729","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-18T00:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++P7lBUv01oDk5ee2HB0r3Gap3LWWA1YfkUm9BIvq2Git5zQVu/MXoYx/cCpyuGcn8wF+VgcBoT6BrFVGzQXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:11:00.240411Z"},"content_sha256":"1c3f924a21900a4badf0af5ffd97e2a49520af686149394e913e1719f3a796f8","schema_version":"1.0","event_id":"sha256:1c3f924a21900a4badf0af5ffd97e2a49520af686149394e913e1719f3a796f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKM6S2AZELJRWPCX2JSFUWXISC/bundle.json","state_url":"https://pith.science/pith/OKM6S2AZELJRWPCX2JSFUWXISC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKM6S2AZELJRWPCX2JSFUWXISC/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-02T04:11:00Z","links":{"resolver":"https://pith.science/pith/OKM6S2AZELJRWPCX2JSFUWXISC","bundle":"https://pith.science/pith/OKM6S2AZELJRWPCX2JSFUWXISC/bundle.json","state":"https://pith.science/pith/OKM6S2AZELJRWPCX2JSFUWXISC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKM6S2AZELJRWPCX2JSFUWXISC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OKM6S2AZELJRWPCX2JSFUWXISC","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":"f74eac77488f5cbd1aee0d638c6822188fbad9d1c322164d522960483225043d","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-12-17T10:50:41Z","title_canon_sha256":"e41adce6d8e46384c818af251385ad1214b5192ab7cf9537825ec7d266d19674"},"schema_version":"1.0","source":{"id":"1612.05729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05729","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05729v1","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05729","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"OKM6S2AZELJR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OKM6S2AZELJRWPCX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OKM6S2AZ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:1c3f924a21900a4badf0af5ffd97e2a49520af686149394e913e1719f3a796f8","target":"graph","created_at":"2026-05-18T00:54:46Z","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":"The increasing availability of implicit feedback datasets has raised the interest in developing effective collaborative filtering techniques able to deal asymmetrically with unambiguous positive feedback and ambiguous negative feedback. In this paper, we propose a principled kernel-based collaborative filtering method for top-N item recommendation with implicit feedback. We present an efficient implementation using the linear kernel, and we show how to generalize it to kernels of the dot product family preserving the efficiency. We also investigate on the elements which influence the sparsity ","authors_text":"Fabio Aiolli, Mirko Polato","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-12-17T10:50:41Z","title":"Exploiting sparsity to build efficient kernel based collaborative filtering for top-N item recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05729","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:5754af9dd56caa9bcfc9fa13877555870c38761556464368d4c8a252b9e735cd","target":"record","created_at":"2026-05-18T00:54:46Z","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":"f74eac77488f5cbd1aee0d638c6822188fbad9d1c322164d522960483225043d","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-12-17T10:50:41Z","title_canon_sha256":"e41adce6d8e46384c818af251385ad1214b5192ab7cf9537825ec7d266d19674"},"schema_version":"1.0","source":{"id":"1612.05729","kind":"arxiv","version":1}},"canonical_sha256":"7299e9681922d31b3c57d2645a5ae89082bb7c2948fa1277bd2b9e3ccf6d5d80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7299e9681922d31b3c57d2645a5ae89082bb7c2948fa1277bd2b9e3ccf6d5d80","first_computed_at":"2026-05-18T00:54:46.846880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:46.846880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S2RUmibYOyohAUg1I/Zh+xwpUOINif6Xz03JDDvhZ+idQLuFR6Lzz3ixydEQpdksdIwiOGb7dlluHKN4SNQHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:46.847474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5754af9dd56caa9bcfc9fa13877555870c38761556464368d4c8a252b9e735cd","sha256:1c3f924a21900a4badf0af5ffd97e2a49520af686149394e913e1719f3a796f8"],"state_sha256":"99c4812ee2ed5c7bdf319511dd77fad9c69f5451b8bc10ea07b270eec0327850"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yd77gRPM50qJOIZlZCikUOids59OmPNcJe9p8ziz4bBg0AjjIF9m9KGsysI2OYsthr24wM5mixjxv4L8sJVzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:11:00.242403Z","bundle_sha256":"123bf6271031998b26096fda470b144e515194ec62d58ca9eae569de8d56ec08"}}