{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:35NHARPYWHZHZZJ7AC7QA5BSRN","short_pith_number":"pith:35NHARPY","canonical_record":{"source":{"id":"2402.13975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-02-21T18:01:14Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c351a4a7c64b4be2b170dc6cc86236de91615ec30cbbf28bf3c5939df9cf5d8c","abstract_canon_sha256":"663f17bdb249c8c3f7445b2c5c47acbd5e10502cefe939a496520383e5d5b5d2"},"schema_version":"1.0"},"canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","source":{"kind":"arxiv","id":"2402.13975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.13975","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"2402.13975v1","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13975","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"35NHARPYWHZH","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"pith_short_16","alias_value":"35NHARPYWHZHZZJ7","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"pith_short_8","alias_value":"35NHARPY","created_at":"2026-07-05T07:47:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:35NHARPYWHZHZZJ7AC7QA5BSRN","target":"record","payload":{"canonical_record":{"source":{"id":"2402.13975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-02-21T18:01:14Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c351a4a7c64b4be2b170dc6cc86236de91615ec30cbbf28bf3c5939df9cf5d8c","abstract_canon_sha256":"663f17bdb249c8c3f7445b2c5c47acbd5e10502cefe939a496520383e5d5b5d2"},"schema_version":"1.0"},"canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:50.920627Z","signature_b64":"k6VZwaO+jtEx9l0oCZ2rRZFtlxKKwSmGlEZ16suv/vIr7EBj82KbJOItZDW8X/6Mjx0qicFNtvQhV4ig66FhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","last_reissued_at":"2026-07-05T07:47:50.920160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:50.920160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.13975","source_version":1,"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-05T07:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Up7HjU0T3b5Mq9NzLvu5biNWyHL/nbi0sp7CVBZy69qMNqTRcyhN8xWHbTNY5/Z2NmS8DwroHoJwRuB5RdfKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:13:39.492892Z"},"content_sha256":"eeff2751a4f247efde4bc2dc7e24a35031670ef3a15e11a34877f55521a6f329","schema_version":"1.0","event_id":"sha256:eeff2751a4f247efde4bc2dc7e24a35031670ef3a15e11a34877f55521a6f329"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:35NHARPYWHZHZZJ7AC7QA5BSRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Lexing Ying","submitted_at":"2024-02-21T18:01:14Z","abstract_excerpt":"In this work, we analyze a sublinear-time algorithm for selecting a few rows and columns of a matrix for low-rank approximation purposes. The algorithm is based on an initial uniformly random selection of rows and columns, followed by a refinement of this choice using a strong rank-revealing QR factorization. We prove bounds on the error of the corresponding low-rank approximation (more precisely, the CUR approximation error) when the matrix is a perturbation of a low-rank matrix that can be factorized into the product of matrices with suitable incoherence and/or sparsity assumptions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13975","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.13975/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-05T07:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EoZ5Jrueta2eja6M/pE3S8JBqwS1nZUBvXUV6wMrb70+WaiyaWwwhfg7KWSQPk+0IpkHyoMz3svgIXevDi17AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:13:39.497019Z"},"content_sha256":"41d6a63cd1bdece4d7b160adb6f0a2f9c294d8e4cdd6b223fde440511b8dd14e","schema_version":"1.0","event_id":"sha256:41d6a63cd1bdece4d7b160adb6f0a2f9c294d8e4cdd6b223fde440511b8dd14e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/bundle.json","state_url":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/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-13T10:13:39Z","links":{"resolver":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN","bundle":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/bundle.json","state":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:35NHARPYWHZHZZJ7AC7QA5BSRN","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":"663f17bdb249c8c3f7445b2c5c47acbd5e10502cefe939a496520383e5d5b5d2","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-02-21T18:01:14Z","title_canon_sha256":"c351a4a7c64b4be2b170dc6cc86236de91615ec30cbbf28bf3c5939df9cf5d8c"},"schema_version":"1.0","source":{"id":"2402.13975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.13975","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"2402.13975v1","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13975","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"35NHARPYWHZH","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"pith_short_16","alias_value":"35NHARPYWHZHZZJ7","created_at":"2026-07-05T07:47:50Z"},{"alias_kind":"pith_short_8","alias_value":"35NHARPY","created_at":"2026-07-05T07:47:50Z"}],"graph_snapshots":[{"event_id":"sha256:41d6a63cd1bdece4d7b160adb6f0a2f9c294d8e4cdd6b223fde440511b8dd14e","target":"graph","created_at":"2026-07-05T07:47:50Z","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/2402.13975/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we analyze a sublinear-time algorithm for selecting a few rows and columns of a matrix for low-rank approximation purposes. The algorithm is based on an initial uniformly random selection of rows and columns, followed by a refinement of this choice using a strong rank-revealing QR factorization. We prove bounds on the error of the corresponding low-rank approximation (more precisely, the CUR approximation error) when the matrix is a perturbation of a low-rank matrix that can be factorized into the product of matrices with suitable incoherence and/or sparsity assumptions.","authors_text":"Alice Cortinovis, Lexing Ying","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-02-21T18:01:14Z","title":"A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13975","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:eeff2751a4f247efde4bc2dc7e24a35031670ef3a15e11a34877f55521a6f329","target":"record","created_at":"2026-07-05T07:47:50Z","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":"663f17bdb249c8c3f7445b2c5c47acbd5e10502cefe939a496520383e5d5b5d2","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-02-21T18:01:14Z","title_canon_sha256":"c351a4a7c64b4be2b170dc6cc86236de91615ec30cbbf28bf3c5939df9cf5d8c"},"schema_version":"1.0","source":{"id":"2402.13975","kind":"arxiv","version":1}},"canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","first_computed_at":"2026-07-05T07:47:50.920160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:47:50.920160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k6VZwaO+jtEx9l0oCZ2rRZFtlxKKwSmGlEZ16suv/vIr7EBj82KbJOItZDW8X/6Mjx0qicFNtvQhV4ig66FhCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:47:50.920627Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.13975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeff2751a4f247efde4bc2dc7e24a35031670ef3a15e11a34877f55521a6f329","sha256:41d6a63cd1bdece4d7b160adb6f0a2f9c294d8e4cdd6b223fde440511b8dd14e"],"state_sha256":"3d42db1d330d9207e4559d027d80cc2e33e523d2a4cf4680017e93e59260fba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"andFHWvOr7RXnE2T3rJ/Z1ssp6b3Tr0wEcPXhmCY5QgQX/1BVe6QldMMVSb0wMLD4Vv1Fk1dqXJQ+Crvxl5cBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:13:39.504190Z","bundle_sha256":"011a06c04e1c756855a1883d58e4ce22252e9f90c169f91eb72a2244ddbe1d19"}}