{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AFLVSNAYVEISAQA4FHOIRKOJQK","short_pith_number":"pith:AFLVSNAY","schema_version":"1.0","canonical_sha256":"0157593418a91120401c29dc88a9c9828a368e14f8a685f002152d78fe26892b","source":{"kind":"arxiv","id":"2002.03229","version":2},"attestation_state":"computed","paper":{"title":"Supervised Quantile Normalization for Low-rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean-Philippe Vert, Jonathan Niles-Weed, Marco Cuturi, Olivier Teboul","submitted_at":"2020-02-08T21:06:02Z","abstract_excerpt":"Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a matrix factorization step is usually preceded by ad-hoc feature normalization steps, such as \\texttt{tf-idf} scaling or data whitening. We propose in this work to learn these normalization operators jointly with the factorization itself. More precisely, given a $d\\times n$ matrix $X$ of $d$ features measured on $n$ individuals, we propose to learn the parameter"},"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":"2002.03229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-08T21:06:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a5c9d46c809e640119425ef40816d0282a68ef3bb2c941b6e8eb4db371c6a01b","abstract_canon_sha256":"657e83945fb2ca6601150b3b8057edbda589281ebbca6ca07ca3ed79975c0180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:12.710312Z","signature_b64":"jWkLaBqb5G0QKHwSddQEU4tU0wnYJJ083QcqZVK0hMs5rromG9Tq4DyGiquV/9rSO633jlGZdxntPEcXQ7ojAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0157593418a91120401c29dc88a9c9828a368e14f8a685f002152d78fe26892b","last_reissued_at":"2026-07-05T01:16:12.709838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:12.709838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Quantile Normalization for Low-rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean-Philippe Vert, Jonathan Niles-Weed, Marco Cuturi, Olivier Teboul","submitted_at":"2020-02-08T21:06:02Z","abstract_excerpt":"Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a matrix factorization step is usually preceded by ad-hoc feature normalization steps, such as \\texttt{tf-idf} scaling or data whitening. We propose in this work to learn these normalization operators jointly with the factorization itself. More precisely, given a $d\\times n$ matrix $X$ of $d$ features measured on $n$ individuals, we propose to learn the parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03229","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/2002.03229/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":"2002.03229","created_at":"2026-07-05T01:16:12.709902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.03229v2","created_at":"2026-07-05T01:16:12.709902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03229","created_at":"2026-07-05T01:16:12.709902+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFLVSNAYVEIS","created_at":"2026-07-05T01:16:12.709902+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFLVSNAYVEISAQA4","created_at":"2026-07-05T01:16:12.709902+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFLVSNAY","created_at":"2026-07-05T01:16:12.709902+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/AFLVSNAYVEISAQA4FHOIRKOJQK","json":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK.json","graph_json":"https://pith.science/api/pith-number/AFLVSNAYVEISAQA4FHOIRKOJQK/graph.json","events_json":"https://pith.science/api/pith-number/AFLVSNAYVEISAQA4FHOIRKOJQK/events.json","paper":"https://pith.science/paper/AFLVSNAY"},"agent_actions":{"view_html":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK","download_json":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK.json","view_paper":"https://pith.science/paper/AFLVSNAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.03229&json=true","fetch_graph":"https://pith.science/api/pith-number/AFLVSNAYVEISAQA4FHOIRKOJQK/graph.json","fetch_events":"https://pith.science/api/pith-number/AFLVSNAYVEISAQA4FHOIRKOJQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK/action/storage_attestation","attest_author":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK/action/author_attestation","sign_citation":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK/action/citation_signature","submit_replication":"https://pith.science/pith/AFLVSNAYVEISAQA4FHOIRKOJQK/action/replication_record"}},"created_at":"2026-07-05T01:16:12.709902+00:00","updated_at":"2026-07-05T01:16:12.709902+00:00"}