{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ATH766ARSI6AO4CLBJPPLW4NSK","short_pith_number":"pith:ATH766AR","canonical_record":{"source":{"id":"1611.00491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-02T07:36:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ab17b9b36c0d1e69579f8d95decaa3e2c7854c7d6cf496e54cf413686f37ed6","abstract_canon_sha256":"1e9b68de50bc0ed6ac3064ba084a1140794b166ae81f408f374330b5cac4bd0e"},"schema_version":"1.0"},"canonical_sha256":"04cfff7811923c07704b0a5ef5db8d928c6979a000d6bc1b3090fbbf671ee32f","source":{"kind":"arxiv","id":"1611.00491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00491","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00491v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00491","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"ATH766ARSI6A","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATH766ARSI6AO4CL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATH766AR","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ATH766ARSI6AO4CLBJPPLW4NSK","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-02T07:36:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ab17b9b36c0d1e69579f8d95decaa3e2c7854c7d6cf496e54cf413686f37ed6","abstract_canon_sha256":"1e9b68de50bc0ed6ac3064ba084a1140794b166ae81f408f374330b5cac4bd0e"},"schema_version":"1.0"},"canonical_sha256":"04cfff7811923c07704b0a5ef5db8d928c6979a000d6bc1b3090fbbf671ee32f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.659528Z","signature_b64":"PK4nhP/wxDGfdcJ2ug1vTdtjM+39wZH0b5OTY+NaOPWn7jQvvoss95j6acD27YmyiAR1Bxzr7vhUJDGujdsPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04cfff7811923c07704b0a5ef5db8d928c6979a000d6bc1b3090fbbf671ee32f","last_reissued_at":"2026-05-18T01:00:32.658850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.658850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00491","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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xsjvqqOanCukO5k0nYxN/3Mnms9zSF6WQfMy9IpT9dOcnu4c+9HB9Ndg6+5wxGdMyxQmD7qBQs/EMyuUJUEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:28:25.483602Z"},"content_sha256":"6c2621592ffca1f2123f7305a7b52bd63e4c7298d133121e45b19b37b5114e98","schema_version":"1.0","event_id":"sha256:6c2621592ffca1f2123f7305a7b52bd63e4c7298d133121e45b19b37b5114e98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ATH766ARSI6AO4CLBJPPLW4NSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A High Throughput Pilot Allocation for M2M Communication in Crowded Massive MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huimei Han, Xudong Guo, Ying Li","submitted_at":"2016-11-02T07:36:23Z","abstract_excerpt":"A new scheme to resolve the intra-cell pilot collision for M2M communication in crowded massive multiple-input multiple-output (MIMO) systems is proposed. The proposed scheme permits those failed user equipments (UEs), judged by a strongest-user collision resolution (SUCR) protocol, to contend for the idle pilots, i.e., the pilots that are not selected by any UE in the initial step. This scheme is called as SUCR combined idle pilots access (SUCR-IPA). To analyze the performance of the SUCR-IPA scheme, we develop a simple method to compute the access success probability of the UEs in each rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00491","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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5B73cSKPkzTI6eirt5vIIhMe4E2nMeNK8dyfX+9hNKivyjPWYKmWLm2czF6HmqUSasBLO1bEXtSq4BjgzEEGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:28:25.484365Z"},"content_sha256":"6530fd5771c51cbd8409282a73bef7e8367d1c9a21a0a38506ff65a39c5ffc91","schema_version":"1.0","event_id":"sha256:6530fd5771c51cbd8409282a73bef7e8367d1c9a21a0a38506ff65a39c5ffc91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATH766ARSI6AO4CLBJPPLW4NSK/bundle.json","state_url":"https://pith.science/pith/ATH766ARSI6AO4CLBJPPLW4NSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATH766ARSI6AO4CLBJPPLW4NSK/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-31T13:28:25Z","links":{"resolver":"https://pith.science/pith/ATH766ARSI6AO4CLBJPPLW4NSK","bundle":"https://pith.science/pith/ATH766ARSI6AO4CLBJPPLW4NSK/bundle.json","state":"https://pith.science/pith/ATH766ARSI6AO4CLBJPPLW4NSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATH766ARSI6AO4CLBJPPLW4NSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ATH766ARSI6AO4CLBJPPLW4NSK","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":"1e9b68de50bc0ed6ac3064ba084a1140794b166ae81f408f374330b5cac4bd0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-02T07:36:23Z","title_canon_sha256":"3ab17b9b36c0d1e69579f8d95decaa3e2c7854c7d6cf496e54cf413686f37ed6"},"schema_version":"1.0","source":{"id":"1611.00491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00491","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00491v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00491","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"ATH766ARSI6A","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATH766ARSI6AO4CL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATH766AR","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:6530fd5771c51cbd8409282a73bef7e8367d1c9a21a0a38506ff65a39c5ffc91","target":"graph","created_at":"2026-05-18T01:00:32Z","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":"A new scheme to resolve the intra-cell pilot collision for M2M communication in crowded massive multiple-input multiple-output (MIMO) systems is proposed. The proposed scheme permits those failed user equipments (UEs), judged by a strongest-user collision resolution (SUCR) protocol, to contend for the idle pilots, i.e., the pilots that are not selected by any UE in the initial step. This scheme is called as SUCR combined idle pilots access (SUCR-IPA). To analyze the performance of the SUCR-IPA scheme, we develop a simple method to compute the access success probability of the UEs in each rando","authors_text":"Huimei Han, Xudong Guo, Ying Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-02T07:36:23Z","title":"A High Throughput Pilot Allocation for M2M Communication in Crowded Massive MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00491","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:6c2621592ffca1f2123f7305a7b52bd63e4c7298d133121e45b19b37b5114e98","target":"record","created_at":"2026-05-18T01:00:32Z","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":"1e9b68de50bc0ed6ac3064ba084a1140794b166ae81f408f374330b5cac4bd0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-02T07:36:23Z","title_canon_sha256":"3ab17b9b36c0d1e69579f8d95decaa3e2c7854c7d6cf496e54cf413686f37ed6"},"schema_version":"1.0","source":{"id":"1611.00491","kind":"arxiv","version":1}},"canonical_sha256":"04cfff7811923c07704b0a5ef5db8d928c6979a000d6bc1b3090fbbf671ee32f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04cfff7811923c07704b0a5ef5db8d928c6979a000d6bc1b3090fbbf671ee32f","first_computed_at":"2026-05-18T01:00:32.658850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.658850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PK4nhP/wxDGfdcJ2ug1vTdtjM+39wZH0b5OTY+NaOPWn7jQvvoss95j6acD27YmyiAR1Bxzr7vhUJDGujdsPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.659528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c2621592ffca1f2123f7305a7b52bd63e4c7298d133121e45b19b37b5114e98","sha256:6530fd5771c51cbd8409282a73bef7e8367d1c9a21a0a38506ff65a39c5ffc91"],"state_sha256":"4fd7acfc1ae67dee88878019659797d7b116b6ed522be5c15f3023be845ef695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQj8epbflvnpXzPIm1E8QTfrFQlse795NAxdXdsm8YcxBULWqvVHGaC3WLn5UmpSSQs91kGurHJz3mzySP+CAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:28:25.488332Z","bundle_sha256":"fe95461fb80d3642817388506206c828af81abbdbe1e76c60bd115e6090b3101"}}