{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MFFDQ5J3GJMJYGCO2HJSPX3JTH","short_pith_number":"pith:MFFDQ5J3","canonical_record":{"source":{"id":"1710.07946","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-10-22T14:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"d43f7ddb28f435906ffab22cf9b261317c422e3f32ead1f56c3ddc322852c484","abstract_canon_sha256":"ce6079355807f7afca555e2961fc787b3c16045ea45fe1d1af74448769f05afc"},"schema_version":"1.0"},"canonical_sha256":"614a38753b32589c184ed1d327df6999da18912de33d9993bfe6652f27b7f429","source":{"kind":"arxiv","id":"1710.07946","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07946","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07946v6","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07946","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"MFFDQ5J3GJMJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MFFDQ5J3GJMJYGCO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MFFDQ5J3","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MFFDQ5J3GJMJYGCO2HJSPX3JTH","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07946","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-10-22T14:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"d43f7ddb28f435906ffab22cf9b261317c422e3f32ead1f56c3ddc322852c484","abstract_canon_sha256":"ce6079355807f7afca555e2961fc787b3c16045ea45fe1d1af74448769f05afc"},"schema_version":"1.0"},"canonical_sha256":"614a38753b32589c184ed1d327df6999da18912de33d9993bfe6652f27b7f429","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:06.638660Z","signature_b64":"tQkOGgJVaSiqqhTOhbuKyhXX8bvKFutyQ/JHbKqNC59EyFUuF7cjZ4xTzgdObmqBPOfi8bMHYp8ljai9CztkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614a38753b32589c184ed1d327df6999da18912de33d9993bfe6652f27b7f429","last_reissued_at":"2026-05-18T00:14:06.637994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:06.637994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07946","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0qUIBg2S9eC0cwK2uMhMb+Is4VJed2SV5sSvFJgjpzA5XyrXrkO22+iE9X5BWgokwbQhIagzoudsoHFSv5ZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:37:24.580215Z"},"content_sha256":"21ef47d872cfcffda3ced7512d1d31dd479b7a4ce62c1bbb6c41f9deed8f495d","schema_version":"1.0","event_id":"sha256:21ef47d872cfcffda3ced7512d1d31dd479b7a4ce62c1bbb6c41f9deed8f495d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MFFDQ5J3GJMJYGCO2HJSPX3JTH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superfast CUR Matrix Algorithms, Their Pre-Processing and Extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"John Svadlenka, Liang Zhao, Qi Luan, Victor Y. Pan","submitted_at":"2017-10-22T14:11:33Z","abstract_excerpt":"We study superfast algorithms that computes low rank approximation of a matrix (hereafter referred to as LRA) that use much fewer memory cells and arithmetic operations than the input matrix has entries. We first specify a family of 2mn matrices of size m*n such that for almost 50% of them any superfast LRA algorithm fails to improve the poor trivial approximation by the matrix filled with zeros, but then we prove that the class of all such hard inputs is narrow - the cross-approximation (hereafter {C-A}) superfast iterations as well as some more primitive superfast algorithms compute reasonab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07946","kind":"arxiv","version":6},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbF0DufgKKfjaig6kFQSy8Gh8PmxWjeXARvCs81iJvw4Q61MGvZ1CvQcuVbzj9DmiHVaeZVBF41MwxIkq+inAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:37:24.580567Z"},"content_sha256":"79645f3a943bbc323d3edea9aff6c6045ebe37b83339251a4f5fbf37285b3c27","schema_version":"1.0","event_id":"sha256:79645f3a943bbc323d3edea9aff6c6045ebe37b83339251a4f5fbf37285b3c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH/bundle.json","state_url":"https://pith.science/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T14:37:24Z","links":{"resolver":"https://pith.science/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH","bundle":"https://pith.science/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH/bundle.json","state":"https://pith.science/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFFDQ5J3GJMJYGCO2HJSPX3JTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MFFDQ5J3GJMJYGCO2HJSPX3JTH","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":"ce6079355807f7afca555e2961fc787b3c16045ea45fe1d1af74448769f05afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-10-22T14:11:33Z","title_canon_sha256":"d43f7ddb28f435906ffab22cf9b261317c422e3f32ead1f56c3ddc322852c484"},"schema_version":"1.0","source":{"id":"1710.07946","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07946","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07946v6","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07946","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"MFFDQ5J3GJMJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MFFDQ5J3GJMJYGCO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MFFDQ5J3","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:79645f3a943bbc323d3edea9aff6c6045ebe37b83339251a4f5fbf37285b3c27","target":"graph","created_at":"2026-05-18T00:14:06Z","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":"We study superfast algorithms that computes low rank approximation of a matrix (hereafter referred to as LRA) that use much fewer memory cells and arithmetic operations than the input matrix has entries. We first specify a family of 2mn matrices of size m*n such that for almost 50% of them any superfast LRA algorithm fails to improve the poor trivial approximation by the matrix filled with zeros, but then we prove that the class of all such hard inputs is narrow - the cross-approximation (hereafter {C-A}) superfast iterations as well as some more primitive superfast algorithms compute reasonab","authors_text":"John Svadlenka, Liang Zhao, Qi Luan, Victor Y. Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-10-22T14:11:33Z","title":"Superfast CUR Matrix Algorithms, Their Pre-Processing and Extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07946","kind":"arxiv","version":6},"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:21ef47d872cfcffda3ced7512d1d31dd479b7a4ce62c1bbb6c41f9deed8f495d","target":"record","created_at":"2026-05-18T00:14:06Z","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":"ce6079355807f7afca555e2961fc787b3c16045ea45fe1d1af74448769f05afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-10-22T14:11:33Z","title_canon_sha256":"d43f7ddb28f435906ffab22cf9b261317c422e3f32ead1f56c3ddc322852c484"},"schema_version":"1.0","source":{"id":"1710.07946","kind":"arxiv","version":6}},"canonical_sha256":"614a38753b32589c184ed1d327df6999da18912de33d9993bfe6652f27b7f429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"614a38753b32589c184ed1d327df6999da18912de33d9993bfe6652f27b7f429","first_computed_at":"2026-05-18T00:14:06.637994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:06.637994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQkOGgJVaSiqqhTOhbuKyhXX8bvKFutyQ/JHbKqNC59EyFUuF7cjZ4xTzgdObmqBPOfi8bMHYp8ljai9CztkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:06.638660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07946","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21ef47d872cfcffda3ced7512d1d31dd479b7a4ce62c1bbb6c41f9deed8f495d","sha256:79645f3a943bbc323d3edea9aff6c6045ebe37b83339251a4f5fbf37285b3c27"],"state_sha256":"dedbec5934fd34fc546ab29eabc1b6056016b996c268ae037113a51e28315773"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HoOPTcZrgBfYIGn1tYDv0UH47dbhRXYeu9WpGaB+B44e3+TuiEmXrAWGaQZ/V9+/wj9IoeZvEeMySh5tEMGZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:37:24.582367Z","bundle_sha256":"45870e4f58d329020655c534c20d148d3d4603f7c37003b0aa818a974ced5e6a"}}