{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6IKU4HBG5TOPO4IHVVD6HTYTN7","short_pith_number":"pith:6IKU4HBG","canonical_record":{"source":{"id":"1902.06188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-17T02:14:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0fac8b1e19c315124cc10174b9e312c0575d3a29d8782a3f051c0eaa07ce836b","abstract_canon_sha256":"348f5b21dd817fed9e21c2c057ec4b16b411887072a370f7471cbdc20f7a7631"},"schema_version":"1.0"},"canonical_sha256":"f2154e1c26ecdcf77107ad47e3cf136fe4680269f8b1560714f10664cf846cb4","source":{"kind":"arxiv","id":"1902.06188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06188","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06188v2","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06188","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"6IKU4HBG5TOP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6IKU4HBG5TOPO4IH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6IKU4HBG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6IKU4HBG5TOPO4IHVVD6HTYTN7","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-17T02:14:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0fac8b1e19c315124cc10174b9e312c0575d3a29d8782a3f051c0eaa07ce836b","abstract_canon_sha256":"348f5b21dd817fed9e21c2c057ec4b16b411887072a370f7471cbdc20f7a7631"},"schema_version":"1.0"},"canonical_sha256":"f2154e1c26ecdcf77107ad47e3cf136fe4680269f8b1560714f10664cf846cb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:40.928724Z","signature_b64":"owKujOEKjig55Ch9SSJi0rVNU4A2AwS/09FmpQyY9trc4/yVCzQneBkiaRhE0OOi6mXg59lvoKiDHA6RpPLWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2154e1c26ecdcf77107ad47e3cf136fe4680269f8b1560714f10664cf846cb4","last_reissued_at":"2026-05-17T23:53:40.928166Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:40.928166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06188","source_version":2,"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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgBcHqmdbVPaKhI0FJkienT1jhodnJIA7iSErlY6omc6JwrYNXjYc+RRnQcBs458nw9QVwt8pvuf9ekTE2ZWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:34:45.130855Z"},"content_sha256":"125cf5118bf37db5d5a27d1709851984cc3101506460cfebbb9a0e9b8f6b2ef2","schema_version":"1.0","event_id":"sha256:125cf5118bf37db5d5a27d1709851984cc3101506460cfebbb9a0e9b8f6b2ef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6IKU4HBG5TOPO4IHVVD6HTYTN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collaborative Similarity Embedding for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Chih-Ming Chen, Chuan-Ju Wang, Ming-Feng Tsai, Yi-Hsuan Yang","submitted_at":"2019-02-17T02:14:39Z","abstract_excerpt":"We present collaborative similarity embedding (CSE), a unified framework that exploits comprehensive collaborative relations available in a user-item bipartite graph for representation learning and recommendation. In the proposed framework, we differentiate two types of proximity relations: direct proximity and k-th order neighborhood proximity. While learning from the former exploits direct user-item associations observable from the graph, learning from the latter makes use of implicit associations such as user-user similarities and item-item similarities, which can provide valuable informati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06188","kind":"arxiv","version":2},"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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hYwITNGRWJ3Y/Fb5V4ZkSUMSjQKN15oFOpFJrXSA3zi/l2hgHeItQ9ZhWTn5eEmBAUd6ZieoeBsDmC7TvzDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:34:45.131195Z"},"content_sha256":"711ca519ec9150df3e7002be0ccdf84cb6f20f2942aa3a18bf74572061148fb9","schema_version":"1.0","event_id":"sha256:711ca519ec9150df3e7002be0ccdf84cb6f20f2942aa3a18bf74572061148fb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7/bundle.json","state_url":"https://pith.science/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7/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-01T11:34:45Z","links":{"resolver":"https://pith.science/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7","bundle":"https://pith.science/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7/bundle.json","state":"https://pith.science/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IKU4HBG5TOPO4IHVVD6HTYTN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6IKU4HBG5TOPO4IHVVD6HTYTN7","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":"348f5b21dd817fed9e21c2c057ec4b16b411887072a370f7471cbdc20f7a7631","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-17T02:14:39Z","title_canon_sha256":"0fac8b1e19c315124cc10174b9e312c0575d3a29d8782a3f051c0eaa07ce836b"},"schema_version":"1.0","source":{"id":"1902.06188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06188","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06188v2","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06188","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"6IKU4HBG5TOP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6IKU4HBG5TOPO4IH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6IKU4HBG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:711ca519ec9150df3e7002be0ccdf84cb6f20f2942aa3a18bf74572061148fb9","target":"graph","created_at":"2026-05-17T23:53:40Z","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":"We present collaborative similarity embedding (CSE), a unified framework that exploits comprehensive collaborative relations available in a user-item bipartite graph for representation learning and recommendation. In the proposed framework, we differentiate two types of proximity relations: direct proximity and k-th order neighborhood proximity. While learning from the former exploits direct user-item associations observable from the graph, learning from the latter makes use of implicit associations such as user-user similarities and item-item similarities, which can provide valuable informati","authors_text":"Chih-Ming Chen, Chuan-Ju Wang, Ming-Feng Tsai, Yi-Hsuan Yang","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-17T02:14:39Z","title":"Collaborative Similarity Embedding for Recommender Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06188","kind":"arxiv","version":2},"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:125cf5118bf37db5d5a27d1709851984cc3101506460cfebbb9a0e9b8f6b2ef2","target":"record","created_at":"2026-05-17T23:53:40Z","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":"348f5b21dd817fed9e21c2c057ec4b16b411887072a370f7471cbdc20f7a7631","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-17T02:14:39Z","title_canon_sha256":"0fac8b1e19c315124cc10174b9e312c0575d3a29d8782a3f051c0eaa07ce836b"},"schema_version":"1.0","source":{"id":"1902.06188","kind":"arxiv","version":2}},"canonical_sha256":"f2154e1c26ecdcf77107ad47e3cf136fe4680269f8b1560714f10664cf846cb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2154e1c26ecdcf77107ad47e3cf136fe4680269f8b1560714f10664cf846cb4","first_computed_at":"2026-05-17T23:53:40.928166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:40.928166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"owKujOEKjig55Ch9SSJi0rVNU4A2AwS/09FmpQyY9trc4/yVCzQneBkiaRhE0OOi6mXg59lvoKiDHA6RpPLWBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:40.928724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:125cf5118bf37db5d5a27d1709851984cc3101506460cfebbb9a0e9b8f6b2ef2","sha256:711ca519ec9150df3e7002be0ccdf84cb6f20f2942aa3a18bf74572061148fb9"],"state_sha256":"e5de1712c9b3cbbdabb86b819b18f19200100ad60d6223fd432e00ec1dbee0fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTxxWhSoCnjG03UvjMinBWRYjEBUojE+0UKqF1v9ZAoNZ/loqneOA8Ntum02LkToylwVxRlfGwn9aI+iRHNlAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:34:45.133079Z","bundle_sha256":"6bcfc2157881a71a8179ff761104cf256504f227bfc8483bf74bf8bc746841f7"}}