{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VHHI4XA5HZH5D4JGCFEW23LHBA","short_pith_number":"pith:VHHI4XA5","schema_version":"1.0","canonical_sha256":"a9ce8e5c1d3e4fd1f12611496d6d6708231e99152ca3e27323ca267c0a6d28f9","source":{"kind":"arxiv","id":"1605.03861","version":2},"attestation_state":"computed","paper":{"title":"Approximating matrices and convex bodies through Kadison-Singer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.FA","authors_text":"Omer Friedland, Pierre Youssef","submitted_at":"2016-05-12T15:45:27Z","abstract_excerpt":"We show that any $n\\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of the extracted matrix. Our proof uses the recent solution of the Kadison-Singer problem. We also develop a sort of tensorization technique to deal with constraint approximation problems. As an application, we provide a sparsification result with equal weights and an optimal approximate John's decomposition for non-symmetric convex bodies. This enables us to sh"},"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":"1605.03861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-05-12T15:45:27Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"05ca86f45987090802e41f86a136fdd25d5b252be8d9b5ae227f37c2c9b99564","abstract_canon_sha256":"d3b9fcf5fdc86f61b4999683df2ee759d56d7391df5a34c572c11b73d16f65d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:30.933925Z","signature_b64":"8dtHM+wMFw9zaYmgVg+gEAZQZKfzAh+AMWiivDW5Uewy97jJsiLCjE/XIB/AdMdCm99yNb2c9qztmLg4gNU9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ce8e5c1d3e4fd1f12611496d6d6708231e99152ca3e27323ca267c0a6d28f9","last_reissued_at":"2026-05-18T00:10:30.933285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:30.933285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating matrices and convex bodies through Kadison-Singer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.FA","authors_text":"Omer Friedland, Pierre Youssef","submitted_at":"2016-05-12T15:45:27Z","abstract_excerpt":"We show that any $n\\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of the extracted matrix. Our proof uses the recent solution of the Kadison-Singer problem. We also develop a sort of tensorization technique to deal with constraint approximation problems. As an application, we provide a sparsification result with equal weights and an optimal approximate John's decomposition for non-symmetric convex bodies. This enables us to sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03861","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":""},"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":"1605.03861","created_at":"2026-05-18T00:10:30.933408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03861v2","created_at":"2026-05-18T00:10:30.933408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03861","created_at":"2026-05-18T00:10:30.933408+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHHI4XA5HZH5","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHHI4XA5HZH5D4JG","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHHI4XA5","created_at":"2026-05-18T12:30:48.956258+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/VHHI4XA5HZH5D4JGCFEW23LHBA","json":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA.json","graph_json":"https://pith.science/api/pith-number/VHHI4XA5HZH5D4JGCFEW23LHBA/graph.json","events_json":"https://pith.science/api/pith-number/VHHI4XA5HZH5D4JGCFEW23LHBA/events.json","paper":"https://pith.science/paper/VHHI4XA5"},"agent_actions":{"view_html":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA","download_json":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA.json","view_paper":"https://pith.science/paper/VHHI4XA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03861&json=true","fetch_graph":"https://pith.science/api/pith-number/VHHI4XA5HZH5D4JGCFEW23LHBA/graph.json","fetch_events":"https://pith.science/api/pith-number/VHHI4XA5HZH5D4JGCFEW23LHBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/action/storage_attestation","attest_author":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/action/author_attestation","sign_citation":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/action/citation_signature","submit_replication":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/action/replication_record"}},"created_at":"2026-05-18T00:10:30.933408+00:00","updated_at":"2026-05-18T00:10:30.933408+00:00"}