{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C4FWWOVANTPTBOQJFW3OKCAKF7","short_pith_number":"pith:C4FWWOVA","schema_version":"1.0","canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","source":{"kind":"arxiv","id":"1208.4696","version":2},"attestation_state":"computed","paper":{"title":"Typical $l_1$-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.IT"],"primary_cat":"cs.IT","authors_text":"Mikko Vehkapera, Saikat Chatterjee, Yoshiyuki Kabashima","submitted_at":"2012-08-23T09:09:54Z","abstract_excerpt":"We consider the problem of recovering an $N$-dimensional sparse vector $\\vm{x}$ from its linear transformation $\\vm{y}=\\vm{D} \\vm{x}$ of $M(< N)$ dimension. Minimizing the $l_{1}$-norm of $\\vm{x}$ under the constraint $\\vm{y} = \\vm{D} \\vm{x}$ is a standard approach for the recovery problem, and earlier studies report that the critical condition for typically successful $l_1$-recovery is universal over a variety of randomly constructed matrices $\\vm{D}$. For examining the extent of the universality, we focus on the case in which $\\vm{D}$ is provided by concatenating $\\nb=N/M$ matrices $\\vm{O}_{"},"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":"1208.4696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-23T09:09:54Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"title_canon_sha256":"f812a119087f7a6df7e1cecb39338fa88184acd485605887c96ac3962749f1cd","abstract_canon_sha256":"364990b7fed4e2ee4f7e59eddb1779affa88ac4cc89ef25749ea50ec51807678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.583295Z","signature_b64":"8AKyy7UJkq/dPJw+wfBsMCjaNi1R+qqkg8K/HhH1Gj7JwTC55tPC3Rdhm1ps13sx61yeqtnZN32yNsQ5YLTrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","last_reissued_at":"2026-05-18T02:21:00.582717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.582717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typical $l_1$-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.IT"],"primary_cat":"cs.IT","authors_text":"Mikko Vehkapera, Saikat Chatterjee, Yoshiyuki Kabashima","submitted_at":"2012-08-23T09:09:54Z","abstract_excerpt":"We consider the problem of recovering an $N$-dimensional sparse vector $\\vm{x}$ from its linear transformation $\\vm{y}=\\vm{D} \\vm{x}$ of $M(< N)$ dimension. Minimizing the $l_{1}$-norm of $\\vm{x}$ under the constraint $\\vm{y} = \\vm{D} \\vm{x}$ is a standard approach for the recovery problem, and earlier studies report that the critical condition for typically successful $l_1$-recovery is universal over a variety of randomly constructed matrices $\\vm{D}$. For examining the extent of the universality, we focus on the case in which $\\vm{D}$ is provided by concatenating $\\nb=N/M$ matrices $\\vm{O}_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4696","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":"1208.4696","created_at":"2026-05-18T02:21:00.582791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4696v2","created_at":"2026-05-18T02:21:00.582791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4696","created_at":"2026-05-18T02:21:00.582791+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4FWWOVANTPT","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4FWWOVANTPTBOQJ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4FWWOVA","created_at":"2026-05-18T12:27:01.376967+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/C4FWWOVANTPTBOQJFW3OKCAKF7","json":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7.json","graph_json":"https://pith.science/api/pith-number/C4FWWOVANTPTBOQJFW3OKCAKF7/graph.json","events_json":"https://pith.science/api/pith-number/C4FWWOVANTPTBOQJFW3OKCAKF7/events.json","paper":"https://pith.science/paper/C4FWWOVA"},"agent_actions":{"view_html":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7","download_json":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7.json","view_paper":"https://pith.science/paper/C4FWWOVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4696&json=true","fetch_graph":"https://pith.science/api/pith-number/C4FWWOVANTPTBOQJFW3OKCAKF7/graph.json","fetch_events":"https://pith.science/api/pith-number/C4FWWOVANTPTBOQJFW3OKCAKF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/action/storage_attestation","attest_author":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/action/author_attestation","sign_citation":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/action/citation_signature","submit_replication":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/action/replication_record"}},"created_at":"2026-05-18T02:21:00.582791+00:00","updated_at":"2026-05-18T02:21:00.582791+00:00"}