{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NGSX433UNNPLNA46HTJINFLUHT","short_pith_number":"pith:NGSX433U","canonical_record":{"source":{"id":"1801.04001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T21:42:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3172ade15e283c36080bc0ba61617b437c06335e767f1d86e4548f24ae7f13a","abstract_canon_sha256":"5c4323ef9abbd2747e5a1f162364f8944921035ae5ac857ebf0575f608c72bce"},"schema_version":"1.0"},"canonical_sha256":"69a57e6f746b5eb6839e3cd28695743ced1cfa35c3f941bff2990bc421595ba2","source":{"kind":"arxiv","id":"1801.04001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04001","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04001v1","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04001","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"NGSX433UNNPL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGSX433UNNPLNA46","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGSX433U","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NGSX433UNNPLNA46HTJINFLUHT","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T21:42:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3172ade15e283c36080bc0ba61617b437c06335e767f1d86e4548f24ae7f13a","abstract_canon_sha256":"5c4323ef9abbd2747e5a1f162364f8944921035ae5ac857ebf0575f608c72bce"},"schema_version":"1.0"},"canonical_sha256":"69a57e6f746b5eb6839e3cd28695743ced1cfa35c3f941bff2990bc421595ba2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:12.197605Z","signature_b64":"aiUp34nqminPWI+tQp8aA5MNSJg8z04mdo2Aj9PxIGnD/SvMaCdTNWK7gXmAR88Q+KcrnZcPD+jIz9ZJRhm7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a57e6f746b5eb6839e3cd28695743ced1cfa35c3f941bff2990bc421595ba2","last_reissued_at":"2026-05-18T00:26:12.197102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:12.197102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04001","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-18T00:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGa89NAKr5ROtTjgxOT8BUN5SmRI0UcbsSk+wGgzzQYjU5LhXdyIW8uIZ+nzYAfSp5W7mz3GE5MPXl2GESDdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:56:28.262124Z"},"content_sha256":"ece7e398359bc246bcfa11d6cf163e447037cf6e8fcb7720bff72ddecdab4981","schema_version":"1.0","event_id":"sha256:ece7e398359bc246bcfa11d6cf163e447037cf6e8fcb7720bff72ddecdab4981"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NGSX433UNNPLNA46HTJINFLUHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient C-RAN Random Access for IoT Devices: Learning Links via Recommendation Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenwei Wang, Haralabos Papadopoulos, Ozgun Y. Bursalioglu, Zheda Li","submitted_at":"2018-01-11T21:42:33Z","abstract_excerpt":"We focus on C-RAN random access protocols for IoT devices that yield low-latency high-rate active-device detection in dense networks of large-array remote radio heads. In this context, we study the problem of learning the strengths of links between detected devices and network sites. In particular, we develop recommendation-system inspired algorithms, which exploit random-access observations collected across the network to classify links between active devices and network sites across the network. Our simulations and analysis reveal the potential merit of data-driven schemes for such on-the-fl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04001","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-18T00:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82vgWBC8R8MLTYXAyeiI0sDnUVN+vu9i4cgoIweYDLXyJEZhAuXDyjdZCLkhO5Oxo/Kg1fwzZI+ESOL/m8/xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:56:28.262487Z"},"content_sha256":"a97270b6189ab1f4ed6f1752227b84284c86d5e0cd2970216691dff789b4d72d","schema_version":"1.0","event_id":"sha256:a97270b6189ab1f4ed6f1752227b84284c86d5e0cd2970216691dff789b4d72d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGSX433UNNPLNA46HTJINFLUHT/bundle.json","state_url":"https://pith.science/pith/NGSX433UNNPLNA46HTJINFLUHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGSX433UNNPLNA46HTJINFLUHT/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-03T18:56:28Z","links":{"resolver":"https://pith.science/pith/NGSX433UNNPLNA46HTJINFLUHT","bundle":"https://pith.science/pith/NGSX433UNNPLNA46HTJINFLUHT/bundle.json","state":"https://pith.science/pith/NGSX433UNNPLNA46HTJINFLUHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGSX433UNNPLNA46HTJINFLUHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NGSX433UNNPLNA46HTJINFLUHT","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":"5c4323ef9abbd2747e5a1f162364f8944921035ae5ac857ebf0575f608c72bce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T21:42:33Z","title_canon_sha256":"e3172ade15e283c36080bc0ba61617b437c06335e767f1d86e4548f24ae7f13a"},"schema_version":"1.0","source":{"id":"1801.04001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04001","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04001v1","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04001","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"NGSX433UNNPL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGSX433UNNPLNA46","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGSX433U","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a97270b6189ab1f4ed6f1752227b84284c86d5e0cd2970216691dff789b4d72d","target":"graph","created_at":"2026-05-18T00:26: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":"We focus on C-RAN random access protocols for IoT devices that yield low-latency high-rate active-device detection in dense networks of large-array remote radio heads. In this context, we study the problem of learning the strengths of links between detected devices and network sites. In particular, we develop recommendation-system inspired algorithms, which exploit random-access observations collected across the network to classify links between active devices and network sites across the network. Our simulations and analysis reveal the potential merit of data-driven schemes for such on-the-fl","authors_text":"Chenwei Wang, Haralabos Papadopoulos, Ozgun Y. Bursalioglu, Zheda Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T21:42:33Z","title":"Efficient C-RAN Random Access for IoT Devices: Learning Links via Recommendation Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04001","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:ece7e398359bc246bcfa11d6cf163e447037cf6e8fcb7720bff72ddecdab4981","target":"record","created_at":"2026-05-18T00:26: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":"5c4323ef9abbd2747e5a1f162364f8944921035ae5ac857ebf0575f608c72bce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T21:42:33Z","title_canon_sha256":"e3172ade15e283c36080bc0ba61617b437c06335e767f1d86e4548f24ae7f13a"},"schema_version":"1.0","source":{"id":"1801.04001","kind":"arxiv","version":1}},"canonical_sha256":"69a57e6f746b5eb6839e3cd28695743ced1cfa35c3f941bff2990bc421595ba2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69a57e6f746b5eb6839e3cd28695743ced1cfa35c3f941bff2990bc421595ba2","first_computed_at":"2026-05-18T00:26:12.197102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:12.197102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aiUp34nqminPWI+tQp8aA5MNSJg8z04mdo2Aj9PxIGnD/SvMaCdTNWK7gXmAR88Q+KcrnZcPD+jIz9ZJRhm7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:12.197605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ece7e398359bc246bcfa11d6cf163e447037cf6e8fcb7720bff72ddecdab4981","sha256:a97270b6189ab1f4ed6f1752227b84284c86d5e0cd2970216691dff789b4d72d"],"state_sha256":"f20a04fd9d7d1b44f90971bc1048e04b505fc78580c760e25f8cb91c8b87782c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1x0kvzwx0/eOrJyfnqYmZDsmmexSgNiennMS9KU8XMHHoUpXhQSfcfms1E0WbFFGM3+Vc/DuMj0waeLx713CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:56:28.264422Z","bundle_sha256":"060de85ff3a80a34dda43ecdc965c630d2f33418353d90f4fcae253158aaa58f"}}