{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4PXBK6FV3TYJZCKUTSOUUVO5KQ","short_pith_number":"pith:4PXBK6FV","canonical_record":{"source":{"id":"1010.0011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T20:09:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a83c325a5979a771e976b74898688cde92d48a8eb826bb23e69b6f11ac6f1f5","abstract_canon_sha256":"9cc277ebca1e048e127f9e7a59c573d94b15cc7ff034ae79a95b03c74732fc05"},"schema_version":"1.0"},"canonical_sha256":"e3ee1578b5dcf09c89549c9d4a55dd540e8c869325ec0acfdb3df3e969913bbe","source":{"kind":"arxiv","id":"1010.0011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0011","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0011v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0011","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"4PXBK6FV3TYJ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4PXBK6FV3TYJZCKU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4PXBK6FV","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4PXBK6FV3TYJZCKUTSOUUVO5KQ","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T20:09:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a83c325a5979a771e976b74898688cde92d48a8eb826bb23e69b6f11ac6f1f5","abstract_canon_sha256":"9cc277ebca1e048e127f9e7a59c573d94b15cc7ff034ae79a95b03c74732fc05"},"schema_version":"1.0"},"canonical_sha256":"e3ee1578b5dcf09c89549c9d4a55dd540e8c869325ec0acfdb3df3e969913bbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.389838Z","signature_b64":"KevbPszzMxUNsSIT1m7fZO50rigTj2bjUznbaAh7xMf1qKGZtsVf09NLbrf6JuT6aZLCol19tYCukMPgoJx/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ee1578b5dcf09c89549c9d4a55dd540e8c869325ec0acfdb3df3e969913bbe","last_reissued_at":"2026-05-18T04:40:00.389381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.389381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0011","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-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRpHXziuq9pAHVrESNbe4AZI098BX/N+VRxG1LZyXB6zYKFkXDlqQj9mx62Zq/tBgIOSPEdtsitQJnlGmmtqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:51:17.942450Z"},"content_sha256":"8b52b9b43bcce0f0c189ec0bfe4afe078224ec1d6b75cccd667ba55c3e6ac15a","schema_version":"1.0","event_id":"sha256:8b52b9b43bcce0f0c189ec0bfe4afe078224ec1d6b75cccd667ba55c3e6ac15a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4PXBK6FV3TYJZCKUTSOUUVO5KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Compressed Sensing Matrices from Additive Character Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nam Yul Yu","submitted_at":"2010-09-30T20:09:23Z","abstract_excerpt":"Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \\times N$ measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for $N=K^2$, and to present a sufficient condition on the sparsity level for unique sparse recovery. Also, the restricted isometry property (RIP) is statistically studied for the deterministic matrix. Using additive character sequences with small alp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0011","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-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9syexMB2qlYu2WUJWNrFSWrzyDboirVf2rYstws3Ym3ItKFeyDH2opSHUII7TTd0oTFSZe4FvuIwx2XdkixuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:51:17.942800Z"},"content_sha256":"52b89501e785d1cc175a64cddbf6fdf1da6acbc900908fc5d8ccde5dd6bce82d","schema_version":"1.0","event_id":"sha256:52b89501e785d1cc175a64cddbf6fdf1da6acbc900908fc5d8ccde5dd6bce82d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ/bundle.json","state_url":"https://pith.science/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ/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-05T18:51:17Z","links":{"resolver":"https://pith.science/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ","bundle":"https://pith.science/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ/bundle.json","state":"https://pith.science/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PXBK6FV3TYJZCKUTSOUUVO5KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4PXBK6FV3TYJZCKUTSOUUVO5KQ","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":"9cc277ebca1e048e127f9e7a59c573d94b15cc7ff034ae79a95b03c74732fc05","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T20:09:23Z","title_canon_sha256":"9a83c325a5979a771e976b74898688cde92d48a8eb826bb23e69b6f11ac6f1f5"},"schema_version":"1.0","source":{"id":"1010.0011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0011","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0011v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0011","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"4PXBK6FV3TYJ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4PXBK6FV3TYJZCKU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4PXBK6FV","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:52b89501e785d1cc175a64cddbf6fdf1da6acbc900908fc5d8ccde5dd6bce82d","target":"graph","created_at":"2026-05-18T04:40:00Z","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":"Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \\times N$ measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for $N=K^2$, and to present a sufficient condition on the sparsity level for unique sparse recovery. Also, the restricted isometry property (RIP) is statistically studied for the deterministic matrix. Using additive character sequences with small alp","authors_text":"Nam Yul Yu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T20:09:23Z","title":"Deterministic Compressed Sensing Matrices from Additive Character Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0011","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:8b52b9b43bcce0f0c189ec0bfe4afe078224ec1d6b75cccd667ba55c3e6ac15a","target":"record","created_at":"2026-05-18T04:40:00Z","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":"9cc277ebca1e048e127f9e7a59c573d94b15cc7ff034ae79a95b03c74732fc05","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T20:09:23Z","title_canon_sha256":"9a83c325a5979a771e976b74898688cde92d48a8eb826bb23e69b6f11ac6f1f5"},"schema_version":"1.0","source":{"id":"1010.0011","kind":"arxiv","version":1}},"canonical_sha256":"e3ee1578b5dcf09c89549c9d4a55dd540e8c869325ec0acfdb3df3e969913bbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ee1578b5dcf09c89549c9d4a55dd540e8c869325ec0acfdb3df3e969913bbe","first_computed_at":"2026-05-18T04:40:00.389381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:00.389381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KevbPszzMxUNsSIT1m7fZO50rigTj2bjUznbaAh7xMf1qKGZtsVf09NLbrf6JuT6aZLCol19tYCukMPgoJx/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:00.389838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b52b9b43bcce0f0c189ec0bfe4afe078224ec1d6b75cccd667ba55c3e6ac15a","sha256:52b89501e785d1cc175a64cddbf6fdf1da6acbc900908fc5d8ccde5dd6bce82d"],"state_sha256":"169dc54b69c729d3b01efe5b614f5e76e601faf057a59aa268d541d9a549ed8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MrOVsWR2UqB0MAUn6g4YOSdRs6fcpmAryA7XNZZEuycNaEDHR1ycBrlXVAA9N5uQk4N6TuIa2UayrY2zl17DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:51:17.944782Z","bundle_sha256":"8679183076262f1c5e65bc858a56a677f6fafd01785cdc7359417405bef647ca"}}