{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:37QDQ3YC353WEDVMZXPNS4N7NR","short_pith_number":"pith:37QDQ3YC","canonical_record":{"source":{"id":"1906.03817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-10T07:04:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b0b061538cf45de19d79a77f5772836c3a7dd56424d7e9aaf2c4235fb6e4f9c","abstract_canon_sha256":"fe079a2f4bc747c0b0646814aa4d4468b49deed07476e0044699f7ba9903ad20"},"schema_version":"1.0"},"canonical_sha256":"dfe0386f02df77620eaccdded971bf6c6f62611bef191e6e972a1c5fc2577067","source":{"kind":"arxiv","id":"1906.03817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03817","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03817v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03817","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"37QDQ3YC353W","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"37QDQ3YC353WEDVM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"37QDQ3YC","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:37QDQ3YC353WEDVMZXPNS4N7NR","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-10T07:04:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b0b061538cf45de19d79a77f5772836c3a7dd56424d7e9aaf2c4235fb6e4f9c","abstract_canon_sha256":"fe079a2f4bc747c0b0646814aa4d4468b49deed07476e0044699f7ba9903ad20"},"schema_version":"1.0"},"canonical_sha256":"dfe0386f02df77620eaccdded971bf6c6f62611bef191e6e972a1c5fc2577067","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:44.879781Z","signature_b64":"aan+sP0xlgVfo+PEKvLmQC/YIuwJkoy9Tfg9hitcIebUsxt8wUdp1ZwzWN+Cdjjhv7fxSzjW8kMj7R01kH9/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfe0386f02df77620eaccdded971bf6c6f62611bef191e6e972a1c5fc2577067","last_reissued_at":"2026-05-17T23:43:44.878937Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:44.878937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03817","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:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASapzUN8zD/lmTp8K1TonqlT0muFa89FTxfHqxBeMhtoyMNVRlh0nVufLKsiIMv9+m9nXDSEVywKnt0mKa5kCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:27:24.664278Z"},"content_sha256":"c4ee712551e858f600b57c12a70fd4719ec80b53575c6928d9a823bc82734798","schema_version":"1.0","event_id":"sha256:c4ee712551e858f600b57c12a70fd4719ec80b53575c6928d9a823bc82734798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:37QDQ3YC353WEDVMZXPNS4N7NR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Access for Massive Machine-Type Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Zhuo Sun","submitted_at":"2019-06-10T07:04:02Z","abstract_excerpt":"The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation scheme is designed for grant-free random access systems. We propose a decentralized transmission control and design a compressed sensing (CS)-based user identification and channel estimation scheme. We analyze the packet delay and throughput of the proposed scheme. We also optimize the transmission control scheme to maximize the system throughput. Second, a rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03817","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:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9cufEf639qbr3kDC/r4rz2jsTLGmBliedamHekAcqwu70K1hKavRws41okcoi3BT9VOzR88ID13YEskG/vsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:27:24.664971Z"},"content_sha256":"124b3ef1d6fd7aa921ae723218fe2f1c835b84b47fa7ae3061afdf4133902cb7","schema_version":"1.0","event_id":"sha256:124b3ef1d6fd7aa921ae723218fe2f1c835b84b47fa7ae3061afdf4133902cb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37QDQ3YC353WEDVMZXPNS4N7NR/bundle.json","state_url":"https://pith.science/pith/37QDQ3YC353WEDVMZXPNS4N7NR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37QDQ3YC353WEDVMZXPNS4N7NR/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-02T23:27:24Z","links":{"resolver":"https://pith.science/pith/37QDQ3YC353WEDVMZXPNS4N7NR","bundle":"https://pith.science/pith/37QDQ3YC353WEDVMZXPNS4N7NR/bundle.json","state":"https://pith.science/pith/37QDQ3YC353WEDVMZXPNS4N7NR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37QDQ3YC353WEDVMZXPNS4N7NR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:37QDQ3YC353WEDVMZXPNS4N7NR","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":"fe079a2f4bc747c0b0646814aa4d4468b49deed07476e0044699f7ba9903ad20","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-10T07:04:02Z","title_canon_sha256":"1b0b061538cf45de19d79a77f5772836c3a7dd56424d7e9aaf2c4235fb6e4f9c"},"schema_version":"1.0","source":{"id":"1906.03817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03817","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03817v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03817","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"37QDQ3YC353W","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"37QDQ3YC353WEDVM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"37QDQ3YC","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:124b3ef1d6fd7aa921ae723218fe2f1c835b84b47fa7ae3061afdf4133902cb7","target":"graph","created_at":"2026-05-17T23:43:44Z","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":"The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation scheme is designed for grant-free random access systems. We propose a decentralized transmission control and design a compressed sensing (CS)-based user identification and channel estimation scheme. We analyze the packet delay and throughput of the proposed scheme. We also optimize the transmission control scheme to maximize the system throughput. Second, a rando","authors_text":"Zhuo Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-10T07:04:02Z","title":"Random Access for Massive Machine-Type Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03817","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:c4ee712551e858f600b57c12a70fd4719ec80b53575c6928d9a823bc82734798","target":"record","created_at":"2026-05-17T23:43:44Z","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":"fe079a2f4bc747c0b0646814aa4d4468b49deed07476e0044699f7ba9903ad20","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-10T07:04:02Z","title_canon_sha256":"1b0b061538cf45de19d79a77f5772836c3a7dd56424d7e9aaf2c4235fb6e4f9c"},"schema_version":"1.0","source":{"id":"1906.03817","kind":"arxiv","version":1}},"canonical_sha256":"dfe0386f02df77620eaccdded971bf6c6f62611bef191e6e972a1c5fc2577067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfe0386f02df77620eaccdded971bf6c6f62611bef191e6e972a1c5fc2577067","first_computed_at":"2026-05-17T23:43:44.878937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:44.878937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aan+sP0xlgVfo+PEKvLmQC/YIuwJkoy9Tfg9hitcIebUsxt8wUdp1ZwzWN+Cdjjhv7fxSzjW8kMj7R01kH9/BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:44.879781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4ee712551e858f600b57c12a70fd4719ec80b53575c6928d9a823bc82734798","sha256:124b3ef1d6fd7aa921ae723218fe2f1c835b84b47fa7ae3061afdf4133902cb7"],"state_sha256":"7840dc1aa16efe951646ec8e89b531497b30ed733058dd6eacf47d8b53639a6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTM7tZpgts+hU+rYhERfKbOAyTOnjNOiCWrQ1mIGyijWGwIjxpWrCczysb/Mb8ZpRCOzKblP8TqlM6Pufn9/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:27:24.666934Z","bundle_sha256":"9762636cd25f5c1e04e47d3f15d10f9a7ccd18809b704506341216c934cbffb1"}}