{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VHHI4XA5HZH5D4JGCFEW23LHBA","short_pith_number":"pith:VHHI4XA5","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"},"canonical_sha256":"a9ce8e5c1d3e4fd1f12611496d6d6708231e99152ca3e27323ca267c0a6d28f9","source":{"kind":"arxiv","id":"1605.03861","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03861","created_at":"2026-05-18T00:10:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03861v2","created_at":"2026-05-18T00:10:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03861","created_at":"2026-05-18T00:10:30Z"},{"alias_kind":"pith_short_12","alias_value":"VHHI4XA5HZH5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHHI4XA5HZH5D4JG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHHI4XA5","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VHHI4XA5HZH5D4JGCFEW23LHBA","target":"record","payload":{"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"},"canonical_sha256":"a9ce8e5c1d3e4fd1f12611496d6d6708231e99152ca3e27323ca267c0a6d28f9","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"},"source_kind":"arxiv","source_id":"1605.03861","source_version":2,"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:10:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onWAnhUnJXUZ04HMPfLdmsYyfEovKJTyajm19H/JVRQNitBjG0KqvvAwhK3eenL3Ja2Gy6ZGaU34+YZNLquPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:27:21.572744Z"},"content_sha256":"860ff4ae98a8bd147b6cdb3c92a23f544eb0e12926e4d9b6ed399d62cbaa9452","schema_version":"1.0","event_id":"sha256:860ff4ae98a8bd147b6cdb3c92a23f544eb0e12926e4d9b6ed399d62cbaa9452"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VHHI4XA5HZH5D4JGCFEW23LHBA","target":"graph","payload":{"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"},"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:10:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D377fg+5u5NxLp8V8MBGmeNYgYTG7wDX1FJGsfLeq8fV5L6EgWWjg4mC1s2vawpCRj6yRCykKT2F6VJc0ANCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:27:21.573358Z"},"content_sha256":"c4596523cc1972dfd43713cca3dfb42dda6d560437ce2c88b75d197b8c5328e4","schema_version":"1.0","event_id":"sha256:c4596523cc1972dfd43713cca3dfb42dda6d560437ce2c88b75d197b8c5328e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/bundle.json","state_url":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/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-05-30T02:27:21Z","links":{"resolver":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA","bundle":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/bundle.json","state":"https://pith.science/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHHI4XA5HZH5D4JGCFEW23LHBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VHHI4XA5HZH5D4JGCFEW23LHBA","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":"d3b9fcf5fdc86f61b4999683df2ee759d56d7391df5a34c572c11b73d16f65d6","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-05-12T15:45:27Z","title_canon_sha256":"05ca86f45987090802e41f86a136fdd25d5b252be8d9b5ae227f37c2c9b99564"},"schema_version":"1.0","source":{"id":"1605.03861","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03861","created_at":"2026-05-18T00:10:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03861v2","created_at":"2026-05-18T00:10:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03861","created_at":"2026-05-18T00:10:30Z"},{"alias_kind":"pith_short_12","alias_value":"VHHI4XA5HZH5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHHI4XA5HZH5D4JG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHHI4XA5","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:c4596523cc1972dfd43713cca3dfb42dda6d560437ce2c88b75d197b8c5328e4","target":"graph","created_at":"2026-05-18T00:10:30Z","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 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","authors_text":"Omer Friedland, Pierre Youssef","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-05-12T15:45:27Z","title":"Approximating matrices and convex bodies through Kadison-Singer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03861","kind":"arxiv","version":2},"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:860ff4ae98a8bd147b6cdb3c92a23f544eb0e12926e4d9b6ed399d62cbaa9452","target":"record","created_at":"2026-05-18T00:10:30Z","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":"d3b9fcf5fdc86f61b4999683df2ee759d56d7391df5a34c572c11b73d16f65d6","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-05-12T15:45:27Z","title_canon_sha256":"05ca86f45987090802e41f86a136fdd25d5b252be8d9b5ae227f37c2c9b99564"},"schema_version":"1.0","source":{"id":"1605.03861","kind":"arxiv","version":2}},"canonical_sha256":"a9ce8e5c1d3e4fd1f12611496d6d6708231e99152ca3e27323ca267c0a6d28f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ce8e5c1d3e4fd1f12611496d6d6708231e99152ca3e27323ca267c0a6d28f9","first_computed_at":"2026-05-18T00:10:30.933285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:30.933285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dtHM+wMFw9zaYmgVg+gEAZQZKfzAh+AMWiivDW5Uewy97jJsiLCjE/XIB/AdMdCm99yNb2c9qztmLg4gNU9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:30.933925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03861","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:860ff4ae98a8bd147b6cdb3c92a23f544eb0e12926e4d9b6ed399d62cbaa9452","sha256:c4596523cc1972dfd43713cca3dfb42dda6d560437ce2c88b75d197b8c5328e4"],"state_sha256":"b4b14c1b1010557502ba71efafc43b4b40e2f1e7308a7f3a4e54297851df0cf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0tlzo4XOShr6KCcfKqDpSiI//0gd/SQpy5aJsarGNZoy3uWvTbgu1/uNLn7JGkJ/vjtOBo8Kb5/J4rtd7DjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:27:21.577552Z","bundle_sha256":"8aedef221597d3f829b517ea8b1c4431e2763a88e14931c5e0537b68fadc453a"}}