{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IIUBBGXBPWHUGSL3ZBLPXEY7ZF","short_pith_number":"pith:IIUBBGXB","canonical_record":{"source":{"id":"1606.04275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-14T09:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"e1e7206b908b60629f0703f824de78146432b5256de7e640b31e0c922557edd7","abstract_canon_sha256":"423b49a44a2ff38957a1a6ed73cd555205f0a27c4747b3d71af34865b206355c"},"schema_version":"1.0"},"canonical_sha256":"4228109ae17d8f43497bc856fb931fc95cb6b37455142e244bd266224de03e8a","source":{"kind":"arxiv","id":"1606.04275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04275","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04275v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04275","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"IIUBBGXBPWHU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IIUBBGXBPWHUGSL3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IIUBBGXB","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IIUBBGXBPWHUGSL3ZBLPXEY7ZF","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-14T09:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"e1e7206b908b60629f0703f824de78146432b5256de7e640b31e0c922557edd7","abstract_canon_sha256":"423b49a44a2ff38957a1a6ed73cd555205f0a27c4747b3d71af34865b206355c"},"schema_version":"1.0"},"canonical_sha256":"4228109ae17d8f43497bc856fb931fc95cb6b37455142e244bd266224de03e8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.835589Z","signature_b64":"Lwz98HQmrlZmZXfk0tvr7Xd1B8n4RISbhSrEG38k4DyxEGH/e04xFvVqnmbv9crJVLpc6aQApxVezXHe5y/QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4228109ae17d8f43497bc856fb931fc95cb6b37455142e244bd266224de03e8a","last_reissued_at":"2026-05-18T01:12:25.835258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.835258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04275","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:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27mAkBsqULx5g7QH/+SHt1yaujxPMPynkxxEx2aj6U1zGT+U8JeVQO11jLc0zuJ/dpzTiJz16fJh4LqTaq1TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:15:26.448975Z"},"content_sha256":"85e4185f273ea16cf2c31680da02136effac73848fb8b9a9f4e796407e4e3737","schema_version":"1.0","event_id":"sha256:85e4185f273ea16cf2c31680da02136effac73848fb8b9a9f4e796407e4e3737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IIUBBGXBPWHUGSL3ZBLPXEY7ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Antti Airola, Bernard De Baets, Michiel Stock, Tapio Pahikkala, Willem Waegeman","submitted_at":"2016-06-14T09:38:18Z","abstract_excerpt":"Pairwise learning or dyadic prediction concerns the prediction of properties for pairs of objects. It can be seen as an umbrella covering various machine learning problems such as matrix completion, collaborative filtering, multi-task learning, transfer learning, network prediction and zero-shot learning. In this work we analyze kernel-based methods for pairwise learning, with a particular focus on a recently-suggested two-step method. We show that this method offers an appealing alternative for commonly-applied Kronecker-based methods that model dyads by means of pairwise feature representati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04275","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:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVRanv1VBW2crwDkgYmvQwOQ2xp/chgj4s2zn1af5jKlv31E3T2StVENdX8tPfCDOO8NJ8YyFFhqkwUc5oCxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:15:26.449732Z"},"content_sha256":"d997f07d22fba1de0121bc6dede14e72685160334e453059aedd0c4fd41c6109","schema_version":"1.0","event_id":"sha256:d997f07d22fba1de0121bc6dede14e72685160334e453059aedd0c4fd41c6109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF/bundle.json","state_url":"https://pith.science/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF/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-30T07:15:26Z","links":{"resolver":"https://pith.science/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF","bundle":"https://pith.science/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF/bundle.json","state":"https://pith.science/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIUBBGXBPWHUGSL3ZBLPXEY7ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IIUBBGXBPWHUGSL3ZBLPXEY7ZF","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":"423b49a44a2ff38957a1a6ed73cd555205f0a27c4747b3d71af34865b206355c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-14T09:38:18Z","title_canon_sha256":"e1e7206b908b60629f0703f824de78146432b5256de7e640b31e0c922557edd7"},"schema_version":"1.0","source":{"id":"1606.04275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04275","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04275v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04275","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"IIUBBGXBPWHU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IIUBBGXBPWHUGSL3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IIUBBGXB","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:d997f07d22fba1de0121bc6dede14e72685160334e453059aedd0c4fd41c6109","target":"graph","created_at":"2026-05-18T01:12:25Z","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":"Pairwise learning or dyadic prediction concerns the prediction of properties for pairs of objects. It can be seen as an umbrella covering various machine learning problems such as matrix completion, collaborative filtering, multi-task learning, transfer learning, network prediction and zero-shot learning. In this work we analyze kernel-based methods for pairwise learning, with a particular focus on a recently-suggested two-step method. We show that this method offers an appealing alternative for commonly-applied Kronecker-based methods that model dyads by means of pairwise feature representati","authors_text":"Antti Airola, Bernard De Baets, Michiel Stock, Tapio Pahikkala, Willem Waegeman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-14T09:38:18Z","title":"Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04275","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:85e4185f273ea16cf2c31680da02136effac73848fb8b9a9f4e796407e4e3737","target":"record","created_at":"2026-05-18T01:12:25Z","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":"423b49a44a2ff38957a1a6ed73cd555205f0a27c4747b3d71af34865b206355c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-14T09:38:18Z","title_canon_sha256":"e1e7206b908b60629f0703f824de78146432b5256de7e640b31e0c922557edd7"},"schema_version":"1.0","source":{"id":"1606.04275","kind":"arxiv","version":1}},"canonical_sha256":"4228109ae17d8f43497bc856fb931fc95cb6b37455142e244bd266224de03e8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4228109ae17d8f43497bc856fb931fc95cb6b37455142e244bd266224de03e8a","first_computed_at":"2026-05-18T01:12:25.835258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:25.835258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lwz98HQmrlZmZXfk0tvr7Xd1B8n4RISbhSrEG38k4DyxEGH/e04xFvVqnmbv9crJVLpc6aQApxVezXHe5y/QBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:25.835589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e4185f273ea16cf2c31680da02136effac73848fb8b9a9f4e796407e4e3737","sha256:d997f07d22fba1de0121bc6dede14e72685160334e453059aedd0c4fd41c6109"],"state_sha256":"47a6b61e22edc78eea8a91b4718f8a3922ef2fb1b425355c47ee57af500dcdcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkCR9kHz0ISs+2U+pdVUe/rTUcvmp9BucmgJdHIf6ND0L19f9/vWM2WVTG+YCOiJDGmqLxwzZrYtQ+iXe4QjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:15:26.454621Z","bundle_sha256":"645910d8154e65fe3da344cf0106cacd4b03efaf59a577254e59c4366efde475"}}