{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UHJCEMWXSIGQCODRRT6STN2TOM","short_pith_number":"pith:UHJCEMWX","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"},"canonical_sha256":"a1d22232d7920d0138718cfd29b75373331cd4bf668abb7e8fad198da6b90f37","source":{"kind":"arxiv","id":"2211.10748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10748","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10748v1","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10748","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"UHJCEMWXSIGQ","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"UHJCEMWXSIGQCODR","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"UHJCEMWX","created_at":"2026-07-05T05:17:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UHJCEMWXSIGQCODRRT6STN2TOM","target":"record","payload":{"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"},"canonical_sha256":"a1d22232d7920d0138718cfd29b75373331cd4bf668abb7e8fad198da6b90f37","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"},"source_kind":"arxiv","source_id":"2211.10748","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGaHaagYbwAEjD7XVHL4Au/tRYb8ry6zm1oHxRuMUMtm8XcYUasdouVS6L4q1ll4osujFvCS6u0doGYtt0EnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:14:18.508336Z"},"content_sha256":"dd680453f2db879c2e4d3ccffcfc74b6ff40584cf04b99ba924944d2f05c708d","schema_version":"1.0","event_id":"sha256:dd680453f2db879c2e4d3ccffcfc74b6ff40584cf04b99ba924944d2f05c708d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UHJCEMWXSIGQCODRRT6STN2TOM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBPisYU9gkH3RQeiX7ghreLVajT3HLfgTmSM/ZZGpYnLyAlBWcmx7wnVVnWWDvdTVRqkmW6eE+weRILmLQ0eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:14:18.508930Z"},"content_sha256":"8151097d63ddf82bc164a04154158feee88768e538cba240ca5759c715348063","schema_version":"1.0","event_id":"sha256:8151097d63ddf82bc164a04154158feee88768e538cba240ca5759c715348063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/bundle.json","state_url":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHJCEMWXSIGQCODRRT6STN2TOM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T07:14:18Z","links":{"resolver":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM","bundle":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/bundle.json","state":"https://pith.science/pith/UHJCEMWXSIGQCODRRT6STN2TOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHJCEMWXSIGQCODRRT6STN2TOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UHJCEMWXSIGQCODRRT6STN2TOM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"86387a46609ab64eec18f7d278827967a5a1e517d8f6d92cbac2826792a9b342","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-11-19T16:57:41Z","title_canon_sha256":"9cba0513f8a98c8876380448863d06047761d19aa267086aa957e894c05e1aa6"},"schema_version":"1.0","source":{"id":"2211.10748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10748","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10748v1","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10748","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"UHJCEMWXSIGQ","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"UHJCEMWXSIGQCODR","created_at":"2026-07-05T05:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"UHJCEMWX","created_at":"2026-07-05T05:17:34Z"}],"graph_snapshots":[{"event_id":"sha256:8151097d63ddf82bc164a04154158feee88768e538cba240ca5759c715348063","target":"graph","created_at":"2026-07-05T05:17:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.10748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ananthram Swami, Bojan Radojicic, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-11-19T16:57:41Z","title":"Delay-aware Backpressure Routing Using Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10748","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dd680453f2db879c2e4d3ccffcfc74b6ff40584cf04b99ba924944d2f05c708d","target":"record","created_at":"2026-07-05T05:17:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"86387a46609ab64eec18f7d278827967a5a1e517d8f6d92cbac2826792a9b342","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-11-19T16:57:41Z","title_canon_sha256":"9cba0513f8a98c8876380448863d06047761d19aa267086aa957e894c05e1aa6"},"schema_version":"1.0","source":{"id":"2211.10748","kind":"arxiv","version":1}},"canonical_sha256":"a1d22232d7920d0138718cfd29b75373331cd4bf668abb7e8fad198da6b90f37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1d22232d7920d0138718cfd29b75373331cd4bf668abb7e8fad198da6b90f37","first_computed_at":"2026-07-05T05:17:34.095560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:34.095560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"49o6xoeSYlZsP91nx6JeCtJ37bDyO2ARxs4/c4la9w+PWKAcDpzYBKo6D7Vr1yrRSyhaAuUXtoCgN26eZ2L2Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:34.096012Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.10748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd680453f2db879c2e4d3ccffcfc74b6ff40584cf04b99ba924944d2f05c708d","sha256:8151097d63ddf82bc164a04154158feee88768e538cba240ca5759c715348063"],"state_sha256":"078cca66fad4630981acff5d287a07b5b7a76632837c0bfa7219639d89a51f5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfP00twQuB4RFUY4lSCp/8g9HGPeLhLczC/oz1oLUaBblk3M8pDC2rzNt3yqjVicZx0W51gj6zgwxbvNKXUBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:14:18.514065Z","bundle_sha256":"17a49c20735f4541ddfee561c7df62a17f8fe657b486be859255c93d32bf54eb"}}