{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FUVSA7XTGYYYXFC27ZXN6SVFC2","short_pith_number":"pith:FUVSA7XT","schema_version":"1.0","canonical_sha256":"2d2b207ef336318b945afe6edf4aa516b6244c45360498389e628e479942e30e","source":{"kind":"arxiv","id":"1304.7049","version":1},"attestation_state":"computed","paper":{"title":"Subspace-preserving sparsification of matrices with minimal perturbation to the near null-space. Part I: Basics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"math.NA","authors_text":"Chetan Jhurani","submitted_at":"2013-04-26T01:43:09Z","abstract_excerpt":"This is the first of two papers to describe a matrix sparsification algorithm that takes a general real or complex matrix as input and produces a sparse output matrix of the same size. The non-zero entries in the output are chosen to minimize changes to the singular values and singular vectors corresponding to the near null-space of the input. The output matrix is constrained to preserve left and right null-spaces exactly. The sparsity pattern of the output matrix is automatically determined or can be given as input.\n  If the input matrix belongs to a common matrix subspace, we prove that the "},"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":"1304.7049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-26T01:43:09Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"f0cb2ecdcbebb7c9e752c25bfafbbabd32f996e8ab5bc4a41c3f83935ef84016","abstract_canon_sha256":"32f9040f3f048c4dd6c0e7c09acdf90ae7d014df5c75378de5ab2fecf35d7b02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.721134Z","signature_b64":"OVFhZGTuz4AiXXaG19cnWrcS1xCqz4dD6uCbuBpQGV+aZOHGwuBgnaLVuZn4IpbhSeGuRcuRorkuWJ0g27vtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d2b207ef336318b945afe6edf4aa516b6244c45360498389e628e479942e30e","last_reissued_at":"2026-05-18T03:27:02.720568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.720568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace-preserving sparsification of matrices with minimal perturbation to the near null-space. Part I: Basics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"math.NA","authors_text":"Chetan Jhurani","submitted_at":"2013-04-26T01:43:09Z","abstract_excerpt":"This is the first of two papers to describe a matrix sparsification algorithm that takes a general real or complex matrix as input and produces a sparse output matrix of the same size. The non-zero entries in the output are chosen to minimize changes to the singular values and singular vectors corresponding to the near null-space of the input. The output matrix is constrained to preserve left and right null-spaces exactly. The sparsity pattern of the output matrix is automatically determined or can be given as input.\n  If the input matrix belongs to a common matrix subspace, we prove that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7049","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":"1304.7049","created_at":"2026-05-18T03:27:02.720655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7049v1","created_at":"2026-05-18T03:27:02.720655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7049","created_at":"2026-05-18T03:27:02.720655+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUVSA7XTGYYY","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUVSA7XTGYYYXFC2","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUVSA7XT","created_at":"2026-05-18T12:27:45.050594+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/FUVSA7XTGYYYXFC27ZXN6SVFC2","json":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2.json","graph_json":"https://pith.science/api/pith-number/FUVSA7XTGYYYXFC27ZXN6SVFC2/graph.json","events_json":"https://pith.science/api/pith-number/FUVSA7XTGYYYXFC27ZXN6SVFC2/events.json","paper":"https://pith.science/paper/FUVSA7XT"},"agent_actions":{"view_html":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2","download_json":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2.json","view_paper":"https://pith.science/paper/FUVSA7XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7049&json=true","fetch_graph":"https://pith.science/api/pith-number/FUVSA7XTGYYYXFC27ZXN6SVFC2/graph.json","fetch_events":"https://pith.science/api/pith-number/FUVSA7XTGYYYXFC27ZXN6SVFC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2/action/storage_attestation","attest_author":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2/action/author_attestation","sign_citation":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2/action/citation_signature","submit_replication":"https://pith.science/pith/FUVSA7XTGYYYXFC27ZXN6SVFC2/action/replication_record"}},"created_at":"2026-05-18T03:27:02.720655+00:00","updated_at":"2026-05-18T03:27:02.720655+00:00"}