{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PPOU56F37ABFPIVFRYQMMZ5NUJ","short_pith_number":"pith:PPOU56F3","schema_version":"1.0","canonical_sha256":"7bdd4ef8bbf80257a2a58e20c667ada252a7dc79149d896a527a3dfb14d449bd","source":{"kind":"arxiv","id":"2401.03812","version":1},"attestation_state":"computed","paper":{"title":"ORANUS: Latency-tailored Orchestration via Stochastic Network Calculus in 6G O-RAN","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andres Garcia-Saavedra, Lanfranco Zanzi, Oscar Adamuz-Hinojosa, Vincenzo Sciancalepore, Xavier Costa-P\\'erez","submitted_at":"2024-01-08T11:04:07Z","abstract_excerpt":"The Open Radio Access Network (O-RAN)-compliant solutions lack crucial details to perform effective control loops at multiple time scales. In this vein, we propose ORANUS, an O-RAN-compliant mathematical framework to allocate radio resources to multiple ultra Reliable Low Latency Communication (uRLLC) services. In the near-RT control loop, ORANUS relies on a novel Stochastic Network Calculus (SNC)-based model to compute the amount of guaranteed radio resources for each uRLLC service. Unlike traditional approaches as queueing theory, the SNC-based model allows ORANUS to ensure the probability t"},"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":"2401.03812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-08T11:04:07Z","cross_cats_sorted":[],"title_canon_sha256":"286a935d1f6733f137c9cdf9b6bea1d43d72d1c0b454eb85d34b400b3815c96e","abstract_canon_sha256":"b682595b4d1733c5bbe90c40976e9242c8052a202496fef792e5294f4889f612"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:31:14.045764Z","signature_b64":"IPO4RmNNP5D/MBSKI/u/ug+3ucrPJj+JJMehM+PSVN3I//2N25Na07p4/W2EdAXleQBtpZl6vpTH2GkCnE8ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bdd4ef8bbf80257a2a58e20c667ada252a7dc79149d896a527a3dfb14d449bd","last_reissued_at":"2026-07-05T07:31:14.045279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:31:14.045279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ORANUS: Latency-tailored Orchestration via Stochastic Network Calculus in 6G O-RAN","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andres Garcia-Saavedra, Lanfranco Zanzi, Oscar Adamuz-Hinojosa, Vincenzo Sciancalepore, Xavier Costa-P\\'erez","submitted_at":"2024-01-08T11:04:07Z","abstract_excerpt":"The Open Radio Access Network (O-RAN)-compliant solutions lack crucial details to perform effective control loops at multiple time scales. In this vein, we propose ORANUS, an O-RAN-compliant mathematical framework to allocate radio resources to multiple ultra Reliable Low Latency Communication (uRLLC) services. In the near-RT control loop, ORANUS relies on a novel Stochastic Network Calculus (SNC)-based model to compute the amount of guaranteed radio resources for each uRLLC service. Unlike traditional approaches as queueing theory, the SNC-based model allows ORANUS to ensure the probability t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03812","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/2401.03812/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":"2401.03812","created_at":"2026-07-05T07:31:14.045339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.03812v1","created_at":"2026-07-05T07:31:14.045339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03812","created_at":"2026-07-05T07:31:14.045339+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPOU56F37ABF","created_at":"2026-07-05T07:31:14.045339+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPOU56F37ABFPIVF","created_at":"2026-07-05T07:31:14.045339+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPOU56F3","created_at":"2026-07-05T07:31:14.045339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01128","citing_title":"MORPH: Multi-Environment Orchestrated Reinforcement Learning for PRB Handling in O-RAN","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ","json":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ.json","graph_json":"https://pith.science/api/pith-number/PPOU56F37ABFPIVFRYQMMZ5NUJ/graph.json","events_json":"https://pith.science/api/pith-number/PPOU56F37ABFPIVFRYQMMZ5NUJ/events.json","paper":"https://pith.science/paper/PPOU56F3"},"agent_actions":{"view_html":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ","download_json":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ.json","view_paper":"https://pith.science/paper/PPOU56F3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.03812&json=true","fetch_graph":"https://pith.science/api/pith-number/PPOU56F37ABFPIVFRYQMMZ5NUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PPOU56F37ABFPIVFRYQMMZ5NUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ/action/storage_attestation","attest_author":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ/action/author_attestation","sign_citation":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ/action/citation_signature","submit_replication":"https://pith.science/pith/PPOU56F37ABFPIVFRYQMMZ5NUJ/action/replication_record"}},"created_at":"2026-07-05T07:31:14.045339+00:00","updated_at":"2026-07-05T07:31:14.045339+00:00"}