{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:276EBQTFT3XACF46ELXOJDHCMD","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":"09e4dee1ffaac56b114908af213acbb486c06d43591d63d745cb7b0b085e676d","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-17T06:56:57Z","title_canon_sha256":"caecd54391e1ecbcb1f880d00ce5c6032608e913858d4db1ef0868e154f646f6"},"schema_version":"1.0","source":{"id":"2310.11028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11028","created_at":"2026-07-05T07:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11028v1","created_at":"2026-07-05T07:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11028","created_at":"2026-07-05T07:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"276EBQTFT3XA","created_at":"2026-07-05T07:01:49Z"},{"alias_kind":"pith_short_16","alias_value":"276EBQTFT3XACF46","created_at":"2026-07-05T07:01:49Z"},{"alias_kind":"pith_short_8","alias_value":"276EBQTF","created_at":"2026-07-05T07:01:49Z"}],"graph_snapshots":[{"event_id":"sha256:587418b7f2a48b45c68d7cfb99801b76f40b79608f100050f60a44cbc5e637f5","target":"graph","created_at":"2026-07-05T07:01:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.11028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Matrices are exceptionally useful in various fields of study as they provide a convenient framework to organize and manipulate data in a structured manner. However, modern matrices can involve billions of elements, making their storage and processing quite demanding in terms of computational resources and memory usage. Although prohibitively large, such matrices are often approximately low rank. We propose an algorithm that exploits this structure to obtain a low rank decomposition of any matrix $\\mathbf{A}$ as $\\mathbf{A} \\approx \\mathbf{L}\\mathbf{R}$, where $\\mathbf{L}$ and $\\mathbf{R}$ are ","authors_text":"Mert Pilanci, Rajarshi Saha, Varun Srivastava","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-17T06:56:57Z","title":"Matrix Compression via Randomized Low Rank and Low Precision Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11028","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:5b1fb1f5deb0ce04a6503569706735aec0facd55828ffc699d2524aab917c528","target":"record","created_at":"2026-07-05T07:01:49Z","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":"09e4dee1ffaac56b114908af213acbb486c06d43591d63d745cb7b0b085e676d","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-17T06:56:57Z","title_canon_sha256":"caecd54391e1ecbcb1f880d00ce5c6032608e913858d4db1ef0868e154f646f6"},"schema_version":"1.0","source":{"id":"2310.11028","kind":"arxiv","version":1}},"canonical_sha256":"d7fc40c2659eee01179e22eee48ce260cee95f86e99d4f2119dfddb5fe6776d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7fc40c2659eee01179e22eee48ce260cee95f86e99d4f2119dfddb5fe6776d6","first_computed_at":"2026-07-05T07:01:49.477579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:01:49.477579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXw4Qj7C8CfslyhVwMQboao4/LqPyumXflp8lG0P8rM/xLTtN717LYy3kanJus9fkk0huUIke4h32EbcBe0gBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:01:49.478037Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.11028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b1fb1f5deb0ce04a6503569706735aec0facd55828ffc699d2524aab917c528","sha256:587418b7f2a48b45c68d7cfb99801b76f40b79608f100050f60a44cbc5e637f5"],"state_sha256":"589490d37904e0e09232ae008aa857767ec3d3b4440706558c24045fb91795c9"}