{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:62W46VOCQUM7MQE2CQTDZLXQZH","short_pith_number":"pith:62W46VOC","canonical_record":{"source":{"id":"1906.04112","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-06-10T16:39:12Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"161b2308f0e66dc5f4f008ed797cfaa71e8d16de1f05e8cc96314971051ac901","abstract_canon_sha256":"23b4c408ca008d2caa24e7d12d0f5906953123bdada248b2931cf61ed1a33f58"},"schema_version":"1.0"},"canonical_sha256":"f6adcf55c28519f6409a14263caef0c9f208f17cfbef40a4db1ed8a46013e43c","source":{"kind":"arxiv","id":"1906.04112","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04112","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04112v6","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04112","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"pith_short_12","alias_value":"62W46VOCQUM7","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"pith_short_16","alias_value":"62W46VOCQUM7MQE2","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"pith_short_8","alias_value":"62W46VOC","created_at":"2026-07-05T11:34:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:62W46VOCQUM7MQE2CQTDZLXQZH","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04112","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-06-10T16:39:12Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"161b2308f0e66dc5f4f008ed797cfaa71e8d16de1f05e8cc96314971051ac901","abstract_canon_sha256":"23b4c408ca008d2caa24e7d12d0f5906953123bdada248b2931cf61ed1a33f58"},"schema_version":"1.0"},"canonical_sha256":"f6adcf55c28519f6409a14263caef0c9f208f17cfbef40a4db1ed8a46013e43c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:38.558513Z","signature_b64":"6SRPbSjpvSxLvdJ75xJVtMuNAPNkYn4HiWoQROZ0tJVpFkVsm9mwT0bKGjYYrFEPs18NdOVcVsCWX3HdnIIHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6adcf55c28519f6409a14263caef0c9f208f17cfbef40a4db1ed8a46013e43c","last_reissued_at":"2026-07-05T11:34:38.557999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:38.557999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04112","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-07-05T11:34:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVQ25uqx2NQjXRHZ9hkFyh9ybTNohNdFALtIaxOpPpbC5I2F/fxfj7GZb6P9UYjmYx/lcP+Tog/SsiqPBsUECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:39:33.963801Z"},"content_sha256":"7d57507fee4e8d661d42f66e49a3b96c1ec7c3e85a49ed5f0edf0183abd2ad66","schema_version":"1.0","event_id":"sha256:7d57507fee4e8d661d42f66e49a3b96c1ec7c3e85a49ed5f0edf0183abd2ad66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:62W46VOCQUM7MQE2CQTDZLXQZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CUR Low Rank Approximation of a Matrix at Sublinear Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"John Svadlenka, Liang Zhao, Qi Luan, Soo Go, Victor Y. Pan","submitted_at":"2019-06-10T16:39:12Z","abstract_excerpt":"Low rank approximation of a matrix (hereafter LRA) is a highly important area of Numerical Linear and Multilinear Algebra and Data Mining and Analysis. One can operate with an LRA at sublinear cost -- by using much fewer memory cells and flops than an input matrix M has entries. For worst case inputs one cannot compute even a reasonably close LRA at sublinear cost, but in computational practice accurate LRAs, even in their memory efficient form of CUR LRAs, are routinely obtained at sublinear cost for large and important classes of matrices, in particular by means of Cross-Approximation iterat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04112","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.04112/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:34:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wry2jjTa5/e+iYFIF8vEf0EP+UOHlZ1+kVIBtwgf0NKzj9tSU3yBGy5Yd3XbZqVgTWCBfGDbPNADIwuYUmJNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:39:33.964320Z"},"content_sha256":"90b4b5f00e8dc488c0e68582e8ddb59b81c6556aed091c6ee059177e1f01e082","schema_version":"1.0","event_id":"sha256:90b4b5f00e8dc488c0e68582e8ddb59b81c6556aed091c6ee059177e1f01e082"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62W46VOCQUM7MQE2CQTDZLXQZH/bundle.json","state_url":"https://pith.science/pith/62W46VOCQUM7MQE2CQTDZLXQZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62W46VOCQUM7MQE2CQTDZLXQZH/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-08-17T04:39:33Z","links":{"resolver":"https://pith.science/pith/62W46VOCQUM7MQE2CQTDZLXQZH","bundle":"https://pith.science/pith/62W46VOCQUM7MQE2CQTDZLXQZH/bundle.json","state":"https://pith.science/pith/62W46VOCQUM7MQE2CQTDZLXQZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62W46VOCQUM7MQE2CQTDZLXQZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:62W46VOCQUM7MQE2CQTDZLXQZH","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":"23b4c408ca008d2caa24e7d12d0f5906953123bdada248b2931cf61ed1a33f58","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-06-10T16:39:12Z","title_canon_sha256":"161b2308f0e66dc5f4f008ed797cfaa71e8d16de1f05e8cc96314971051ac901"},"schema_version":"1.0","source":{"id":"1906.04112","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04112","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04112v6","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04112","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"pith_short_12","alias_value":"62W46VOCQUM7","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"pith_short_16","alias_value":"62W46VOCQUM7MQE2","created_at":"2026-07-05T11:34:38Z"},{"alias_kind":"pith_short_8","alias_value":"62W46VOC","created_at":"2026-07-05T11:34:38Z"}],"graph_snapshots":[{"event_id":"sha256:90b4b5f00e8dc488c0e68582e8ddb59b81c6556aed091c6ee059177e1f01e082","target":"graph","created_at":"2026-07-05T11:34: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1906.04112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low rank approximation of a matrix (hereafter LRA) is a highly important area of Numerical Linear and Multilinear Algebra and Data Mining and Analysis. One can operate with an LRA at sublinear cost -- by using much fewer memory cells and flops than an input matrix M has entries. For worst case inputs one cannot compute even a reasonably close LRA at sublinear cost, but in computational practice accurate LRAs, even in their memory efficient form of CUR LRAs, are routinely obtained at sublinear cost for large and important classes of matrices, in particular by means of Cross-Approximation iterat","authors_text":"John Svadlenka, Liang Zhao, Qi Luan, Soo Go, Victor Y. Pan","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-06-10T16:39:12Z","title":"CUR Low Rank Approximation of a Matrix at Sublinear Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04112","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:7d57507fee4e8d661d42f66e49a3b96c1ec7c3e85a49ed5f0edf0183abd2ad66","target":"record","created_at":"2026-07-05T11:34: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":"23b4c408ca008d2caa24e7d12d0f5906953123bdada248b2931cf61ed1a33f58","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-06-10T16:39:12Z","title_canon_sha256":"161b2308f0e66dc5f4f008ed797cfaa71e8d16de1f05e8cc96314971051ac901"},"schema_version":"1.0","source":{"id":"1906.04112","kind":"arxiv","version":6}},"canonical_sha256":"f6adcf55c28519f6409a14263caef0c9f208f17cfbef40a4db1ed8a46013e43c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6adcf55c28519f6409a14263caef0c9f208f17cfbef40a4db1ed8a46013e43c","first_computed_at":"2026-07-05T11:34:38.557999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:38.557999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6SRPbSjpvSxLvdJ75xJVtMuNAPNkYn4HiWoQROZ0tJVpFkVsm9mwT0bKGjYYrFEPs18NdOVcVsCWX3HdnIIHBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:38.558513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04112","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d57507fee4e8d661d42f66e49a3b96c1ec7c3e85a49ed5f0edf0183abd2ad66","sha256:90b4b5f00e8dc488c0e68582e8ddb59b81c6556aed091c6ee059177e1f01e082"],"state_sha256":"1195358ff9c0ce896c69fd105dfc7be075dc0235371448a271048ec398ab3a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6y/ZDrVD3VVh/2l8qbTkNCTUiUFC7l9eY1BYQHpULkfW4t9HOSXqULPBFIWoF7242K1145reP+RmxgxMw47DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T04:39:33.969522Z","bundle_sha256":"a7b9f19cd2c8546a9ff8622588359854f797bd4a78abcd62d92aa4fbb33e1cee"}}