{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MPJPAERJE4X72SBCO3VNYJOPV7","short_pith_number":"pith:MPJPAERJ","schema_version":"1.0","canonical_sha256":"63d2f01229272ffd482276eadc25cfaff6293695062ad524e8ede79f35a2854d","source":{"kind":"arxiv","id":"1905.06479","version":4},"attestation_state":"computed","paper":{"title":"Efficient Scheduling for the Massive Random Access Gaussian Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Danilo Silva, Gustavo Kasper Facenda","submitted_at":"2019-05-16T00:13:49Z","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"},"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":"1905.06479","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-16T00:13:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2ba0cc242f498d1e891343857425ef67ed5574168ae647a87f976ec5983480dd","abstract_canon_sha256":"7eee6e2156617590ebb0163bd702a6a46e772f105c68d412c3d012ffa460057a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:58.704403Z","signature_b64":"425VrxKvDKX0gJO+RBOye+9JuA+9fevT91sDPaVJLZBs4ehCx5zfFFDNOOOZb1dyJtzvEzliz3cvb+xMbJAoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63d2f01229272ffd482276eadc25cfaff6293695062ad524e8ede79f35a2854d","last_reissued_at":"2026-07-05T01:51:58.703967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:58.703967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Scheduling for the Massive Random Access Gaussian Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Danilo Silva, Gustavo Kasper Facenda","submitted_at":"2019-05-16T00:13:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06479","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.06479/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1905.06479","created_at":"2026-07-05T01:51:58.704029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06479v4","created_at":"2026-07-05T01:51:58.704029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06479","created_at":"2026-07-05T01:51:58.704029+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPJPAERJE4X7","created_at":"2026-07-05T01:51:58.704029+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPJPAERJE4X72SBC","created_at":"2026-07-05T01:51:58.704029+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPJPAERJ","created_at":"2026-07-05T01:51:58.704029+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/MPJPAERJE4X72SBCO3VNYJOPV7","json":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7.json","graph_json":"https://pith.science/api/pith-number/MPJPAERJE4X72SBCO3VNYJOPV7/graph.json","events_json":"https://pith.science/api/pith-number/MPJPAERJE4X72SBCO3VNYJOPV7/events.json","paper":"https://pith.science/paper/MPJPAERJ"},"agent_actions":{"view_html":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7","download_json":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7.json","view_paper":"https://pith.science/paper/MPJPAERJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06479&json=true","fetch_graph":"https://pith.science/api/pith-number/MPJPAERJE4X72SBCO3VNYJOPV7/graph.json","fetch_events":"https://pith.science/api/pith-number/MPJPAERJE4X72SBCO3VNYJOPV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7/action/storage_attestation","attest_author":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7/action/author_attestation","sign_citation":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7/action/citation_signature","submit_replication":"https://pith.science/pith/MPJPAERJE4X72SBCO3VNYJOPV7/action/replication_record"}},"created_at":"2026-07-05T01:51:58.704029+00:00","updated_at":"2026-07-05T01:51:58.704029+00:00"}