{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SVQT2RB3SOO3HAAVDIKA2LYFGE","short_pith_number":"pith:SVQT2RB3","canonical_record":{"source":{"id":"1803.03610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-09T17:37:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b2ae4cfa7dd9dd411702cf712688481c1ef124789ba0372183d71b268eda350","abstract_canon_sha256":"0c72b64b154cc62eae8cf6931054cae2e211c04dd9e7e9a72191965ffb2b32e1"},"schema_version":"1.0"},"canonical_sha256":"95613d443b939db380151a140d2f05310daa90e7297c765838ef7c337d45156c","source":{"kind":"arxiv","id":"1803.03610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03610","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03610v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03610","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"SVQT2RB3SOO3","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SVQT2RB3SOO3HAAV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SVQT2RB3","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SVQT2RB3SOO3HAAVDIKA2LYFGE","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-09T17:37:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b2ae4cfa7dd9dd411702cf712688481c1ef124789ba0372183d71b268eda350","abstract_canon_sha256":"0c72b64b154cc62eae8cf6931054cae2e211c04dd9e7e9a72191965ffb2b32e1"},"schema_version":"1.0"},"canonical_sha256":"95613d443b939db380151a140d2f05310daa90e7297c765838ef7c337d45156c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.955618Z","signature_b64":"5PDJxh45DQxCprwDawJm4mrsCHEEv7wpH4/FbO7HB59yqC7RKfgp84tFeUaJLjd6Ss0kSgp2fQn4Hdt9r8h1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95613d443b939db380151a140d2f05310daa90e7297c765838ef7c337d45156c","last_reissued_at":"2026-05-18T00:21:38.954890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.954890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03610","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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkNMoVvSwAs0tnDKqxQzhJXbPH+SCpvqJSI33d9tijvLirSkNcDjA6Zuzc4fJ84k7TBEZX1Fr9pG3cUJEucVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:05:08.768480Z"},"content_sha256":"1a17aba2599a69d702ca7af531bf6b13d82bdff36f69b153871230ca0e504469","schema_version":"1.0","event_id":"sha256:1a17aba2599a69d702ca7af531bf6b13d82bdff36f69b153871230ca0e504469"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SVQT2RB3SOO3HAAVDIKA2LYFGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Access Schemes in Wireless Systems With Correlated User Activity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Ellersgaard Kal{\\o}r, Osama A. Hanna, Petar Popovski","submitted_at":"2018-03-09T17:37:27Z","abstract_excerpt":"Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to exhibit a high degree of correlation, e.g. because they observe the same physical phenomenon. This paves the way to devise access schemes that combine scheduling and random access, which is the topic of this work. The underlying idea is to schedule highly correlated users in such a way that their transmissions are less likely to result in a collision. To th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03610","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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmE+zCc0pRK7Hxz5pWnh64GOfttXcp7h5G520f39a765CNoWzA3d0Oymca9Xbtpxn5XqXBzQh9ptskFXPvudBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:05:08.769391Z"},"content_sha256":"cd64735c0b270dc292056d4dda1865586a3261e308c6b949bd36bfb32892faa4","schema_version":"1.0","event_id":"sha256:cd64735c0b270dc292056d4dda1865586a3261e308c6b949bd36bfb32892faa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE/bundle.json","state_url":"https://pith.science/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE/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-26T15:05:08Z","links":{"resolver":"https://pith.science/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE","bundle":"https://pith.science/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE/bundle.json","state":"https://pith.science/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVQT2RB3SOO3HAAVDIKA2LYFGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SVQT2RB3SOO3HAAVDIKA2LYFGE","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":"0c72b64b154cc62eae8cf6931054cae2e211c04dd9e7e9a72191965ffb2b32e1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-09T17:37:27Z","title_canon_sha256":"3b2ae4cfa7dd9dd411702cf712688481c1ef124789ba0372183d71b268eda350"},"schema_version":"1.0","source":{"id":"1803.03610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03610","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03610v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03610","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"SVQT2RB3SOO3","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SVQT2RB3SOO3HAAV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SVQT2RB3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:cd64735c0b270dc292056d4dda1865586a3261e308c6b949bd36bfb32892faa4","target":"graph","created_at":"2026-05-18T00:21:38Z","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":"Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to exhibit a high degree of correlation, e.g. because they observe the same physical phenomenon. This paves the way to devise access schemes that combine scheduling and random access, which is the topic of this work. The underlying idea is to schedule highly correlated users in such a way that their transmissions are less likely to result in a collision. To th","authors_text":"Anders Ellersgaard Kal{\\o}r, Osama A. Hanna, Petar Popovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-09T17:37:27Z","title":"Random Access Schemes in Wireless Systems With Correlated User Activity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03610","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:1a17aba2599a69d702ca7af531bf6b13d82bdff36f69b153871230ca0e504469","target":"record","created_at":"2026-05-18T00:21:38Z","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":"0c72b64b154cc62eae8cf6931054cae2e211c04dd9e7e9a72191965ffb2b32e1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-09T17:37:27Z","title_canon_sha256":"3b2ae4cfa7dd9dd411702cf712688481c1ef124789ba0372183d71b268eda350"},"schema_version":"1.0","source":{"id":"1803.03610","kind":"arxiv","version":1}},"canonical_sha256":"95613d443b939db380151a140d2f05310daa90e7297c765838ef7c337d45156c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95613d443b939db380151a140d2f05310daa90e7297c765838ef7c337d45156c","first_computed_at":"2026-05-18T00:21:38.954890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:38.954890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5PDJxh45DQxCprwDawJm4mrsCHEEv7wpH4/FbO7HB59yqC7RKfgp84tFeUaJLjd6Ss0kSgp2fQn4Hdt9r8h1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:38.955618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a17aba2599a69d702ca7af531bf6b13d82bdff36f69b153871230ca0e504469","sha256:cd64735c0b270dc292056d4dda1865586a3261e308c6b949bd36bfb32892faa4"],"state_sha256":"60b1295e2c17e99890403791ac2f48af95d39167b8b28cbfbcb37a96239cc2f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqxDP3m1+MKnoaoUNB7q/Q40TXWAFn5k3XChO0bs7NCrhJm+LPmROVTfYiAyOfv2h+SZeNVwl76ABMdpZgeUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:05:08.772583Z","bundle_sha256":"36643db09c185c1a56a581310364745f11054b390db9c8365729f765c75402f9"}}