{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6QH6QUO6ETA22IQWQTCWJG7XKV","short_pith_number":"pith:6QH6QUO6","canonical_record":{"source":{"id":"1011.2740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T19:16:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbc557947ed39bd4f869404ebe5f39fd02f1725bae8d1397115726013d06f982","abstract_canon_sha256":"3dd74e97140dab281b959877d230dc5654cb15e2c46d1bfc6dfc2dffa3f7b0e0"},"schema_version":"1.0"},"canonical_sha256":"f40fe851de24c1ad221684c5649bf7554ad05f4e0c150fc87a373e0255543e58","source":{"kind":"arxiv","id":"1011.2740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2740","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2740v1","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2740","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"6QH6QUO6ETA2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6QH6QUO6ETA22IQW","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6QH6QUO6","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6QH6QUO6ETA22IQWQTCWJG7XKV","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T19:16:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbc557947ed39bd4f869404ebe5f39fd02f1725bae8d1397115726013d06f982","abstract_canon_sha256":"3dd74e97140dab281b959877d230dc5654cb15e2c46d1bfc6dfc2dffa3f7b0e0"},"schema_version":"1.0"},"canonical_sha256":"f40fe851de24c1ad221684c5649bf7554ad05f4e0c150fc87a373e0255543e58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:09.640893Z","signature_b64":"+FXegNsRlFZqvpRUa4ywY1lRqD3szDUc3jG+uNBT2s5fCdz/oVLVli4pW765yV3aBwA4B7/myHC+3FIryjCSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f40fe851de24c1ad221684c5649bf7554ad05f4e0c150fc87a373e0255543e58","last_reissued_at":"2026-05-18T04:36:09.640128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:09.640128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2740","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:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQC4NXrqzEdAfNC0v9MBSwvKHnLZ7mhMF27ECdyoE6zx9izkMBfrd5/mA2AcrPIw5TxS/dF/GyESJg35qorRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:00:20.929501Z"},"content_sha256":"26d8016230b3b565d538016331d80060d11f3c9a75cadbc674d1f11d5f608068","schema_version":"1.0","event_id":"sha256:26d8016230b3b565d538016331d80060d11f3c9a75cadbc674d1f11d5f608068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6QH6QUO6ETA22IQWQTCWJG7XKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Compressed Sensing Matrices from Multiplicative 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-11-11T19:16:33Z","abstract_excerpt":"Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a $K \\times N$ measurement matrix for compressed sensing is deterministically constructed via multiplicative character sequences. Precisely, a constant multiple of a cyclic shift of an $M$-ary power residue or Sidelnikov sequence is arranged as a column vector of the matrix, through modulating a primitive $M$-th root of unity. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for large $K$ and $M$, and to present a sufficient con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2740","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:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIv5ZUg3KhK92C4e5eittFyBJc5qhFpcvGOraZA/L2u0zV+5EGxa9l5QAh/tlbwvynv0ek3Z8K9QNll6ZCWkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:00:20.929840Z"},"content_sha256":"97e9f062acb8078963b49ca2e5fe2fc659b49151eb891e7cc8b353da3dcf5aad","schema_version":"1.0","event_id":"sha256:97e9f062acb8078963b49ca2e5fe2fc659b49151eb891e7cc8b353da3dcf5aad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QH6QUO6ETA22IQWQTCWJG7XKV/bundle.json","state_url":"https://pith.science/pith/6QH6QUO6ETA22IQWQTCWJG7XKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QH6QUO6ETA22IQWQTCWJG7XKV/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-06T09:00:20Z","links":{"resolver":"https://pith.science/pith/6QH6QUO6ETA22IQWQTCWJG7XKV","bundle":"https://pith.science/pith/6QH6QUO6ETA22IQWQTCWJG7XKV/bundle.json","state":"https://pith.science/pith/6QH6QUO6ETA22IQWQTCWJG7XKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QH6QUO6ETA22IQWQTCWJG7XKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6QH6QUO6ETA22IQWQTCWJG7XKV","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":"3dd74e97140dab281b959877d230dc5654cb15e2c46d1bfc6dfc2dffa3f7b0e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T19:16:33Z","title_canon_sha256":"cbc557947ed39bd4f869404ebe5f39fd02f1725bae8d1397115726013d06f982"},"schema_version":"1.0","source":{"id":"1011.2740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2740","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2740v1","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2740","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"6QH6QUO6ETA2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6QH6QUO6ETA22IQW","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6QH6QUO6","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:97e9f062acb8078963b49ca2e5fe2fc659b49151eb891e7cc8b353da3dcf5aad","target":"graph","created_at":"2026-05-18T04:36: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":"Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a $K \\times N$ measurement matrix for compressed sensing is deterministically constructed via multiplicative character sequences. Precisely, a constant multiple of a cyclic shift of an $M$-ary power residue or Sidelnikov sequence is arranged as a column vector of the matrix, through modulating a primitive $M$-th root of unity. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for large $K$ and $M$, and to present a sufficient con","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-11-11T19:16:33Z","title":"Deterministic Compressed Sensing Matrices from Multiplicative Character Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2740","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:26d8016230b3b565d538016331d80060d11f3c9a75cadbc674d1f11d5f608068","target":"record","created_at":"2026-05-18T04:36: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":"3dd74e97140dab281b959877d230dc5654cb15e2c46d1bfc6dfc2dffa3f7b0e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T19:16:33Z","title_canon_sha256":"cbc557947ed39bd4f869404ebe5f39fd02f1725bae8d1397115726013d06f982"},"schema_version":"1.0","source":{"id":"1011.2740","kind":"arxiv","version":1}},"canonical_sha256":"f40fe851de24c1ad221684c5649bf7554ad05f4e0c150fc87a373e0255543e58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f40fe851de24c1ad221684c5649bf7554ad05f4e0c150fc87a373e0255543e58","first_computed_at":"2026-05-18T04:36:09.640128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:09.640128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+FXegNsRlFZqvpRUa4ywY1lRqD3szDUc3jG+uNBT2s5fCdz/oVLVli4pW765yV3aBwA4B7/myHC+3FIryjCSAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:09.640893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d8016230b3b565d538016331d80060d11f3c9a75cadbc674d1f11d5f608068","sha256:97e9f062acb8078963b49ca2e5fe2fc659b49151eb891e7cc8b353da3dcf5aad"],"state_sha256":"085a1bb9f864d4959d716d6bfb57497c15690a8285d68bd2e26d752adcb83524"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wy6azhWgQ51glDtXpEKcb5YpYMrti/ZDZiOGXvVC1Ly1x8R4y3UQFmuZ+ACqQn6duxrdnVy1wFSzjVcUa/UDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:00:20.932219Z","bundle_sha256":"275f5268ad83ec522862b4730dc7d5fc99af8be63c0cce54f46a95022e6ce156"}}