{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AHAFFMU3KWHWQSUUS5YCQHBQJO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a1ad3f8450a0ac75ba878e96813a03d394d9ba639a4d591265737b5f102688d","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-09-11T17:23:47Z","title_canon_sha256":"6245c413bd2bea0d8830d90c9278289079cb315d28b6a94af4b893fac52b871c"},"schema_version":"1.0","source":{"id":"2509.09637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09637","created_at":"2026-07-05T12:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09637v1","created_at":"2026-07-05T12:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09637","created_at":"2026-07-05T12:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"AHAFFMU3KWHW","created_at":"2026-07-05T12:09:39Z"},{"alias_kind":"pith_short_16","alias_value":"AHAFFMU3KWHWQSUU","created_at":"2026-07-05T12:09:39Z"},{"alias_kind":"pith_short_8","alias_value":"AHAFFMU3","created_at":"2026-07-05T12:09:39Z"}],"graph_snapshots":[{"event_id":"sha256:2901edc83602ce5519f2ceb018e9ebc3467b783cf539c94da24f9fad35bc365c","target":"graph","created_at":"2026-07-05T12:09:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.09637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ahmed Rashwan, Chris Budd, Keith Briggs","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09637","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2316a6fa87258cca55ba4d3f0186f6aebc3768ac6ec77188da045f1b74138113","target":"record","created_at":"2026-07-05T12:09:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a1ad3f8450a0ac75ba878e96813a03d394d9ba639a4d591265737b5f102688d","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-09-11T17:23:47Z","title_canon_sha256":"6245c413bd2bea0d8830d90c9278289079cb315d28b6a94af4b893fac52b871c"},"schema_version":"1.0","source":{"id":"2509.09637","kind":"arxiv","version":1}},"canonical_sha256":"01c052b29b558f684a949770281c304ba309b97e02d2ce4f26d7c29b16b3220a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01c052b29b558f684a949770281c304ba309b97e02d2ce4f26d7c29b16b3220a","first_computed_at":"2026-07-05T12:09:39.967994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:39.967994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLh+zI1YyYSO2zHTIMOiiF9do2QDrnN2/4A+/gdQrkw1FHVgz3EJM1zuD13BpjOZVUbZs1VmcMej08QxxHFuAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:39.968497Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2316a6fa87258cca55ba4d3f0186f6aebc3768ac6ec77188da045f1b74138113","sha256:2901edc83602ce5519f2ceb018e9ebc3467b783cf539c94da24f9fad35bc365c"],"state_sha256":"00cf16babca2c71fce939c0c89b75e02288bdf7b53b634e5f73dbf986ea27216"}