{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:STTV244K76LCX4GCMKXZTDKQEC","short_pith_number":"pith:STTV244K","schema_version":"1.0","canonical_sha256":"94e75d738aff962bf0c262af998d5020b8538f1fc0c7a3b53df65e2be06ccea9","source":{"kind":"arxiv","id":"2405.04330","version":2},"attestation_state":"computed","paper":{"title":"How to reveal the rank of a matrix?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Townsend, Anil Damle, Annan Yu, Silke Glas","submitted_at":"2024-05-07T13:58:57Z","abstract_excerpt":"We study algorithms called rank-revealers that reveal a matrix's rank structure. Such algorithms form a fundamental component in matrix compression, singular value estimation, and column subset selection problems. While column-pivoted QR has been widely adopted due to its practicality, it is not always a rank-revealer. Conversely, Gaussian elimination (GE) with a pivoting strategy known as global maximum volume pivoting is guaranteed to estimate a matrix's singular values but its exponential complexity limits its interest to theory. We show that the concept of local maximum volume pivoting is "},"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":"2405.04330","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-05-07T13:58:57Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"db0e749f3937c669cfcca0302f4a88d3017039aacfc231d7b0af525a4cad3520","abstract_canon_sha256":"1c93892fc69f1c622d2656961c53294090ba4175c264069565361b2cb2aec964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:24.393551Z","signature_b64":"z1rONFA2LZU/q4VI2lhvBtTUXRyDD9Ma3eWpMhJwuyJooKwFGP1yAt+lNhzj0iUZI9XgyAhaEZSCAxD4ABrNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94e75d738aff962bf0c262af998d5020b8538f1fc0c7a3b53df65e2be06ccea9","last_reissued_at":"2026-07-05T08:26:24.393066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:24.393066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to reveal the rank of a matrix?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Townsend, Anil Damle, Annan Yu, Silke Glas","submitted_at":"2024-05-07T13:58:57Z","abstract_excerpt":"We study algorithms called rank-revealers that reveal a matrix's rank structure. Such algorithms form a fundamental component in matrix compression, singular value estimation, and column subset selection problems. While column-pivoted QR has been widely adopted due to its practicality, it is not always a rank-revealer. Conversely, Gaussian elimination (GE) with a pivoting strategy known as global maximum volume pivoting is guaranteed to estimate a matrix's singular values but its exponential complexity limits its interest to theory. We show that the concept of local maximum volume pivoting is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04330","kind":"arxiv","version":2},"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/2405.04330/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.04330","created_at":"2026-07-05T08:26:24.393152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.04330v2","created_at":"2026-07-05T08:26:24.393152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04330","created_at":"2026-07-05T08:26:24.393152+00:00"},{"alias_kind":"pith_short_12","alias_value":"STTV244K76LC","created_at":"2026-07-05T08:26:24.393152+00:00"},{"alias_kind":"pith_short_16","alias_value":"STTV244K76LCX4GC","created_at":"2026-07-05T08:26:24.393152+00:00"},{"alias_kind":"pith_short_8","alias_value":"STTV244K","created_at":"2026-07-05T08:26:24.393152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01574","citing_title":"Maximum volume coordinates for Grassmann interpolation: Lagrange, Hermite, and errors","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC","json":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC.json","graph_json":"https://pith.science/api/pith-number/STTV244K76LCX4GCMKXZTDKQEC/graph.json","events_json":"https://pith.science/api/pith-number/STTV244K76LCX4GCMKXZTDKQEC/events.json","paper":"https://pith.science/paper/STTV244K"},"agent_actions":{"view_html":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC","download_json":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC.json","view_paper":"https://pith.science/paper/STTV244K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.04330&json=true","fetch_graph":"https://pith.science/api/pith-number/STTV244K76LCX4GCMKXZTDKQEC/graph.json","fetch_events":"https://pith.science/api/pith-number/STTV244K76LCX4GCMKXZTDKQEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC/action/storage_attestation","attest_author":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC/action/author_attestation","sign_citation":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC/action/citation_signature","submit_replication":"https://pith.science/pith/STTV244K76LCX4GCMKXZTDKQEC/action/replication_record"}},"created_at":"2026-07-05T08:26:24.393152+00:00","updated_at":"2026-07-05T08:26:24.393152+00:00"}