{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MPJPAERJE4X72SBCO3VNYJOPV7","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":"7eee6e2156617590ebb0163bd702a6a46e772f105c68d412c3d012ffa460057a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-16T00:13:49Z","title_canon_sha256":"2ba0cc242f498d1e891343857425ef67ed5574168ae647a87f976ec5983480dd"},"schema_version":"1.0","source":{"id":"1905.06479","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06479","created_at":"2026-07-05T01:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06479v4","created_at":"2026-07-05T01:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06479","created_at":"2026-07-05T01:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"MPJPAERJE4X7","created_at":"2026-07-05T01:51:58Z"},{"alias_kind":"pith_short_16","alias_value":"MPJPAERJE4X72SBC","created_at":"2026-07-05T01:51:58Z"},{"alias_kind":"pith_short_8","alias_value":"MPJPAERJ","created_at":"2026-07-05T01:51:58Z"}],"graph_snapshots":[{"event_id":"sha256:bbe4c4f025ce447237ff60dbce051edf10431610fce6cf1d46930b33585e1116","target":"graph","created_at":"2026-07-05T01:51:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.06479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the massive random access Gaussian channel with a focus on small payloads. For this problem, grant-based schemes have been regarded as inefficient due to the necessity of large feedbacks and the use of inefficient scheduling request methods. This papers attempts to answer whether grant-based schemes can be competitive against state-ot-art grantless schemes and worthy of further investigation. In order to compare these schemes fairly, a novel model is proposed, and, under this model, a novel grant-based scheme is proposed. The scheme uses Ordentlich and Polyanskiy's gran","authors_text":"Danilo Silva, Gustavo Kasper Facenda","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-16T00:13:49Z","title":"Efficient Scheduling for the Massive Random Access Gaussian Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06479","kind":"arxiv","version":4},"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:a3e8723ff9117f860d235e4c1d767627f5f6b1ab7ab79a88ea13a9eaa16ac320","target":"record","created_at":"2026-07-05T01:51:58Z","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":"7eee6e2156617590ebb0163bd702a6a46e772f105c68d412c3d012ffa460057a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-16T00:13:49Z","title_canon_sha256":"2ba0cc242f498d1e891343857425ef67ed5574168ae647a87f976ec5983480dd"},"schema_version":"1.0","source":{"id":"1905.06479","kind":"arxiv","version":4}},"canonical_sha256":"63d2f01229272ffd482276eadc25cfaff6293695062ad524e8ede79f35a2854d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63d2f01229272ffd482276eadc25cfaff6293695062ad524e8ede79f35a2854d","first_computed_at":"2026-07-05T01:51:58.703967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:58.703967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"425VrxKvDKX0gJO+RBOye+9JuA+9fevT91sDPaVJLZBs4ehCx5zfFFDNOOOZb1dyJtzvEzliz3cvb+xMbJAoAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:58.704403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06479","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3e8723ff9117f860d235e4c1d767627f5f6b1ab7ab79a88ea13a9eaa16ac320","sha256:bbe4c4f025ce447237ff60dbce051edf10431610fce6cf1d46930b33585e1116"],"state_sha256":"c37da546a0a4bb9e470bf388b26632d4b9842e1f014d88046d7ad292f8f486cb"}