{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:32CQSAMGOXNBGNBHN6MZ76WBAI","short_pith_number":"pith:32CQSAMG","canonical_record":{"source":{"id":"2504.00461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-01T06:35:42Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b8915a8233b01b6c48d8e76a9b64185d2d1fcba52a3cc0347f58e3cb48509a0d","abstract_canon_sha256":"42e063e263ba84e96709cd50cf98c430210612dcece6ff045c94ad64422830e2"},"schema_version":"1.0"},"canonical_sha256":"de8509018675da1334276f999ffac1022c1d22af4b9b847ac338f86bb9c9d4a9","source":{"kind":"arxiv","id":"2504.00461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00461","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00461v1","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00461","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"32CQSAMGOXNB","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"pith_short_16","alias_value":"32CQSAMGOXNBGNBH","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"pith_short_8","alias_value":"32CQSAMG","created_at":"2026-07-05T10:43:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:32CQSAMGOXNBGNBHN6MZ76WBAI","target":"record","payload":{"canonical_record":{"source":{"id":"2504.00461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-01T06:35:42Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b8915a8233b01b6c48d8e76a9b64185d2d1fcba52a3cc0347f58e3cb48509a0d","abstract_canon_sha256":"42e063e263ba84e96709cd50cf98c430210612dcece6ff045c94ad64422830e2"},"schema_version":"1.0"},"canonical_sha256":"de8509018675da1334276f999ffac1022c1d22af4b9b847ac338f86bb9c9d4a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:47.268241Z","signature_b64":"kSSLTqQp3LPJQjCftmUe0nMlfR79lVpzlDrKqnmUholOaPUS+QvP1EiHEhFiSkLuDAhkHZ7kv3iTY9TXfkd8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de8509018675da1334276f999ffac1022c1d22af4b9b847ac338f86bb9c9d4a9","last_reissued_at":"2026-07-05T10:43:47.267697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:47.267697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.00461","source_version":1,"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-07-05T10:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSykEkm6kZ689WkQ9LVnoX02Cf7fph9iXSgDFIp2jUL9GyDpag8+JMMIibX0RcypmXqn2LifyvPUYP+rHtoIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:55:26.596277Z"},"content_sha256":"4455bd3108e6246dd19d0e4116160c61eae6bc00a46f24530c23cb1e002a0c21","schema_version":"1.0","event_id":"sha256:4455bd3108e6246dd19d0e4116160c61eae6bc00a46f24530c23cb1e002a0c21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:32CQSAMGOXNBGNBHN6MZ76WBAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Arnab Maiti, Gabriele Farina, Kevin Jamieson, Lillian J. Ratliff, Zhiyuan Fan","submitted_at":"2025-04-01T06:35:42Z","abstract_excerpt":"In this paper, we study the online shortest path problem in directed acyclic graphs (DAGs) under bandit feedback against an adaptive adversary. Given a DAG $G = (V, E)$ with a source node $v_{\\mathsf{s}}$ and a sink node $v_{\\mathsf{t}}$, let $X \\subseteq \\{0,1\\}^{|E|}$ denote the set of all paths from $v_{\\mathsf{s}}$ to $v_{\\mathsf{t}}$. At each round $t$, we select a path $\\mathbf{x}_t \\in X$ and receive bandit feedback on our loss $\\langle \\mathbf{x}_t, \\mathbf{y}_t \\rangle \\in [-1,1]$, where $\\mathbf{y}_t$ is an adversarially chosen loss vector. Our goal is to minimize regret with respect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00461","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/2504.00461/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"},"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-07-05T10:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTnr3+ZozZbpMQidGeI909CpdOPy2mM8Owq5zXQ6ZB/84DfoPYa9PNEM1I0xQoq9ELsI/OP6ltDZ3DcxVW8KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:55:26.597395Z"},"content_sha256":"d805875bf8d4798c08cf5b6d11167d2da5964c7e96d56115d021435837f27739","schema_version":"1.0","event_id":"sha256:d805875bf8d4798c08cf5b6d11167d2da5964c7e96d56115d021435837f27739"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32CQSAMGOXNBGNBHN6MZ76WBAI/bundle.json","state_url":"https://pith.science/pith/32CQSAMGOXNBGNBHN6MZ76WBAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32CQSAMGOXNBGNBHN6MZ76WBAI/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-08-08T04:55:26Z","links":{"resolver":"https://pith.science/pith/32CQSAMGOXNBGNBHN6MZ76WBAI","bundle":"https://pith.science/pith/32CQSAMGOXNBGNBHN6MZ76WBAI/bundle.json","state":"https://pith.science/pith/32CQSAMGOXNBGNBHN6MZ76WBAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32CQSAMGOXNBGNBHN6MZ76WBAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:32CQSAMGOXNBGNBHN6MZ76WBAI","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":"42e063e263ba84e96709cd50cf98c430210612dcece6ff045c94ad64422830e2","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-01T06:35:42Z","title_canon_sha256":"b8915a8233b01b6c48d8e76a9b64185d2d1fcba52a3cc0347f58e3cb48509a0d"},"schema_version":"1.0","source":{"id":"2504.00461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00461","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00461v1","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00461","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"32CQSAMGOXNB","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"pith_short_16","alias_value":"32CQSAMGOXNBGNBH","created_at":"2026-07-05T10:43:47Z"},{"alias_kind":"pith_short_8","alias_value":"32CQSAMG","created_at":"2026-07-05T10:43:47Z"}],"graph_snapshots":[{"event_id":"sha256:d805875bf8d4798c08cf5b6d11167d2da5964c7e96d56115d021435837f27739","target":"graph","created_at":"2026-07-05T10:43:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.00461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the online shortest path problem in directed acyclic graphs (DAGs) under bandit feedback against an adaptive adversary. Given a DAG $G = (V, E)$ with a source node $v_{\\mathsf{s}}$ and a sink node $v_{\\mathsf{t}}$, let $X \\subseteq \\{0,1\\}^{|E|}$ denote the set of all paths from $v_{\\mathsf{s}}$ to $v_{\\mathsf{t}}$. At each round $t$, we select a path $\\mathbf{x}_t \\in X$ and receive bandit feedback on our loss $\\langle \\mathbf{x}_t, \\mathbf{y}_t \\rangle \\in [-1,1]$, where $\\mathbf{y}_t$ is an adversarially chosen loss vector. Our goal is to minimize regret with respect","authors_text":"Arnab Maiti, Gabriele Farina, Kevin Jamieson, Lillian J. Ratliff, Zhiyuan Fan","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-01T06:35:42Z","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00461","kind":"arxiv","version":1},"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:4455bd3108e6246dd19d0e4116160c61eae6bc00a46f24530c23cb1e002a0c21","target":"record","created_at":"2026-07-05T10:43:47Z","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":"42e063e263ba84e96709cd50cf98c430210612dcece6ff045c94ad64422830e2","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-01T06:35:42Z","title_canon_sha256":"b8915a8233b01b6c48d8e76a9b64185d2d1fcba52a3cc0347f58e3cb48509a0d"},"schema_version":"1.0","source":{"id":"2504.00461","kind":"arxiv","version":1}},"canonical_sha256":"de8509018675da1334276f999ffac1022c1d22af4b9b847ac338f86bb9c9d4a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de8509018675da1334276f999ffac1022c1d22af4b9b847ac338f86bb9c9d4a9","first_computed_at":"2026-07-05T10:43:47.267697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:47.267697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kSSLTqQp3LPJQjCftmUe0nMlfR79lVpzlDrKqnmUholOaPUS+QvP1EiHEhFiSkLuDAhkHZ7kv3iTY9TXfkd8Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:47.268241Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.00461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4455bd3108e6246dd19d0e4116160c61eae6bc00a46f24530c23cb1e002a0c21","sha256:d805875bf8d4798c08cf5b6d11167d2da5964c7e96d56115d021435837f27739"],"state_sha256":"667946542fc52f5ac9641fc04295cab190528c04c6396977534aee4f48f2b984"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cfIDMIE4B2STwprguZEAdZCSKdRCqfbAxsvMFkZlSeyu5YJQtOqdSnIphDBNSaU/7KvJ1q1wAJbqfw7zme3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:55:26.603542Z","bundle_sha256":"c42eea2b8e2d6f4a13da79e9b1cd9c05ed15ca755899eb03cc2bef70f66d81fa"}}