{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ANCLB4FQZDGAR634GQ5A4FOOKG","short_pith_number":"pith:ANCLB4FQ","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"},"canonical_sha256":"0344b0f0b0c8cc08fb7c343a0e15ce518e1ae8293a6659c699ea3fdc34321ca7","source":{"kind":"arxiv","id":"1810.08171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08171","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08171v1","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08171","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"ANCLB4FQZDGA","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ANCLB4FQZDGAR634","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ANCLB4FQ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ANCLB4FQZDGAR634GQ5A4FOOKG","target":"record","payload":{"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"},"canonical_sha256":"0344b0f0b0c8cc08fb7c343a0e15ce518e1ae8293a6659c699ea3fdc34321ca7","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"},"source_kind":"arxiv","source_id":"1810.08171","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-05-18T00:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ps0goGcCVw+GARKawKEfLtkMHQwQ8DrBDXlhgaPGmKpnWtAeOTqBMYCDsm+VeSb7x5Meb+ce0UaJTe2yWG80AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:33:07.783170Z"},"content_sha256":"d757c49c2c6efdf225fdc67c2bf16de29687f56a0ba49f9fe880d018a726aa1b","schema_version":"1.0","event_id":"sha256:d757c49c2c6efdf225fdc67c2bf16de29687f56a0ba49f9fe880d018a726aa1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ANCLB4FQZDGAR634GQ5A4FOOKG","target":"graph","payload":{"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"},"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-05-18T00:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SO5IhGw+ot4cIIu80yTHsAN84seD5wbYis+01REvPC2HgHqZgTGlUgr5F3Z7iy7HTLMfhuKK/tHQCB6l23dPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:33:07.783545Z"},"content_sha256":"c828add8c97329f51ad0ee2ae53eebf28a193eec26aa0bb9c671a0d8dcaf63bf","schema_version":"1.0","event_id":"sha256:c828add8c97329f51ad0ee2ae53eebf28a193eec26aa0bb9c671a0d8dcaf63bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/bundle.json","state_url":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/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-06-04T20:33:07Z","links":{"resolver":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG","bundle":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/bundle.json","state":"https://pith.science/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANCLB4FQZDGAR634GQ5A4FOOKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ANCLB4FQZDGAR634GQ5A4FOOKG","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":"5b2e02446eeac215ec372af00657972e05aa09fbdad4cad9ca03caeea529f053","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T17:24:52Z","title_canon_sha256":"c535a600eb220eac1264bc7efa94a3a66574667751e920ec4d2180a705dc3c71"},"schema_version":"1.0","source":{"id":"1810.08171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08171","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08171v1","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08171","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"ANCLB4FQZDGA","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ANCLB4FQZDGAR634","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ANCLB4FQ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:c828add8c97329f51ad0ee2ae53eebf28a193eec26aa0bb9c671a0d8dcaf63bf","target":"graph","created_at":"2026-05-18T00:02: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"},"paper":{"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","authors_text":"David P. Woodruff, Hongyang Zhang, Maria-Florina Balcan, Yi Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T17:24:52Z","title":"Testing Matrix Rank, Optimally"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08171","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:d757c49c2c6efdf225fdc67c2bf16de29687f56a0ba49f9fe880d018a726aa1b","target":"record","created_at":"2026-05-18T00:02: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":"5b2e02446eeac215ec372af00657972e05aa09fbdad4cad9ca03caeea529f053","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T17:24:52Z","title_canon_sha256":"c535a600eb220eac1264bc7efa94a3a66574667751e920ec4d2180a705dc3c71"},"schema_version":"1.0","source":{"id":"1810.08171","kind":"arxiv","version":1}},"canonical_sha256":"0344b0f0b0c8cc08fb7c343a0e15ce518e1ae8293a6659c699ea3fdc34321ca7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0344b0f0b0c8cc08fb7c343a0e15ce518e1ae8293a6659c699ea3fdc34321ca7","first_computed_at":"2026-05-18T00:02:50.389484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:50.389484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBEKwuy/mp0EbmYoYHUhW6h7P1Tle/8fsm7PUBM6wuXxM4IAgpk18LOFAqbwjPC7QWFjxgyM0zaDc7LDNdHrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:50.389993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d757c49c2c6efdf225fdc67c2bf16de29687f56a0ba49f9fe880d018a726aa1b","sha256:c828add8c97329f51ad0ee2ae53eebf28a193eec26aa0bb9c671a0d8dcaf63bf"],"state_sha256":"df521323b3095305e932d1e4d8ffe13e0848840aa553181f4c10468d6a3686b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyugP+9Ig2RV/U/Ogv2UDKd4rmpI4Kev4picGqeC0ZQxe1AWwlqianqkK89z1LHCZoSpCldlh9F5q6EM/91EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:33:07.785890Z","bundle_sha256":"bf264cbab4e3eb137824ceae224cb0136c1d0189b6e376add2751ac2746424db"}}