{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GQ2DJLO5K4WBDV6D52WPTDMZXU","short_pith_number":"pith:GQ2DJLO5","canonical_record":{"source":{"id":"2409.19550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-29T04:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"6a54dab8877af1dae37af81d263850d2779b3ebbbfa2b682db9c9a6c6b395fea","abstract_canon_sha256":"b7481cbdcdc264840e5e3ac64f27d0ce80807cfccea2b1915b58a98efca54e97"},"schema_version":"1.0"},"canonical_sha256":"343434addd572c11d7c3eeacf98d99bd0e41becfa22eb82b4faae3646adad275","source":{"kind":"arxiv","id":"2409.19550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.19550","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2409.19550v1","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19550","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"GQ2DJLO5K4WB","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"GQ2DJLO5K4WBDV6D","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"GQ2DJLO5","created_at":"2026-07-05T09:13:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GQ2DJLO5K4WBDV6D52WPTDMZXU","target":"record","payload":{"canonical_record":{"source":{"id":"2409.19550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-29T04:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"6a54dab8877af1dae37af81d263850d2779b3ebbbfa2b682db9c9a6c6b395fea","abstract_canon_sha256":"b7481cbdcdc264840e5e3ac64f27d0ce80807cfccea2b1915b58a98efca54e97"},"schema_version":"1.0"},"canonical_sha256":"343434addd572c11d7c3eeacf98d99bd0e41becfa22eb82b4faae3646adad275","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:13:17.113028Z","signature_b64":"bAS2kSmE+SREmBy3ULOX3jBkIujXaPGGALsNObfYXTa4BZmpPMRuk8zyxDLXCltia+PhMi39k/kakA+nuKTkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"343434addd572c11d7c3eeacf98d99bd0e41becfa22eb82b4faae3646adad275","last_reissued_at":"2026-07-05T09:13:17.112527Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:13:17.112527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.19550","source_version":1,"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-05T09:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dv6f0gUSmeuTabZj1V+akKBkmeG8UuKAxAi09WUv/wd5mx7iccoqqfbxXr2Fo1TStEhGG3Tl5jCPV51klPPlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:00:51.465575Z"},"content_sha256":"b20224c96f7530f857b446d4b479bc9a3c744e64707acddc46572253d2d811cd","schema_version":"1.0","event_id":"sha256:b20224c96f7530f857b446d4b479bc9a3c744e64707acddc46572253d2d811cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GQ2DJLO5K4WBDV6D52WPTDMZXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Changyi Ma, Runsheng Yu, Xiao Chen, Youzhi Zhang","submitted_at":"2024-09-29T04:27:23Z","abstract_excerpt":"Similarity matrix serves as a fundamental tool at the core of numerous downstream machine-learning tasks. However, missing data is inevitable and often results in an inaccurate similarity matrix. To address this issue, Similarity Matrix Completion (SMC) methods have been proposed, but they suffer from high computation complexity due to the Singular Value Decomposition (SVD) operation. To reduce the computation complexity, Matrix Factorization (MF) techniques are more explicit and frequently applied to provide a low-rank solution, but the exact low-rank optimal solution can not be guaranteed si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19550","kind":"arxiv","version":1},"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/2409.19550/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-05T09:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAFPrYjwQOAgrqfmt4pnL4tyu82psZ6DXz4HLIt/RjidufNOMYBjSNPaRJFljDR9g17bLnFvgTcL8HFygabEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:00:51.465960Z"},"content_sha256":"9120154949691ce15d3635c2309b57ade28687718163ddceae856c2473311728","schema_version":"1.0","event_id":"sha256:9120154949691ce15d3635c2309b57ade28687718163ddceae856c2473311728"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU/bundle.json","state_url":"https://pith.science/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU/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-03T19:00:51Z","links":{"resolver":"https://pith.science/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU","bundle":"https://pith.science/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU/bundle.json","state":"https://pith.science/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQ2DJLO5K4WBDV6D52WPTDMZXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GQ2DJLO5K4WBDV6D52WPTDMZXU","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":"b7481cbdcdc264840e5e3ac64f27d0ce80807cfccea2b1915b58a98efca54e97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-29T04:27:23Z","title_canon_sha256":"6a54dab8877af1dae37af81d263850d2779b3ebbbfa2b682db9c9a6c6b395fea"},"schema_version":"1.0","source":{"id":"2409.19550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.19550","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2409.19550v1","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19550","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"GQ2DJLO5K4WB","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"GQ2DJLO5K4WBDV6D","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"GQ2DJLO5","created_at":"2026-07-05T09:13:17Z"}],"graph_snapshots":[{"event_id":"sha256:9120154949691ce15d3635c2309b57ade28687718163ddceae856c2473311728","target":"graph","created_at":"2026-07-05T09:13: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.19550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Similarity matrix serves as a fundamental tool at the core of numerous downstream machine-learning tasks. However, missing data is inevitable and often results in an inaccurate similarity matrix. To address this issue, Similarity Matrix Completion (SMC) methods have been proposed, but they suffer from high computation complexity due to the Singular Value Decomposition (SVD) operation. To reduce the computation complexity, Matrix Factorization (MF) techniques are more explicit and frequently applied to provide a low-rank solution, but the exact low-rank optimal solution can not be guaranteed si","authors_text":"Changyi Ma, Runsheng Yu, Xiao Chen, Youzhi Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-29T04:27:23Z","title":"Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19550","kind":"arxiv","version":1},"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:b20224c96f7530f857b446d4b479bc9a3c744e64707acddc46572253d2d811cd","target":"record","created_at":"2026-07-05T09:13: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":"b7481cbdcdc264840e5e3ac64f27d0ce80807cfccea2b1915b58a98efca54e97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-29T04:27:23Z","title_canon_sha256":"6a54dab8877af1dae37af81d263850d2779b3ebbbfa2b682db9c9a6c6b395fea"},"schema_version":"1.0","source":{"id":"2409.19550","kind":"arxiv","version":1}},"canonical_sha256":"343434addd572c11d7c3eeacf98d99bd0e41becfa22eb82b4faae3646adad275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"343434addd572c11d7c3eeacf98d99bd0e41becfa22eb82b4faae3646adad275","first_computed_at":"2026-07-05T09:13:17.112527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:13:17.112527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bAS2kSmE+SREmBy3ULOX3jBkIujXaPGGALsNObfYXTa4BZmpPMRuk8zyxDLXCltia+PhMi39k/kakA+nuKTkDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:13:17.113028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.19550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b20224c96f7530f857b446d4b479bc9a3c744e64707acddc46572253d2d811cd","sha256:9120154949691ce15d3635c2309b57ade28687718163ddceae856c2473311728"],"state_sha256":"d743592a0780759ec9864c474fd516bbe607ef0a1394311e5f5d37771616c782"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyBsmzu7psLvzhtDRx+qJx+ffGBSSKKR6jdfLwJ7gQbpaiHdoYGw1LoyfhAcbnd8iTrVQ5zDGZl895BHW3lmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:00:51.468289Z","bundle_sha256":"98ef1bf6341563b74e8e564d67b366b9ddc885049aac00e0de757a67dccca78b"}}