{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NY7IJMYYRUWFESJKM4OEA7Y7OW","short_pith_number":"pith:NY7IJMYY","canonical_record":{"source":{"id":"1802.04606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-13T13:19:42Z","cross_cats_sorted":[],"title_canon_sha256":"777139309902089cd81e5aea496534b0c83e15a88a14ddec4e9ee9a163083944","abstract_canon_sha256":"f79e3c88d20535a167169691061110ced0a898e138e31993e9e6a8c26b5c8f73"},"schema_version":"1.0"},"canonical_sha256":"6e3e84b3188d2c52492a671c407f1f75993d975d744e223232701136abffb67b","source":{"kind":"arxiv","id":"1802.04606","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04606","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04606v2","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04606","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"NY7IJMYYRUWF","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NY7IJMYYRUWFESJK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NY7IJMYY","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NY7IJMYYRUWFESJKM4OEA7Y7OW","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-13T13:19:42Z","cross_cats_sorted":[],"title_canon_sha256":"777139309902089cd81e5aea496534b0c83e15a88a14ddec4e9ee9a163083944","abstract_canon_sha256":"f79e3c88d20535a167169691061110ced0a898e138e31993e9e6a8c26b5c8f73"},"schema_version":"1.0"},"canonical_sha256":"6e3e84b3188d2c52492a671c407f1f75993d975d744e223232701136abffb67b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:21.810214Z","signature_b64":"z/oUMyXrg5Cor7NVLefVLIxkMLkncRqVq4F9oYUTlRdL9Ejl93V+Qtce735XS8be58gQYGIEFDgHs8wGAQjLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3e84b3188d2c52492a671c407f1f75993d975d744e223232701136abffb67b","last_reissued_at":"2026-05-18T00:14:21.809516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:21.809516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04606","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-18T00:14:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goytnYpuDA6gtq5ibA1gtimwYrajzenanTsmOWlmP7aEk5Mb8TOV2Z0Ln90g7jzjt7vuskyQJkSXPW8Tvn1kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:04:01.713036Z"},"content_sha256":"f41a0f76f54aa3806f88c2a038651f3fd48e154f516de356e2fdec9e7d22d9a1","schema_version":"1.0","event_id":"sha256:f41a0f76f54aa3806f88c2a038651f3fd48e154f516de356e2fdec9e7d22d9a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NY7IJMYYRUWFESJKM4OEA7Y7OW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric Factorization: Recommendation beyond Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Liming Zhu, Lina Yao, Shuai Zhang, Xiang Zhang, Xiwei Xu, Yi Tay","submitted_at":"2018-02-13T13:19:42Z","abstract_excerpt":"In the past decade, matrix factorization has been extensively researched and has become one of the most popular techniques for personalized recommendations. Nevertheless, the dot product adopted in matrix factorization based recommender models does not satisfy the inequality property, which may limit their expressiveness and lead to sub-optimal solutions. To overcome this problem, we propose a novel recommender technique dubbed as {\\em Metric Factorization}. We assume that users and items can be placed in a low dimensional space and their explicit closeness can be measured using Euclidean dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04606","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-18T00:14:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pS9o4mHuJhFBhms5OUcDWvzytTj2DpDvJftlOxx4SEIiF6VvOBrCcEvxy8T7aM4cEwhvW8BBe+xsIQ7IJJ8JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:04:01.713680Z"},"content_sha256":"36214ae09129aeb69b73b0f0b6c85d4ba5362297f8861a772dac22b7c6c3f824","schema_version":"1.0","event_id":"sha256:36214ae09129aeb69b73b0f0b6c85d4ba5362297f8861a772dac22b7c6c3f824"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW/bundle.json","state_url":"https://pith.science/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW/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-28T22:04:01Z","links":{"resolver":"https://pith.science/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW","bundle":"https://pith.science/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW/bundle.json","state":"https://pith.science/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NY7IJMYYRUWFESJKM4OEA7Y7OW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NY7IJMYYRUWFESJKM4OEA7Y7OW","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":"f79e3c88d20535a167169691061110ced0a898e138e31993e9e6a8c26b5c8f73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-13T13:19:42Z","title_canon_sha256":"777139309902089cd81e5aea496534b0c83e15a88a14ddec4e9ee9a163083944"},"schema_version":"1.0","source":{"id":"1802.04606","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04606","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04606v2","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04606","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"NY7IJMYYRUWF","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NY7IJMYYRUWFESJK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NY7IJMYY","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:36214ae09129aeb69b73b0f0b6c85d4ba5362297f8861a772dac22b7c6c3f824","target":"graph","created_at":"2026-05-18T00:14:21Z","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":"In the past decade, matrix factorization has been extensively researched and has become one of the most popular techniques for personalized recommendations. Nevertheless, the dot product adopted in matrix factorization based recommender models does not satisfy the inequality property, which may limit their expressiveness and lead to sub-optimal solutions. To overcome this problem, we propose a novel recommender technique dubbed as {\\em Metric Factorization}. We assume that users and items can be placed in a low dimensional space and their explicit closeness can be measured using Euclidean dist","authors_text":"Liming Zhu, Lina Yao, Shuai Zhang, Xiang Zhang, Xiwei Xu, Yi Tay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-13T13:19:42Z","title":"Metric Factorization: Recommendation beyond Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04606","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:f41a0f76f54aa3806f88c2a038651f3fd48e154f516de356e2fdec9e7d22d9a1","target":"record","created_at":"2026-05-18T00:14:21Z","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":"f79e3c88d20535a167169691061110ced0a898e138e31993e9e6a8c26b5c8f73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-13T13:19:42Z","title_canon_sha256":"777139309902089cd81e5aea496534b0c83e15a88a14ddec4e9ee9a163083944"},"schema_version":"1.0","source":{"id":"1802.04606","kind":"arxiv","version":2}},"canonical_sha256":"6e3e84b3188d2c52492a671c407f1f75993d975d744e223232701136abffb67b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e3e84b3188d2c52492a671c407f1f75993d975d744e223232701136abffb67b","first_computed_at":"2026-05-18T00:14:21.809516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:21.809516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z/oUMyXrg5Cor7NVLefVLIxkMLkncRqVq4F9oYUTlRdL9Ejl93V+Qtce735XS8be58gQYGIEFDgHs8wGAQjLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:21.810214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04606","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f41a0f76f54aa3806f88c2a038651f3fd48e154f516de356e2fdec9e7d22d9a1","sha256:36214ae09129aeb69b73b0f0b6c85d4ba5362297f8861a772dac22b7c6c3f824"],"state_sha256":"34975532d7a97f2f51ecfbcfbc0dd6140eff07da41c752b45ac57e49f3ce4e75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsbSJjywYeu8jG1UxDcEdy+r63GZmgHWuskDt5p/trjQYfh0eet8qFoVw2wx21JIKuTxj3Fa+hGxFiZBuvF1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:04:01.717079Z","bundle_sha256":"f18655404abd2b563f15a0c8d1060f16ba1e929fa5457b959218ba3de43fed0c"}}