{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JFUQL5L5MJJB6DQWASXHSWJRRS","short_pith_number":"pith:JFUQL5L5","schema_version":"1.0","canonical_sha256":"496905f57d62521f0e1604ae7959318c9cd5ba39e58b1374d2ab0985f1aa053e","source":{"kind":"arxiv","id":"1804.06769","version":3},"attestation_state":"computed","paper":{"title":"CoNet: Collaborative Cross Networks for Cross-Domain Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Guangneng Hu, Qiang Yang, Yu Zhang","submitted_at":"2018-04-18T14:48:21Z","abstract_excerpt":"The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-domain recommendation by using neural networks as the base model. In contrast to the matrix factorization based cross-domain techniques, our method is deep transfer learning, which can learn complex user-item interaction relationships. We assume that hidden layers in two base network"},"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":"1804.06769","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-18T14:48:21Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"31c7a47214be76fb138bcf3106891b8fe0e33b89d0ce8e4d990428018d2e93de","abstract_canon_sha256":"ff7e718eb1ed43302b6dd0e669d368c8e2e2ed7c0bf4b0fdd00114db33f456ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:17.355546Z","signature_b64":"JcTx7Tw250Y0U5/TM/PDneOi6Uyw6cRTPHKoVcfCt5dFa3L/fswcSKLivHpVeWok2egI0iC8SRF9zWR2/R3YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496905f57d62521f0e1604ae7959318c9cd5ba39e58b1374d2ab0985f1aa053e","last_reissued_at":"2026-05-17T23:59:17.354948Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:17.354948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoNet: Collaborative Cross Networks for Cross-Domain Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Guangneng Hu, Qiang Yang, Yu Zhang","submitted_at":"2018-04-18T14:48:21Z","abstract_excerpt":"The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-domain recommendation by using neural networks as the base model. In contrast to the matrix factorization based cross-domain techniques, our method is deep transfer learning, which can learn complex user-item interaction relationships. We assume that hidden layers in two base network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06769","kind":"arxiv","version":3},"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":"1804.06769","created_at":"2026-05-17T23:59:17.355031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06769v3","created_at":"2026-05-17T23:59:17.355031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06769","created_at":"2026-05-17T23:59:17.355031+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFUQL5L5MJJB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFUQL5L5MJJB6DQW","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFUQL5L5","created_at":"2026-05-18T12:32:31.084164+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/JFUQL5L5MJJB6DQWASXHSWJRRS","json":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS.json","graph_json":"https://pith.science/api/pith-number/JFUQL5L5MJJB6DQWASXHSWJRRS/graph.json","events_json":"https://pith.science/api/pith-number/JFUQL5L5MJJB6DQWASXHSWJRRS/events.json","paper":"https://pith.science/paper/JFUQL5L5"},"agent_actions":{"view_html":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS","download_json":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS.json","view_paper":"https://pith.science/paper/JFUQL5L5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06769&json=true","fetch_graph":"https://pith.science/api/pith-number/JFUQL5L5MJJB6DQWASXHSWJRRS/graph.json","fetch_events":"https://pith.science/api/pith-number/JFUQL5L5MJJB6DQWASXHSWJRRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/action/storage_attestation","attest_author":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/action/author_attestation","sign_citation":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/action/citation_signature","submit_replication":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/action/replication_record"}},"created_at":"2026-05-17T23:59:17.355031+00:00","updated_at":"2026-05-17T23:59:17.355031+00:00"}