{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HQETVSKBD6PNF6KJSHVGAASHX6","short_pith_number":"pith:HQETVSKB","schema_version":"1.0","canonical_sha256":"3c093ac9411f9ed2f94991ea600247bfb679e8ac1f367eab7ffb545f24f0fc4d","source":{"kind":"arxiv","id":"1902.07933","version":1},"attestation_state":"computed","paper":{"title":"On Throughput Maximization of Grant-Free Access with Reliability-Latency Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Cedomir Stefanovi\\'c, H. Murat G\\\"ursu, Wolfgang Kellerer","submitted_at":"2019-02-21T09:39:31Z","abstract_excerpt":"Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is the reservation-based access, which involves lengthy and resource-inefficient signaling exchanges. An alternative is to use grant-free access, in which there is no resource reservation. A handful of recent works investigated how to fulfill reliability and latency requirements with different flavors of grant-free solutions. However, the resource efficiency, "},"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":"1902.07933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-21T09:39:31Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4bd494a761dba14d33234b73eb7164b6549c61d7dde6f1a7e445742a73bf0a15","abstract_canon_sha256":"a64c3ba82a5d092faff80a579d500a6d0af3ef6335320ce90a74c7d7b1e3afa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.465603Z","signature_b64":"sAQ6sbLauiJRWYeV+WeELLV2B2HYST/i1rm8ZdIEcMHnI2rdNk1KfzJMMlbCSziRU7UbdE5iD9yXIJw2cdRqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c093ac9411f9ed2f94991ea600247bfb679e8ac1f367eab7ffb545f24f0fc4d","last_reissued_at":"2026-05-17T23:53:03.465049Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.465049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Throughput Maximization of Grant-Free Access with Reliability-Latency Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Cedomir Stefanovi\\'c, H. Murat G\\\"ursu, Wolfgang Kellerer","submitted_at":"2019-02-21T09:39:31Z","abstract_excerpt":"Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is the reservation-based access, which involves lengthy and resource-inefficient signaling exchanges. An alternative is to use grant-free access, in which there is no resource reservation. A handful of recent works investigated how to fulfill reliability and latency requirements with different flavors of grant-free solutions. However, the resource efficiency, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07933","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":"1902.07933","created_at":"2026-05-17T23:53:03.465146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07933v1","created_at":"2026-05-17T23:53:03.465146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07933","created_at":"2026-05-17T23:53:03.465146+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQETVSKBD6PN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQETVSKBD6PNF6KJ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQETVSKB","created_at":"2026-05-18T12:33:18.533446+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/HQETVSKBD6PNF6KJSHVGAASHX6","json":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6.json","graph_json":"https://pith.science/api/pith-number/HQETVSKBD6PNF6KJSHVGAASHX6/graph.json","events_json":"https://pith.science/api/pith-number/HQETVSKBD6PNF6KJSHVGAASHX6/events.json","paper":"https://pith.science/paper/HQETVSKB"},"agent_actions":{"view_html":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6","download_json":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6.json","view_paper":"https://pith.science/paper/HQETVSKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07933&json=true","fetch_graph":"https://pith.science/api/pith-number/HQETVSKBD6PNF6KJSHVGAASHX6/graph.json","fetch_events":"https://pith.science/api/pith-number/HQETVSKBD6PNF6KJSHVGAASHX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6/action/storage_attestation","attest_author":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6/action/author_attestation","sign_citation":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6/action/citation_signature","submit_replication":"https://pith.science/pith/HQETVSKBD6PNF6KJSHVGAASHX6/action/replication_record"}},"created_at":"2026-05-17T23:53:03.465146+00:00","updated_at":"2026-05-17T23:53:03.465146+00:00"}