{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QQD7YQXQ3HXX2EUSTMDZ43GM2N","short_pith_number":"pith:QQD7YQXQ","canonical_record":{"source":{"id":"1810.10637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T21:47:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"78f4b090ed3528dc472959a53837b5515f992581189ee1a2ae6253c273953c5b","abstract_canon_sha256":"941b55b340a81487eb6df28d0d4146849a4a9a80a0d43747cf6a80de9f0c1a0f"},"schema_version":"1.0"},"canonical_sha256":"8407fc42f0d9ef7d12929b079e6cccd34a5fa5f2db48a82ab65123f3d3e85a31","source":{"kind":"arxiv","id":"1810.10637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10637","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10637v2","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10637","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"QQD7YQXQ3HXX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQD7YQXQ3HXX2EUS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQD7YQXQ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QQD7YQXQ3HXX2EUSTMDZ43GM2N","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T21:47:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"78f4b090ed3528dc472959a53837b5515f992581189ee1a2ae6253c273953c5b","abstract_canon_sha256":"941b55b340a81487eb6df28d0d4146849a4a9a80a0d43747cf6a80de9f0c1a0f"},"schema_version":"1.0"},"canonical_sha256":"8407fc42f0d9ef7d12929b079e6cccd34a5fa5f2db48a82ab65123f3d3e85a31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.939142Z","signature_b64":"Gbnj4Tww+9ZEPeGSkNvvqp3sbmuLU0esU/mnEE7G5yL9aswupdk/DvpgOjZrI/TrcDm4NryihvC2qyGZOlfNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8407fc42f0d9ef7d12929b079e6cccd34a5fa5f2db48a82ab65123f3d3e85a31","last_reissued_at":"2026-05-17T23:57:56.938461Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.938461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10637","source_version":2,"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhTJRBoqXCgxkb8tCFvn9sThhdoN0+j0ayydDkZAe4uPgKU4k6DZu21BOlZIsjmqDB7jwBdqXnp1CY9IpaCpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:05:23.814095Z"},"content_sha256":"e21670dfeba4b21b59ff770e98ad777c4e3f08463d22fd12117a38a646ea791a","schema_version":"1.0","event_id":"sha256:e21670dfeba4b21b59ff770e98ad777c4e3f08463d22fd12117a38a646ea791a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QQD7YQXQ3HXX2EUSTMDZ43GM2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eytan Modiano, Ruihao Zhu","submitted_at":"2018-10-24T21:47:19Z","abstract_excerpt":"We introduce efficient algorithms which achieve nearly optimal regrets for the problem of stochastic online shortest path routing with end-to-end feedback. The setting is a natural application of the combinatorial stochastic bandits problem, a special case of the linear stochastic bandits problem. We show how the difficulties posed by the large scale action set can be overcome by the networked structure of the action set. Our approach presents a novel connection between bandit learning and shortest path algorithms. Our main contribution is an adaptive exploration algorithm with nearly optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10637","kind":"arxiv","version":2},"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtntQT78PHQUa7dsJfeBopsi1VlbPI9dW/8CMSzcNGH/4iYXR5i0K96yAn83mPzcQ28vaSSYfKIx4M2l8+qYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:05:23.814843Z"},"content_sha256":"0d1bc4fb7251bbbc8110ba76255e3ef9e1bafbe2d04ca644da6d7a263ca54936","schema_version":"1.0","event_id":"sha256:0d1bc4fb7251bbbc8110ba76255e3ef9e1bafbe2d04ca644da6d7a263ca54936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N/bundle.json","state_url":"https://pith.science/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N/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-06-05T23:05:23Z","links":{"resolver":"https://pith.science/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N","bundle":"https://pith.science/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N/bundle.json","state":"https://pith.science/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQD7YQXQ3HXX2EUSTMDZ43GM2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QQD7YQXQ3HXX2EUSTMDZ43GM2N","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":"941b55b340a81487eb6df28d0d4146849a4a9a80a0d43747cf6a80de9f0c1a0f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T21:47:19Z","title_canon_sha256":"78f4b090ed3528dc472959a53837b5515f992581189ee1a2ae6253c273953c5b"},"schema_version":"1.0","source":{"id":"1810.10637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10637","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10637v2","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10637","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"QQD7YQXQ3HXX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQD7YQXQ3HXX2EUS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQD7YQXQ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:0d1bc4fb7251bbbc8110ba76255e3ef9e1bafbe2d04ca644da6d7a263ca54936","target":"graph","created_at":"2026-05-17T23:57:56Z","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":"We introduce efficient algorithms which achieve nearly optimal regrets for the problem of stochastic online shortest path routing with end-to-end feedback. The setting is a natural application of the combinatorial stochastic bandits problem, a special case of the linear stochastic bandits problem. We show how the difficulties posed by the large scale action set can be overcome by the networked structure of the action set. Our approach presents a novel connection between bandit learning and shortest path algorithms. Our main contribution is an adaptive exploration algorithm with nearly optimal ","authors_text":"Eytan Modiano, Ruihao Zhu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T21:47:19Z","title":"Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10637","kind":"arxiv","version":2},"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:e21670dfeba4b21b59ff770e98ad777c4e3f08463d22fd12117a38a646ea791a","target":"record","created_at":"2026-05-17T23:57:56Z","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":"941b55b340a81487eb6df28d0d4146849a4a9a80a0d43747cf6a80de9f0c1a0f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T21:47:19Z","title_canon_sha256":"78f4b090ed3528dc472959a53837b5515f992581189ee1a2ae6253c273953c5b"},"schema_version":"1.0","source":{"id":"1810.10637","kind":"arxiv","version":2}},"canonical_sha256":"8407fc42f0d9ef7d12929b079e6cccd34a5fa5f2db48a82ab65123f3d3e85a31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8407fc42f0d9ef7d12929b079e6cccd34a5fa5f2db48a82ab65123f3d3e85a31","first_computed_at":"2026-05-17T23:57:56.938461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:56.938461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gbnj4Tww+9ZEPeGSkNvvqp3sbmuLU0esU/mnEE7G5yL9aswupdk/DvpgOjZrI/TrcDm4NryihvC2qyGZOlfNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:56.939142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e21670dfeba4b21b59ff770e98ad777c4e3f08463d22fd12117a38a646ea791a","sha256:0d1bc4fb7251bbbc8110ba76255e3ef9e1bafbe2d04ca644da6d7a263ca54936"],"state_sha256":"9a20c85ffaa3948a99c4a70d31cd86a120fc1c80f983aaecce71dff23417aa47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQiutvMPH1pWNzsY5OztyRw1UX4pMtWay3jFE60fsRfxTMHFGR48558qsRQH32YTQWB35JlnoTfT9FLK87R9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:05:23.819352Z","bundle_sha256":"95ed0840b729ba64a0dbfa8801a195da9a3f3bcc69f11baf7734a14d236391f0"}}