{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NU3GWIO7NA5LCVEOX2NAYTWQTB","short_pith_number":"pith:NU3GWIO7","canonical_record":{"source":{"id":"2605.01752","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-03T07:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"b1ef50732ac4c9dbc12b51998f2b3ab1febc61d8fcb8a55cc84ba14bf02d1fa4","abstract_canon_sha256":"678b254aa307c22f2f49a45d49015fe6aceccda3605d253d81ae9caf4e24b033"},"schema_version":"1.0"},"canonical_sha256":"6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59","source":{"kind":"arxiv","id":"2605.01752","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01752","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01752v2","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01752","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"NU3GWIO7NA5L","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"NU3GWIO7NA5LCVEO","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"NU3GWIO7","created_at":"2026-05-20T00:05:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NU3GWIO7NA5LCVEOX2NAYTWQTB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.01752","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-03T07:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"b1ef50732ac4c9dbc12b51998f2b3ab1febc61d8fcb8a55cc84ba14bf02d1fa4","abstract_canon_sha256":"678b254aa307c22f2f49a45d49015fe6aceccda3605d253d81ae9caf4e24b033"},"schema_version":"1.0"},"canonical_sha256":"6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:45.793709Z","signature_b64":"gjnMcoagyRQtUx/G5VooQo6yq+B4JrzYJq+TDSAD8KhmTvqG/WugztDCIZx4Cy9beLgRzQVTeJftJtV0DsYPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59","last_reissued_at":"2026-05-20T00:05:45.793136Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:45.793136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.01752","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-20T00:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQQ830HoCO0nuS+QWAVLiUkIcNyhXlvDFtNfjb0gNcBAiHjRiKoWwfRK1fTh3F1Q0Bfwlb6FwR/95P6j0aeFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:06:00.617686Z"},"content_sha256":"a78121ac5a7eb2835eef4c65fa67496b2b0923516ad0ee8bd3887e67d1dbcf3a","schema_version":"1.0","event_id":"sha256:a78121ac5a7eb2835eef4c65fa67496b2b0923516ad0ee8bd3887e67d1dbcf3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NU3GWIO7NA5LCVEOX2NAYTWQTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Youngmin Oh","submitted_at":"2026-05-03T07:19:05Z","abstract_excerpt":"We study linear dueling bandits in volatile environments characterized by the simultaneous presence of post-serving contexts, delayed feedback, and adversarial corruption. Feedback is subject to unknown stochastic or adversarial delays and a cumulative corruption budget $\\mathcal{C}$. To address these challenges, we propose \\term, which integrates a learned approximator that predicts post-serving contexts from pre-serving information. It further employs an adaptive weighting strategy that clips feature vectors to mitigate the impact of corrupted and delayed observations simultaneously. Under s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Under standard regularity conditions and a parametric post-serving mapping, we rigorously establish that our algorithm is delay-regime-agnostic, achieving a regret upper bound of O~(d(sqrt(T) + C + D)), ... our analysis reveals an additive cost structure between corruption and delay, avoiding the multiplicative degradation typical of prior works. We further establish lower bounds that nearly match our upper bounds up to a sqrt(d) factor for adversarial delays in the absence of post-serving contexts.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"standard regularity conditions and a parametric post-serving mapping (assumed to enable the learned approximator for post-serving contexts)","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The algorithm achieves a delay-regime-agnostic regret bound of O~(d(sqrt(T) + C + D)) with additive costs for corruption and delay under parametric post-serving context assumptions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"de0ff8481f98a0e741b584e81bb0ca96a8085026a5eabf86e1198a7f9f5767fc"},"source":{"id":"2605.01752","kind":"arxiv","version":2},"verdict":{"id":"a32b1b6f-8902-4a73-8a8c-4ac741e7d398","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T15:28:37.091891Z","strongest_claim":"Under standard regularity conditions and a parametric post-serving mapping, we rigorously establish that our algorithm is delay-regime-agnostic, achieving a regret upper bound of O~(d(sqrt(T) + C + D)), ... our analysis reveals an additive cost structure between corruption and delay, avoiding the multiplicative degradation typical of prior works. We further establish lower bounds that nearly match our upper bounds up to a sqrt(d) factor for adversarial delays in the absence of post-serving contexts.","one_line_summary":"The algorithm achieves a delay-regime-agnostic regret bound of O~(d(sqrt(T) + C + D)) with additive costs for corruption and delay under parametric post-serving context assumptions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"standard regularity conditions and a parametric post-serving mapping (assumed to enable the learned approximator for post-serving contexts)","pith_extraction_headline":"A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01752/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T17:00:32.005284Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1fce457090c80ebfba3d975a89bc9a6d23436b1c66e42676a37524dd8c8a73d1"},"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":"a32b1b6f-8902-4a73-8a8c-4ac741e7d398"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45Xs60QYHfIqf3jeNvzPhWhlTTRUO5aywLZCb1ZxeSGTxpTzwoW/eVCtGIFUdYQ5dCkf/Gt3JiuinSHifuZJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:06:00.618687Z"},"content_sha256":"0f055ded36d7ad0b04ca9c5b1f098f459db93ead05bc14801c739777656a7027","schema_version":"1.0","event_id":"sha256:0f055ded36d7ad0b04ca9c5b1f098f459db93ead05bc14801c739777656a7027"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB/bundle.json","state_url":"https://pith.science/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB/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-10T07:06:00Z","links":{"resolver":"https://pith.science/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB","bundle":"https://pith.science/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB/bundle.json","state":"https://pith.science/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NU3GWIO7NA5LCVEOX2NAYTWQTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NU3GWIO7NA5LCVEOX2NAYTWQTB","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":"678b254aa307c22f2f49a45d49015fe6aceccda3605d253d81ae9caf4e24b033","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-03T07:19:05Z","title_canon_sha256":"b1ef50732ac4c9dbc12b51998f2b3ab1febc61d8fcb8a55cc84ba14bf02d1fa4"},"schema_version":"1.0","source":{"id":"2605.01752","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01752","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01752v2","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01752","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"NU3GWIO7NA5L","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"NU3GWIO7NA5LCVEO","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"NU3GWIO7","created_at":"2026-05-20T00:05:45Z"}],"graph_snapshots":[{"event_id":"sha256:0f055ded36d7ad0b04ca9c5b1f098f459db93ead05bc14801c739777656a7027","target":"graph","created_at":"2026-05-20T00:05:45Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Under standard regularity conditions and a parametric post-serving mapping, we rigorously establish that our algorithm is delay-regime-agnostic, achieving a regret upper bound of O~(d(sqrt(T) + C + D)), ... our analysis reveals an additive cost structure between corruption and delay, avoiding the multiplicative degradation typical of prior works. We further establish lower bounds that nearly match our upper bounds up to a sqrt(d) factor for adversarial delays in the absence of post-serving contexts."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"standard regularity conditions and a parametric post-serving mapping (assumed to enable the learned approximator for post-serving contexts)"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The algorithm achieves a delay-regime-agnostic regret bound of O~(d(sqrt(T) + C + D)) with additive costs for corruption and delay under parametric post-serving context assumptions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together."}],"snapshot_sha256":"de0ff8481f98a0e741b584e81bb0ca96a8085026a5eabf86e1198a7f9f5767fc"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T17:00:32.005284Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01752/integrity.json","findings":[],"snapshot_sha256":"1fce457090c80ebfba3d975a89bc9a6d23436b1c66e42676a37524dd8c8a73d1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study linear dueling bandits in volatile environments characterized by the simultaneous presence of post-serving contexts, delayed feedback, and adversarial corruption. Feedback is subject to unknown stochastic or adversarial delays and a cumulative corruption budget $\\mathcal{C}$. To address these challenges, we propose \\term, which integrates a learned approximator that predicts post-serving contexts from pre-serving information. It further employs an adaptive weighting strategy that clips feature vectors to mitigate the impact of corrupted and delayed observations simultaneously. Under s","authors_text":"Youngmin Oh","cross_cats":[],"headline":"A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-03T07:19:05Z","title":"Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01752","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:28:37.091891Z","id":"a32b1b6f-8902-4a73-8a8c-4ac741e7d398","model_set":{"reader":"grok-4.3"},"one_line_summary":"The algorithm achieves a delay-regime-agnostic regret bound of O~(d(sqrt(T) + C + D)) with additive costs for corruption and delay under parametric post-serving context assumptions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together.","strongest_claim":"Under standard regularity conditions and a parametric post-serving mapping, we rigorously establish that our algorithm is delay-regime-agnostic, achieving a regret upper bound of O~(d(sqrt(T) + C + D)), ... our analysis reveals an additive cost structure between corruption and delay, avoiding the multiplicative degradation typical of prior works. We further establish lower bounds that nearly match our upper bounds up to a sqrt(d) factor for adversarial delays in the absence of post-serving contexts.","weakest_assumption":"standard regularity conditions and a parametric post-serving mapping (assumed to enable the learned approximator for post-serving contexts)"}},"verdict_id":"a32b1b6f-8902-4a73-8a8c-4ac741e7d398"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a78121ac5a7eb2835eef4c65fa67496b2b0923516ad0ee8bd3887e67d1dbcf3a","target":"record","created_at":"2026-05-20T00:05:45Z","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":"678b254aa307c22f2f49a45d49015fe6aceccda3605d253d81ae9caf4e24b033","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-03T07:19:05Z","title_canon_sha256":"b1ef50732ac4c9dbc12b51998f2b3ab1febc61d8fcb8a55cc84ba14bf02d1fa4"},"schema_version":"1.0","source":{"id":"2605.01752","kind":"arxiv","version":2}},"canonical_sha256":"6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59","first_computed_at":"2026-05-20T00:05:45.793136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:45.793136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gjnMcoagyRQtUx/G5VooQo6yq+B4JrzYJq+TDSAD8KhmTvqG/WugztDCIZx4Cy9beLgRzQVTeJftJtV0DsYPAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:45.793709Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01752","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a78121ac5a7eb2835eef4c65fa67496b2b0923516ad0ee8bd3887e67d1dbcf3a","sha256:0f055ded36d7ad0b04ca9c5b1f098f459db93ead05bc14801c739777656a7027"],"state_sha256":"445c58d0ffaffab173379cef832e040fd3ca98815bfbcaf1f72261a72a051609"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnFDSPeJcZEXxpwqXeji8xvRLpYikinMF2EzJXkTs6cF43p1I+RAZCFzzBj51OPd3vE7nFmGZUcxwDZF/7PBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:06:00.623408Z","bundle_sha256":"f17e01b45f6c43664afef29ee5869eff38dbd31b236bade0d8d0354b29b971ec"}}