{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6YI35ZTKTUJ5XVVUPQTNEGHCTB","short_pith_number":"pith:6YI35ZTK","schema_version":"1.0","canonical_sha256":"f611bee66a9d13dbd6b47c26d218e2985506829da382947b0bf703a8d0306e5f","source":{"kind":"arxiv","id":"1102.5462","version":2},"attestation_state":"computed","paper":{"title":"Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Animashree Anandkumar, Babak Hassibi, Juhwan Yoo, M. Amin Khajehnejad","submitted_at":"2011-02-27T00:36:29Z","abstract_excerpt":"We introduce a new class of measurement matrices for compressed sensing, using low order summaries over binary sequences of a given length. We prove recovery guarantees for three reconstruction algorithms using the proposed measurements, including $\\ell_1$ minimization and two combinatorial methods. In particular, one of the algorithms recovers $k$-sparse vectors of length $N$ in sublinear time $\\text{poly}(k\\log{N})$, and requires at most $\\Omega(k\\log{N}\\log\\log{N})$ measurements. The empirical oversampling constant of the algorithm is significantly better than existing sublinear recovery al"},"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":"1102.5462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-27T00:36:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d164be58244411fbcd760bc9fd5cc18e460668b12458fbb47d6e71b87768136f","abstract_canon_sha256":"aa8d76ee756906d86c1a8208b073c0d860569cd2b196f45f75f4e1063a574f27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:17.423508Z","signature_b64":"mo9ntHHI8geKxzsgNZm/4VzuxbZt0L26wzK0iigJ5jgVe884vw6V2sOAlczbzdym3pR63Z9xDri2E3EAM43eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f611bee66a9d13dbd6b47c26d218e2985506829da382947b0bf703a8d0306e5f","last_reissued_at":"2026-05-18T04:27:17.422857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:17.422857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Animashree Anandkumar, Babak Hassibi, Juhwan Yoo, M. Amin Khajehnejad","submitted_at":"2011-02-27T00:36:29Z","abstract_excerpt":"We introduce a new class of measurement matrices for compressed sensing, using low order summaries over binary sequences of a given length. We prove recovery guarantees for three reconstruction algorithms using the proposed measurements, including $\\ell_1$ minimization and two combinatorial methods. In particular, one of the algorithms recovers $k$-sparse vectors of length $N$ in sublinear time $\\text{poly}(k\\log{N})$, and requires at most $\\Omega(k\\log{N}\\log\\log{N})$ measurements. The empirical oversampling constant of the algorithm is significantly better than existing sublinear recovery al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5462","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":"1102.5462","created_at":"2026-05-18T04:27:17.422969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5462v2","created_at":"2026-05-18T04:27:17.422969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5462","created_at":"2026-05-18T04:27:17.422969+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YI35ZTKTUJ5","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YI35ZTKTUJ5XVVU","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YI35ZTK","created_at":"2026-05-18T12:26:22.705136+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/6YI35ZTKTUJ5XVVUPQTNEGHCTB","json":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB.json","graph_json":"https://pith.science/api/pith-number/6YI35ZTKTUJ5XVVUPQTNEGHCTB/graph.json","events_json":"https://pith.science/api/pith-number/6YI35ZTKTUJ5XVVUPQTNEGHCTB/events.json","paper":"https://pith.science/paper/6YI35ZTK"},"agent_actions":{"view_html":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB","download_json":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB.json","view_paper":"https://pith.science/paper/6YI35ZTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5462&json=true","fetch_graph":"https://pith.science/api/pith-number/6YI35ZTKTUJ5XVVUPQTNEGHCTB/graph.json","fetch_events":"https://pith.science/api/pith-number/6YI35ZTKTUJ5XVVUPQTNEGHCTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/action/storage_attestation","attest_author":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/action/author_attestation","sign_citation":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/action/citation_signature","submit_replication":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/action/replication_record"}},"created_at":"2026-05-18T04:27:17.422969+00:00","updated_at":"2026-05-18T04:27:17.422969+00:00"}