{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WGHTJRMHKSCKIGJIFWHJY4P2WE","short_pith_number":"pith:WGHTJRMH","canonical_record":{"source":{"id":"1601.06899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T06:09:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9899b5ae2487cac73e49c3708f996c59a21f1fff41df7cd96f8eb32a6e411b37","abstract_canon_sha256":"4c700ce2edd85ca75623bb169b4e98ca0ec8372a56011c61a8a1c80748065e83"},"schema_version":"1.0"},"canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","source":{"kind":"arxiv","id":"1601.06899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06899","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06899v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06899","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"WGHTJRMHKSCK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WGHTJRMHKSCKIGJI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WGHTJRMH","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WGHTJRMHKSCKIGJIFWHJY4P2WE","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T06:09:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9899b5ae2487cac73e49c3708f996c59a21f1fff41df7cd96f8eb32a6e411b37","abstract_canon_sha256":"4c700ce2edd85ca75623bb169b4e98ca0ec8372a56011c61a8a1c80748065e83"},"schema_version":"1.0"},"canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.585779Z","signature_b64":"lbj5JE4V2Q5w3rf+q27N2MGzIk/TzDZJw5qTFakbuPimqMS1eV/CQKiyA2afvZywFgxDJPY5SgF0b/A3Vm1IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","last_reissued_at":"2026-05-18T01:21:59.585280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.585280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06899","source_version":1,"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:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dap/4VyhTt9OAepBsyTxHC2DyWv/yKQkqB2v5Ezr/CP3n0HR4LHINm9/YqyRtw82/SFIk4tcFVZLWf0pOGW6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:32:01.295978Z"},"content_sha256":"e555898766c96693e80fb4ef03b058a34dd418f9c82b119840af1a59ebd6ef47","schema_version":"1.0","event_id":"sha256:e555898766c96693e80fb4ef03b058a34dd418f9c82b119840af1a59ebd6ef47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WGHTJRMHKSCKIGJIFWHJY4P2WE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Compressive Sensing: A Compute-and-Recover Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Namyoon Lee, Song-Nam Hong","submitted_at":"2016-01-26T06:09:40Z","abstract_excerpt":"In this paper, we propose \\textit{coded compressive sensing} that recovers an $n$-dimensional integer sparse signal vector from a noisy and quantized measurement vector whose dimension $m$ is far-fewer than $n$. The core idea of coded compressive sensing is to construct a linear sensing matrix whose columns consist of lattice codes. We present a two-stage decoding method named \\textit{compute-and-recover} to detect the sparse signal from the noisy and quantized measurements. In the first stage, we transform such measurements into noiseless finite-field measurements using the linearity of latti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06899","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":""},"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:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wSL8Ibe9r4yVv32Px09mtaTOwgI9s9xsWordmpaIzpGHA5CrkTNPSjLsQfZGHp9EXpYJx9V2frNiVz6SPUKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:32:01.296666Z"},"content_sha256":"c1f55cae8db2e9ad4b2806f7d01ede7ef6285ca736072bf5ebc1657854fbc433","schema_version":"1.0","event_id":"sha256:c1f55cae8db2e9ad4b2806f7d01ede7ef6285ca736072bf5ebc1657854fbc433"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/bundle.json","state_url":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/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-22T10:32:01Z","links":{"resolver":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE","bundle":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/bundle.json","state":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WGHTJRMHKSCKIGJIFWHJY4P2WE","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":"4c700ce2edd85ca75623bb169b4e98ca0ec8372a56011c61a8a1c80748065e83","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T06:09:40Z","title_canon_sha256":"9899b5ae2487cac73e49c3708f996c59a21f1fff41df7cd96f8eb32a6e411b37"},"schema_version":"1.0","source":{"id":"1601.06899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06899","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06899v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06899","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"WGHTJRMHKSCK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WGHTJRMHKSCKIGJI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WGHTJRMH","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:c1f55cae8db2e9ad4b2806f7d01ede7ef6285ca736072bf5ebc1657854fbc433","target":"graph","created_at":"2026-05-18T01:21:59Z","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":"In this paper, we propose \\textit{coded compressive sensing} that recovers an $n$-dimensional integer sparse signal vector from a noisy and quantized measurement vector whose dimension $m$ is far-fewer than $n$. The core idea of coded compressive sensing is to construct a linear sensing matrix whose columns consist of lattice codes. We present a two-stage decoding method named \\textit{compute-and-recover} to detect the sparse signal from the noisy and quantized measurements. In the first stage, we transform such measurements into noiseless finite-field measurements using the linearity of latti","authors_text":"Namyoon Lee, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T06:09:40Z","title":"Coded Compressive Sensing: A Compute-and-Recover Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06899","kind":"arxiv","version":1},"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:e555898766c96693e80fb4ef03b058a34dd418f9c82b119840af1a59ebd6ef47","target":"record","created_at":"2026-05-18T01:21:59Z","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":"4c700ce2edd85ca75623bb169b4e98ca0ec8372a56011c61a8a1c80748065e83","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T06:09:40Z","title_canon_sha256":"9899b5ae2487cac73e49c3708f996c59a21f1fff41df7cd96f8eb32a6e411b37"},"schema_version":"1.0","source":{"id":"1601.06899","kind":"arxiv","version":1}},"canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","first_computed_at":"2026-05-18T01:21:59.585280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:59.585280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lbj5JE4V2Q5w3rf+q27N2MGzIk/TzDZJw5qTFakbuPimqMS1eV/CQKiyA2afvZywFgxDJPY5SgF0b/A3Vm1IAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:59.585779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e555898766c96693e80fb4ef03b058a34dd418f9c82b119840af1a59ebd6ef47","sha256:c1f55cae8db2e9ad4b2806f7d01ede7ef6285ca736072bf5ebc1657854fbc433"],"state_sha256":"f4c9f8bb43831256971672474ccaf7da5acb9cfbd6e542d0edff8c8892a07824"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7bioVcq/+DzSxoFAY3tJPKTGSCW9AvnpxjsWNG56BFRKm47VLW3d3hP1gZQQCtZ2fqFAf4xt/LS8XXwlzvRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T10:32:01.300295Z","bundle_sha256":"5da6bb0e92909ed57d08286ba784b2674c912948e0b8c37d56ee455c0b527d56"}}