{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XHPQO7YLVBRDC43JA7V6UJBKM5","short_pith_number":"pith:XHPQO7YL","canonical_record":{"source":{"id":"1309.5854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-09-01T22:14:52Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"1ce0bc7b14b812276cebd8f294a2b8b2804ed30a4c49ae2242f4f43e1f610253","abstract_canon_sha256":"3aad8ee4769d536fbb49823726f068638450e800a5a32017df9af31330c7a0ea"},"schema_version":"1.0"},"canonical_sha256":"b9df077f0ba86231736907ebea242a674af9a24b508dacd0037683aa008746c1","source":{"kind":"arxiv","id":"1309.5854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5854","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5854v1","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5854","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"XHPQO7YLVBRD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XHPQO7YLVBRDC43J","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XHPQO7YL","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XHPQO7YLVBRDC43JA7V6UJBKM5","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-09-01T22:14:52Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"1ce0bc7b14b812276cebd8f294a2b8b2804ed30a4c49ae2242f4f43e1f610253","abstract_canon_sha256":"3aad8ee4769d536fbb49823726f068638450e800a5a32017df9af31330c7a0ea"},"schema_version":"1.0"},"canonical_sha256":"b9df077f0ba86231736907ebea242a674af9a24b508dacd0037683aa008746c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:33.908148Z","signature_b64":"VVNjA6er9nLYQIxer//dvMogj3j4WvujJwbpB8MUnWXAJ0Zn9SIEwTUhSQ4hBWLqcnBcl2kpVdPPgMNah/hBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9df077f0ba86231736907ebea242a674af9a24b508dacd0037683aa008746c1","last_reissued_at":"2026-05-18T03:12:33.907485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:33.907485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5854","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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rermEG2aSzvNx0crGDSmFy2DFfhy8yOcaXwlBSVWwvk0xfOquzDzEM3uIz8pWeOpGeFogLQosiMFCJJvyZVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:39:46.861731Z"},"content_sha256":"e1dca5909fca80605222727bfe5ebb29bf5c6976e0371a163e9e79801f07b276","schema_version":"1.0","event_id":"sha256:e1dca5909fca80605222727bfe5ebb29bf5c6976e0371a163e9e79801f07b276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XHPQO7YLVBRDC43JA7V6UJBKM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Demodulation of Sparse PPM Signals with Low Samples Using Trained RIP Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.OH","authors_text":"Mahrokh G. Shayesteh, Mehdi Chehel Amirani, Seyed Hossein Hosseini","submitted_at":"2013-09-01T22:14:52Z","abstract_excerpt":"Compressed sensing (CS) theory considers the restricted isometry property (RIP) as a sufficient condition for measurement matrix which guarantees the recovery of any sparse signal from its compressed measurements. The RIP condition also preserves enough information for classification of sparse symbols, even with fewer measurements. In this work, we utilize RIP bound as the cost function for training a simple neural network in order to exploit the near optimal measurements or equivalently near optimal features for classification of a known set of sparse symbols. As an example, we consider demod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5854","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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7ZpsV3WW4jjRCdT+mHpFzLFigee96f174oiVYfcIovKjBjXimlGTeiIoqhqMn/Oi/hbh6+OJtfePl/B7u+zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:39:46.862074Z"},"content_sha256":"a42fd7b29729c0136a9c0566d8b26d8971a44ea84e8e7d2b9f265a23b481166b","schema_version":"1.0","event_id":"sha256:a42fd7b29729c0136a9c0566d8b26d8971a44ea84e8e7d2b9f265a23b481166b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHPQO7YLVBRDC43JA7V6UJBKM5/bundle.json","state_url":"https://pith.science/pith/XHPQO7YLVBRDC43JA7V6UJBKM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHPQO7YLVBRDC43JA7V6UJBKM5/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-26T18:39:46Z","links":{"resolver":"https://pith.science/pith/XHPQO7YLVBRDC43JA7V6UJBKM5","bundle":"https://pith.science/pith/XHPQO7YLVBRDC43JA7V6UJBKM5/bundle.json","state":"https://pith.science/pith/XHPQO7YLVBRDC43JA7V6UJBKM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHPQO7YLVBRDC43JA7V6UJBKM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XHPQO7YLVBRDC43JA7V6UJBKM5","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":"3aad8ee4769d536fbb49823726f068638450e800a5a32017df9af31330c7a0ea","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-09-01T22:14:52Z","title_canon_sha256":"1ce0bc7b14b812276cebd8f294a2b8b2804ed30a4c49ae2242f4f43e1f610253"},"schema_version":"1.0","source":{"id":"1309.5854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5854","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5854v1","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5854","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"XHPQO7YLVBRD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XHPQO7YLVBRDC43J","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XHPQO7YL","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:a42fd7b29729c0136a9c0566d8b26d8971a44ea84e8e7d2b9f265a23b481166b","target":"graph","created_at":"2026-05-18T03:12:33Z","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 (CS) theory considers the restricted isometry property (RIP) as a sufficient condition for measurement matrix which guarantees the recovery of any sparse signal from its compressed measurements. The RIP condition also preserves enough information for classification of sparse symbols, even with fewer measurements. In this work, we utilize RIP bound as the cost function for training a simple neural network in order to exploit the near optimal measurements or equivalently near optimal features for classification of a known set of sparse symbols. As an example, we consider demod","authors_text":"Mahrokh G. Shayesteh, Mehdi Chehel Amirani, Seyed Hossein Hosseini","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-09-01T22:14:52Z","title":"Demodulation of Sparse PPM Signals with Low Samples Using Trained RIP Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5854","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:e1dca5909fca80605222727bfe5ebb29bf5c6976e0371a163e9e79801f07b276","target":"record","created_at":"2026-05-18T03:12:33Z","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":"3aad8ee4769d536fbb49823726f068638450e800a5a32017df9af31330c7a0ea","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-09-01T22:14:52Z","title_canon_sha256":"1ce0bc7b14b812276cebd8f294a2b8b2804ed30a4c49ae2242f4f43e1f610253"},"schema_version":"1.0","source":{"id":"1309.5854","kind":"arxiv","version":1}},"canonical_sha256":"b9df077f0ba86231736907ebea242a674af9a24b508dacd0037683aa008746c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9df077f0ba86231736907ebea242a674af9a24b508dacd0037683aa008746c1","first_computed_at":"2026-05-18T03:12:33.907485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:33.907485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVNjA6er9nLYQIxer//dvMogj3j4WvujJwbpB8MUnWXAJ0Zn9SIEwTUhSQ4hBWLqcnBcl2kpVdPPgMNah/hBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:33.908148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1dca5909fca80605222727bfe5ebb29bf5c6976e0371a163e9e79801f07b276","sha256:a42fd7b29729c0136a9c0566d8b26d8971a44ea84e8e7d2b9f265a23b481166b"],"state_sha256":"81799247b3be76bf466e21cdeb2c7bb5660963def848ee1bbcd2bf8c2ab2ab82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsoqBupiwa/SOGJELvAi4DUqTMNszWO+sId+jdonr+w+ms6zkmZEgGpZYVF3QglJilAUCk6/pvnb+bgnUVvDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T18:39:46.864007Z","bundle_sha256":"8765657ba68a64c45fe513d110627cda7a079865f69b32788391685585854b76"}}