{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JFUQL5L5MJJB6DQWASXHSWJRRS","short_pith_number":"pith:JFUQL5L5","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"},"canonical_sha256":"496905f57d62521f0e1604ae7959318c9cd5ba39e58b1374d2ab0985f1aa053e","source":{"kind":"arxiv","id":"1804.06769","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06769","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06769v3","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06769","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"JFUQL5L5MJJB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JFUQL5L5MJJB6DQW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JFUQL5L5","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JFUQL5L5MJJB6DQWASXHSWJRRS","target":"record","payload":{"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"},"canonical_sha256":"496905f57d62521f0e1604ae7959318c9cd5ba39e58b1374d2ab0985f1aa053e","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"},"source_kind":"arxiv","source_id":"1804.06769","source_version":3,"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-17T23:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qe4kr+JTXcfGQBBblNSWdswH8I2aElMhjqr2pABrJt5Q4Ucp2eoxB8x7c2jfKit9/TM+pKrv0VKFmbV7IbWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:01:47.381084Z"},"content_sha256":"9f63716e80ad8f88ff8394df1574f2ac7712e4e93650fa6da531a65505e2bc3d","schema_version":"1.0","event_id":"sha256:9f63716e80ad8f88ff8394df1574f2ac7712e4e93650fa6da531a65505e2bc3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JFUQL5L5MJJB6DQWASXHSWJRRS","target":"graph","payload":{"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"},"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-17T23:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eC+ngkH8fbB+t0DM+t20+I0v3SARUbzI4YFm4sd4BVF8RKb+CT8ROZuJ5DyiZxIbxvQjFFsGxdBinS/+s0UXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:01:47.381452Z"},"content_sha256":"54f4813b58fcbfb7b9ae77012e8702103f8d42f081a7179b3199ab67cf0f0dc1","schema_version":"1.0","event_id":"sha256:54f4813b58fcbfb7b9ae77012e8702103f8d42f081a7179b3199ab67cf0f0dc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/bundle.json","state_url":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/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-03T13:01:47Z","links":{"resolver":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS","bundle":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/bundle.json","state":"https://pith.science/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFUQL5L5MJJB6DQWASXHSWJRRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JFUQL5L5MJJB6DQWASXHSWJRRS","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":"ff7e718eb1ed43302b6dd0e669d368c8e2e2ed7c0bf4b0fdd00114db33f456ae","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-18T14:48:21Z","title_canon_sha256":"31c7a47214be76fb138bcf3106891b8fe0e33b89d0ce8e4d990428018d2e93de"},"schema_version":"1.0","source":{"id":"1804.06769","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06769","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06769v3","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06769","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"JFUQL5L5MJJB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JFUQL5L5MJJB6DQW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JFUQL5L5","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:54f4813b58fcbfb7b9ae77012e8702103f8d42f081a7179b3199ab67cf0f0dc1","target":"graph","created_at":"2026-05-17T23:59:17Z","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 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","authors_text":"Guangneng Hu, Qiang Yang, Yu Zhang","cross_cats":["cs.AI","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-18T14:48:21Z","title":"CoNet: Collaborative Cross Networks for Cross-Domain Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06769","kind":"arxiv","version":3},"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:9f63716e80ad8f88ff8394df1574f2ac7712e4e93650fa6da531a65505e2bc3d","target":"record","created_at":"2026-05-17T23:59:17Z","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":"ff7e718eb1ed43302b6dd0e669d368c8e2e2ed7c0bf4b0fdd00114db33f456ae","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-18T14:48:21Z","title_canon_sha256":"31c7a47214be76fb138bcf3106891b8fe0e33b89d0ce8e4d990428018d2e93de"},"schema_version":"1.0","source":{"id":"1804.06769","kind":"arxiv","version":3}},"canonical_sha256":"496905f57d62521f0e1604ae7959318c9cd5ba39e58b1374d2ab0985f1aa053e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"496905f57d62521f0e1604ae7959318c9cd5ba39e58b1374d2ab0985f1aa053e","first_computed_at":"2026-05-17T23:59:17.354948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:17.354948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JcTx7Tw250Y0U5/TM/PDneOi6Uyw6cRTPHKoVcfCt5dFa3L/fswcSKLivHpVeWok2egI0iC8SRF9zWR2/R3YAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:17.355546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06769","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f63716e80ad8f88ff8394df1574f2ac7712e4e93650fa6da531a65505e2bc3d","sha256:54f4813b58fcbfb7b9ae77012e8702103f8d42f081a7179b3199ab67cf0f0dc1"],"state_sha256":"6a84dba59ee7d82400d4bd77ffead8924a253c8a18b9bf88c1b77f019260db89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LSUtlR3yo4CNGDCc2jSiglNNVxY9jcgqsHJ09uWkW3U475DLjWb+pUAKuC9kYZgPMWStgobnNvhonsUET74DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:01:47.383473Z","bundle_sha256":"49e45608b37634973433c4639f3c3ab758640b420ceddc32799fbd7ec3f6333b"}}