{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AIARCOLF6ZYB6MCMMHEXOZVTJM","short_pith_number":"pith:AIARCOLF","schema_version":"1.0","canonical_sha256":"0201113965f6701f304c61c97766b34b1dad619d8e441a0802e680aba9ca355a","source":{"kind":"arxiv","id":"2312.02471","version":2},"attestation_state":"computed","paper":{"title":"Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using 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":"Gunjan Verma, Jake Perazzone, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2023-12-05T03:46:30Z","abstract_excerpt":"Computational offloading has become an enabling component for edge intelligence in mobile and smart devices. Existing offloading schemes mainly focus on mobile devices and servers, while ignoring the potential network congestion caused by tasks from multiple mobile devices, especially in wireless multi-hop networks. To fill this gap, we propose a low-overhead, congestion-aware distributed task offloading scheme by augmenting a distributed greedy framework with graph-based machine learning. In simulated wireless multi-hop networks with 20-110 nodes and a resource allocation scheme based on shor"},"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":"2312.02471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-12-05T03:46:30Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"d186cc2273da3952b98565882cd3e98eba702765fbf5eb534be204a6e12f459f","abstract_canon_sha256":"a83ac6a33a36db3351801df1f2829732bae6c44dd0c5c9851525a551db064885"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:04.888434Z","signature_b64":"au1JbDMmVbLwmQ91rutTmnUUp3tAPl/Ew5/omaBkjF4BGTZzMiPn+13XR/xoH6YMBHgDlXivVM8UBitGvVhnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0201113965f6701f304c61c97766b34b1dad619d8e441a0802e680aba9ca355a","last_reissued_at":"2026-07-05T07:36:04.887939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:04.887939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using 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":"Gunjan Verma, Jake Perazzone, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2023-12-05T03:46:30Z","abstract_excerpt":"Computational offloading has become an enabling component for edge intelligence in mobile and smart devices. Existing offloading schemes mainly focus on mobile devices and servers, while ignoring the potential network congestion caused by tasks from multiple mobile devices, especially in wireless multi-hop networks. To fill this gap, we propose a low-overhead, congestion-aware distributed task offloading scheme by augmenting a distributed greedy framework with graph-based machine learning. In simulated wireless multi-hop networks with 20-110 nodes and a resource allocation scheme based on shor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02471","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/2312.02471/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":"2312.02471","created_at":"2026-07-05T07:36:04.888005+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02471v2","created_at":"2026-07-05T07:36:04.888005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02471","created_at":"2026-07-05T07:36:04.888005+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIARCOLF6ZYB","created_at":"2026-07-05T07:36:04.888005+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIARCOLF6ZYB6MCM","created_at":"2026-07-05T07:36:04.888005+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIARCOLF","created_at":"2026-07-05T07:36:04.888005+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/AIARCOLF6ZYB6MCMMHEXOZVTJM","json":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM.json","graph_json":"https://pith.science/api/pith-number/AIARCOLF6ZYB6MCMMHEXOZVTJM/graph.json","events_json":"https://pith.science/api/pith-number/AIARCOLF6ZYB6MCMMHEXOZVTJM/events.json","paper":"https://pith.science/paper/AIARCOLF"},"agent_actions":{"view_html":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM","download_json":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM.json","view_paper":"https://pith.science/paper/AIARCOLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02471&json=true","fetch_graph":"https://pith.science/api/pith-number/AIARCOLF6ZYB6MCMMHEXOZVTJM/graph.json","fetch_events":"https://pith.science/api/pith-number/AIARCOLF6ZYB6MCMMHEXOZVTJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM/action/storage_attestation","attest_author":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM/action/author_attestation","sign_citation":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM/action/citation_signature","submit_replication":"https://pith.science/pith/AIARCOLF6ZYB6MCMMHEXOZVTJM/action/replication_record"}},"created_at":"2026-07-05T07:36:04.888005+00:00","updated_at":"2026-07-05T07:36:04.888005+00:00"}