{"as_of":"2026-08-16T21:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25abc5d66282bd20bdd3986463287407c75af68dd2fde537e0e11fe367f07f36","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:52:17.561504Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.09637/citation-record","integrity":"/paper/2509.09637/integrity","json":"/paper/2509.09637/citation-record.json","paper":"/paper/2509.09637"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.446050Z","title":"5G D2D networks: Tech- niques, challenges, and future prospects","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.446050Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:250dc66cc080ec3ca30a5f9fe6c648633eb8f27b1503eb5ce568d03dd7428a0e","observation_id":"30d3ec7c-7b35-4b89-9d53-1fdb08686cbf","resolution":{"observed_at":"2026-08-04T18:52:17.446050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.449688Z","title":"Back-pressure-based packet-by-packet adaptive routing in communication networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.449688Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:bc7364e89c7a51ca5b51cc7b5761b89f5c243391c15865310401bee158c841c1","observation_id":"316efaa6-674f-4649-9ab9-3ca966b252a8","resolution":{"observed_at":"2026-08-04T18:52:17.449688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.452802Z","title":"Optimal oblivious routing in poly- nomial time","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.452802Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:8e0dffc9719d4c86433f021b29e9b776351741af1f31561c7cbd9461cec78f71","observation_id":"1cdb6de6-b720-400e-95eb-24c2ac2e6089","resolution":{"observed_at":"2026-08-04T18:52:17.452802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01261","last_updated":"2018-10-17T17:51:36Z","snapshot_observed_at":"2026-08-15T04:21:38.631648Z","submitted_at":"2018-06-04T17:58:18Z","title":"Relational inductive biases, deep learning, and graph networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01261","snapshot_observed_at":"2026-08-04T18:52:17.455636Z","title":"Relational inductive biases, deep learning, and graph networks. arXiv 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.455636Z"},"links":{"cited_paper":"/paper/1806.01261","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:a1e8117243d1850e02bfc2575914ec21189b86202e98cf8c8cfcb6502cea78c8","observation_id":"6c4050d5-0304-4367-8f74-dabd18864904","resolution":{"observed_at":"2026-08-04T18:52:17.455636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.458877Z","title":"Combinatorial optimization and reasoning with graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.458877Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:03c400d1a351b68882163ee720786c32a1826cfb8c09fdb9472303b87beee37e","observation_id":"3a13f6d5-d302-4605-9d68-3bd7e84d846d","resolution":{"observed_at":"2026-08-04T18:52:17.458877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.461618Z","title":"Cross-layer congestion control, rout- ing and scheduling design in ad hoc wireless networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.461618Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:9bcb3bfb2ee35b4987c851349b7764572e2069666f59a8bf438991ef5978b070","observation_id":"4a90948b-5b7f-4851-899f-9bd1fee313dc","resolution":{"observed_at":"2026-08-04T18:52:17.461618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.464549Z","title":"Enhancing the delay performance of dynamic backpressure algo- rithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.464549Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:eacac5593b094d0e8ca904497ff0201646fd05989e5222ff1e54877cfa1d223c","observation_id":"eca3e843-062d-4bea-b9c2-00a308fec97e","resolution":{"observed_at":"2026-08-04T18:52:17.464549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.467056Z","title":"Sinkhorn distances: Lightspeed com- putation of optimal transport","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.467056Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:7a5388e66ec1011f3625f80d8b52bad538fc5e4c0068f727f416eec050a2ed40","observation_id":"cb66fad6-986a-4031-8a20-de889ac5b31e","resolution":{"observed_at":"2026-08-04T18:52:17.467056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.469543Z","title":"A note on two problems in con- nexion with graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.469543Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:0ffc44c75faa216adb2af90f0e6984deeb2b085dd72305d8a7651493156fe1c3","observation_id":"d6990660-1e0e-416e-a7b6-8e1c3945be3a","resolution":{"observed_at":"2026-08-04T18:52:17.469543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.472151Z","title":"Optimal wireless resource allocation with random edge graph neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.472151Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:548c02abb3d125e40a79e4454338c2fd82fbee5087763f7e10c0c276661826f5","observation_id":"ebf51b80-13e0-4cdf-8364-6e29628e072a","resolution":{"observed_at":"2026-08-04T18:52:17.472151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.06926","last_updated":"2017-08-23T09:16:49Z","snapshot_observed_at":"2026-08-14T20:39:43.655950Z","submitted_at":"2017-08-23T09:16:49Z","title":"Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.06926","snapshot_observed_at":"2026-08-04T18:52:17.475076Z","title":"Multi-agent Q-learning aided back- pressure routing algorithm for delay reduction","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.475076Z"},"links":{"cited_paper":"/paper/1708.06926","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:37b3b270c22e463ea2df118c46fda127370777c08a6fa365f0216bca580bde40","observation_id":"8a5d8e25-de3a-4a29-90b6-3b1825db7b50","resolution":{"observed_at":"2026-08-04T18:52:17.475076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.478002Z","title":"Resource allocation and cross-layer control in wireless networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.478002Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:e2fd2697c358a0d97700efa00fd25d693ff406a85087bc4878828c570d2bbd61","observation_id":"e87e1857-c875-4b74-85b6-3bc402e6ad13","resolution":{"observed_at":"2026-08-04T18:52:17.478002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.480547Z","title":"Understanding pooling in graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.480547Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:acf800f59bf207669597492f331ecce3ffcb015d1646aaf89b809b1cc5707069","observation_id":"7a55e216-b8e1-4a1a-9252-1887db450530","resolution":{"observed_at":"2026-08-04T18:52:17.480547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.482966Z","title":"A survey of actor-critic reinforce- ment learning: Standard and natural policy gradients","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.482966Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:8caf72d0a1185a333c5b8a6d67fa08fafce25189024b635ec709f2cfc9c24902","observation_id":"9ef2b28d-abc9-499f-b370-5b74a1c9908a","resolution":{"observed_at":"2026-08-04T18:52:17.482966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.485404Z","title":"Delay-optimal back-pressure routing algorithm for multihop wireless networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.485404Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:381b39b8fbb7375a05883ddb2f1ad0145ad5fe5146a222b2f33093707f73f27f","observation_id":"200b10be-d809-41f7-afc9-8aefdef5f04f","resolution":{"observed_at":"2026-08-04T18:52:17.485404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.487978Z","title":"Efficient gather and scatter oper- ations on graphics processors","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.487978Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:870bbaf6eda29a1d65a2357bff19b0ab0d7581d79e43351db21c06a5ef17596f","observation_id":"d22e5099-55e0-47ac-84fd-91708941e522","resolution":{"observed_at":"2026-08-04T18:52:17.487978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12265","last_updated":"2020-02-18T19:49:48Z","snapshot_observed_at":"2026-08-15T23:39:52.468529Z","submitted_at":"2019-05-29T08:11:52Z","title":"Strategies for Pre-training Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12265","snapshot_observed_at":"2026-08-04T18:52:17.490484Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.490484Z"},"links":{"cited_paper":"/paper/1905.12265","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:1777b5e8979b52e400db5d561395d1463cf09ef1f0ffeb3f71735b71cf49b0f6","observation_id":"03195c46-83c0-4004-8de7-3c9b0357e2b2","resolution":{"observed_at":"2026-08-04T18:52:17.490484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.493471Z","title":"Delay- based back-pressure scheduling in multihop wireless networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.493471Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:f879cf53aaf28d854985169bd0451f28788bbe367166fd895bef62655124f22c","observation_id":"c3c50c78-b9ef-410f-a5ac-603b5a615c9f","resolution":{"observed_at":"2026-08-04T18:52:17.493471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.495887Z","title":"Learning skillful medium-range global weather forecasting","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.495887Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:697f4fe5b729d422cf704236213c2de5e9d635db0674f245ce24a0f70df6e491","observation_id":"bad5eb84-50b1-47fe-9023-9babf213fbc2","resolution":{"observed_at":"2026-08-04T18:52:17.495887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12787","snapshot_observed_at":"2026-08-04T18:52:17.498386Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.498386Z"},"links":{"cited_paper":"/paper/1904.12787","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:0c3e45d00da0e7c03cdd06cdb15535c96b15c7d399bf95b6da9251d7c2a137e4","observation_id":"d4d033ee-b090-4cb3-8d90-0816af9592b4","resolution":{"observed_at":"2026-08-04T18:52:17.498386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.501271Z","title":"Software avail- able from tensorflow.org","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.501271Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:b773043a4df366d5978a1ff05f291d5423260deeead1b52925a60dc5becd61c5","observation_id":"88e8d8e3-6b71-47b7-83be-ce6b93038f06","resolution":{"observed_at":"2026-08-04T18:52:17.501271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.08665","last_updated":"2018-02-23T18:15:13Z","snapshot_observed_at":"2026-08-14T19:42:46.664224Z","submitted_at":"2018-02-23T18:15:13Z","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.08665","snapshot_observed_at":"2026-08-04T18:52:17.503731Z","title":"Learning latent permutations with Gumbel-Sinkhorn networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.503731Z"},"links":{"cited_paper":"/paper/1802.08665","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:63b226f7bb6693ed64db27e5faf5245bc7774df60891c30d7a9f1516e00264aa","observation_id":"3ecc4718-927b-427d-a0af-d230d8759afb","resolution":{"observed_at":"2026-08-04T18:52:17.503731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.506474Z","title":"Hard-Constrained Neural Networks with Universal Ap- proximation Guarantees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.506474Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:074ed9554c483d915883e211550f85fd30f323666da491b890c14d5c65fb223a","observation_id":"ebd7db79-4059-4cd6-8b1d-1d5cf0b9f986","resolution":{"observed_at":"2026-08-04T18:52:17.506474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-08-14T03:19:40.736445Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-04T18:52:17.508908Z","title":"Playing Atari with deep reinforcement learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.508908Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:2f3ffab4c57400eb43401e401d05275faaad9c8794b123bb47172b1cde3abb9a","observation_id":"4ecaaea1-2ecc-40fc-a06c-12f32a93cda2","resolution":{"observed_at":"2026-08-04T18:52:17.508908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.511657Z","title":"Routing without routes: The back- pressure collection protocol","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.511657Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:6c0fb98c8ecbe7928177fe6b876eb9350b10e949a8b9df1dfdfeba1f6010a925","observation_id":"2618785b-fc71-4745-982a-3c70e56cbfa7","resolution":{"observed_at":"2026-08-04T18:52:17.511657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.514177Z","title":"Random- ized algorithms","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.514177Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:94907ace5ff943817defea9989bbb8dc4b23534d93ca1df6b0e4682acc6a0847","observation_id":"3e2648dc-ffa2-49f7-951d-aaa662054b29","resolution":{"observed_at":"2026-08-04T18:52:17.514177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.516812Z","title":"Stability and probability 1 con- vergence for queueing networks via Lyapunov opti- mization","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.516812Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:7edd3854b7dc9d5f243d57c014ccc7bd56fa286723edad0e5a7531746ef8ff02","observation_id":"3425bc29-144b-404c-b938-3c12baa59aa7","resolution":{"observed_at":"2026-08-04T18:52:17.516812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.519197Z","title":"Dynamic power allocation and routing for time varying wireless networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.519197Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:b909f85df6254fa02640bf7e2834397e436905d60117e364d14cece1a2ae6d1d","observation_id":"afaa0f1d-04f2-49f9-936f-38d702b6142c","resolution":{"observed_at":"2026-08-04T18:52:17.519197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.521504Z","title":"A highly adaptive distributed routing algorithm for mobile wire- less networks","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.521504Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:a40d3464bc3e22db8a92adb758aa0a0638639bd1e173613eb2d1869a67c87ddf","observation_id":"7e35fd9c-31ba-4884-9daf-57b6b8919f86","resolution":{"observed_at":"2026-08-04T18:52:17.521504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01703","last_updated":"2019-12-03T22:06:05Z","snapshot_observed_at":"2026-07-06T08:41:49.632205Z","submitted_at":"2019-12-03T22:06:05Z","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01703","snapshot_observed_at":"2026-08-04T18:52:17.523787Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.523787Z"},"links":{"cited_paper":"/paper/1912.01703","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:03b4aa70d06cd82a0ad94b06c91f7f633981a0825d2ede216baaa9e9d983b5dd","observation_id":"b3a9b0dc-df85-4f7b-821c-1116a48019db","resolution":{"observed_at":"2026-08-04T18:52:17.523787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.526387Z","title":"Ad-hoc on- demand distance vector routing","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.526387Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:5636e89a263a3e0efcbf46c664ccbb0a1355d5bd78816e10368cb7a1a2e91620","observation_id":"f4f1b0c2-d77e-4c83-aab7-092ea0cb4de2","resolution":{"observed_at":"2026-08-04T18:52:17.526387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.528786Z","title":"Monotonic value function factori- sation for deep multi-agent reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.528786Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:8ffe27a4708b5a2ad6f6b85bbb1f4dd778d36988648cc5e47000b67079cbfc92","observation_id":"63e28631-ce1d-43ea-8c94-cd648f90d543","resolution":{"observed_at":"2026-08-04T18:52:17.528786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.531094Z","title":"The graph neural network model","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.531094Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:c658f4fa6aaf876f108da45b3245d07210edd21d9d9a4bba568982e84a341d37","observation_id":"206112fa-592c-4b9e-b830-e54814b81033","resolution":{"observed_at":"2026-08-04T18:52:17.531094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.533452Z","title":"Position-based routing in ad hoc networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.533452Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:3846bc128762d57ca50b752a062c70a90a89a27295505a2808de688becb68852","observation_id":"680ef1cf-c68a-40b4-b422-e4f23f86a7e5","resolution":{"observed_at":"2026-08-04T18:52:17.533452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.536027Z","title":"Value-Decomposition Networks For Cooperative Multi-Agent Learning Based On Team Reward","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.536027Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:ccd9a809266f10ae5924c77036df4b1e514c0675d0f9037c6a83d610a6075cb3","observation_id":"136f0e15-0ea6-4b55-9fe0-a17e18d0d56a","resolution":{"observed_at":"2026-08-04T18:52:17.536027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.538597Z","title":"Stability properties of constrained queueing systems and schedul- ing policies for maximum throughput in multihop radio networks","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.538597Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:052a2942daf76258aaf473e8cd94267983b2ead70e6ac3adb4eafc61abe9330c","observation_id":"3c38ceff-2b94-4471-9fed-083de62328a6","resolution":{"observed_at":"2026-08-04T18:52:17.538597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.540873Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.540873Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:a24c7394a34af1a1f0fd57d37f1eadf4fab7574aa7d93409704748cb60a71ee0","observation_id":"82d395bb-46eb-488c-b4e4-bc52142af79a","resolution":{"observed_at":"2026-08-04T18:52:17.540873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08336","last_updated":"2026-04-20T11:06:32Z","snapshot_observed_at":"2026-07-06T15:54:43.529621Z","submitted_at":"2023-07-17T09:12:05Z","title":"RAYEN: Imposition of Hard Convex Constraints on Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08336","snapshot_observed_at":"2026-08-04T18:52:17.543284Z","title":"Rayen: Imposition of hard convex constraints on neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.543284Z"},"links":{"cited_paper":"/paper/2307.08336","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:127720a0a9f961cf42adf4cad54acef556a53fb2777641f2a2f2b5ed444e31f8","observation_id":"5e1446e4-5c8d-4231-b3fc-07b6394f1c52","resolution":{"observed_at":"2026-08-04T18:52:17.543284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.545890Z","title":"LinSATNet: the positive linear satisfiability neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.545890Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:dc3afc9cc37ab4bc1fbe106537ff62f2f251bc066d1285fbd5ac602cbcec3da2","observation_id":"1990d033-a851-4b6b-b262-6f7fb2944d0c","resolution":{"observed_at":"2026-08-04T18:52:17.545890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.548449Z","title":"On combining shortest-path and back- pressure routing over multihop wireless networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.548449Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:6d2c8937db9648c22394632799592ffa6be46c5979a0b1ef9e582a889dc112a5","observation_id":"41d6d675-c97d-4c6d-9522-f47e21185f6f","resolution":{"observed_at":"2026-08-04T18:52:17.548449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.550755Z","title":"Biased backpressure routing us- ing link features and graph neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.550755Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:bfb21657eae5d90b327c60d19a3ce699b6ef0db9800e522bac60bd80bf70cfdd","observation_id":"7e58149b-b447-43ec-a7f4-20c07c803cfd","resolution":{"observed_at":"2026-08-04T18:52:17.550755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.553476Z","title":"Since the objective is strictly increasing inµ W ijc, this contradicts the optimality ofµ W i","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.553476Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:00c9a6c548319fcebb4c64a497edf7dc807151995df7dbdc1ea20c8e19eafc0a","observation_id":"7a94c64c-d833-4358-ae1f-300b3be96260","resolution":{"observed_at":"2026-08-04T18:52:17.553476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.556140Z","title":"By Lemma 2, each element(j, c)∈E + saturates either the row or column constraint (or both) atM j,c","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.556140Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:500f801caf463bf0e710046f2dda5991d31046a1e45cb03e1944c42fb7d5866a","observation_id":"ea70058e-521a-4212-8bb3-ec619437f1d4","resolution":{"observed_at":"2026-08-04T18:52:17.556140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.558890Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.558890Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:328d7c399e502ca46abcf6cc38d48ad4e58901cacf8f7bae1410e0d769d3b5e7","observation_id":"65c7aa7f-32f9-4bc9-8254-9363cb3612ae","resolution":{"observed_at":"2026-08-04T18:52:17.558890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:52:17.561504Z","title":"Its row/column sum constraints are corresponding subvectors ofT i, Ii","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.561504Z"},"links":{"citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:23378c1cbf76b9a8a6dd4e904b21b9c868d78483ad15a8319b751c3d2d3fa308","observation_id":"85cd9c67-a502-4030-b3d3-da817f200eae","resolution":{"observed_at":"2026-08-04T18:52:17.561504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":45},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"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."}