{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UHJCEMWXSIGQCODRRT6STN2TOM","short_pith_number":"pith:UHJCEMWX","schema_version":"1.0","canonical_sha256":"a1d22232d7920d0138718cfd29b75373331cd4bf668abb7e8fad198da6b90f37","source":{"kind":"arxiv","id":"2211.10748","version":1},"attestation_state":"computed","paper":{"title":"Delay-aware Backpressure Routing Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Ananthram Swami, Bojan Radojicic, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2022-11-19T16:57:41Z","abstract_excerpt":"We propose a throughput-optimal biased backpressure (BP) algorithm for routing, where the bias is learned through a graph neural network that seeks to minimize end-to-end delay. Classical BP routing provides a simple yet powerful distributed solution for resource allocation in wireless multi-hop networks but has poor delay performance. A low-cost approach to improve this delay performance is to favor shorter paths by incorporating pre-defined biases in the BP computation, such as a bias based on the shortest path (hop) distance to the destination. In this work, we improve upon the widely-used "},"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":"2211.10748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-11-19T16:57:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9cba0513f8a98c8876380448863d06047761d19aa267086aa957e894c05e1aa6","abstract_canon_sha256":"86387a46609ab64eec18f7d278827967a5a1e517d8f6d92cbac2826792a9b342"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:34.096012Z","signature_b64":"49o6xoeSYlZsP91nx6JeCtJ37bDyO2ARxs4/c4la9w+PWKAcDpzYBKo6D7Vr1yrRSyhaAuUXtoCgN26eZ2L2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1d22232d7920d0138718cfd29b75373331cd4bf668abb7e8fad198da6b90f37","last_reissued_at":"2026-07-05T05:17:34.095560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:34.095560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay-aware Backpressure Routing Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Ananthram Swami, Bojan Radojicic, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2022-11-19T16:57:41Z","abstract_excerpt":"We propose a throughput-optimal biased backpressure (BP) algorithm for routing, where the bias is learned through a graph neural network that seeks to minimize end-to-end delay. Classical BP routing provides a simple yet powerful distributed solution for resource allocation in wireless multi-hop networks but has poor delay performance. A low-cost approach to improve this delay performance is to favor shorter paths by incorporating pre-defined biases in the BP computation, such as a bias based on the shortest path (hop) distance to the destination. In this work, we improve upon the widely-used "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10748","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/2211.10748/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":"2211.10748","created_at":"2026-07-05T05:17:34.095638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10748v1","created_at":"2026-07-05T05:17:34.095638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10748","created_at":"2026-07-05T05:17:34.095638+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHJCEMWXSIGQ","created_at":"2026-07-05T05:17:34.095638+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHJCEMWXSIGQCODR","created_at":"2026-07-05T05:17:34.095638+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHJCEMWX","created_at":"2026-07-05T05:17:34.095638+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/UHJCEMWXSIGQCODRRT6STN2TOM","json":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM.json","graph_json":"https://pith.science/api/pith-number/UHJCEMWXSIGQCODRRT6STN2TOM/graph.json","events_json":"https://pith.science/api/pith-number/UHJCEMWXSIGQCODRRT6STN2TOM/events.json","paper":"https://pith.science/paper/UHJCEMWX"},"agent_actions":{"view_html":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM","download_json":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM.json","view_paper":"https://pith.science/paper/UHJCEMWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10748&json=true","fetch_graph":"https://pith.science/api/pith-number/UHJCEMWXSIGQCODRRT6STN2TOM/graph.json","fetch_events":"https://pith.science/api/pith-number/UHJCEMWXSIGQCODRRT6STN2TOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/action/storage_attestation","attest_author":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/action/author_attestation","sign_citation":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/action/citation_signature","submit_replication":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/action/replication_record"}},"created_at":"2026-07-05T05:17:34.095638+00:00","updated_at":"2026-07-05T05:17:34.095638+00:00"}