{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I7IU5O7RVICSFSAAOFRTLE4QH5","short_pith_number":"pith:I7IU5O7R","schema_version":"1.0","canonical_sha256":"47d14ebbf1aa0522c80071633593903f6c48ec0d13a905888fafebca56bd6b1e","source":{"kind":"arxiv","id":"1310.1502","version":3},"attestation_state":"computed","paper":{"title":"Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.NA","authors_text":"Ilse C. F. Ipsen, John T. Holodnak","submitted_at":"2013-10-05T18:09:50Z","abstract_excerpt":"Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c >= rank(A) columns depend on the right singular vector matrix of A. For a Monte-Carlo matrix multiplication algorithm by Drineas et al. that samples outer products, we present probabilistic bounds for the 2-norm relative error due to randomization. The bounds depend on the stable rank or the rank of A, but not on the matrix dimensions. Numerical experiments "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1310.1502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-05T18:09:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dce0c66c750e23e4194e0066d597839dc7a218f6048d626ea33ba4bb22107e66","abstract_canon_sha256":"3e96e377b3f8895e5c2a3e4cd748add174a4e95ec9fcce13676b484b04047613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:49.580087Z","signature_b64":"BXzHr7sVQHvEAhE/CB2OYHz/OwkV8CvK3KxEu3t2TXpjJIaX6GhsMSEOa9r1MUESSk5dhx4SmgMxOBJexnjcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47d14ebbf1aa0522c80071633593903f6c48ec0d13a905888fafebca56bd6b1e","last_reissued_at":"2026-05-18T02:51:49.579604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:49.579604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.NA","authors_text":"Ilse C. F. Ipsen, John T. Holodnak","submitted_at":"2013-10-05T18:09:50Z","abstract_excerpt":"Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c >= rank(A) columns depend on the right singular vector matrix of A. For a Monte-Carlo matrix multiplication algorithm by Drineas et al. that samples outer products, we present probabilistic bounds for the 2-norm relative error due to randomization. The bounds depend on the stable rank or the rank of A, but not on the matrix dimensions. Numerical experiments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1502","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.1502","created_at":"2026-05-18T02:51:49.579675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1502v3","created_at":"2026-05-18T02:51:49.579675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1502","created_at":"2026-05-18T02:51:49.579675+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7IU5O7RVICS","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7IU5O7RVICSFSAA","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7IU5O7R","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5","json":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5.json","graph_json":"https://pith.science/api/pith-number/I7IU5O7RVICSFSAAOFRTLE4QH5/graph.json","events_json":"https://pith.science/api/pith-number/I7IU5O7RVICSFSAAOFRTLE4QH5/events.json","paper":"https://pith.science/paper/I7IU5O7R"},"agent_actions":{"view_html":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5","download_json":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5.json","view_paper":"https://pith.science/paper/I7IU5O7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1502&json=true","fetch_graph":"https://pith.science/api/pith-number/I7IU5O7RVICSFSAAOFRTLE4QH5/graph.json","fetch_events":"https://pith.science/api/pith-number/I7IU5O7RVICSFSAAOFRTLE4QH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5/action/storage_attestation","attest_author":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5/action/author_attestation","sign_citation":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5/action/citation_signature","submit_replication":"https://pith.science/pith/I7IU5O7RVICSFSAAOFRTLE4QH5/action/replication_record"}},"created_at":"2026-05-18T02:51:49.579675+00:00","updated_at":"2026-05-18T02:51:49.579675+00:00"}