{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AHAFFMU3KWHWQSUUS5YCQHBQJO","short_pith_number":"pith:AHAFFMU3","schema_version":"1.0","canonical_sha256":"01c052b29b558f684a949770281c304ba309b97e02d2ce4f26d7c29b16b3220a","source":{"kind":"arxiv","id":"2509.09637","version":1},"attestation_state":"computed","paper":{"title":"A neural drift-plus-penalty algorithm for network power allocation and routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ahmed Rashwan, Chris Budd, Keith Briggs","submitted_at":"2025-09-11T17:23:47Z","abstract_excerpt":"The drift-plus-penalty method is a Lyapunov optimisation technique commonly applied to network routing problems. It reduces the original stochastic planning task to a sequence of greedy optimizations, enabling the design of distributed routing algorithms which stabilize data queues while simultaneously optimizing a specified penalty function. While drift-plus-penalty methods have desirable asymptotic properties, they tend to incur higher network delay than alternative control methods, especially under light network load. In this work, we propose a learned variant of the drift-plus-penalty meth"},"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.09637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-09-11T17:23:47Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"6245c413bd2bea0d8830d90c9278289079cb315d28b6a94af4b893fac52b871c","abstract_canon_sha256":"4a1ad3f8450a0ac75ba878e96813a03d394d9ba639a4d591265737b5f102688d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:39.968497Z","signature_b64":"jLh+zI1YyYSO2zHTIMOiiF9do2QDrnN2/4A+/gdQrkw1FHVgz3EJM1zuD13BpjOZVUbZs1VmcMej08QxxHFuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01c052b29b558f684a949770281c304ba309b97e02d2ce4f26d7c29b16b3220a","last_reissued_at":"2026-07-05T12:09:39.967994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:39.967994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A neural drift-plus-penalty algorithm for network power allocation and routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ahmed Rashwan, Chris Budd, Keith Briggs","submitted_at":"2025-09-11T17:23:47Z","abstract_excerpt":"The drift-plus-penalty method is a Lyapunov optimisation technique commonly applied to network routing problems. It reduces the original stochastic planning task to a sequence of greedy optimizations, enabling the design of distributed routing algorithms which stabilize data queues while simultaneously optimizing a specified penalty function. While drift-plus-penalty methods have desirable asymptotic properties, they tend to incur higher network delay than alternative control methods, especially under light network load. In this work, we propose a learned variant of the drift-plus-penalty meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09637","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.09637/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.09637","created_at":"2026-07-05T12:09:39.968058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09637v1","created_at":"2026-07-05T12:09:39.968058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09637","created_at":"2026-07-05T12:09:39.968058+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHAFFMU3KWHW","created_at":"2026-07-05T12:09:39.968058+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHAFFMU3KWHWQSUU","created_at":"2026-07-05T12:09:39.968058+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHAFFMU3","created_at":"2026-07-05T12:09:39.968058+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/AHAFFMU3KWHWQSUUS5YCQHBQJO","json":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO.json","graph_json":"https://pith.science/api/pith-number/AHAFFMU3KWHWQSUUS5YCQHBQJO/graph.json","events_json":"https://pith.science/api/pith-number/AHAFFMU3KWHWQSUUS5YCQHBQJO/events.json","paper":"https://pith.science/paper/AHAFFMU3"},"agent_actions":{"view_html":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO","download_json":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO.json","view_paper":"https://pith.science/paper/AHAFFMU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09637&json=true","fetch_graph":"https://pith.science/api/pith-number/AHAFFMU3KWHWQSUUS5YCQHBQJO/graph.json","fetch_events":"https://pith.science/api/pith-number/AHAFFMU3KWHWQSUUS5YCQHBQJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO/action/storage_attestation","attest_author":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO/action/author_attestation","sign_citation":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO/action/citation_signature","submit_replication":"https://pith.science/pith/AHAFFMU3KWHWQSUUS5YCQHBQJO/action/replication_record"}},"created_at":"2026-07-05T12:09:39.968058+00:00","updated_at":"2026-07-05T12:09:39.968058+00:00"}