{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UGH3WGWJ34RYBDHSWLTAURWLLH","short_pith_number":"pith:UGH3WGWJ","schema_version":"1.0","canonical_sha256":"a18fbb1ac9df23808cf2b2e60a46cb59fe652fedb9c093bccf1e9e078c09d8ac","source":{"kind":"arxiv","id":"2509.10499","version":1},"attestation_state":"computed","paper":{"title":"Towards Scalable O-RAN Resource Management: Graph-Augmented Proximal Policy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Duc-Thinh Ngo (STACK, Kandaraj Piamrat, LS2N), Ons Aouedi, Philippe Raipin-Parv\\'edy, Thomas Hassan","submitted_at":"2025-09-01T08:53:04Z","abstract_excerpt":"Open Radio Access Network (O-RAN) architectures enable flexible, scalable, and cost-efficient mobile networks by disaggregating and virtualizing baseband functions. However, this flexibility introduces significant challenges for resource management, requiring joint optimization of functional split selection and virtualized unit placement under dynamic demands and complex topologies. Existing solutions often address these aspects separately or lack scalability in large and real-world scenarios. In this work, we propose a novel Graph-Augmented Proximal Policy Optimization (GPPO) framework that l"},"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":"2509.10499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-09-01T08:53:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1d541fb60f8c04640ba0859241d86d865b31a4041d163432f6c68ab8e39ee07f","abstract_canon_sha256":"37aea73f4bd3708e0a6838bc3894d490d86fdf2fd8239f8b4a8c50de970ca6da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:22.048258Z","signature_b64":"LA9xVlI3tA+6f1+tgEQP8pf+/fxXtgf9LNqnWTU383ne/aeTs46HH4mViH1I96HTXDraHRL6mHVizJniwWGQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a18fbb1ac9df23808cf2b2e60a46cb59fe652fedb9c093bccf1e9e078c09d8ac","last_reissued_at":"2026-07-05T12:11:22.047792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:22.047792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Scalable O-RAN Resource Management: Graph-Augmented Proximal Policy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Duc-Thinh Ngo (STACK, Kandaraj Piamrat, LS2N), Ons Aouedi, Philippe Raipin-Parv\\'edy, Thomas Hassan","submitted_at":"2025-09-01T08:53:04Z","abstract_excerpt":"Open Radio Access Network (O-RAN) architectures enable flexible, scalable, and cost-efficient mobile networks by disaggregating and virtualizing baseband functions. However, this flexibility introduces significant challenges for resource management, requiring joint optimization of functional split selection and virtualized unit placement under dynamic demands and complex topologies. Existing solutions often address these aspects separately or lack scalability in large and real-world scenarios. In this work, we propose a novel Graph-Augmented Proximal Policy Optimization (GPPO) framework that l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10499","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/2509.10499/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":"2509.10499","created_at":"2026-07-05T12:11:22.047847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10499v1","created_at":"2026-07-05T12:11:22.047847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10499","created_at":"2026-07-05T12:11:22.047847+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGH3WGWJ34RY","created_at":"2026-07-05T12:11:22.047847+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGH3WGWJ34RYBDHS","created_at":"2026-07-05T12:11:22.047847+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGH3WGWJ","created_at":"2026-07-05T12:11:22.047847+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/UGH3WGWJ34RYBDHSWLTAURWLLH","json":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH.json","graph_json":"https://pith.science/api/pith-number/UGH3WGWJ34RYBDHSWLTAURWLLH/graph.json","events_json":"https://pith.science/api/pith-number/UGH3WGWJ34RYBDHSWLTAURWLLH/events.json","paper":"https://pith.science/paper/UGH3WGWJ"},"agent_actions":{"view_html":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH","download_json":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH.json","view_paper":"https://pith.science/paper/UGH3WGWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10499&json=true","fetch_graph":"https://pith.science/api/pith-number/UGH3WGWJ34RYBDHSWLTAURWLLH/graph.json","fetch_events":"https://pith.science/api/pith-number/UGH3WGWJ34RYBDHSWLTAURWLLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH/action/storage_attestation","attest_author":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH/action/author_attestation","sign_citation":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH/action/citation_signature","submit_replication":"https://pith.science/pith/UGH3WGWJ34RYBDHSWLTAURWLLH/action/replication_record"}},"created_at":"2026-07-05T12:11:22.047847+00:00","updated_at":"2026-07-05T12:11:22.047847+00:00"}