{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BXTCFPUR2QG5PWBSY23GUNPIOY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5479cfe38297c5d92ba91239b75b2875415bf9489b7be0bc1897aac672c84c8c","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-08T02:41:43Z","title_canon_sha256":"3d19ca910f904f5cb45c7c4b9b1c74d8f9559876fea3964b1034b15d0c47bf33"},"schema_version":"1.0","source":{"id":"1906.04572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04572","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04572v1","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04572","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"BXTCFPUR2QG5","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXTCFPUR2QG5PWBS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXTCFPUR","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:3bbd52dcbdc56cd594477109eaf620eb08b14e408da7a3f13fb55fd9ec0397d2","target":"graph","created_at":"2026-05-17T23:43:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"M. Kaloorazi, R. C. de Lamare","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-08T02:41:43Z","title":"Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04572","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1bd98d0e385a37ce3fa75f47f705ca8e0f137a3280bf9a6d3e0abf93235f04f7","target":"record","created_at":"2026-05-17T23:43:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5479cfe38297c5d92ba91239b75b2875415bf9489b7be0bc1897aac672c84c8c","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-08T02:41:43Z","title_canon_sha256":"3d19ca910f904f5cb45c7c4b9b1c74d8f9559876fea3964b1034b15d0c47bf33"},"schema_version":"1.0","source":{"id":"1906.04572","kind":"arxiv","version":1}},"canonical_sha256":"0de622be91d40dd7d832c6b66a35e8761a926963039b3024df1acb07dc19da71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0de622be91d40dd7d832c6b66a35e8761a926963039b3024df1acb07dc19da71","first_computed_at":"2026-05-17T23:43:38.878281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:38.878281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Q/QvYBKpCGMJQJA1w5F/pgr+XZzI4I0knO8kMOLMQBGOnV/37QJ/9hc9h2XRczDI0HvzGO1s6ltL2CYiCRCBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:38.878832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bd98d0e385a37ce3fa75f47f705ca8e0f137a3280bf9a6d3e0abf93235f04f7","sha256:3bbd52dcbdc56cd594477109eaf620eb08b14e408da7a3f13fb55fd9ec0397d2"],"state_sha256":"a5e81a12c563054a58e2eabcd9e73b5cca97e86fac703f3fd273e17363391afe"}