{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5XITDS5454VWU3G6UOXXID6VG4","short_pith_number":"pith:5XITDS54","canonical_record":{"source":{"id":"1202.0840","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:49:47Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"e7fdb05708953e1c572a6d8099ba00c8e705c0fe99ef2208003373e5873c6bc7","abstract_canon_sha256":"a7bb00d1238f9ec38691b995186cbf8635bc5cbfa8c91f2c7205ad2857e9e0cf"},"schema_version":"1.0"},"canonical_sha256":"edd131cbbcef2b6a6cdea3af740fd5372d7c8658fcfca9c0da5b3a1b18db3976","source":{"kind":"arxiv","id":"1202.0840","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0840","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0840v4","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0840","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"5XITDS5454VW","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5XITDS5454VWU3G6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5XITDS54","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5XITDS5454VWU3G6UOXXID6VG4","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0840","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:49:47Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"e7fdb05708953e1c572a6d8099ba00c8e705c0fe99ef2208003373e5873c6bc7","abstract_canon_sha256":"a7bb00d1238f9ec38691b995186cbf8635bc5cbfa8c91f2c7205ad2857e9e0cf"},"schema_version":"1.0"},"canonical_sha256":"edd131cbbcef2b6a6cdea3af740fd5372d7c8658fcfca9c0da5b3a1b18db3976","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:09.112922Z","signature_b64":"vX3ViHvix1+gysy3rQTVO8Pes9YkNX4VeRVQYRAQdi5mlGcisXfFBt/VQjA9lzgWdyhm+dHaIbbDdpSngwB3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edd131cbbcef2b6a6cdea3af740fd5372d7c8658fcfca9c0da5b3a1b18db3976","last_reissued_at":"2026-05-18T01:24:09.112185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:09.112185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0840","source_version":4,"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-18T01:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kysng7ZXFoJCkQ5KcyHijuoD16bQ+ep3ch5n2qQeC+UJmizSt9PBPYNdKSAubu4rsv/X2uQsZLB4pNSxXFJnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:00:12.553244Z"},"content_sha256":"090a264ad951fd177c19705f8f7b9829c5324ebe4d3fa46f430e8bf2216c6393","schema_version":"1.0","event_id":"sha256:090a264ad951fd177c19705f8f7b9829c5324ebe4d3fa46f430e8bf2216c6393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5XITDS5454VWU3G6UOXXID6VG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossy Compression via Sparse Linear Regression: Performance under Minimum-distance Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Antony Joseph, Ramji Venkataramanan, Sekhar Tatikonda","submitted_at":"2012-02-03T22:49:47Z","abstract_excerpt":"We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a design matrix. Called a Sparse Superposition or Sparse Regression codebook, this structure is motivated by an analogous construction proposed recently by Barron and Joseph for communication over an AWGN channel. For i.i.d Gaussian sources and minimum-distance encoding, we show that such a code can attain the Shannon rate-distortion function with the optimal er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0840","kind":"arxiv","version":4},"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-18T01:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2O2hEEkOGkqg4TrwFM2edPxPLFc59rSjK80IXuNzZ05t7NIA2ASa3u9VUnS31T1vXsNRkXxTSNL4QwX5+XqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:00:12.553604Z"},"content_sha256":"e1c008c4e826c6744e79ce73a49da62303b1c682c1a464606d643348a270efa8","schema_version":"1.0","event_id":"sha256:e1c008c4e826c6744e79ce73a49da62303b1c682c1a464606d643348a270efa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XITDS5454VWU3G6UOXXID6VG4/bundle.json","state_url":"https://pith.science/pith/5XITDS5454VWU3G6UOXXID6VG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XITDS5454VWU3G6UOXXID6VG4/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-28T13:00:12Z","links":{"resolver":"https://pith.science/pith/5XITDS5454VWU3G6UOXXID6VG4","bundle":"https://pith.science/pith/5XITDS5454VWU3G6UOXXID6VG4/bundle.json","state":"https://pith.science/pith/5XITDS5454VWU3G6UOXXID6VG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XITDS5454VWU3G6UOXXID6VG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5XITDS5454VWU3G6UOXXID6VG4","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":"a7bb00d1238f9ec38691b995186cbf8635bc5cbfa8c91f2c7205ad2857e9e0cf","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:49:47Z","title_canon_sha256":"e7fdb05708953e1c572a6d8099ba00c8e705c0fe99ef2208003373e5873c6bc7"},"schema_version":"1.0","source":{"id":"1202.0840","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0840","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0840v4","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0840","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"5XITDS5454VW","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5XITDS5454VWU3G6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5XITDS54","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:e1c008c4e826c6744e79ce73a49da62303b1c682c1a464606d643348a270efa8","target":"graph","created_at":"2026-05-18T01:24:09Z","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 study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a design matrix. Called a Sparse Superposition or Sparse Regression codebook, this structure is motivated by an analogous construction proposed recently by Barron and Joseph for communication over an AWGN channel. For i.i.d Gaussian sources and minimum-distance encoding, we show that such a code can attain the Shannon rate-distortion function with the optimal er","authors_text":"Antony Joseph, Ramji Venkataramanan, Sekhar Tatikonda","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:49:47Z","title":"Lossy Compression via Sparse Linear Regression: Performance under Minimum-distance Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0840","kind":"arxiv","version":4},"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:090a264ad951fd177c19705f8f7b9829c5324ebe4d3fa46f430e8bf2216c6393","target":"record","created_at":"2026-05-18T01:24:09Z","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":"a7bb00d1238f9ec38691b995186cbf8635bc5cbfa8c91f2c7205ad2857e9e0cf","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:49:47Z","title_canon_sha256":"e7fdb05708953e1c572a6d8099ba00c8e705c0fe99ef2208003373e5873c6bc7"},"schema_version":"1.0","source":{"id":"1202.0840","kind":"arxiv","version":4}},"canonical_sha256":"edd131cbbcef2b6a6cdea3af740fd5372d7c8658fcfca9c0da5b3a1b18db3976","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edd131cbbcef2b6a6cdea3af740fd5372d7c8658fcfca9c0da5b3a1b18db3976","first_computed_at":"2026-05-18T01:24:09.112185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:09.112185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vX3ViHvix1+gysy3rQTVO8Pes9YkNX4VeRVQYRAQdi5mlGcisXfFBt/VQjA9lzgWdyhm+dHaIbbDdpSngwB3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:09.112922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0840","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:090a264ad951fd177c19705f8f7b9829c5324ebe4d3fa46f430e8bf2216c6393","sha256:e1c008c4e826c6744e79ce73a49da62303b1c682c1a464606d643348a270efa8"],"state_sha256":"3e790ab048e291123771670f5c7d778a1c97670575d0667c804d8b4470060985"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fiUhAsn4RXFUVki32fVcvzV1HL/XfCrPz3BXp+VwSA7hEhewlOWDUVe8j6CMHiLaSjgD5kJvG72/kVeQ1vQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:00:12.555554Z","bundle_sha256":"e30f1b5cb65c13eba53ab4dabd398f902957611acda0b0acbac4bd264dc4a021"}}