Pith. sign in

Paper Citation Record · LEDGER

A neural drift-plus-penalty algorithm for network power allocation and routing

As of 16 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2509.09637.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.09637 v1

Coverage vector

measured 45 of 45 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T18:52:17.561504Z

measured 45 of 45 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

45 of 45 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved45
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 30d3ec7c-7b35-4b89-9d53-1fdb08686cbf · outbound

This paper cites 5G D2D networks: Tech- niques, challenges, and future prospects.

A neural drift-plus-penalty algorithm for network power allocation and routing 5G D2D networks: Tech- niques, challenges, and future prospects

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.446050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.446050Z digest=sha256:250dc66cc080ec3ca30a5f9fe6c648633eb8f27b1503eb5ce568d03dd7428a0e

Observation 316efaa6-674f-4649-9ab9-3ca966b252a8 · outbound

This paper cites Back-pressure-based packet-by-packet adaptive routing in communication networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Back-pressure-based packet-by-packet adaptive routing in communication networks

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.449688Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.449688Z digest=sha256:bc7364e89c7a51ca5b51cc7b5761b89f5c243391c15865310401bee158c841c1

Observation 1cdb6de6-b720-400e-95eb-24c2ac2e6089 · outbound

This paper cites Optimal oblivious routing in poly- nomial time.

A neural drift-plus-penalty algorithm for network power allocation and routing Optimal oblivious routing in poly- nomial time

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.452802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.452802Z digest=sha256:8e0dffc9719d4c86433f021b29e9b776351741af1f31561c7cbd9461cec78f71

Observation 6c4050d5-0304-4367-8f74-dabd18864904 · outbound

This paper cites Relational inductive biases, deep learning, and graph networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Relational inductive biases, deep learning, and graph networks

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.455636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.455636Z digest=sha256:a1e8117243d1850e02bfc2575914ec21189b86202e98cf8c8cfcb6502cea78c8

Observation 3a13f6d5-d302-4605-9d68-3bd7e84d846d · outbound

This paper cites Combinatorial optimization and reasoning with graph neural networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Combinatorial optimization and reasoning with graph neural networks

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.458877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.458877Z digest=sha256:03c400d1a351b68882163ee720786c32a1826cfb8c09fdb9472303b87beee37e

Observation 4a90948b-5b7f-4851-899f-9bd1fee313dc · outbound

This paper cites Cross-layer congestion control, rout- ing and scheduling design in ad hoc wireless networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Cross-layer congestion control, rout- ing and scheduling design in ad hoc wireless networks

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.461618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.461618Z digest=sha256:9bcb3bfb2ee35b4987c851349b7764572e2069666f59a8bf438991ef5978b070

Observation eca3e843-062d-4bea-b9c2-00a308fec97e · outbound

This paper cites Enhancing the delay performance of dynamic backpressure algo- rithms.

A neural drift-plus-penalty algorithm for network power allocation and routing Enhancing the delay performance of dynamic backpressure algo- rithms

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.464549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.464549Z digest=sha256:eacac5593b094d0e8ca904497ff0201646fd05989e5222ff1e54877cfa1d223c

Observation cb66fad6-986a-4031-8a20-de889ac5b31e · outbound

This paper cites Sinkhorn distances: Lightspeed com- putation of optimal transport.

A neural drift-plus-penalty algorithm for network power allocation and routing Sinkhorn distances: Lightspeed com- putation of optimal transport

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.467056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.467056Z digest=sha256:7a5388e66ec1011f3625f80d8b52bad538fc5e4c0068f727f416eec050a2ed40

Observation d6990660-1e0e-416e-a7b6-8e1c3945be3a · outbound

This paper cites A note on two problems in con- nexion with graphs.

A neural drift-plus-penalty algorithm for network power allocation and routing A note on two problems in con- nexion with graphs

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.469543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.469543Z digest=sha256:0ffc44c75faa216adb2af90f0e6984deeb2b085dd72305d8a7651493156fe1c3

Observation ebf51b80-13e0-4cdf-8364-6e29628e072a · outbound

This paper cites Optimal wireless resource allocation with random edge graph neural networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Optimal wireless resource allocation with random edge graph neural networks

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.472151Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.472151Z digest=sha256:548c02abb3d125e40a79e4454338c2fd82fbee5087763f7e10c0c276661826f5

Observation 8a5d8e25-de3a-4a29-90b6-3b1825db7b50 · outbound

This paper cites Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction.

A neural drift-plus-penalty algorithm for network power allocation and routing Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.475076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.475076Z digest=sha256:37b3b270c22e463ea2df118c46fda127370777c08a6fa365f0216bca580bde40

Observation e87e1857-c875-4b74-85b6-3bc402e6ad13 · outbound

This paper cites Resource allocation and cross-layer control in wireless networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Resource allocation and cross-layer control in wireless networks

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.478002Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.478002Z digest=sha256:e2fd2697c358a0d97700efa00fd25d693ff406a85087bc4878828c570d2bbd61

Observation 7a55e216-b8e1-4a1a-9252-1887db450530 · outbound

This paper cites Understanding pooling in graph neural networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Understanding pooling in graph neural networks

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.480547Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.480547Z digest=sha256:acf800f59bf207669597492f331ecce3ffcb015d1646aaf89b809b1cc5707069

Observation 9ef2b28d-abc9-499f-b370-5b74a1c9908a · outbound

This paper cites A survey of actor-critic reinforce- ment learning: Standard and natural policy gradients.

A neural drift-plus-penalty algorithm for network power allocation and routing A survey of actor-critic reinforce- ment learning: Standard and natural policy gradients

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.482966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.482966Z digest=sha256:8caf72d0a1185a333c5b8a6d67fa08fafce25189024b635ec709f2cfc9c24902

Observation 200b10be-d809-41f7-afc9-8aefdef5f04f · outbound

This paper cites Delay-optimal back-pressure routing algorithm for multihop wireless networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Delay-optimal back-pressure routing algorithm for multihop wireless networks

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.485404Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.485404Z digest=sha256:381b39b8fbb7375a05883ddb2f1ad0145ad5fe5146a222b2f33093707f73f27f

Observation d22e5099-55e0-47ac-84fd-91708941e522 · outbound

This paper cites Efficient gather and scatter oper- ations on graphics processors.

A neural drift-plus-penalty algorithm for network power allocation and routing Efficient gather and scatter oper- ations on graphics processors

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.487978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.487978Z digest=sha256:870bbaf6eda29a1d65a2357bff19b0ab0d7581d79e43351db21c06a5ef17596f

Observation 03195c46-83c0-4004-8de7-3c9b0357e2b2 · outbound

This paper cites Strategies for Pre-training Graph Neural Networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Strategies for Pre-training Graph Neural Networks

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.490484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.490484Z digest=sha256:1777b5e8979b52e400db5d561395d1463cf09ef1f0ffeb3f71735b71cf49b0f6

Observation c3c50c78-b9ef-410f-a5ac-603b5a615c9f · outbound

This paper cites Delay- based back-pressure scheduling in multihop wireless networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Delay- based back-pressure scheduling in multihop wireless networks

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.493471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.493471Z digest=sha256:f879cf53aaf28d854985169bd0451f28788bbe367166fd895bef62655124f22c

Observation bad5eb84-50b1-47fe-9023-9babf213fbc2 · outbound

This paper cites Learning skillful medium-range global weather forecasting.

A neural drift-plus-penalty algorithm for network power allocation and routing Learning skillful medium-range global weather forecasting

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.495887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.495887Z digest=sha256:697f4fe5b729d422cf704236213c2de5e9d635db0674f245ce24a0f70df6e491

Observation d4d033ee-b090-4cb3-8d90-0816af9592b4 · outbound

This paper cites Graph Matching Networks for Learning the Similarity of Graph Structured Objects.

A neural drift-plus-penalty algorithm for network power allocation and routing Graph Matching Networks for Learning the Similarity of Graph Structured Objects

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.498386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.498386Z digest=sha256:0c3e45d00da0e7c03cdd06cdb15535c96b15c7d399bf95b6da9251d7c2a137e4

Observation 88e8d8e3-6b71-47b7-83be-ce6b93038f06 · outbound

This paper cites Software avail- able from tensorflow.org.

A neural drift-plus-penalty algorithm for network power allocation and routing Software avail- able from tensorflow.org

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.501271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.501271Z digest=sha256:b773043a4df366d5978a1ff05f291d5423260deeead1b52925a60dc5becd61c5

Observation 3ecc4718-927b-427d-a0af-d230d8759afb · outbound

This paper cites Learning Latent Permutations with Gumbel-Sinkhorn Networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Learning Latent Permutations with Gumbel-Sinkhorn Networks

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.503731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.503731Z digest=sha256:63b226f7bb6693ed64db27e5faf5245bc7774df60891c30d7a9f1516e00264aa

Observation ebd7db79-4059-4cd6-8b1d-1d5cf0b9f986 · outbound

This paper cites Hard-Constrained Neural Networks with Universal Ap- proximation Guarantees.

A neural drift-plus-penalty algorithm for network power allocation and routing Hard-Constrained Neural Networks with Universal Ap- proximation Guarantees

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.506474Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.506474Z digest=sha256:074ed9554c483d915883e211550f85fd30f323666da491b890c14d5c65fb223a

Observation 4ecaaea1-2ecc-40fc-a06c-12f32a93cda2 · outbound

This paper cites Playing Atari with Deep Reinforcement Learning.

A neural drift-plus-penalty algorithm for network power allocation and routing Playing Atari with Deep Reinforcement Learning

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.508908Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.508908Z digest=sha256:2f3ffab4c57400eb43401e401d05275faaad9c8794b123bb47172b1cde3abb9a

Observation 2618785b-fc71-4745-982a-3c70e56cbfa7 · outbound

This paper cites Routing without routes: The back- pressure collection protocol.

A neural drift-plus-penalty algorithm for network power allocation and routing Routing without routes: The back- pressure collection protocol

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.511657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.511657Z digest=sha256:6c0fb98c8ecbe7928177fe6b876eb9350b10e949a8b9df1dfdfeba1f6010a925

Observation 3e2648dc-ffa2-49f7-951d-aaa662054b29 · outbound

This paper cites Random- ized algorithms.

A neural drift-plus-penalty algorithm for network power allocation and routing Random- ized algorithms

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.514177Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.514177Z digest=sha256:94907ace5ff943817defea9989bbb8dc4b23534d93ca1df6b0e4682acc6a0847

Observation 3425bc29-144b-404c-b938-3c12baa59aa7 · outbound

This paper cites Stability and probability 1 con- vergence for queueing networks via Lyapunov opti- mization.

A neural drift-plus-penalty algorithm for network power allocation and routing Stability and probability 1 con- vergence for queueing networks via Lyapunov opti- mization

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.516812Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.516812Z digest=sha256:7edd3854b7dc9d5f243d57c014ccc7bd56fa286723edad0e5a7531746ef8ff02

Observation afaa0f1d-04f2-49f9-936f-38d702b6142c · outbound

This paper cites Dynamic power allocation and routing for time varying wireless networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Dynamic power allocation and routing for time varying wireless networks

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.519197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.519197Z digest=sha256:b909f85df6254fa02640bf7e2834397e436905d60117e364d14cece1a2ae6d1d

Observation 7e35fd9c-31ba-4884-9daf-57b6b8919f86 · outbound

This paper cites A highly adaptive distributed routing algorithm for mobile wire- less networks.

A neural drift-plus-penalty algorithm for network power allocation and routing A highly adaptive distributed routing algorithm for mobile wire- less networks

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.521504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.521504Z digest=sha256:a40d3464bc3e22db8a92adb758aa0a0638639bd1e173613eb2d1869a67c87ddf

Observation b3a9b0dc-df85-4f7b-821c-1116a48019db · outbound

This paper cites PyTorch: An Imperative Style, High-Performance Deep Learning Library.

A neural drift-plus-penalty algorithm for network power allocation and routing PyTorch: An Imperative Style, High-Performance Deep Learning Library

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.523787Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.523787Z digest=sha256:03b4aa70d06cd82a0ad94b06c91f7f633981a0825d2ede216baaa9e9d983b5dd

Observation f4f1b0c2-d77e-4c83-aab7-092ea0cb4de2 · outbound

This paper cites Ad-hoc on- demand distance vector routing.

A neural drift-plus-penalty algorithm for network power allocation and routing Ad-hoc on- demand distance vector routing

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.526387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.526387Z digest=sha256:5636e89a263a3e0efcbf46c664ccbb0a1355d5bd78816e10368cb7a1a2e91620

Observation 63e28631-ce1d-43ea-8c94-cd648f90d543 · outbound

This paper cites Monotonic value function factori- sation for deep multi-agent reinforcement learning.

A neural drift-plus-penalty algorithm for network power allocation and routing Monotonic value function factori- sation for deep multi-agent reinforcement learning

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.528786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.528786Z digest=sha256:8ffe27a4708b5a2ad6f6b85bbb1f4dd778d36988648cc5e47000b67079cbfc92

Observation 206112fa-592c-4b9e-b830-e54814b81033 · outbound

This paper cites The graph neural network model.

A neural drift-plus-penalty algorithm for network power allocation and routing The graph neural network model

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.531094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.531094Z digest=sha256:c658f4fa6aaf876f108da45b3245d07210edd21d9d9a4bba568982e84a341d37

Observation 680ef1cf-c68a-40b4-b422-e4f23f86a7e5 · outbound

This paper cites Position-based routing in ad hoc networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Position-based routing in ad hoc networks

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.533452Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.533452Z digest=sha256:3846bc128762d57ca50b752a062c70a90a89a27295505a2808de688becb68852

Observation 136f0e15-0ea6-4b55-9fe0-a17e18d0d56a · outbound

This paper cites Value-Decomposition Networks For Cooperative Multi-Agent Learning Based On Team Reward.

A neural drift-plus-penalty algorithm for network power allocation and routing Value-Decomposition Networks For Cooperative Multi-Agent Learning Based On Team Reward

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.536027Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.536027Z digest=sha256:ccd9a809266f10ae5924c77036df4b1e514c0675d0f9037c6a83d610a6075cb3

Observation 3c38ceff-2b94-4471-9fed-083de62328a6 · outbound

This paper cites Stability properties of constrained queueing systems and schedul- ing policies for maximum throughput in multihop radio networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Stability properties of constrained queueing systems and schedul- ing policies for maximum throughput in multihop radio networks

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.538597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.538597Z digest=sha256:052a2942daf76258aaf473e8cd94267983b2ead70e6ac3adb4eafc61abe9330c

Observation 82d395bb-46eb-488c-b4e4-bc52142af79a · outbound

This paper cites Understanding over-squashing and bottlenecks on graphs via curvature.

A neural drift-plus-penalty algorithm for network power allocation and routing Understanding over-squashing and bottlenecks on graphs via curvature

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.540873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.540873Z digest=sha256:a24c7394a34af1a1f0fd57d37f1eadf4fab7574aa7d93409704748cb60a71ee0

Observation 5e1446e4-5c8d-4231-b3fc-07b6394f1c52 · outbound

This paper cites RAYEN: Imposition of Hard Convex Constraints on Neural Networks.

A neural drift-plus-penalty algorithm for network power allocation and routing RAYEN: Imposition of Hard Convex Constraints on Neural Networks

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.543284Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.543284Z digest=sha256:127720a0a9f961cf42adf4cad54acef556a53fb2777641f2a2f2b5ed444e31f8

Observation 1990d033-a851-4b6b-b262-6f7fb2944d0c · outbound

This paper cites LinSATNet: the positive linear satisfiability neural networks.

A neural drift-plus-penalty algorithm for network power allocation and routing LinSATNet: the positive linear satisfiability neural networks

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.545890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.545890Z digest=sha256:dc3afc9cc37ab4bc1fbe106537ff62f2f251bc066d1285fbd5ac602cbcec3da2

Observation 41d6d675-c97d-4c6d-9522-f47e21185f6f · outbound

This paper cites On combining shortest-path and back- pressure routing over multihop wireless networks.

A neural drift-plus-penalty algorithm for network power allocation and routing On combining shortest-path and back- pressure routing over multihop wireless networks

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.548449Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.548449Z digest=sha256:6d2c8937db9648c22394632799592ffa6be46c5979a0b1ef9e582a889dc112a5

Observation 7e58149b-b447-43ec-a7f4-20c07c803cfd · outbound

This paper cites Biased backpressure routing us- ing link features and graph neural networks.

A neural drift-plus-penalty algorithm for network power allocation and routing Biased backpressure routing us- ing link features and graph neural networks

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.550755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.550755Z digest=sha256:bfb21657eae5d90b327c60d19a3ce699b6ef0db9800e522bac60bd80bf70cfdd

Observation 7a94c64c-d833-4358-ae1f-300b3be96260 · outbound

This paper cites Since the objective is strictly increasing inµ W ijc, this contradicts the optimality ofµ W i.

A neural drift-plus-penalty algorithm for network power allocation and routing Since the objective is strictly increasing inµ W ijc, this contradicts the optimality ofµ W i

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.553476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.553476Z digest=sha256:00c9a6c548319fcebb4c64a497edf7dc807151995df7dbdc1ea20c8e19eafc0a

Observation ea70058e-521a-4212-8bb3-ec619437f1d4 · outbound

This paper cites By Lemma 2, each element(j, c)∈E + saturates either the row or column constraint (or both) atM j,c.

A neural drift-plus-penalty algorithm for network power allocation and routing By Lemma 2, each element(j, c)∈E + saturates either the row or column constraint (or both) atM j,c

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.556140Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.556140Z digest=sha256:500f801caf463bf0e710046f2dda5991d31046a1e45cb03e1944c42fb7d5866a

Observation 65c7aa7f-32f9-4bc9-8254-9363cb3612ae · outbound

This paper cites an unresolved cited work.

A neural drift-plus-penalty algorithm for network power allocation and routing Unresolved cited work

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.558890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.558890Z digest=sha256:328d7c399e502ca46abcf6cc38d48ad4e58901cacf8f7bae1410e0d769d3b5e7

Observation 85cd9c67-a502-4030-b3d3-da817f200eae · outbound

This paper cites Its row/column sum constraints are corresponding subvectors ofT i, Ii.

A neural drift-plus-penalty algorithm for network power allocation and routing Its row/column sum constraints are corresponding subvectors ofT i, Ii

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-04T18:52:17.561504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:52:17.561504Z digest=sha256:23378c1cbf76b9a8a6dd4e904b21b9c868d78483ad15a8319b751c3d2d3fa308

Pith citing papers

No inbound Pith citation observations are available.