{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCB4TTWTATJVVS6D66DX7LTQAM","short_pith_number":"pith:DCB4TTWT","canonical_record":{"source":{"id":"1812.11242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-28T22:55:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccbec9599d712e028f5dbb95b25b98b0cdef7bcec86a585cfc99bb9de0292d87","abstract_canon_sha256":"320843fd7883753ab557fe04089ab152d266bbff5774e6bafa0669037bd2a7be"},"schema_version":"1.0"},"canonical_sha256":"1883c9ced304d35acbc3f7877fae70032cd7a6f8ae9429ee5c588b308c6fa2dd","source":{"kind":"arxiv","id":"1812.11242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11242","created_at":"2026-05-17T23:57:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11242v1","created_at":"2026-05-17T23:57:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11242","created_at":"2026-05-17T23:57:12Z"},{"alias_kind":"pith_short_12","alias_value":"DCB4TTWTATJV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCB4TTWTATJVVS6D","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCB4TTWT","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCB4TTWTATJVVS6D66DX7LTQAM","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-28T22:55:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccbec9599d712e028f5dbb95b25b98b0cdef7bcec86a585cfc99bb9de0292d87","abstract_canon_sha256":"320843fd7883753ab557fe04089ab152d266bbff5774e6bafa0669037bd2a7be"},"schema_version":"1.0"},"canonical_sha256":"1883c9ced304d35acbc3f7877fae70032cd7a6f8ae9429ee5c588b308c6fa2dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:12.462310Z","signature_b64":"ALFQdz60uz1lxSSG2C2AKf3eUSye1VGt9DKEDjcEeFjonvImDlo7cqKAx8PDgNTrgbwoFyu2WIbof5AR/TSUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1883c9ced304d35acbc3f7877fae70032cd7a6f8ae9429ee5c588b308c6fa2dd","last_reissued_at":"2026-05-17T23:57:12.461778Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:12.461778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11242","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-17T23:57:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFMC2mPyHUHl85q7A82YPphKaloaTsMrXxljD15pEXzGBbmkUZot1hI98b82hTJfD7FGLX5IruJTkcjNuAbJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:05:30.704607Z"},"content_sha256":"a9c832ffadd9cec58ac49235005a2da44e18098f1807607f1a5f7f9b05ba706c","schema_version":"1.0","event_id":"sha256:a9c832ffadd9cec58ac49235005a2da44e18098f1807607f1a5f7f9b05ba706c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCB4TTWTATJVVS6D66DX7LTQAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NOMA-based Compressive Random Access using Gaussian Spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinho Choi","submitted_at":"2018-12-28T22:55:33Z","abstract_excerpt":"Compressive random access (CRA) is a random access scheme that has been considered for massive machine-type communication (MTC) with non-orthogonal spreading sequences, where the notion of compressive sensing (CS) is used for low-complexity detectors by exploiting the sparse device activity. In this paper, we study the application of power-domain non-orthogonal multiple access (NOMA) to CRA in order to improve the performance of CRA (or increase the number of devices to be supported). We consider Gaussian spreading sequences and derive design criteria through a large-system analysis to determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11242","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-17T23:57:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvzTHWeG4Y3f8k47Q933JJkfs3x7JPCyDbzTYeqg7awfvjR9hx5J5mH3E9DyRuudYPkHFqJyQ01clFbrlj60AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:05:30.705292Z"},"content_sha256":"f99bb0dbf1b504435a35001b71a9c6e046d520cfa47864955a1176fe3f739d89","schema_version":"1.0","event_id":"sha256:f99bb0dbf1b504435a35001b71a9c6e046d520cfa47864955a1176fe3f739d89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCB4TTWTATJVVS6D66DX7LTQAM/bundle.json","state_url":"https://pith.science/pith/DCB4TTWTATJVVS6D66DX7LTQAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCB4TTWTATJVVS6D66DX7LTQAM/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-28T21:05:30Z","links":{"resolver":"https://pith.science/pith/DCB4TTWTATJVVS6D66DX7LTQAM","bundle":"https://pith.science/pith/DCB4TTWTATJVVS6D66DX7LTQAM/bundle.json","state":"https://pith.science/pith/DCB4TTWTATJVVS6D66DX7LTQAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCB4TTWTATJVVS6D66DX7LTQAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCB4TTWTATJVVS6D66DX7LTQAM","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":"320843fd7883753ab557fe04089ab152d266bbff5774e6bafa0669037bd2a7be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-28T22:55:33Z","title_canon_sha256":"ccbec9599d712e028f5dbb95b25b98b0cdef7bcec86a585cfc99bb9de0292d87"},"schema_version":"1.0","source":{"id":"1812.11242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11242","created_at":"2026-05-17T23:57:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11242v1","created_at":"2026-05-17T23:57:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11242","created_at":"2026-05-17T23:57:12Z"},{"alias_kind":"pith_short_12","alias_value":"DCB4TTWTATJV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCB4TTWTATJVVS6D","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCB4TTWT","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:f99bb0dbf1b504435a35001b71a9c6e046d520cfa47864955a1176fe3f739d89","target":"graph","created_at":"2026-05-17T23:57:12Z","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":"Compressive random access (CRA) is a random access scheme that has been considered for massive machine-type communication (MTC) with non-orthogonal spreading sequences, where the notion of compressive sensing (CS) is used for low-complexity detectors by exploiting the sparse device activity. In this paper, we study the application of power-domain non-orthogonal multiple access (NOMA) to CRA in order to improve the performance of CRA (or increase the number of devices to be supported). We consider Gaussian spreading sequences and derive design criteria through a large-system analysis to determi","authors_text":"Jinho Choi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-28T22:55:33Z","title":"NOMA-based Compressive Random Access using Gaussian Spreading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11242","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:a9c832ffadd9cec58ac49235005a2da44e18098f1807607f1a5f7f9b05ba706c","target":"record","created_at":"2026-05-17T23:57:12Z","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":"320843fd7883753ab557fe04089ab152d266bbff5774e6bafa0669037bd2a7be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-28T22:55:33Z","title_canon_sha256":"ccbec9599d712e028f5dbb95b25b98b0cdef7bcec86a585cfc99bb9de0292d87"},"schema_version":"1.0","source":{"id":"1812.11242","kind":"arxiv","version":1}},"canonical_sha256":"1883c9ced304d35acbc3f7877fae70032cd7a6f8ae9429ee5c588b308c6fa2dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1883c9ced304d35acbc3f7877fae70032cd7a6f8ae9429ee5c588b308c6fa2dd","first_computed_at":"2026-05-17T23:57:12.461778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:12.461778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ALFQdz60uz1lxSSG2C2AKf3eUSye1VGt9DKEDjcEeFjonvImDlo7cqKAx8PDgNTrgbwoFyu2WIbof5AR/TSUBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:12.462310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9c832ffadd9cec58ac49235005a2da44e18098f1807607f1a5f7f9b05ba706c","sha256:f99bb0dbf1b504435a35001b71a9c6e046d520cfa47864955a1176fe3f739d89"],"state_sha256":"c0276d3031edca3e4a830b3c9b5bf30e74fcedddda230f43426b7c747752daa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jB1mc8P8PX+vskdKnxKpJfVFe/GTGBppBXQqZrl4uGcJkr+QpGiU6UJ87L7B1mghZ4CLrYQILxEGspyEop4mDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:05:30.708990Z","bundle_sha256":"ba558943c6beadfc8bed1993383f16d7756a2b57f764efc3fd7b0b1d7f8df8a7"}}