{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BXTCFPUR2QG5PWBSY23GUNPIOY","short_pith_number":"pith:BXTCFPUR","schema_version":"1.0","canonical_sha256":"0de622be91d40dd7d832c6b66a35e8761a926963039b3024df1acb07dc19da71","source":{"kind":"arxiv","id":"1906.04572","version":1},"attestation_state":"computed","paper":{"title":"Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"M. Kaloorazi, R. C. de Lamare","submitted_at":"2019-06-08T02:41:43Z","abstract_excerpt":"In this work, a novel rank-revealing matrix decomposition algorithm termed Compressed Randomized UTV (CoR-UTV) decomposition along with a CoR-UTV variant aided by the power method technique is proposed. CoR-UTV computes an approximation to a low-rank input matrix by making use of random sampling schemes. Given a large and dense matrix of size $m\\times n$ with numerical rank $k$, where $k \\ll \\text{min} \\{m,n\\}$, CoR-UTV requires a few passes over the data, and runs in $O(mnk)$ floating-point operations. Furthermore, CoR-UTV can exploit modern computational platforms and can be optimized for ma"},"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":"1906.04572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-08T02:41:43Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"3d19ca910f904f5cb45c7c4b9b1c74d8f9559876fea3964b1034b15d0c47bf33","abstract_canon_sha256":"5479cfe38297c5d92ba91239b75b2875415bf9489b7be0bc1897aac672c84c8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:38.878832Z","signature_b64":"5Q/QvYBKpCGMJQJA1w5F/pgr+XZzI4I0knO8kMOLMQBGOnV/37QJ/9hc9h2XRczDI0HvzGO1s6ltL2CYiCRCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de622be91d40dd7d832c6b66a35e8761a926963039b3024df1acb07dc19da71","last_reissued_at":"2026-05-17T23:43:38.878281Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:38.878281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"M. Kaloorazi, R. C. de Lamare","submitted_at":"2019-06-08T02:41:43Z","abstract_excerpt":"In this work, a novel rank-revealing matrix decomposition algorithm termed Compressed Randomized UTV (CoR-UTV) decomposition along with a CoR-UTV variant aided by the power method technique is proposed. CoR-UTV computes an approximation to a low-rank input matrix by making use of random sampling schemes. Given a large and dense matrix of size $m\\times n$ with numerical rank $k$, where $k \\ll \\text{min} \\{m,n\\}$, CoR-UTV requires a few passes over the data, and runs in $O(mnk)$ floating-point operations. Furthermore, CoR-UTV can exploit modern computational platforms and can be optimized for ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04572","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":""},"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":"1906.04572","created_at":"2026-05-17T23:43:38.878382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04572v1","created_at":"2026-05-17T23:43:38.878382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04572","created_at":"2026-05-17T23:43:38.878382+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXTCFPUR2QG5","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXTCFPUR2QG5PWBS","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXTCFPUR","created_at":"2026-05-18T12:33:12.712433+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/BXTCFPUR2QG5PWBSY23GUNPIOY","json":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY.json","graph_json":"https://pith.science/api/pith-number/BXTCFPUR2QG5PWBSY23GUNPIOY/graph.json","events_json":"https://pith.science/api/pith-number/BXTCFPUR2QG5PWBSY23GUNPIOY/events.json","paper":"https://pith.science/paper/BXTCFPUR"},"agent_actions":{"view_html":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY","download_json":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY.json","view_paper":"https://pith.science/paper/BXTCFPUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04572&json=true","fetch_graph":"https://pith.science/api/pith-number/BXTCFPUR2QG5PWBSY23GUNPIOY/graph.json","fetch_events":"https://pith.science/api/pith-number/BXTCFPUR2QG5PWBSY23GUNPIOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY/action/storage_attestation","attest_author":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY/action/author_attestation","sign_citation":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY/action/citation_signature","submit_replication":"https://pith.science/pith/BXTCFPUR2QG5PWBSY23GUNPIOY/action/replication_record"}},"created_at":"2026-05-17T23:43:38.878382+00:00","updated_at":"2026-05-17T23:43:38.878382+00:00"}