{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DISO6THMEBTHMBBPHIXHJFYSFP","short_pith_number":"pith:DISO6THM","schema_version":"1.0","canonical_sha256":"1a24ef4cec206676042f3a2e7497122bc5c771242a91b95559f267815115406f","source":{"kind":"arxiv","id":"1102.5689","version":3},"attestation_state":"computed","paper":{"title":"Matrix probing and its conditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.PR","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Jiawei Chiu, Laurent Demanet","submitted_at":"2011-02-28T15:29:16Z","abstract_excerpt":"When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can be used to recover an approximation to A^-1. A basic question is whether this linear system is invertible and well-conditioned. In this paper, we show that if the Gram matrix of the B_j's is sufficiently well-conditioned and each B_j has a high numerical rank, then n {proportional} p log^2 n will ensure that the linear system is well-conditioned with high pro"},"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":"1102.5689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-02-28T15:29:16Z","cross_cats_sorted":["cs.NA","math.PR","math.ST","stat.TH"],"title_canon_sha256":"738e7e94aaa9c068e059737e3b3ca73dac6281cf5ad51d22184130aa42303ee8","abstract_canon_sha256":"e5747f2c0860c90b43a7d70e916f13286a1aa2df8551fe025e6723d87ac168fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:47.062167Z","signature_b64":"SY1qL/0ptxDb/BiU8NnNixExsCsXM0quilWgnuPIi1JqRYYFy2QRKixwNlLVrf+k1gTHiAQBGyt3p4v+7Gy6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a24ef4cec206676042f3a2e7497122bc5c771242a91b95559f267815115406f","last_reissued_at":"2026-05-18T04:10:47.061565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:47.061565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix probing and its conditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.PR","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Jiawei Chiu, Laurent Demanet","submitted_at":"2011-02-28T15:29:16Z","abstract_excerpt":"When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can be used to recover an approximation to A^-1. A basic question is whether this linear system is invertible and well-conditioned. In this paper, we show that if the Gram matrix of the B_j's is sufficiently well-conditioned and each B_j has a high numerical rank, then n {proportional} p log^2 n will ensure that the linear system is well-conditioned with high pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5689","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":"1102.5689","created_at":"2026-05-18T04:10:47.061650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5689v3","created_at":"2026-05-18T04:10:47.061650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5689","created_at":"2026-05-18T04:10:47.061650+00:00"},{"alias_kind":"pith_short_12","alias_value":"DISO6THMEBTH","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DISO6THMEBTHMBBP","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DISO6THM","created_at":"2026-05-18T12:26:26.731475+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/DISO6THMEBTHMBBPHIXHJFYSFP","json":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP.json","graph_json":"https://pith.science/api/pith-number/DISO6THMEBTHMBBPHIXHJFYSFP/graph.json","events_json":"https://pith.science/api/pith-number/DISO6THMEBTHMBBPHIXHJFYSFP/events.json","paper":"https://pith.science/paper/DISO6THM"},"agent_actions":{"view_html":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP","download_json":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP.json","view_paper":"https://pith.science/paper/DISO6THM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5689&json=true","fetch_graph":"https://pith.science/api/pith-number/DISO6THMEBTHMBBPHIXHJFYSFP/graph.json","fetch_events":"https://pith.science/api/pith-number/DISO6THMEBTHMBBPHIXHJFYSFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP/action/storage_attestation","attest_author":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP/action/author_attestation","sign_citation":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP/action/citation_signature","submit_replication":"https://pith.science/pith/DISO6THMEBTHMBBPHIXHJFYSFP/action/replication_record"}},"created_at":"2026-05-18T04:10:47.061650+00:00","updated_at":"2026-05-18T04:10:47.061650+00:00"}