{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FQH3KPSHNYPSDXSGIBVIGYQU7Q","short_pith_number":"pith:FQH3KPSH","canonical_record":{"source":{"id":"1802.05821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-16T02:17:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bc6c4cb80f5e6fc4e516ddbf561f307c8384ec69d57ceb79f7eed59a50940fad","abstract_canon_sha256":"64b351361de4fa4960543d64d65e453d6353de4f5db8b53d07462693d4762605"},"schema_version":"1.0"},"canonical_sha256":"2c0fb53e476e1f21de46406a836214fc0bb50fea05528f82d4124d1487f7d7ba","source":{"kind":"arxiv","id":"1802.05821","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05821","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05821v2","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05821","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"FQH3KPSHNYPS","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"pith_short_16","alias_value":"FQH3KPSHNYPSDXSG","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"pith_short_8","alias_value":"FQH3KPSH","created_at":"2026-07-05T00:35:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FQH3KPSHNYPSDXSGIBVIGYQU7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-16T02:17:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bc6c4cb80f5e6fc4e516ddbf561f307c8384ec69d57ceb79f7eed59a50940fad","abstract_canon_sha256":"64b351361de4fa4960543d64d65e453d6353de4f5db8b53d07462693d4762605"},"schema_version":"1.0"},"canonical_sha256":"2c0fb53e476e1f21de46406a836214fc0bb50fea05528f82d4124d1487f7d7ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:41.085692Z","signature_b64":"wxBojwD3jxQ+joOs4DfbDEJVr0kNyLe+O0OobL7LejiMvWVrrnvxrtqoqppYqwUcUBoFJBNHwnkgc03SjtQFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c0fb53e476e1f21de46406a836214fc0bb50fea05528f82d4124d1487f7d7ba","last_reissued_at":"2026-07-05T00:35:41.085232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:41.085232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05821","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-07-05T00:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxoeDo5AGiPQo+B3mUqhosiCSNn2znsRLgti2yGBk6YxfybQsuh7G6CKA4RL25dauwrxoxF9g8JaBYZMG5oYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:49:02.787847Z"},"content_sha256":"43ad9851fad785ecbb3bfb6619ff95933a72fd63c09b3443ecbb7edc2bdf4ef3","schema_version":"1.0","event_id":"sha256:43ad9851fad785ecbb3bfb6619ff95933a72fd63c09b3443ecbb7edc2bdf4ef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FQH3KPSHNYPSDXSGIBVIGYQU7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jian Tan, Jinfeng Xu, Kaiyi Ji, Yuejie Chi","submitted_at":"2018-02-16T02:17:58Z","abstract_excerpt":"Low-rank matrix completion has achieved great success in many real-world data applications. A matrix factorization model that learns latent features is usually employed and, to improve prediction performance, the similarities between latent variables can be exploited by pairwise learning using the graph regularized matrix factorization (GRMF) method. However, existing GRMF approaches often use the squared loss to measure the pairwise differences, which may be overly influenced by dissimilar pairs and lead to inferior prediction. To fully empower pairwise learning for matrix completion, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05821","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1802.05821/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Es7oV3dNYm+ioYiNXouFfTYB7VifyJesIU8y8OlAUzrnNoxNuPVBHNCu4YSt/lWlbCLEVAWMpLpdDAawTYr3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:49:02.788445Z"},"content_sha256":"3c87ac8e26947f625039a54b52daf117bf99887c674806d05e514f4bb6d5275c","schema_version":"1.0","event_id":"sha256:3c87ac8e26947f625039a54b52daf117bf99887c674806d05e514f4bb6d5275c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q/bundle.json","state_url":"https://pith.science/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q/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-08-04T01:49:02Z","links":{"resolver":"https://pith.science/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q","bundle":"https://pith.science/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q/bundle.json","state":"https://pith.science/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQH3KPSHNYPSDXSGIBVIGYQU7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FQH3KPSHNYPSDXSGIBVIGYQU7Q","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":"64b351361de4fa4960543d64d65e453d6353de4f5db8b53d07462693d4762605","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-16T02:17:58Z","title_canon_sha256":"bc6c4cb80f5e6fc4e516ddbf561f307c8384ec69d57ceb79f7eed59a50940fad"},"schema_version":"1.0","source":{"id":"1802.05821","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05821","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05821v2","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05821","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"FQH3KPSHNYPS","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"pith_short_16","alias_value":"FQH3KPSHNYPSDXSG","created_at":"2026-07-05T00:35:41Z"},{"alias_kind":"pith_short_8","alias_value":"FQH3KPSH","created_at":"2026-07-05T00:35:41Z"}],"graph_snapshots":[{"event_id":"sha256:3c87ac8e26947f625039a54b52daf117bf99887c674806d05e514f4bb6d5275c","target":"graph","created_at":"2026-07-05T00:35:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1802.05821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank matrix completion has achieved great success in many real-world data applications. A matrix factorization model that learns latent features is usually employed and, to improve prediction performance, the similarities between latent variables can be exploited by pairwise learning using the graph regularized matrix factorization (GRMF) method. However, existing GRMF approaches often use the squared loss to measure the pairwise differences, which may be overly influenced by dissimilar pairs and lead to inferior prediction. To fully empower pairwise learning for matrix completion, we prop","authors_text":"Jian Tan, Jinfeng Xu, Kaiyi Ji, Yuejie Chi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-16T02:17:58Z","title":"Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05821","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:43ad9851fad785ecbb3bfb6619ff95933a72fd63c09b3443ecbb7edc2bdf4ef3","target":"record","created_at":"2026-07-05T00:35:41Z","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":"64b351361de4fa4960543d64d65e453d6353de4f5db8b53d07462693d4762605","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-16T02:17:58Z","title_canon_sha256":"bc6c4cb80f5e6fc4e516ddbf561f307c8384ec69d57ceb79f7eed59a50940fad"},"schema_version":"1.0","source":{"id":"1802.05821","kind":"arxiv","version":2}},"canonical_sha256":"2c0fb53e476e1f21de46406a836214fc0bb50fea05528f82d4124d1487f7d7ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c0fb53e476e1f21de46406a836214fc0bb50fea05528f82d4124d1487f7d7ba","first_computed_at":"2026-07-05T00:35:41.085232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:35:41.085232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wxBojwD3jxQ+joOs4DfbDEJVr0kNyLe+O0OobL7LejiMvWVrrnvxrtqoqppYqwUcUBoFJBNHwnkgc03SjtQFAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:35:41.085692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05821","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43ad9851fad785ecbb3bfb6619ff95933a72fd63c09b3443ecbb7edc2bdf4ef3","sha256:3c87ac8e26947f625039a54b52daf117bf99887c674806d05e514f4bb6d5275c"],"state_sha256":"8e1f28c73848b0a4396dbedcc8ed5eb18989d588de10741287569e112d30a9f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKwV8vH3GA5tEzrrPnNIEz/HSoCn500hwaRnEbacc8FOz89OAOe8wuh+d8uupF00IOeJgQYZU14Ozy0bWHT+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:49:02.793347Z","bundle_sha256":"0c65cab4da08e2e9e50974077e1265e84d944e535521d973475975d31450e72b"}}