{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6YI35ZTKTUJ5XVVUPQTNEGHCTB","short_pith_number":"pith:6YI35ZTK","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"},"canonical_sha256":"f611bee66a9d13dbd6b47c26d218e2985506829da382947b0bf703a8d0306e5f","source":{"kind":"arxiv","id":"1102.5462","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5462","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5462v2","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5462","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"6YI35ZTKTUJ5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6YI35ZTKTUJ5XVVU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6YI35ZTK","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6YI35ZTKTUJ5XVVUPQTNEGHCTB","target":"record","payload":{"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"},"canonical_sha256":"f611bee66a9d13dbd6b47c26d218e2985506829da382947b0bf703a8d0306e5f","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"},"source_kind":"arxiv","source_id":"1102.5462","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-18T04:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yT928Nh8qOmV9kXu6T9/udHg7V0Z2/wM88X/VaZa23OjGio9pqRmoTjvaB+HNA4LM+VRNhJRn1mWTGnkZRnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:58:07.676346Z"},"content_sha256":"8c4ea5c5be395742f294d7f9c24854b6db064ba131bede913e63b019adcc5c79","schema_version":"1.0","event_id":"sha256:8c4ea5c5be395742f294d7f9c24854b6db064ba131bede913e63b019adcc5c79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6YI35ZTKTUJ5XVVUPQTNEGHCTB","target":"graph","payload":{"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"},"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-18T04:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"am4YihJbJ6ZPewok9EGASml0vWF30b2PBM5vqQQ4ntI4GbxB0EhWNKu50v1crRC3KHynJdEu+pDD3wvuHxrbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:58:07.676926Z"},"content_sha256":"eecf8e9c6ebbfdc73064dbd45d86dec8096ca5af855f382d5638572d5c3d35a8","schema_version":"1.0","event_id":"sha256:eecf8e9c6ebbfdc73064dbd45d86dec8096ca5af855f382d5638572d5c3d35a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/bundle.json","state_url":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/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-27T08:58:07Z","links":{"resolver":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB","bundle":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/bundle.json","state":"https://pith.science/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YI35ZTKTUJ5XVVUPQTNEGHCTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6YI35ZTKTUJ5XVVUPQTNEGHCTB","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":"aa8d76ee756906d86c1a8208b073c0d860569cd2b196f45f75f4e1063a574f27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-27T00:36:29Z","title_canon_sha256":"d164be58244411fbcd760bc9fd5cc18e460668b12458fbb47d6e71b87768136f"},"schema_version":"1.0","source":{"id":"1102.5462","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5462","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5462v2","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5462","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"6YI35ZTKTUJ5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6YI35ZTKTUJ5XVVU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6YI35ZTK","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:eecf8e9c6ebbfdc73064dbd45d86dec8096ca5af855f382d5638572d5c3d35a8","target":"graph","created_at":"2026-05-18T04:27:17Z","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 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","authors_text":"Animashree Anandkumar, Babak Hassibi, Juhwan Yoo, M. Amin Khajehnejad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-27T00:36:29Z","title":"Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5462","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:8c4ea5c5be395742f294d7f9c24854b6db064ba131bede913e63b019adcc5c79","target":"record","created_at":"2026-05-18T04:27:17Z","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":"aa8d76ee756906d86c1a8208b073c0d860569cd2b196f45f75f4e1063a574f27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-27T00:36:29Z","title_canon_sha256":"d164be58244411fbcd760bc9fd5cc18e460668b12458fbb47d6e71b87768136f"},"schema_version":"1.0","source":{"id":"1102.5462","kind":"arxiv","version":2}},"canonical_sha256":"f611bee66a9d13dbd6b47c26d218e2985506829da382947b0bf703a8d0306e5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f611bee66a9d13dbd6b47c26d218e2985506829da382947b0bf703a8d0306e5f","first_computed_at":"2026-05-18T04:27:17.422857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:17.422857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mo9ntHHI8geKxzsgNZm/4VzuxbZt0L26wzK0iigJ5jgVe884vw6V2sOAlczbzdym3pR63Z9xDri2E3EAM43eBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:17.423508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5462","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c4ea5c5be395742f294d7f9c24854b6db064ba131bede913e63b019adcc5c79","sha256:eecf8e9c6ebbfdc73064dbd45d86dec8096ca5af855f382d5638572d5c3d35a8"],"state_sha256":"edc7da01d0e8eade219925bdd76204054a497b1b8f4c18d49234e3816eda7a7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Myd0fbA7MAPiggDQitzXZ6DFx1ifICe1rpb/Ofzoi6eYynp16pTl6NRe+mYw+zyw93i1qv+/hhrN218UgZ4TDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:58:07.680254Z","bundle_sha256":"b126d0476c8b2c192f5292ea2bb56927f296346454884d1b6a5bab16d6897d83"}}