{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LMBWCSY5F46C4UQ4V3BLKCKONI","short_pith_number":"pith:LMBWCSY5","canonical_record":{"source":{"id":"1903.09759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-23T04:57:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7ab26c078803f7df90d174e94dacd1ade33ffd482f00d52218d8a0c4abcc38e","abstract_canon_sha256":"ef57c5dead700a8818975c026167e4bb9b35981985f3faecef8b405c65d97faa"},"schema_version":"1.0"},"canonical_sha256":"5b03614b1d2f3c2e521caec2b5094e6a0269dbadde9bcbdb2e71b63cf275892e","source":{"kind":"arxiv","id":"1903.09759","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09759","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09759v1","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09759","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"pith_short_12","alias_value":"LMBWCSY5F46C","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LMBWCSY5F46C4UQ4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LMBWCSY5","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LMBWCSY5F46C4UQ4V3BLKCKONI","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-23T04:57:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7ab26c078803f7df90d174e94dacd1ade33ffd482f00d52218d8a0c4abcc38e","abstract_canon_sha256":"ef57c5dead700a8818975c026167e4bb9b35981985f3faecef8b405c65d97faa"},"schema_version":"1.0"},"canonical_sha256":"5b03614b1d2f3c2e521caec2b5094e6a0269dbadde9bcbdb2e71b63cf275892e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:20.439905Z","signature_b64":"Q6i4TSAeKVXWog3GKew4p9MTbsYDwRITc2Xm1jUXpPhMbS6loaZVJ/CfPkB/NH+Qz/vWUg11NyOcDoyEwL5nCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b03614b1d2f3c2e521caec2b5094e6a0269dbadde9bcbdb2e71b63cf275892e","last_reissued_at":"2026-05-17T23:42:20.439308Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:20.439308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09759","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:42:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BdkE4z00wl+dB9YA1JPFjFvlX4pt/08twl0O53IB1OLZGYmYC4W4NEJ+0k0Js/Z/2zVm+z8hA32WKO6n2JtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:56:07.107987Z"},"content_sha256":"57afb62240dfff06c2199c87b6c20c853582843ea677fcbd8feb747edb65b91d","schema_version":"1.0","event_id":"sha256:57afb62240dfff06c2199c87b6c20c853582843ea677fcbd8feb747edb65b91d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LMBWCSY5F46C4UQ4V3BLKCKONI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Active User Detection and Channel Estimation in Massive Access Systems Exploiting Reed-Muller Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jue Wang, Lajos Hanzo, Zhaoyang Zhang","submitted_at":"2019-03-23T04:57:43Z","abstract_excerpt":"The requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user detection and channel estimation. In this paper, we exploit the vast sequence space and the beneficial nested structure of the length-$2^m$ second-order Reed-Muller (RM) sequences for designing an efficient RA scheme, which is capable of reliably detecting multiple active users from the set of unknown potential users with a size as large as $2^{m(m-1)/2}$, whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09759","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:42:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZiMIaQCvmDQE3lIIUr/z811Yb3L97taTY3i51U0t2kwgBXi+S5/G/whk6vq+HCwSF/jZXIdYfntMa3uWvRbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:56:07.108401Z"},"content_sha256":"2dd959a66237156010008ec3e5bc480ecb21d0134e2d2839e2aa8a93b7f49079","schema_version":"1.0","event_id":"sha256:2dd959a66237156010008ec3e5bc480ecb21d0134e2d2839e2aa8a93b7f49079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMBWCSY5F46C4UQ4V3BLKCKONI/bundle.json","state_url":"https://pith.science/pith/LMBWCSY5F46C4UQ4V3BLKCKONI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMBWCSY5F46C4UQ4V3BLKCKONI/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-24T11:56:07Z","links":{"resolver":"https://pith.science/pith/LMBWCSY5F46C4UQ4V3BLKCKONI","bundle":"https://pith.science/pith/LMBWCSY5F46C4UQ4V3BLKCKONI/bundle.json","state":"https://pith.science/pith/LMBWCSY5F46C4UQ4V3BLKCKONI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMBWCSY5F46C4UQ4V3BLKCKONI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LMBWCSY5F46C4UQ4V3BLKCKONI","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":"ef57c5dead700a8818975c026167e4bb9b35981985f3faecef8b405c65d97faa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-23T04:57:43Z","title_canon_sha256":"f7ab26c078803f7df90d174e94dacd1ade33ffd482f00d52218d8a0c4abcc38e"},"schema_version":"1.0","source":{"id":"1903.09759","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09759","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09759v1","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09759","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"pith_short_12","alias_value":"LMBWCSY5F46C","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LMBWCSY5F46C4UQ4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LMBWCSY5","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2dd959a66237156010008ec3e5bc480ecb21d0134e2d2839e2aa8a93b7f49079","target":"graph","created_at":"2026-05-17T23:42:20Z","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 requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user detection and channel estimation. In this paper, we exploit the vast sequence space and the beneficial nested structure of the length-$2^m$ second-order Reed-Muller (RM) sequences for designing an efficient RA scheme, which is capable of reliably detecting multiple active users from the set of unknown potential users with a size as large as $2^{m(m-1)/2}$, whil","authors_text":"Jue Wang, Lajos Hanzo, Zhaoyang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-23T04:57:43Z","title":"Joint Active User Detection and Channel Estimation in Massive Access Systems Exploiting Reed-Muller Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09759","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:57afb62240dfff06c2199c87b6c20c853582843ea677fcbd8feb747edb65b91d","target":"record","created_at":"2026-05-17T23:42:20Z","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":"ef57c5dead700a8818975c026167e4bb9b35981985f3faecef8b405c65d97faa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-23T04:57:43Z","title_canon_sha256":"f7ab26c078803f7df90d174e94dacd1ade33ffd482f00d52218d8a0c4abcc38e"},"schema_version":"1.0","source":{"id":"1903.09759","kind":"arxiv","version":1}},"canonical_sha256":"5b03614b1d2f3c2e521caec2b5094e6a0269dbadde9bcbdb2e71b63cf275892e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b03614b1d2f3c2e521caec2b5094e6a0269dbadde9bcbdb2e71b63cf275892e","first_computed_at":"2026-05-17T23:42:20.439308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:20.439308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q6i4TSAeKVXWog3GKew4p9MTbsYDwRITc2Xm1jUXpPhMbS6loaZVJ/CfPkB/NH+Qz/vWUg11NyOcDoyEwL5nCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:20.439905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09759","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57afb62240dfff06c2199c87b6c20c853582843ea677fcbd8feb747edb65b91d","sha256:2dd959a66237156010008ec3e5bc480ecb21d0134e2d2839e2aa8a93b7f49079"],"state_sha256":"9639c43984cf4b48d52be32f049aa42e4d77ef6e0675bc2436eeeae0bb5d04bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rGRH2QrLDMLMbWtaW8ac7MQCr7iOpIi5NmCAoAe9CvvQnI/sN4Dt+PG+ngqlb4XCIu2J7oIUBxqw8ljdBAjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:56:07.110803Z","bundle_sha256":"8c2578037d3c6c1a017d7a8211f27a4f76f7b09e6f4b825734e2bc3ea4552154"}}