{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7SHHOWF5S65HMKJRLKSXM4LG55","short_pith_number":"pith:7SHHOWF5","canonical_record":{"source":{"id":"1707.03426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-11T18:43:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dad10cc932e998aea97a65c45db2a206e6f34b8e72538362ec16718cfd6c7597","abstract_canon_sha256":"d22059391016b8a7bd620bdd5a2be7876ac81b73bd6f3f4dc146dbf2732c7e1d"},"schema_version":"1.0"},"canonical_sha256":"fc8e7758bd97ba7629315aa5767166ef4d34f53c1da043e0abf8fbda7763988c","source":{"kind":"arxiv","id":"1707.03426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03426","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03426v1","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03426","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"7SHHOWF5S65H","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7SHHOWF5S65HMKJR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7SHHOWF5","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7SHHOWF5S65HMKJRLKSXM4LG55","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-11T18:43:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dad10cc932e998aea97a65c45db2a206e6f34b8e72538362ec16718cfd6c7597","abstract_canon_sha256":"d22059391016b8a7bd620bdd5a2be7876ac81b73bd6f3f4dc146dbf2732c7e1d"},"schema_version":"1.0"},"canonical_sha256":"fc8e7758bd97ba7629315aa5767166ef4d34f53c1da043e0abf8fbda7763988c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.099375Z","signature_b64":"e96H3Dzn/7svTNtjFe5dHlkA6TXluJEnCOxN1UGD/WDpRYNQHsSzqLJFpmjqsqdht3B+XCv1ZlZpSEPnE0hVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc8e7758bd97ba7629315aa5767166ef4d34f53c1da043e0abf8fbda7763988c","last_reissued_at":"2026-05-18T00:40:28.098785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.098785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03426","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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2mtN5khYLmZLglbHj3i0F2IbU4UgIlll5Vq5xNHsCvtARoqvITP+AOw3ZbwaDM3C1okJXzvJ7wox+tFwHGOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:40:41.994888Z"},"content_sha256":"d6b71d9b51a20ec6143bdf909c00a559a3c1bb584293756b790bb0e65aa0fee7","schema_version":"1.0","event_id":"sha256:d6b71d9b51a20ec6143bdf909c00a559a3c1bb584293756b790bb0e65aa0fee7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7SHHOWF5S65HMKJRLKSXM4LG55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Task Learning Using Neighborhood Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Li, Georgios Anagnostopoulos, Mansooreh Mollaghasemi, Michael Georgiopoulos, Niloofar Yousefi","submitted_at":"2017-07-11T18:43:41Z","abstract_excerpt":"This paper introduces a new and effective algorithm for learning kernels in a Multi-Task Learning (MTL) setting. Although, we consider a MTL scenario here, our approach can be easily applied to standard single task learning, as well. As shown by our empirical results, our algorithm consistently outperforms the traditional kernel learning algorithms such as uniform combination solution, convex combinations of base kernels as well as some kernel alignment-based models, which have been proven to give promising results in the past. We present a Rademacher complexity bound based on which a new Mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03426","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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5l38S1BwcDgjLdP22gM8ZKp5GQKRmo9xGZFzao2IRQQzpjCctYmM++RBgM+cU/n1siw0SwdOqzcAAoGPQdbVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:40:41.995234Z"},"content_sha256":"9e2791c6273a7fbb11d3ae28f697a6f02ab6eec5f875099089b461279c4e7681","schema_version":"1.0","event_id":"sha256:9e2791c6273a7fbb11d3ae28f697a6f02ab6eec5f875099089b461279c4e7681"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SHHOWF5S65HMKJRLKSXM4LG55/bundle.json","state_url":"https://pith.science/pith/7SHHOWF5S65HMKJRLKSXM4LG55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SHHOWF5S65HMKJRLKSXM4LG55/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-30T04:40:41Z","links":{"resolver":"https://pith.science/pith/7SHHOWF5S65HMKJRLKSXM4LG55","bundle":"https://pith.science/pith/7SHHOWF5S65HMKJRLKSXM4LG55/bundle.json","state":"https://pith.science/pith/7SHHOWF5S65HMKJRLKSXM4LG55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SHHOWF5S65HMKJRLKSXM4LG55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7SHHOWF5S65HMKJRLKSXM4LG55","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":"d22059391016b8a7bd620bdd5a2be7876ac81b73bd6f3f4dc146dbf2732c7e1d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-11T18:43:41Z","title_canon_sha256":"dad10cc932e998aea97a65c45db2a206e6f34b8e72538362ec16718cfd6c7597"},"schema_version":"1.0","source":{"id":"1707.03426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03426","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03426v1","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03426","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"7SHHOWF5S65H","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7SHHOWF5S65HMKJR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7SHHOWF5","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:9e2791c6273a7fbb11d3ae28f697a6f02ab6eec5f875099089b461279c4e7681","target":"graph","created_at":"2026-05-18T00:40:28Z","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":"This paper introduces a new and effective algorithm for learning kernels in a Multi-Task Learning (MTL) setting. Although, we consider a MTL scenario here, our approach can be easily applied to standard single task learning, as well. As shown by our empirical results, our algorithm consistently outperforms the traditional kernel learning algorithms such as uniform combination solution, convex combinations of base kernels as well as some kernel alignment-based models, which have been proven to give promising results in the past. We present a Rademacher complexity bound based on which a new Mult","authors_text":"Cong Li, Georgios Anagnostopoulos, Mansooreh Mollaghasemi, Michael Georgiopoulos, Niloofar Yousefi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-11T18:43:41Z","title":"Multi-Task Learning Using Neighborhood Kernels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03426","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:d6b71d9b51a20ec6143bdf909c00a559a3c1bb584293756b790bb0e65aa0fee7","target":"record","created_at":"2026-05-18T00:40:28Z","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":"d22059391016b8a7bd620bdd5a2be7876ac81b73bd6f3f4dc146dbf2732c7e1d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-11T18:43:41Z","title_canon_sha256":"dad10cc932e998aea97a65c45db2a206e6f34b8e72538362ec16718cfd6c7597"},"schema_version":"1.0","source":{"id":"1707.03426","kind":"arxiv","version":1}},"canonical_sha256":"fc8e7758bd97ba7629315aa5767166ef4d34f53c1da043e0abf8fbda7763988c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc8e7758bd97ba7629315aa5767166ef4d34f53c1da043e0abf8fbda7763988c","first_computed_at":"2026-05-18T00:40:28.098785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:28.098785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e96H3Dzn/7svTNtjFe5dHlkA6TXluJEnCOxN1UGD/WDpRYNQHsSzqLJFpmjqsqdht3B+XCv1ZlZpSEPnE0hVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:28.099375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6b71d9b51a20ec6143bdf909c00a559a3c1bb584293756b790bb0e65aa0fee7","sha256:9e2791c6273a7fbb11d3ae28f697a6f02ab6eec5f875099089b461279c4e7681"],"state_sha256":"b7e38840684249a7543b11157f1fb708a735398d75b14d7e65784d4ad32a5abc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZC1BXy0VDjVz9LcXrwCnaWCnVs3gaCxh1Z4A15//mkubP5/Lw6XURCaqcWYf1k3TjRhYH8HKgovcbOnlnzmsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:40:41.997407Z","bundle_sha256":"ce8a8a2d8bd7c4f4d60d28d7cf107de70f4e2eb62fd7cd580c0203fbb1534872"}}