{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G3VO254U2MTSNKYYXFMATPTHYF","short_pith_number":"pith:G3VO254U","schema_version":"1.0","canonical_sha256":"36eaed7794d32726ab18b95809be67c1764314d4676ac974b13a25720c6d18e4","source":{"kind":"arxiv","id":"2508.14884","version":1},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning Based Routing for Heterogeneous Multi-Hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Brian Kim, Fikadu T. Dagefu, Justin H. Kong, Terrence J. Moore","submitted_at":"2025-08-20T17:54:43Z","abstract_excerpt":"Routing in multi-hop wireless networks is a complex problem, especially in heterogeneous networks where multiple wireless communication technologies coexist. Reinforcement learning (RL) methods, such as Q-learning, have been introduced for decentralized routing by allowing nodes to make decisions based on local observations. However, Q-learning suffers from scalability issues and poor generalization due to the difficulty in managing the Q-table in large or dynamic network topologies, especially in heterogeneous networks (HetNets) with diverse channel characteristics. Thus, in this paper, we pr"},"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":"2508.14884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-08-20T17:54:43Z","cross_cats_sorted":[],"title_canon_sha256":"e1c49c07697d02529d749402a2944a4390adf9ea9e60463200b55f0c2e702426","abstract_canon_sha256":"38b25a36fcaf69ddef1b74d57fb7f9a2e88518b1618fb23e1918be73e7f37db2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:45.961951Z","signature_b64":"LAhVhxtUqbzR4K5C5yAo8POiGtNBYMUJD4h9hJjujcHw3qxP7YWD2IWonP0fXwa5oo7coN8F3rxJg/eOmUr+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36eaed7794d32726ab18b95809be67c1764314d4676ac974b13a25720c6d18e4","last_reissued_at":"2026-07-05T11:56:45.961559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:45.961559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning Based Routing for Heterogeneous Multi-Hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Brian Kim, Fikadu T. Dagefu, Justin H. Kong, Terrence J. Moore","submitted_at":"2025-08-20T17:54:43Z","abstract_excerpt":"Routing in multi-hop wireless networks is a complex problem, especially in heterogeneous networks where multiple wireless communication technologies coexist. Reinforcement learning (RL) methods, such as Q-learning, have been introduced for decentralized routing by allowing nodes to make decisions based on local observations. However, Q-learning suffers from scalability issues and poor generalization due to the difficulty in managing the Q-table in large or dynamic network topologies, especially in heterogeneous networks (HetNets) with diverse channel characteristics. Thus, in this paper, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14884","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/2508.14884/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":"2508.14884","created_at":"2026-07-05T11:56:45.961619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14884v1","created_at":"2026-07-05T11:56:45.961619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14884","created_at":"2026-07-05T11:56:45.961619+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3VO254U2MTS","created_at":"2026-07-05T11:56:45.961619+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3VO254U2MTSNKYY","created_at":"2026-07-05T11:56:45.961619+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3VO254U","created_at":"2026-07-05T11:56:45.961619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.14883","citing_title":"The Cost Advantage of Virtual Machine Migrations: Empirical Insights into Amazon's EC2 Marketspace","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF","json":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF.json","graph_json":"https://pith.science/api/pith-number/G3VO254U2MTSNKYYXFMATPTHYF/graph.json","events_json":"https://pith.science/api/pith-number/G3VO254U2MTSNKYYXFMATPTHYF/events.json","paper":"https://pith.science/paper/G3VO254U"},"agent_actions":{"view_html":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF","download_json":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF.json","view_paper":"https://pith.science/paper/G3VO254U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14884&json=true","fetch_graph":"https://pith.science/api/pith-number/G3VO254U2MTSNKYYXFMATPTHYF/graph.json","fetch_events":"https://pith.science/api/pith-number/G3VO254U2MTSNKYYXFMATPTHYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF/action/storage_attestation","attest_author":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF/action/author_attestation","sign_citation":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF/action/citation_signature","submit_replication":"https://pith.science/pith/G3VO254U2MTSNKYYXFMATPTHYF/action/replication_record"}},"created_at":"2026-07-05T11:56:45.961619+00:00","updated_at":"2026-07-05T11:56:45.961619+00:00"}