{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ANCLB4FQZDGAR634GQ5A4FOOKG","short_pith_number":"pith:ANCLB4FQ","schema_version":"1.0","canonical_sha256":"0344b0f0b0c8cc08fb7c343a0e15ce518e1ae8293a6659c699ea3fdc34321ca7","source":{"kind":"arxiv","id":"1810.08171","version":1},"attestation_state":"computed","paper":{"title":"Testing Matrix Rank, Optimally","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hongyang Zhang, Maria-Florina Balcan, Yi Li","submitted_at":"2018-10-18T17:24:52Z","abstract_excerpt":"We show that for the problem of testing if a matrix $A \\in F^{n \\times n}$ has rank at most $d$, or requires changing an $\\epsilon$-fraction of entries to have rank at most $d$, there is a non-adaptive query algorithm making $\\widetilde{O}(d^2/\\epsilon)$ queries. Our algorithm works for any field $F$. This improves upon the previous $O(d^2/\\epsilon^2)$ bound (SODA'03), and bypasses an $\\Omega(d^2/\\epsilon^2)$ lower bound of (KDD'14) which holds if the algorithm is required to read a submatrix. Our algorithm is the first such algorithm which does not read a submatrix, and instead reads a carefu"},"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":"1810.08171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T17:24:52Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c535a600eb220eac1264bc7efa94a3a66574667751e920ec4d2180a705dc3c71","abstract_canon_sha256":"5b2e02446eeac215ec372af00657972e05aa09fbdad4cad9ca03caeea529f053"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:50.389993Z","signature_b64":"JBEKwuy/mp0EbmYoYHUhW6h7P1Tle/8fsm7PUBM6wuXxM4IAgpk18LOFAqbwjPC7QWFjxgyM0zaDc7LDNdHrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0344b0f0b0c8cc08fb7c343a0e15ce518e1ae8293a6659c699ea3fdc34321ca7","last_reissued_at":"2026-05-18T00:02:50.389484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:50.389484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Matrix Rank, Optimally","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hongyang Zhang, Maria-Florina Balcan, Yi Li","submitted_at":"2018-10-18T17:24:52Z","abstract_excerpt":"We show that for the problem of testing if a matrix $A \\in F^{n \\times n}$ has rank at most $d$, or requires changing an $\\epsilon$-fraction of entries to have rank at most $d$, there is a non-adaptive query algorithm making $\\widetilde{O}(d^2/\\epsilon)$ queries. Our algorithm works for any field $F$. This improves upon the previous $O(d^2/\\epsilon^2)$ bound (SODA'03), and bypasses an $\\Omega(d^2/\\epsilon^2)$ lower bound of (KDD'14) which holds if the algorithm is required to read a submatrix. Our algorithm is the first such algorithm which does not read a submatrix, and instead reads a carefu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08171","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":""},"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":"1810.08171","created_at":"2026-05-18T00:02:50.389569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08171v1","created_at":"2026-05-18T00:02:50.389569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08171","created_at":"2026-05-18T00:02:50.389569+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANCLB4FQZDGA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANCLB4FQZDGAR634","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANCLB4FQ","created_at":"2026-05-18T12:32:13.499390+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/ANCLB4FQZDGAR634GQ5A4FOOKG","json":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG.json","graph_json":"https://pith.science/api/pith-number/ANCLB4FQZDGAR634GQ5A4FOOKG/graph.json","events_json":"https://pith.science/api/pith-number/ANCLB4FQZDGAR634GQ5A4FOOKG/events.json","paper":"https://pith.science/paper/ANCLB4FQ"},"agent_actions":{"view_html":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG","download_json":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG.json","view_paper":"https://pith.science/paper/ANCLB4FQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08171&json=true","fetch_graph":"https://pith.science/api/pith-number/ANCLB4FQZDGAR634GQ5A4FOOKG/graph.json","fetch_events":"https://pith.science/api/pith-number/ANCLB4FQZDGAR634GQ5A4FOOKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/action/storage_attestation","attest_author":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/action/author_attestation","sign_citation":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/action/citation_signature","submit_replication":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/action/replication_record"}},"created_at":"2026-05-18T00:02:50.389569+00:00","updated_at":"2026-05-18T00:02:50.389569+00:00"}