{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PQFMSZ56AOECG3D3HTSQ6G5EVC","short_pith_number":"pith:PQFMSZ56","schema_version":"1.0","canonical_sha256":"7c0ac967be0388236c7b3ce50f1ba4a8bfc528ef51e4033792f9cccd88eca15a","source":{"kind":"arxiv","id":"2407.09753","version":2},"attestation_state":"computed","paper":{"title":"Biased Backpressure Routing Using Link Features and Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Bojan Radoji\\v{c}i\\'c, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2024-07-13T03:09:22Z","abstract_excerpt":"To reduce the latency of Backpressure (BP) routing in wireless multi-hop networks, we propose to enhance the existing shortest path-biased BP (SP-BP) and sojourn time-based backlog metrics, since they introduce no additional time step-wise signaling overhead to the basic BP. Rather than relying on hop-distance, we introduce a new edge-weighted shortest path bias built on the scheduling duty cycle of wireless links, which can be predicted by a graph convolutional neural network based on the topology and traffic of wireless networks. Additionally, we tackle three long-standing challenges associa"},"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":"2407.09753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2024-07-13T03:09:22Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"829b4174f5cfa3d5e4084feace0196b51b19f8c81cfd40620f8c40a143c056b6","abstract_canon_sha256":"7ec6ca15af12bc1aa4a73d8d572fcb2d3eb06a8f4bbaa3b9735149b3f8ce7c7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:27.609578Z","signature_b64":"8s395VN8BTTeJgW2BFKxTG345VwfUg/mjffS27rdxfkysr9FtPdl9Wu018BPm/GTjmoV4iPHA9Tt5A8nu76uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c0ac967be0388236c7b3ce50f1ba4a8bfc528ef51e4033792f9cccd88eca15a","last_reissued_at":"2026-07-05T09:06:27.609035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:27.609035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Biased Backpressure Routing Using Link Features and Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Bojan Radoji\\v{c}i\\'c, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2024-07-13T03:09:22Z","abstract_excerpt":"To reduce the latency of Backpressure (BP) routing in wireless multi-hop networks, we propose to enhance the existing shortest path-biased BP (SP-BP) and sojourn time-based backlog metrics, since they introduce no additional time step-wise signaling overhead to the basic BP. Rather than relying on hop-distance, we introduce a new edge-weighted shortest path bias built on the scheduling duty cycle of wireless links, which can be predicted by a graph convolutional neural network based on the topology and traffic of wireless networks. Additionally, we tackle three long-standing challenges associa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09753","kind":"arxiv","version":2},"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/2407.09753/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":"2407.09753","created_at":"2026-07-05T09:06:27.609102+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09753v2","created_at":"2026-07-05T09:06:27.609102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09753","created_at":"2026-07-05T09:06:27.609102+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQFMSZ56AOEC","created_at":"2026-07-05T09:06:27.609102+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQFMSZ56AOECG3D3","created_at":"2026-07-05T09:06:27.609102+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQFMSZ56","created_at":"2026-07-05T09:06:27.609102+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/PQFMSZ56AOECG3D3HTSQ6G5EVC","json":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC.json","graph_json":"https://pith.science/api/pith-number/PQFMSZ56AOECG3D3HTSQ6G5EVC/graph.json","events_json":"https://pith.science/api/pith-number/PQFMSZ56AOECG3D3HTSQ6G5EVC/events.json","paper":"https://pith.science/paper/PQFMSZ56"},"agent_actions":{"view_html":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC","download_json":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC.json","view_paper":"https://pith.science/paper/PQFMSZ56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09753&json=true","fetch_graph":"https://pith.science/api/pith-number/PQFMSZ56AOECG3D3HTSQ6G5EVC/graph.json","fetch_events":"https://pith.science/api/pith-number/PQFMSZ56AOECG3D3HTSQ6G5EVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC/action/storage_attestation","attest_author":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC/action/author_attestation","sign_citation":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC/action/citation_signature","submit_replication":"https://pith.science/pith/PQFMSZ56AOECG3D3HTSQ6G5EVC/action/replication_record"}},"created_at":"2026-07-05T09:06:27.609102+00:00","updated_at":"2026-07-05T09:06:27.609102+00:00"}