{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WQYPQL37YPSBTZVQUCP5HYFQYD","short_pith_number":"pith:WQYPQL37","schema_version":"1.0","canonical_sha256":"b430f82f7fc3e419e6b0a09fd3e0b0c0e0fa06f61b16eed92ba8d864b29f44e7","source":{"kind":"arxiv","id":"1711.03361","version":1},"attestation_state":"computed","paper":{"title":"Multi-Relevance Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Tianchun Wang","submitted_at":"2017-11-09T13:06:09Z","abstract_excerpt":"Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separately by modeling the `source-target' pairs without exploring the relatedness between them, which would cause loss of crucial information, thus failing to achieve optimal capability of knowledge transfer. In this paper, we propose a novel and effective approach called Multi-Releva"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.03361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-09T13:06:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7fad6b9c15603c126f0359b8bc6dfb096493e407f896a5194ba214e8eb026d78","abstract_canon_sha256":"3d5e4387b2eeb6f6f1342dd6b1b57df784331bbb8254e04fcd2c99fd17947107"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.374893Z","signature_b64":"3+8WK55Xpaa9w11tZlzAI5GZKgu0EG2RlimMLG3OoG7XCA02Y5Uyrl1mPubdVIN1cPekm2hAMZqxa2hZfQaaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b430f82f7fc3e419e6b0a09fd3e0b0c0e0fa06f61b16eed92ba8d864b29f44e7","last_reissued_at":"2026-05-18T00:30:56.374267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.374267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Relevance Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Tianchun Wang","submitted_at":"2017-11-09T13:06:09Z","abstract_excerpt":"Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separately by modeling the `source-target' pairs without exploring the relatedness between them, which would cause loss of crucial information, thus failing to achieve optimal capability of knowledge transfer. In this paper, we propose a novel and effective approach called Multi-Releva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03361","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.03361","created_at":"2026-05-18T00:30:56.374357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03361v1","created_at":"2026-05-18T00:30:56.374357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03361","created_at":"2026-05-18T00:30:56.374357+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQYPQL37YPSB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQYPQL37YPSBTZVQ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQYPQL37","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD","json":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD.json","graph_json":"https://pith.science/api/pith-number/WQYPQL37YPSBTZVQUCP5HYFQYD/graph.json","events_json":"https://pith.science/api/pith-number/WQYPQL37YPSBTZVQUCP5HYFQYD/events.json","paper":"https://pith.science/paper/WQYPQL37"},"agent_actions":{"view_html":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD","download_json":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD.json","view_paper":"https://pith.science/paper/WQYPQL37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03361&json=true","fetch_graph":"https://pith.science/api/pith-number/WQYPQL37YPSBTZVQUCP5HYFQYD/graph.json","fetch_events":"https://pith.science/api/pith-number/WQYPQL37YPSBTZVQUCP5HYFQYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD/action/storage_attestation","attest_author":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD/action/author_attestation","sign_citation":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD/action/citation_signature","submit_replication":"https://pith.science/pith/WQYPQL37YPSBTZVQUCP5HYFQYD/action/replication_record"}},"created_at":"2026-05-18T00:30:56.374357+00:00","updated_at":"2026-05-18T00:30:56.374357+00:00"}