{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UFM5TWVQWCJIPNGPZI3V24NAAI","short_pith_number":"pith:UFM5TWVQ","schema_version":"1.0","canonical_sha256":"a159d9dab0b09287b4cfca375d71a00229bfd233eada67c769ab146682fdee71","source":{"kind":"arxiv","id":"1809.07535","version":1},"attestation_state":"computed","paper":{"title":"Multiple Preambles for High Success Rate of Grant-Free Random Access with Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daiming Qu, Hao Jiang, Jie Ding, Tao Jiang","submitted_at":"2018-09-20T09:01:08Z","abstract_excerpt":"Grant-free random access (RA) with massive MIMO is a promising RA technique with low signaling overhead that provides significant benefits in increasing the channel reuse efficiency. Since user equipment (UE) detection and channel estimation in grant-free RA rely solely on the received preambles, preamble designs that enable high success rate of UE detection and channel estimation are very much in need to ensure the performance gain of grant-free RA with massive MIMO. In this paper, a super preamble consisting of multiple consecutive preambles is proposed for high success rate of grant-free RA"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-20T09:01:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44992ce1b3b68b75112cb55e3484a287d07bd6e279c041aa0f0d05ea1d812fed","abstract_canon_sha256":"e810462f1ca29ef2ddb6a9bfbd99a20c393ea06c7af13fbcbeceb643bdbf6a7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:16.010781Z","signature_b64":"SCskMb9BLWYL/hFMNU5e3aGQVKrXNff0rF7T5tETohs6bWFgnYdcJH9KR/AnatOezoo7vzBpJBnTDTFGBeyTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a159d9dab0b09287b4cfca375d71a00229bfd233eada67c769ab146682fdee71","last_reissued_at":"2026-05-18T00:05:16.010237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:16.010237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Preambles for High Success Rate of Grant-Free Random Access with Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daiming Qu, Hao Jiang, Jie Ding, Tao Jiang","submitted_at":"2018-09-20T09:01:08Z","abstract_excerpt":"Grant-free random access (RA) with massive MIMO is a promising RA technique with low signaling overhead that provides significant benefits in increasing the channel reuse efficiency. Since user equipment (UE) detection and channel estimation in grant-free RA rely solely on the received preambles, preamble designs that enable high success rate of UE detection and channel estimation are very much in need to ensure the performance gain of grant-free RA with massive MIMO. In this paper, a super preamble consisting of multiple consecutive preambles is proposed for high success rate of grant-free RA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07535","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.07535","created_at":"2026-05-18T00:05:16.010328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07535v1","created_at":"2026-05-18T00:05:16.010328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07535","created_at":"2026-05-18T00:05:16.010328+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFM5TWVQWCJI","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFM5TWVQWCJIPNGP","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFM5TWVQ","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI","json":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI.json","graph_json":"https://pith.science/api/pith-number/UFM5TWVQWCJIPNGPZI3V24NAAI/graph.json","events_json":"https://pith.science/api/pith-number/UFM5TWVQWCJIPNGPZI3V24NAAI/events.json","paper":"https://pith.science/paper/UFM5TWVQ"},"agent_actions":{"view_html":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI","download_json":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI.json","view_paper":"https://pith.science/paper/UFM5TWVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07535&json=true","fetch_graph":"https://pith.science/api/pith-number/UFM5TWVQWCJIPNGPZI3V24NAAI/graph.json","fetch_events":"https://pith.science/api/pith-number/UFM5TWVQWCJIPNGPZI3V24NAAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI/action/storage_attestation","attest_author":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI/action/author_attestation","sign_citation":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI/action/citation_signature","submit_replication":"https://pith.science/pith/UFM5TWVQWCJIPNGPZI3V24NAAI/action/replication_record"}},"created_at":"2026-05-18T00:05:16.010328+00:00","updated_at":"2026-05-18T00:05:16.010328+00:00"}