{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WSIPT36HH6SEAYNWYVHP7MY7NB","short_pith_number":"pith:WSIPT36H","canonical_record":{"source":{"id":"1506.08478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T00:06:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9feae46ad259de836fa6b15c03a5bb60ccc854a1fce18a5edaf5997d7a0bac3c","abstract_canon_sha256":"09808a8666c7fe73e30e383093751b8b12ab4b8f3bb4e49f5f14f548a54f959b"},"schema_version":"1.0"},"canonical_sha256":"b490f9efc73fa44061b6c54effb31f684c19bfc6a7fe9ddc6801c9a6ed3b0623","source":{"kind":"arxiv","id":"1506.08478","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08478","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08478v3","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08478","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"pith_short_12","alias_value":"WSIPT36HH6SE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WSIPT36HH6SEAYNW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WSIPT36H","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WSIPT36HH6SEAYNWYVHP7MY7NB","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T00:06:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9feae46ad259de836fa6b15c03a5bb60ccc854a1fce18a5edaf5997d7a0bac3c","abstract_canon_sha256":"09808a8666c7fe73e30e383093751b8b12ab4b8f3bb4e49f5f14f548a54f959b"},"schema_version":"1.0"},"canonical_sha256":"b490f9efc73fa44061b6c54effb31f684c19bfc6a7fe9ddc6801c9a6ed3b0623","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:05.213572Z","signature_b64":"7vV0/GNNn7K0cXO3PAi0H4sfIxTp0IYC3ph2w+bjwlQF6b5ad5ObSDSmiCf0T09/T6JT1Jee99li6TXUigd7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b490f9efc73fa44061b6c54effb31f684c19bfc6a7fe9ddc6801c9a6ed3b0623","last_reissued_at":"2026-05-18T01:11:05.212888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:05.212888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08478","source_version":3,"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-18T01:11:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/b94uOVBjOdnJuUoVExEetIYNMXdnQISFr2FtnGsrDbZGJeuVm12lTWnltdseqwmCvRqV/nXMuoUTVgbqsvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:43:09.108792Z"},"content_sha256":"358f3dcf94c809c2eab3f4a232973074549c6b6c445d0599f758befd212afdd3","schema_version":"1.0","event_id":"sha256:358f3dcf94c809c2eab3f4a232973074549c6b6c445d0599f758befd212afdd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WSIPT36HH6SEAYNWYVHP7MY7NB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiuser Detection for Random Access Bandwidth Request in WiMAX","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Md Mashud Hyder","submitted_at":"2015-06-29T00:06:38Z","abstract_excerpt":"Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access bandwidth request context. We propose an enhanced random access scheme where the fixed/low-mobility M2M devices pre-equalize their random access codes using the estimated frequency response of the slowly-varying wireless channel. Consequently, we have developed two different multiuser detection algorithms. The first algorithm works in a greedy fashion where it pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08478","kind":"arxiv","version":3},"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-18T01:11:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xk5x2YzAUQqM7eRDBFa8EkelfYe7soW5FvYrxPtvuLsk7DpIQuQ2p2erOEoa7UDbX+hh7GWepg1TLWpJu1RsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:43:09.109277Z"},"content_sha256":"af6639390b1b3c00eba29d8ca40a5a7ac937141c82ab2d479a426e373d18c7b6","schema_version":"1.0","event_id":"sha256:af6639390b1b3c00eba29d8ca40a5a7ac937141c82ab2d479a426e373d18c7b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSIPT36HH6SEAYNWYVHP7MY7NB/bundle.json","state_url":"https://pith.science/pith/WSIPT36HH6SEAYNWYVHP7MY7NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSIPT36HH6SEAYNWYVHP7MY7NB/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-25T20:43:09Z","links":{"resolver":"https://pith.science/pith/WSIPT36HH6SEAYNWYVHP7MY7NB","bundle":"https://pith.science/pith/WSIPT36HH6SEAYNWYVHP7MY7NB/bundle.json","state":"https://pith.science/pith/WSIPT36HH6SEAYNWYVHP7MY7NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSIPT36HH6SEAYNWYVHP7MY7NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WSIPT36HH6SEAYNWYVHP7MY7NB","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":"09808a8666c7fe73e30e383093751b8b12ab4b8f3bb4e49f5f14f548a54f959b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T00:06:38Z","title_canon_sha256":"9feae46ad259de836fa6b15c03a5bb60ccc854a1fce18a5edaf5997d7a0bac3c"},"schema_version":"1.0","source":{"id":"1506.08478","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08478","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08478v3","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08478","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"pith_short_12","alias_value":"WSIPT36HH6SE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WSIPT36HH6SEAYNW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WSIPT36H","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:af6639390b1b3c00eba29d8ca40a5a7ac937141c82ab2d479a426e373d18c7b6","target":"graph","created_at":"2026-05-18T01:11:05Z","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":"Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access bandwidth request context. We propose an enhanced random access scheme where the fixed/low-mobility M2M devices pre-equalize their random access codes using the estimated frequency response of the slowly-varying wireless channel. Consequently, we have developed two different multiuser detection algorithms. The first algorithm works in a greedy fashion where it pe","authors_text":"Md Mashud Hyder","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T00:06:38Z","title":"Multiuser Detection for Random Access Bandwidth Request in WiMAX"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08478","kind":"arxiv","version":3},"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:358f3dcf94c809c2eab3f4a232973074549c6b6c445d0599f758befd212afdd3","target":"record","created_at":"2026-05-18T01:11:05Z","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":"09808a8666c7fe73e30e383093751b8b12ab4b8f3bb4e49f5f14f548a54f959b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T00:06:38Z","title_canon_sha256":"9feae46ad259de836fa6b15c03a5bb60ccc854a1fce18a5edaf5997d7a0bac3c"},"schema_version":"1.0","source":{"id":"1506.08478","kind":"arxiv","version":3}},"canonical_sha256":"b490f9efc73fa44061b6c54effb31f684c19bfc6a7fe9ddc6801c9a6ed3b0623","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b490f9efc73fa44061b6c54effb31f684c19bfc6a7fe9ddc6801c9a6ed3b0623","first_computed_at":"2026-05-18T01:11:05.212888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:05.212888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7vV0/GNNn7K0cXO3PAi0H4sfIxTp0IYC3ph2w+bjwlQF6b5ad5ObSDSmiCf0T09/T6JT1Jee99li6TXUigd7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:05.213572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08478","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:358f3dcf94c809c2eab3f4a232973074549c6b6c445d0599f758befd212afdd3","sha256:af6639390b1b3c00eba29d8ca40a5a7ac937141c82ab2d479a426e373d18c7b6"],"state_sha256":"e0af7de92759086ee61fd2259349d27f94dc1246ab5a3418e6f6a46cc9e16b02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9NEhTrrNWEK90JqB6YEcVRdgViSYktHAEkANnpGJ46+Fw0wUU7FyKvfzWEnMAXZgjYpHTEPtdHRWzSPgRJuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:43:09.111904Z","bundle_sha256":"d67cb812916b864b701bba0dec8e57195b9a416a6e6820b6ba330b2a289ada3d"}}