{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2QXR5FUWO4BENBR4FE7Q2ZIDUJ","short_pith_number":"pith:2QXR5FUW","schema_version":"1.0","canonical_sha256":"d42f1e9696770246863c293f0d6503a25a1cba33cd0e963545f3f30278b34b12","source":{"kind":"arxiv","id":"1008.1498","version":1},"attestation_state":"computed","paper":{"title":"Matrix sparsification and the sparse null space problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CC","authors_text":"Lee-Ad Gottlieb, Tyler Neylon","submitted_at":"2010-08-09T13:14:58Z","abstract_excerpt":"We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems."},"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":"1008.1498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-09T13:14:58Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"112e90a71ee29687869a369161d195eb56dba263926dfd09a147e724de5c1679","abstract_canon_sha256":"57fc790746f0a15931728417453ae3542233ac3fbdd9978c8c9172c77280b2d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:24.108434Z","signature_b64":"DsVXTluDf6AIeyxZMxcWUOkGjh+Ujlv++7WmLipnX0p7Q0fBysRqHtVPTFU3iIaRQqaqylKFoKegy4+Ovr9oDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42f1e9696770246863c293f0d6503a25a1cba33cd0e963545f3f30278b34b12","last_reissued_at":"2026-05-18T04:42:24.108068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:24.108068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix sparsification and the sparse null space problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CC","authors_text":"Lee-Ad Gottlieb, Tyler Neylon","submitted_at":"2010-08-09T13:14:58Z","abstract_excerpt":"We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1498","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":"1008.1498","created_at":"2026-05-18T04:42:24.108116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1498v1","created_at":"2026-05-18T04:42:24.108116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1498","created_at":"2026-05-18T04:42:24.108116+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QXR5FUWO4BE","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QXR5FUWO4BENBR4","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QXR5FUW","created_at":"2026-05-18T12:26:03.138858+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/2QXR5FUWO4BENBR4FE7Q2ZIDUJ","json":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ.json","graph_json":"https://pith.science/api/pith-number/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/graph.json","events_json":"https://pith.science/api/pith-number/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/events.json","paper":"https://pith.science/paper/2QXR5FUW"},"agent_actions":{"view_html":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ","download_json":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ.json","view_paper":"https://pith.science/paper/2QXR5FUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1498&json=true","fetch_graph":"https://pith.science/api/pith-number/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/action/storage_attestation","attest_author":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/action/author_attestation","sign_citation":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/action/citation_signature","submit_replication":"https://pith.science/pith/2QXR5FUWO4BENBR4FE7Q2ZIDUJ/action/replication_record"}},"created_at":"2026-05-18T04:42:24.108116+00:00","updated_at":"2026-05-18T04:42:24.108116+00:00"}