{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BR75C3TT7AFNDBVQ7AU44BTZLM","short_pith_number":"pith:BR75C3TT","schema_version":"1.0","canonical_sha256":"0c7fd16e73f80ad186b0f829ce06795b031fbfd9bca65102fca96f36c141964b","source":{"kind":"arxiv","id":"1304.0003","version":1},"attestation_state":"computed","paper":{"title":"Meshes that trap random subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.PR"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T04:39:26Z","abstract_excerpt":"In our recent work \\cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a polynomial $\\ell_1$-optimization technique when used for solving such systems. As one of the tools we used a probabilistic result of Gordon \\cite{Gordon88}. In this paper we revisit this classic result in its core form and show how it can be reused to in a sense prove its own optimality."},"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.0003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:39:26Z","cross_cats_sorted":["math.IT","math.OC","math.PR"],"title_canon_sha256":"5c73aef342dfbdf334c2c72fef8b68d63325721028c9e8c3b6c410ae87372e1f","abstract_canon_sha256":"696b435d1c4f8ae109611e2684e8c9a940426fed0c52e950e7aee424deff8030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:26.321347Z","signature_b64":"G6knXwbDG9kkh0XrT8DOBg07SFwprWhd6dvoQNOmVMO5xRD6kqN603YVC9zmJWDlYohbHscwd4qcXuLc78f2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c7fd16e73f80ad186b0f829ce06795b031fbfd9bca65102fca96f36c141964b","last_reissued_at":"2026-05-18T03:29:26.320457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:26.320457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meshes that trap random subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.PR"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T04:39:26Z","abstract_excerpt":"In our recent work \\cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a polynomial $\\ell_1$-optimization technique when used for solving such systems. As one of the tools we used a probabilistic result of Gordon \\cite{Gordon88}. In this paper we revisit this classic result in its core form and show how it can be reused to in a sense prove its own optimality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0003","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.0003","created_at":"2026-05-18T03:29:26.320608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0003v1","created_at":"2026-05-18T03:29:26.320608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0003","created_at":"2026-05-18T03:29:26.320608+00:00"},{"alias_kind":"pith_short_12","alias_value":"BR75C3TT7AFN","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BR75C3TT7AFNDBVQ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BR75C3TT","created_at":"2026-05-18T12:27:40.988391+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/BR75C3TT7AFNDBVQ7AU44BTZLM","json":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM.json","graph_json":"https://pith.science/api/pith-number/BR75C3TT7AFNDBVQ7AU44BTZLM/graph.json","events_json":"https://pith.science/api/pith-number/BR75C3TT7AFNDBVQ7AU44BTZLM/events.json","paper":"https://pith.science/paper/BR75C3TT"},"agent_actions":{"view_html":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM","download_json":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM.json","view_paper":"https://pith.science/paper/BR75C3TT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0003&json=true","fetch_graph":"https://pith.science/api/pith-number/BR75C3TT7AFNDBVQ7AU44BTZLM/graph.json","fetch_events":"https://pith.science/api/pith-number/BR75C3TT7AFNDBVQ7AU44BTZLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM/action/storage_attestation","attest_author":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM/action/author_attestation","sign_citation":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM/action/citation_signature","submit_replication":"https://pith.science/pith/BR75C3TT7AFNDBVQ7AU44BTZLM/action/replication_record"}},"created_at":"2026-05-18T03:29:26.320608+00:00","updated_at":"2026-05-18T03:29:26.320608+00:00"}