{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VVV6JMZP7KR7W3PAZ7E3RIPMD3","short_pith_number":"pith:VVV6JMZP","schema_version":"1.0","canonical_sha256":"ad6be4b32ffaa3fb6de0cfc9b8a1ec1edb3b00fa3111c46d61f1019941baaae9","source":{"kind":"arxiv","id":"1810.07323","version":1},"attestation_state":"computed","paper":{"title":"Compressed Randomized UTV Decompositions for Low-Rank Approximations and Big Data Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"M. Kaloorazi, R. C. de Lamare","submitted_at":"2018-10-15T21:33:04Z","abstract_excerpt":"Low-rank matrix approximations play a fundamental role in numerical linear algebra and signal processing applications. This paper introduces 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. CoR-UTV is primarily developed to compute 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,"},"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":"1810.07323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-10-15T21:33:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab15b4e0b54bdb1f56f28a19a9b13c6c68699710f042c4993d64a07a989bb765","abstract_canon_sha256":"f952bdbedf6b7313a879b04afd5ceee3b0043884ede05f7670d46304f038dbf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:58.824924Z","signature_b64":"kzqMuQIrIfAX2KWJww7XGSOROdw1Q+jYxhCuONZnK2+Y1xrejxbQ0wjj3pmn/L8avpnfsel5ZhzBbCDZCa3oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad6be4b32ffaa3fb6de0cfc9b8a1ec1edb3b00fa3111c46d61f1019941baaae9","last_reissued_at":"2026-05-18T00:02:58.824465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:58.824465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Randomized UTV Decompositions for Low-Rank Approximations and Big Data Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"M. Kaloorazi, R. C. de Lamare","submitted_at":"2018-10-15T21:33:04Z","abstract_excerpt":"Low-rank matrix approximations play a fundamental role in numerical linear algebra and signal processing applications. This paper introduces 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. CoR-UTV is primarily developed to compute 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,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07323","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":"1810.07323","created_at":"2026-05-18T00:02:58.824541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07323v1","created_at":"2026-05-18T00:02:58.824541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07323","created_at":"2026-05-18T00:02:58.824541+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVV6JMZP7KR7","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVV6JMZP7KR7W3PA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVV6JMZP","created_at":"2026-05-18T12:32:59.047623+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/VVV6JMZP7KR7W3PAZ7E3RIPMD3","json":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3.json","graph_json":"https://pith.science/api/pith-number/VVV6JMZP7KR7W3PAZ7E3RIPMD3/graph.json","events_json":"https://pith.science/api/pith-number/VVV6JMZP7KR7W3PAZ7E3RIPMD3/events.json","paper":"https://pith.science/paper/VVV6JMZP"},"agent_actions":{"view_html":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3","download_json":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3.json","view_paper":"https://pith.science/paper/VVV6JMZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07323&json=true","fetch_graph":"https://pith.science/api/pith-number/VVV6JMZP7KR7W3PAZ7E3RIPMD3/graph.json","fetch_events":"https://pith.science/api/pith-number/VVV6JMZP7KR7W3PAZ7E3RIPMD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3/action/storage_attestation","attest_author":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3/action/author_attestation","sign_citation":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3/action/citation_signature","submit_replication":"https://pith.science/pith/VVV6JMZP7KR7W3PAZ7E3RIPMD3/action/replication_record"}},"created_at":"2026-05-18T00:02:58.824541+00:00","updated_at":"2026-05-18T00:02:58.824541+00:00"}