{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I6IB72ATGOL4534JBO33GTBIEI","short_pith_number":"pith:I6IB72AT","schema_version":"1.0","canonical_sha256":"47901fe8133397ceef890bb7b34c28221e85fab322bf0fa34ee65363abcb5275","source":{"kind":"arxiv","id":"2412.04082","version":1},"attestation_state":"computed","paper":{"title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Wenlong Lyu, Yuheng Jia","submitted_at":"2024-12-05T11:32:53Z","abstract_excerpt":"Symmetric nonnegative matrix factorization (SymNMF) is a powerful tool for clustering, which typically uses the $k$-nearest neighbor ($k$-NN) method to construct similarity matrix. However, $k$-NN may mislead clustering since the neighbors may belong to different clusters, and its reliability generally decreases as $k$ grows. In this paper, we construct the similarity matrix as a weighted $k$-NN graph with learnable weight that reflects the reliability of each $k$-th NN. This approach reduces the search space of the similarity matrix learning to $n - 1$ dimension, as opposed to the $\\mathcal{O"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.04082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-05T11:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"7016f3b6965f20f16455c40988aa4e56ea691cd2d1eb3fa6a21c9400c734d020","abstract_canon_sha256":"3d9f7d724a0944cfd3a762286fe55d7c54937c9ec0bde3c39da137cfbed3f07e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:58.887518Z","signature_b64":"DbaxDFCb8ralk4c+spzBNSIpq9g3aNeI4O3C3Duz/TtdokRQbRiP05fElIkk79oG5w+AC8UgQQsXPxg/xXbeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47901fe8133397ceef890bb7b34c28221e85fab322bf0fa34ee65363abcb5275","last_reissued_at":"2026-07-05T09:44:58.887029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:58.887029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Wenlong Lyu, Yuheng Jia","submitted_at":"2024-12-05T11:32:53Z","abstract_excerpt":"Symmetric nonnegative matrix factorization (SymNMF) is a powerful tool for clustering, which typically uses the $k$-nearest neighbor ($k$-NN) method to construct similarity matrix. However, $k$-NN may mislead clustering since the neighbors may belong to different clusters, and its reliability generally decreases as $k$ grows. In this paper, we construct the similarity matrix as a weighted $k$-NN graph with learnable weight that reflects the reliability of each $k$-th NN. This approach reduces the search space of the similarity matrix learning to $n - 1$ dimension, as opposed to the $\\mathcal{O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04082","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/2412.04082/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.04082","created_at":"2026-07-05T09:44:58.887088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04082v1","created_at":"2026-07-05T09:44:58.887088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04082","created_at":"2026-07-05T09:44:58.887088+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6IB72ATGOL4","created_at":"2026-07-05T09:44:58.887088+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6IB72ATGOL4534J","created_at":"2026-07-05T09:44:58.887088+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6IB72AT","created_at":"2026-07-05T09:44:58.887088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI","json":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI.json","graph_json":"https://pith.science/api/pith-number/I6IB72ATGOL4534JBO33GTBIEI/graph.json","events_json":"https://pith.science/api/pith-number/I6IB72ATGOL4534JBO33GTBIEI/events.json","paper":"https://pith.science/paper/I6IB72AT"},"agent_actions":{"view_html":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI","download_json":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI.json","view_paper":"https://pith.science/paper/I6IB72AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04082&json=true","fetch_graph":"https://pith.science/api/pith-number/I6IB72ATGOL4534JBO33GTBIEI/graph.json","fetch_events":"https://pith.science/api/pith-number/I6IB72ATGOL4534JBO33GTBIEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI/action/storage_attestation","attest_author":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI/action/author_attestation","sign_citation":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI/action/citation_signature","submit_replication":"https://pith.science/pith/I6IB72ATGOL4534JBO33GTBIEI/action/replication_record"}},"created_at":"2026-07-05T09:44:58.887088+00:00","updated_at":"2026-07-05T09:44:58.887088+00:00"}