{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:P5SGL2NHIS7UJOXYBKTU6HOIZV","short_pith_number":"pith:P5SGL2NH","schema_version":"1.0","canonical_sha256":"7f6465e9a744bf44baf80aa74f1dc8cd49d99362ea6c64477033ce20eee47745","source":{"kind":"arxiv","id":"2306.07040","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear SVD with Asymmetric Kernels: feature learning and asymmetric Nystr\\\"om method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Tonin, Johan A. K. Suykens, Panagiotis Patrinos, Qinghua Tao","submitted_at":"2023-06-12T11:39:34Z","abstract_excerpt":"Asymmetric data naturally exist in real life, such as directed graphs. Different from the common kernel methods requiring Mercer kernels, this paper tackles the asymmetric kernel-based learning problem. We describe a nonlinear extension of the matrix Singular Value Decomposition through asymmetric kernels, namely KSVD. First, we construct two nonlinear feature mappings w.r.t. rows and columns of the given data matrix. The proposed optimization problem maximizes the variance of each mapping projected onto the subspace spanned by the other, subject to a mutual orthogonality constraint. Through L"},"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":"2306.07040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T11:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"ce6c1ff02edbb70b3b6d1ea21e5c66bff930ebb0ae829520eeb58bf5722ffb13","abstract_canon_sha256":"ac73c3b379b0dc7634e2f7fa8f3d8192736bf6236d1b2cbb54bfc640cf52a56f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:46.939299Z","signature_b64":"W3pS3xHDrNxLr38x7b5EGdnfC4WZMIXk3if22v2DcrHrLwXicabNLOpq3OqdovFqGvnVZQemWhioSdMK39KEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6465e9a744bf44baf80aa74f1dc8cd49d99362ea6c64477033ce20eee47745","last_reissued_at":"2026-07-05T06:19:46.938834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:46.938834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear SVD with Asymmetric Kernels: feature learning and asymmetric Nystr\\\"om method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Tonin, Johan A. K. Suykens, Panagiotis Patrinos, Qinghua Tao","submitted_at":"2023-06-12T11:39:34Z","abstract_excerpt":"Asymmetric data naturally exist in real life, such as directed graphs. Different from the common kernel methods requiring Mercer kernels, this paper tackles the asymmetric kernel-based learning problem. We describe a nonlinear extension of the matrix Singular Value Decomposition through asymmetric kernels, namely KSVD. First, we construct two nonlinear feature mappings w.r.t. rows and columns of the given data matrix. The proposed optimization problem maximizes the variance of each mapping projected onto the subspace spanned by the other, subject to a mutual orthogonality constraint. Through L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07040","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/2306.07040/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":"2306.07040","created_at":"2026-07-05T06:19:46.938892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07040v1","created_at":"2026-07-05T06:19:46.938892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07040","created_at":"2026-07-05T06:19:46.938892+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5SGL2NHIS7U","created_at":"2026-07-05T06:19:46.938892+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5SGL2NHIS7UJOXY","created_at":"2026-07-05T06:19:46.938892+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5SGL2NH","created_at":"2026-07-05T06:19:46.938892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14765","citing_title":"An Attention-based Framework for Fair Contrastive Learning","ref_index":2013,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV","json":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV.json","graph_json":"https://pith.science/api/pith-number/P5SGL2NHIS7UJOXYBKTU6HOIZV/graph.json","events_json":"https://pith.science/api/pith-number/P5SGL2NHIS7UJOXYBKTU6HOIZV/events.json","paper":"https://pith.science/paper/P5SGL2NH"},"agent_actions":{"view_html":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV","download_json":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV.json","view_paper":"https://pith.science/paper/P5SGL2NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07040&json=true","fetch_graph":"https://pith.science/api/pith-number/P5SGL2NHIS7UJOXYBKTU6HOIZV/graph.json","fetch_events":"https://pith.science/api/pith-number/P5SGL2NHIS7UJOXYBKTU6HOIZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV/action/storage_attestation","attest_author":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV/action/author_attestation","sign_citation":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV/action/citation_signature","submit_replication":"https://pith.science/pith/P5SGL2NHIS7UJOXYBKTU6HOIZV/action/replication_record"}},"created_at":"2026-07-05T06:19:46.938892+00:00","updated_at":"2026-07-05T06:19:46.938892+00:00"}