{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RRQFAJ5JBGMNJOIHBVDL5KBGVF","short_pith_number":"pith:RRQFAJ5J","schema_version":"1.0","canonical_sha256":"8c605027a90998d4b9070d46bea826a96cbf60f43bbff1351c4ef66c2d32fa18","source":{"kind":"arxiv","id":"2502.21121","version":1},"attestation_state":"computed","paper":{"title":"The Complexity-Performance Tradeoff in Resource Allocation for URLLC Exploiting Dynamic CSI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Federico Librino, Paolo Santi","submitted_at":"2025-02-28T14:56:33Z","abstract_excerpt":"The challenging applications envisioned for the future Internet of Things networks are making it urgent to develop fast and scalable resource allocation algorithms able to meet the stringent reliability and latency constraints typical of the Ultra Reliable, Low Latency Communications (URLLC).\n  However, there is an inherent tradeoff between complexity and performance to be addressed: sophisticated resource allocation methods providing optimized spectrum utilization are challenged by the scale of applications and the concomitant stringent latency constraints. Whether non-trivial resource alloca"},"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":"2502.21121","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NI","submitted_at":"2025-02-28T14:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"51af32610044799cce0a7f8daf714043dde898ac3e703495a2e596f476e3c214","abstract_canon_sha256":"50852f4c37eb6aa8efd4ed08d3142b45868029a09e9e50796656b79d3ea1f646"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:44.690078Z","signature_b64":"QlPRWvW15elxNSvxaZjsla38o03yCfg2Xbh0GHsl5TTkQIBqntqNxwacmyct6aI9tXhTSCJBumcA5K/npHitDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c605027a90998d4b9070d46bea826a96cbf60f43bbff1351c4ef66c2d32fa18","last_reissued_at":"2026-07-05T10:21:44.689591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:44.689591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity-Performance Tradeoff in Resource Allocation for URLLC Exploiting Dynamic CSI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Federico Librino, Paolo Santi","submitted_at":"2025-02-28T14:56:33Z","abstract_excerpt":"The challenging applications envisioned for the future Internet of Things networks are making it urgent to develop fast and scalable resource allocation algorithms able to meet the stringent reliability and latency constraints typical of the Ultra Reliable, Low Latency Communications (URLLC).\n  However, there is an inherent tradeoff between complexity and performance to be addressed: sophisticated resource allocation methods providing optimized spectrum utilization are challenged by the scale of applications and the concomitant stringent latency constraints. Whether non-trivial resource alloca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.21121","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.21121/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":"2502.21121","created_at":"2026-07-05T10:21:44.689652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.21121v1","created_at":"2026-07-05T10:21:44.689652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.21121","created_at":"2026-07-05T10:21:44.689652+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRQFAJ5JBGMN","created_at":"2026-07-05T10:21:44.689652+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRQFAJ5JBGMNJOIH","created_at":"2026-07-05T10:21:44.689652+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRQFAJ5J","created_at":"2026-07-05T10:21:44.689652+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/RRQFAJ5JBGMNJOIHBVDL5KBGVF","json":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF.json","graph_json":"https://pith.science/api/pith-number/RRQFAJ5JBGMNJOIHBVDL5KBGVF/graph.json","events_json":"https://pith.science/api/pith-number/RRQFAJ5JBGMNJOIHBVDL5KBGVF/events.json","paper":"https://pith.science/paper/RRQFAJ5J"},"agent_actions":{"view_html":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF","download_json":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF.json","view_paper":"https://pith.science/paper/RRQFAJ5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.21121&json=true","fetch_graph":"https://pith.science/api/pith-number/RRQFAJ5JBGMNJOIHBVDL5KBGVF/graph.json","fetch_events":"https://pith.science/api/pith-number/RRQFAJ5JBGMNJOIHBVDL5KBGVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF/action/storage_attestation","attest_author":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF/action/author_attestation","sign_citation":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF/action/citation_signature","submit_replication":"https://pith.science/pith/RRQFAJ5JBGMNJOIHBVDL5KBGVF/action/replication_record"}},"created_at":"2026-07-05T10:21:44.689652+00:00","updated_at":"2026-07-05T10:21:44.689652+00:00"}