{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:7NAMEZYBPXNQLJZMHCATU5TZRB","short_pith_number":"pith:7NAMEZYB","schema_version":"1.0","canonical_sha256":"fb40c267017ddb05a72c38813a76798848a7ab39306891b00cf13666548e6ee0","source":{"kind":"arxiv","id":"math/0502327","version":1},"attestation_state":"computed","paper":{"title":"Decoding by Linear Programming","license":"","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.MG","authors_text":"Emmanuel Candes, Terence Tao","submitted_at":"2005-02-15T21:12:45Z","abstract_excerpt":"This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector $f \\in \\R^n$ from corrupted measurements $y = A f + e$. Here, $A$ is an $m$ by $n$ (coding) matrix and $e$ is an arbitrary and unknown vector of errors. Is it possible to recover $f$ exactly from the data $y$? We prove that under suitable conditions on the coding matrix $A$, the input $f$ is the unique solution to the $\\ell_1$-minimization problem ($\\|x\\|_{\\ell_1} := \\sum_i |x_i|$) $$ \\min_{g \\in \\R^n} \\| y - Ag \\|_{\\ell_1} $$ provided that the support "},"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":"math/0502327","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.MG","submitted_at":"2005-02-15T21:12:45Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"8baf01926af32c187671251f32e8bfef567ece066ae820b86432bfd18e2dd331","abstract_canon_sha256":"99b35be500bb2b21c164b978def3a70b09b2b8386dad6fe81250108c1a918ad4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:39:37.144360Z","signature_b64":"oajHaxVeaCtjpBln3nF27vUMNHr2tL6P29RQ+jFpXaudnyV95VWtq1WMCkJlVG6FykV3uP5xM2OgPfdLeWqTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb40c267017ddb05a72c38813a76798848a7ab39306891b00cf13666548e6ee0","last_reissued_at":"2026-07-04T14:39:37.143952Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:39:37.143952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding by Linear Programming","license":"","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.MG","authors_text":"Emmanuel Candes, Terence Tao","submitted_at":"2005-02-15T21:12:45Z","abstract_excerpt":"This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector $f \\in \\R^n$ from corrupted measurements $y = A f + e$. Here, $A$ is an $m$ by $n$ (coding) matrix and $e$ is an arbitrary and unknown vector of errors. Is it possible to recover $f$ exactly from the data $y$? We prove that under suitable conditions on the coding matrix $A$, the input $f$ is the unique solution to the $\\ell_1$-minimization problem ($\\|x\\|_{\\ell_1} := \\sum_i |x_i|$) $$ \\min_{g \\in \\R^n} \\| y - Ag \\|_{\\ell_1} $$ provided that the support "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0502327","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0502327/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0502327","created_at":"2026-07-04T14:39:37.144011+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0502327v1","created_at":"2026-07-04T14:39:37.144011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0502327","created_at":"2026-07-04T14:39:37.144011+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NAMEZYBPXNQ","created_at":"2026-07-04T14:39:37.144011+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NAMEZYBPXNQLJZM","created_at":"2026-07-04T14:39:37.144011+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NAMEZYB","created_at":"2026-07-04T14:39:37.144011+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00311","citing_title":"Sparse Gradient Compression for Fine-Tuning Large Language Models","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB","json":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB.json","graph_json":"https://pith.science/api/pith-number/7NAMEZYBPXNQLJZMHCATU5TZRB/graph.json","events_json":"https://pith.science/api/pith-number/7NAMEZYBPXNQLJZMHCATU5TZRB/events.json","paper":"https://pith.science/paper/7NAMEZYB"},"agent_actions":{"view_html":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB","download_json":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB.json","view_paper":"https://pith.science/paper/7NAMEZYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0502327&json=true","fetch_graph":"https://pith.science/api/pith-number/7NAMEZYBPXNQLJZMHCATU5TZRB/graph.json","fetch_events":"https://pith.science/api/pith-number/7NAMEZYBPXNQLJZMHCATU5TZRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB/action/storage_attestation","attest_author":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB/action/author_attestation","sign_citation":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB/action/citation_signature","submit_replication":"https://pith.science/pith/7NAMEZYBPXNQLJZMHCATU5TZRB/action/replication_record"}},"created_at":"2026-07-04T14:39:37.144011+00:00","updated_at":"2026-07-04T14:39:37.144011+00:00"}