{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:APK77JMOBMF7SE6O3LTPI6PSDY","short_pith_number":"pith:APK77JMO","schema_version":"1.0","canonical_sha256":"03d5ffa58e0b0bf913cedae6f479f21e3916f1dd6a1d33488635f588e8761a73","source":{"kind":"arxiv","id":"1309.7367","version":5},"attestation_state":"computed","paper":{"title":"Stochastic Online Shortest Path Routing: The Value of Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.NI","authors_text":"Alexandre Proutiere, Mikael Johansson, M. Sadegh Talebi, Richard Combes, Zhenhua Zou","submitted_at":"2013-09-27T20:56:41Z","abstract_excerpt":"This paper studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters, and hence the optimal path, can only be estimated by routing packets through the network and observing the realized delays. Our aim is to find a routing policy that minimizes the regret (the cumulative difference of expected delay) between the path chosen by the policy and the unknown optimal path. We formulate the problem as a combinatorial bandit optimizat"},"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":"1309.7367","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-27T20:56:41Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"fca5a33fee954724f37b1abc2f662a4d97e562966826cffc745b3bfc1b28623f","abstract_canon_sha256":"87dfd4d757bddf2218226bb76fb7398919d8b6d90748c3564a0089b317b01224"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:34.710116Z","signature_b64":"s0NSp3fqd8Bl/PYBUlvpZPFMZreUcdIURei3tFZ89gnakCthJSJv/SVhikqwX/OpfW5oCeDYW7UCyYwSPMsmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d5ffa58e0b0bf913cedae6f479f21e3916f1dd6a1d33488635f588e8761a73","last_reissued_at":"2026-05-18T00:52:34.709637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:34.709637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Online Shortest Path Routing: The Value of Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.NI","authors_text":"Alexandre Proutiere, Mikael Johansson, M. Sadegh Talebi, Richard Combes, Zhenhua Zou","submitted_at":"2013-09-27T20:56:41Z","abstract_excerpt":"This paper studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters, and hence the optimal path, can only be estimated by routing packets through the network and observing the realized delays. Our aim is to find a routing policy that minimizes the regret (the cumulative difference of expected delay) between the path chosen by the policy and the unknown optimal path. We formulate the problem as a combinatorial bandit optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7367","kind":"arxiv","version":5},"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":"1309.7367","created_at":"2026-05-18T00:52:34.709712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7367v5","created_at":"2026-05-18T00:52:34.709712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7367","created_at":"2026-05-18T00:52:34.709712+00:00"},{"alias_kind":"pith_short_12","alias_value":"APK77JMOBMF7","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"APK77JMOBMF7SE6O","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"APK77JMO","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13738","citing_title":"Covariance-adapting algorithm for semi-bandits with application to sparse rewards","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY","json":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY.json","graph_json":"https://pith.science/api/pith-number/APK77JMOBMF7SE6O3LTPI6PSDY/graph.json","events_json":"https://pith.science/api/pith-number/APK77JMOBMF7SE6O3LTPI6PSDY/events.json","paper":"https://pith.science/paper/APK77JMO"},"agent_actions":{"view_html":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY","download_json":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY.json","view_paper":"https://pith.science/paper/APK77JMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7367&json=true","fetch_graph":"https://pith.science/api/pith-number/APK77JMOBMF7SE6O3LTPI6PSDY/graph.json","fetch_events":"https://pith.science/api/pith-number/APK77JMOBMF7SE6O3LTPI6PSDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY/action/storage_attestation","attest_author":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY/action/author_attestation","sign_citation":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY/action/citation_signature","submit_replication":"https://pith.science/pith/APK77JMOBMF7SE6O3LTPI6PSDY/action/replication_record"}},"created_at":"2026-05-18T00:52:34.709712+00:00","updated_at":"2026-05-18T00:52:34.709712+00:00"}