{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2IESIAWJFSTFNOR6LTC5VTL3ZI","short_pith_number":"pith:2IESIAWJ","schema_version":"1.0","canonical_sha256":"d2092402c92ca656ba3e5cc5dacd7bca15b1d97a3f16d38ad2696317c59fd7f5","source":{"kind":"arxiv","id":"1603.08664","version":1},"attestation_state":"computed","paper":{"title":"Learning for Robust Routing Based on Stochastic Game in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andres Kwasinski, Dusit Niyato, Wenbo Wang, Zhu Han","submitted_at":"2016-03-29T07:22:15Z","abstract_excerpt":"This paper studies the problem of robust spectrum-aware routing in a multi-hop, multi-channel Cognitive Radio Network (CRN) with the presence of malicious nodes in the secondary network. The proposed routing scheme models the interaction among the Secondary Users (SUs) as a stochastic game. By allowing the backward propagation of the path utility information from the next-hop nodes, the stochastic routing game is decomposed into a series of stage games. The best-response policies are learned through the process of smooth fictitious play, which is guaranteed to converge without flooding of the "},"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":"1603.08664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-29T07:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"e094a807d51d31a1ea22c52e6c3bfb959b4a6fdc1010cbfbda7d4d1756c1a63f","abstract_canon_sha256":"db4d5229332056f4464f14bcd6bfbc82fbb31e11efee60b7297a9c971d9136db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:22.872992Z","signature_b64":"4yyaGFg5pZKiR7cgZUSWuhdYvXP52omxkz0L1i4ToMmhpu4F10jrILbdz8EfsutkITMxvjh80pZdxr8hX/9FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2092402c92ca656ba3e5cc5dacd7bca15b1d97a3f16d38ad2696317c59fd7f5","last_reissued_at":"2026-05-18T00:24:22.872593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:22.872593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning for Robust Routing Based on Stochastic Game in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andres Kwasinski, Dusit Niyato, Wenbo Wang, Zhu Han","submitted_at":"2016-03-29T07:22:15Z","abstract_excerpt":"This paper studies the problem of robust spectrum-aware routing in a multi-hop, multi-channel Cognitive Radio Network (CRN) with the presence of malicious nodes in the secondary network. The proposed routing scheme models the interaction among the Secondary Users (SUs) as a stochastic game. By allowing the backward propagation of the path utility information from the next-hop nodes, the stochastic routing game is decomposed into a series of stage games. The best-response policies are learned through the process of smooth fictitious play, which is guaranteed to converge without flooding of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08664","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.08664","created_at":"2026-05-18T00:24:22.872651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08664v1","created_at":"2026-05-18T00:24:22.872651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08664","created_at":"2026-05-18T00:24:22.872651+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IESIAWJFSTF","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IESIAWJFSTFNOR6","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IESIAWJ","created_at":"2026-05-18T12:29:55.572404+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/2IESIAWJFSTFNOR6LTC5VTL3ZI","json":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI.json","graph_json":"https://pith.science/api/pith-number/2IESIAWJFSTFNOR6LTC5VTL3ZI/graph.json","events_json":"https://pith.science/api/pith-number/2IESIAWJFSTFNOR6LTC5VTL3ZI/events.json","paper":"https://pith.science/paper/2IESIAWJ"},"agent_actions":{"view_html":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI","download_json":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI.json","view_paper":"https://pith.science/paper/2IESIAWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08664&json=true","fetch_graph":"https://pith.science/api/pith-number/2IESIAWJFSTFNOR6LTC5VTL3ZI/graph.json","fetch_events":"https://pith.science/api/pith-number/2IESIAWJFSTFNOR6LTC5VTL3ZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI/action/storage_attestation","attest_author":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI/action/author_attestation","sign_citation":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI/action/citation_signature","submit_replication":"https://pith.science/pith/2IESIAWJFSTFNOR6LTC5VTL3ZI/action/replication_record"}},"created_at":"2026-05-18T00:24:22.872651+00:00","updated_at":"2026-05-18T00:24:22.872651+00:00"}