{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AVLXT3PV6DM6EQRE5AG7IRMY7Y","short_pith_number":"pith:AVLXT3PV","schema_version":"1.0","canonical_sha256":"055779edf5f0d9e24224e80df44598fe0591ac58732e4c34fc4daea7c567b617","source":{"kind":"arxiv","id":"1610.03348","version":1},"attestation_state":"computed","paper":{"title":"Near Optimal Adaptive Shortest Path Routing with Stochastic Links States under Adversarial Attack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dapeng Oliver Wu, Lin Cheng, Pan Zhou","submitted_at":"2016-10-11T14:09:02Z","abstract_excerpt":"We consider the shortest path routing (SPR) of a network with stochastically time varying link metrics under potential adversarial attacks. Due to potential denial of service attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any \\emph{a priori}, designing an adaptive SPR protocol to cope with all possible situations in practice optimally is a very challenging issue. In this paper, we present the first solution by formulating it as a multi-armed bandit (MAB) problem. By introducing a novel control parameter"},"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":"1610.03348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-11T14:09:02Z","cross_cats_sorted":[],"title_canon_sha256":"1ac08959069c8e3a3c3edee6c196f7af34fc70662f3bd683ea62c4b9591cc3d0","abstract_canon_sha256":"0796f5e81c9c9c0ba46237274f3e3494bc7da3b09d0fd81c60d5bbdc2e29ad30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:31.730342Z","signature_b64":"+qv4X8vdY7QXhQzWLjUtF9MOB3EztePVbTQt0UHbE/iuSynlV+aMgK8MLFEjTSyUVkku16bVR7pf1GTe6U4mDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"055779edf5f0d9e24224e80df44598fe0591ac58732e4c34fc4daea7c567b617","last_reissued_at":"2026-05-18T01:02:31.729893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:31.729893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal Adaptive Shortest Path Routing with Stochastic Links States under Adversarial Attack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dapeng Oliver Wu, Lin Cheng, Pan Zhou","submitted_at":"2016-10-11T14:09:02Z","abstract_excerpt":"We consider the shortest path routing (SPR) of a network with stochastically time varying link metrics under potential adversarial attacks. Due to potential denial of service attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any \\emph{a priori}, designing an adaptive SPR protocol to cope with all possible situations in practice optimally is a very challenging issue. In this paper, we present the first solution by formulating it as a multi-armed bandit (MAB) problem. By introducing a novel control parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03348","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":"1610.03348","created_at":"2026-05-18T01:02:31.729966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03348v1","created_at":"2026-05-18T01:02:31.729966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03348","created_at":"2026-05-18T01:02:31.729966+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVLXT3PV6DM6","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVLXT3PV6DM6EQRE","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVLXT3PV","created_at":"2026-05-18T12:30:07.202191+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/AVLXT3PV6DM6EQRE5AG7IRMY7Y","json":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y.json","graph_json":"https://pith.science/api/pith-number/AVLXT3PV6DM6EQRE5AG7IRMY7Y/graph.json","events_json":"https://pith.science/api/pith-number/AVLXT3PV6DM6EQRE5AG7IRMY7Y/events.json","paper":"https://pith.science/paper/AVLXT3PV"},"agent_actions":{"view_html":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y","download_json":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y.json","view_paper":"https://pith.science/paper/AVLXT3PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03348&json=true","fetch_graph":"https://pith.science/api/pith-number/AVLXT3PV6DM6EQRE5AG7IRMY7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/AVLXT3PV6DM6EQRE5AG7IRMY7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y/action/storage_attestation","attest_author":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y/action/author_attestation","sign_citation":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y/action/citation_signature","submit_replication":"https://pith.science/pith/AVLXT3PV6DM6EQRE5AG7IRMY7Y/action/replication_record"}},"created_at":"2026-05-18T01:02:31.729966+00:00","updated_at":"2026-05-18T01:02:31.729966+00:00"}