{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KWU5B35NTP5JRPGHUXPFJ5EOZ4","short_pith_number":"pith:KWU5B35N","canonical_record":{"source":{"id":"1708.06926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T09:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"1347e6fdd69be7ad13176b5c11aa5e4973cd9ad6596446befcc47600b5aadb8f","abstract_canon_sha256":"eb4db28c520931b407cdebcb12c8818e0706cc3ff2b1f6af967decf9f4d962ff"},"schema_version":"1.0"},"canonical_sha256":"55a9d0efad9bfa98bcc7a5de54f48ecf0298b44c873ff49cfbb83b9f6faf0e15","source":{"kind":"arxiv","id":"1708.06926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06926","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06926v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06926","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"KWU5B35NTP5J","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KWU5B35NTP5JRPGH","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KWU5B35N","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KWU5B35NTP5JRPGHUXPFJ5EOZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T09:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"1347e6fdd69be7ad13176b5c11aa5e4973cd9ad6596446befcc47600b5aadb8f","abstract_canon_sha256":"eb4db28c520931b407cdebcb12c8818e0706cc3ff2b1f6af967decf9f4d962ff"},"schema_version":"1.0"},"canonical_sha256":"55a9d0efad9bfa98bcc7a5de54f48ecf0298b44c873ff49cfbb83b9f6faf0e15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.869673Z","signature_b64":"EOtMJGMC0JGWzXI948fx1jpocmqpm09jswGC0aU3Ac4wcn+jmLMSjD4Ww5lutYq323yAP+V8y1rZhL+eGOrICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a9d0efad9bfa98bcc7a5de54f48ecf0298b44c873ff49cfbb83b9f6faf0e15","last_reissued_at":"2026-05-18T00:36:48.869194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.869194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06926","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-05-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ID27EAYzEMGK1QUwCISMjPTPAXe/Re2Ut17NMsm0nONfSjcqxffSdY6eaUwwhkVhevQvKUw09eeGmvGIXF/nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:40:03.936637Z"},"content_sha256":"31987bb6f3625b9675ae3fb0056bd9521a174eeb93ef729eb2fad8466ce23952","schema_version":"1.0","event_id":"sha256:31987bb6f3625b9675ae3fb0056bd9521a174eeb93ef729eb2fad8466ce23952"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KWU5B35NTP5JRPGHUXPFJ5EOZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Juntao Gao, Minoru Ito, Norio Shiratori, Yulong Shen","submitted_at":"2017-08-23T09:16:49Z","abstract_excerpt":"In queueing networks, it is well known that the throughput-optimal backpressure routing algorithm results in poor delay performance for light and moderate traffic loads. To improve delay performance, state-of-the-art backpressure routing algorithm (called BPmin [1]) exploits queue length information to direct packets to less congested routes to their destinations. However, BPmin algorithm estimates route congestion based on unrealistic assumption that every node in the network knows real-time global queue length information of all other nodes. In this paper, we propose multi-agent Q-learning a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06926","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":""},"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-05-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fcI71NI19SxEp1DI5UgDiRg4OD2FOS8L22Jx7Zvb9OhY2XdGM7aX7qG2ZVbEyVgWiTzIo4OL56CVt18fWgSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:40:03.937272Z"},"content_sha256":"4a280daeed1cbdf7f473cebda40caac3147f95a6a9668e91685f33760948466a","schema_version":"1.0","event_id":"sha256:4a280daeed1cbdf7f473cebda40caac3147f95a6a9668e91685f33760948466a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4/bundle.json","state_url":"https://pith.science/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4/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-05-26T21:40:03Z","links":{"resolver":"https://pith.science/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4","bundle":"https://pith.science/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4/bundle.json","state":"https://pith.science/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWU5B35NTP5JRPGHUXPFJ5EOZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KWU5B35NTP5JRPGHUXPFJ5EOZ4","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":"eb4db28c520931b407cdebcb12c8818e0706cc3ff2b1f6af967decf9f4d962ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T09:16:49Z","title_canon_sha256":"1347e6fdd69be7ad13176b5c11aa5e4973cd9ad6596446befcc47600b5aadb8f"},"schema_version":"1.0","source":{"id":"1708.06926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06926","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06926v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06926","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"KWU5B35NTP5J","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KWU5B35NTP5JRPGH","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KWU5B35N","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:4a280daeed1cbdf7f473cebda40caac3147f95a6a9668e91685f33760948466a","target":"graph","created_at":"2026-05-18T00:36:48Z","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"},"paper":{"abstract_excerpt":"In queueing networks, it is well known that the throughput-optimal backpressure routing algorithm results in poor delay performance for light and moderate traffic loads. To improve delay performance, state-of-the-art backpressure routing algorithm (called BPmin [1]) exploits queue length information to direct packets to less congested routes to their destinations. However, BPmin algorithm estimates route congestion based on unrealistic assumption that every node in the network knows real-time global queue length information of all other nodes. In this paper, we propose multi-agent Q-learning a","authors_text":"Juntao Gao, Minoru Ito, Norio Shiratori, Yulong Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T09:16:49Z","title":"Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06926","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:31987bb6f3625b9675ae3fb0056bd9521a174eeb93ef729eb2fad8466ce23952","target":"record","created_at":"2026-05-18T00:36:48Z","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":"eb4db28c520931b407cdebcb12c8818e0706cc3ff2b1f6af967decf9f4d962ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T09:16:49Z","title_canon_sha256":"1347e6fdd69be7ad13176b5c11aa5e4973cd9ad6596446befcc47600b5aadb8f"},"schema_version":"1.0","source":{"id":"1708.06926","kind":"arxiv","version":1}},"canonical_sha256":"55a9d0efad9bfa98bcc7a5de54f48ecf0298b44c873ff49cfbb83b9f6faf0e15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55a9d0efad9bfa98bcc7a5de54f48ecf0298b44c873ff49cfbb83b9f6faf0e15","first_computed_at":"2026-05-18T00:36:48.869194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:48.869194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOtMJGMC0JGWzXI948fx1jpocmqpm09jswGC0aU3Ac4wcn+jmLMSjD4Ww5lutYq323yAP+V8y1rZhL+eGOrICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:48.869673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31987bb6f3625b9675ae3fb0056bd9521a174eeb93ef729eb2fad8466ce23952","sha256:4a280daeed1cbdf7f473cebda40caac3147f95a6a9668e91685f33760948466a"],"state_sha256":"b51c8d4ebea0aa5691e2f54e56935f7e68c49e834ebf8acb85d8b9ec3cf1b695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAyOCVMfQHcBjnw5HoeDQYQRwLgFWqWC+2zVP6oMc+pM6sZKXM1blLMx3FnstceFHDhbD7nMbX80CNwRrvONCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:40:03.939830Z","bundle_sha256":"18619a1095634f22fb9c52bbb50323726c50ff9aef7d396c828832de45721d28"}}