{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BFEW6HRICTKWWWPVWEERFWWEP4","short_pith_number":"pith:BFEW6HRI","canonical_record":{"source":{"id":"1110.0279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-03T07:23:37Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"a6e3b8691401445bb821139f474acb588d1d89f0e4e45a26c591d8666e3d34ef","abstract_canon_sha256":"dfc56e2941b34dca59f5faf6a199c840e004d1a5f957f4c97ca6c2e03703748c"},"schema_version":"1.0"},"canonical_sha256":"09496f1e2814d56b59f5b10912dac47f2496dafa9ff36052ba6904e9f9d821b7","source":{"kind":"arxiv","id":"1110.0279","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0279","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0279v2","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0279","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"BFEW6HRICTKW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BFEW6HRICTKWWWPV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BFEW6HRI","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BFEW6HRICTKWWWPVWEERFWWEP4","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-03T07:23:37Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"a6e3b8691401445bb821139f474acb588d1d89f0e4e45a26c591d8666e3d34ef","abstract_canon_sha256":"dfc56e2941b34dca59f5faf6a199c840e004d1a5f957f4c97ca6c2e03703748c"},"schema_version":"1.0"},"canonical_sha256":"09496f1e2814d56b59f5b10912dac47f2496dafa9ff36052ba6904e9f9d821b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:38.141417Z","signature_b64":"gqNR+QhkGtINMzzfBNLTrJve3ys8dz6zmXmynsNpmZcyDiB4kLfFQP5PIL2u2szBdJpg5DWUmTmNB1I/EFfMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09496f1e2814d56b59f5b10912dac47f2496dafa9ff36052ba6904e9f9d821b7","last_reissued_at":"2026-05-18T04:02:38.140738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:38.140738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0279","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:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BLprxV/ozRDWyKagwbXgcznik62u27XCh8FtTcwXQ1J5zKfZPeczjtfWQsW0CBczoDAfmrAWTe5Kq5wUv8+pBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:37:41.628996Z"},"content_sha256":"551df9b8d17d427dad656fde49787d7be7e88a0d343812d075434b6918cae359","schema_version":"1.0","event_id":"sha256:551df9b8d17d427dad656fde49787d7be7e88a0d343812d075434b6918cae359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BFEW6HRICTKWWWPVWEERFWWEP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding-Theoretic Methods for Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi","submitted_at":"2011-10-03T07:23:37Z","abstract_excerpt":"We review connections between coding-theoretic objects and sparse learning problems. In particular, we show how seemingly different combinatorial objects such as error-correcting codes, combinatorial designs, spherical codes, compressed sensing matrices and group testing designs can be obtained from one another. The reductions enable one to translate upper and lower bounds on the parameters attainable by one object to another. We survey some of the well-known reductions in a unified presentation, and bring some existing gaps to attention. New reductions are also introduced; in particular, we b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0279","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:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ds4knaJ5BBsPpVr6v+3b4K8DSCWbzgE29lMWEhd81k3/i7uzDeT927epeWw7kTkOD5eB+G50ri7TtTsIH9NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:37:41.629359Z"},"content_sha256":"c45ccbaf4a4f86ff8dc691624765bae96984fe8b4b9aa9198325528e9786914a","schema_version":"1.0","event_id":"sha256:c45ccbaf4a4f86ff8dc691624765bae96984fe8b4b9aa9198325528e9786914a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFEW6HRICTKWWWPVWEERFWWEP4/bundle.json","state_url":"https://pith.science/pith/BFEW6HRICTKWWWPVWEERFWWEP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFEW6HRICTKWWWPVWEERFWWEP4/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-06-01T14:37:41Z","links":{"resolver":"https://pith.science/pith/BFEW6HRICTKWWWPVWEERFWWEP4","bundle":"https://pith.science/pith/BFEW6HRICTKWWWPVWEERFWWEP4/bundle.json","state":"https://pith.science/pith/BFEW6HRICTKWWWPVWEERFWWEP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFEW6HRICTKWWWPVWEERFWWEP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BFEW6HRICTKWWWPVWEERFWWEP4","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":"dfc56e2941b34dca59f5faf6a199c840e004d1a5f957f4c97ca6c2e03703748c","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-03T07:23:37Z","title_canon_sha256":"a6e3b8691401445bb821139f474acb588d1d89f0e4e45a26c591d8666e3d34ef"},"schema_version":"1.0","source":{"id":"1110.0279","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0279","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0279v2","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0279","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"BFEW6HRICTKW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BFEW6HRICTKWWWPV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BFEW6HRI","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:c45ccbaf4a4f86ff8dc691624765bae96984fe8b4b9aa9198325528e9786914a","target":"graph","created_at":"2026-05-18T04:02:38Z","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 review connections between coding-theoretic objects and sparse learning problems. In particular, we show how seemingly different combinatorial objects such as error-correcting codes, combinatorial designs, spherical codes, compressed sensing matrices and group testing designs can be obtained from one another. The reductions enable one to translate upper and lower bounds on the parameters attainable by one object to another. We survey some of the well-known reductions in a unified presentation, and bring some existing gaps to attention. New reductions are also introduced; in particular, we b","authors_text":"Mahdi Cheraghchi","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-03T07:23:37Z","title":"Coding-Theoretic Methods for Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0279","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:551df9b8d17d427dad656fde49787d7be7e88a0d343812d075434b6918cae359","target":"record","created_at":"2026-05-18T04:02:38Z","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":"dfc56e2941b34dca59f5faf6a199c840e004d1a5f957f4c97ca6c2e03703748c","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-03T07:23:37Z","title_canon_sha256":"a6e3b8691401445bb821139f474acb588d1d89f0e4e45a26c591d8666e3d34ef"},"schema_version":"1.0","source":{"id":"1110.0279","kind":"arxiv","version":2}},"canonical_sha256":"09496f1e2814d56b59f5b10912dac47f2496dafa9ff36052ba6904e9f9d821b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09496f1e2814d56b59f5b10912dac47f2496dafa9ff36052ba6904e9f9d821b7","first_computed_at":"2026-05-18T04:02:38.140738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:38.140738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gqNR+QhkGtINMzzfBNLTrJve3ys8dz6zmXmynsNpmZcyDiB4kLfFQP5PIL2u2szBdJpg5DWUmTmNB1I/EFfMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:38.141417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0279","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:551df9b8d17d427dad656fde49787d7be7e88a0d343812d075434b6918cae359","sha256:c45ccbaf4a4f86ff8dc691624765bae96984fe8b4b9aa9198325528e9786914a"],"state_sha256":"e621afda65e96627ae630df9be5621cc5afc1bfde5f39fc5564d3079c913a595"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB9bTvNwy6ZdB4+X+Mz2+xEL2NsajPDMy9Dhzbfta1tNvikw53xkKy8Qkcx1Y/tC5u4DR2XhisjS05cIK0KDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:37:41.631526Z","bundle_sha256":"e5e8c0b2d9beab9138048939ddfd99e9ef40288e04d66fe4d709ff09d45543b7"}}