{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RB5N6HD5LF6P3OX4ZOIVEB4DI5","short_pith_number":"pith:RB5N6HD5","schema_version":"1.0","canonical_sha256":"887adf1c7d597cfdbafccb915207834742db50bb5b352fad0f682b8dde407356","source":{"kind":"arxiv","id":"2502.01027","version":4},"attestation_state":"computed","paper":{"title":"Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Axel Carlier, Lai Xing Ng, Wei Tsang Ooi, Yannis Montreuil","submitted_at":"2025-02-03T03:44:35Z","abstract_excerpt":"Two-stage Learning-to-Defer (L2D) enables optimal task delegation by assigning each input to either a fixed main model or one of several offline experts, supporting reliable decision-making in complex, multi-agent environments. However, existing L2D frameworks assume clean inputs and are vulnerable to adversarial perturbations that can manipulate query allocation--causing costly misrouting or expert overload. We present the first comprehensive study of adversarial robustness in two-stage L2D systems. We introduce two novel attack strategie--untargeted and targeted--which respectively disrupt o"},"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":"2502.01027","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-03T03:44:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a2d484c36c4bfca2c5ef0c2fe37fec26bf0217bb2672b8c9fd0e7b4fed830b6b","abstract_canon_sha256":"21ff84f16c93e8fa04e79b751d619bba98b2830faf683fc32121daa1cfb2099e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:24.435554Z","signature_b64":"c3LLf5j2rvVKO9NF5cquG6NJzfrU107Tt62VmcGAKr6US8L+oeb8gubB5wkMmTsslFAdZce3ytCIRc/tl5PeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"887adf1c7d597cfdbafccb915207834742db50bb5b352fad0f682b8dde407356","last_reissued_at":"2026-07-05T11:58:24.435114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:24.435114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Axel Carlier, Lai Xing Ng, Wei Tsang Ooi, Yannis Montreuil","submitted_at":"2025-02-03T03:44:35Z","abstract_excerpt":"Two-stage Learning-to-Defer (L2D) enables optimal task delegation by assigning each input to either a fixed main model or one of several offline experts, supporting reliable decision-making in complex, multi-agent environments. However, existing L2D frameworks assume clean inputs and are vulnerable to adversarial perturbations that can manipulate query allocation--causing costly misrouting or expert overload. We present the first comprehensive study of adversarial robustness in two-stage L2D systems. We introduce two novel attack strategie--untargeted and targeted--which respectively disrupt o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01027","kind":"arxiv","version":4},"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/2502.01027/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.01027","created_at":"2026-07-05T11:58:24.435171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01027v4","created_at":"2026-07-05T11:58:24.435171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01027","created_at":"2026-07-05T11:58:24.435171+00:00"},{"alias_kind":"pith_short_12","alias_value":"RB5N6HD5LF6P","created_at":"2026-07-05T11:58:24.435171+00:00"},{"alias_kind":"pith_short_16","alias_value":"RB5N6HD5LF6P3OX4","created_at":"2026-07-05T11:58:24.435171+00:00"},{"alias_kind":"pith_short_8","alias_value":"RB5N6HD5","created_at":"2026-07-05T11:58:24.435171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.15761","citing_title":"Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guarantees","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2510.10988","citing_title":"Adversarial Robustness in One-Stage Learning-to-Defer","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5","json":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5.json","graph_json":"https://pith.science/api/pith-number/RB5N6HD5LF6P3OX4ZOIVEB4DI5/graph.json","events_json":"https://pith.science/api/pith-number/RB5N6HD5LF6P3OX4ZOIVEB4DI5/events.json","paper":"https://pith.science/paper/RB5N6HD5"},"agent_actions":{"view_html":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5","download_json":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5.json","view_paper":"https://pith.science/paper/RB5N6HD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01027&json=true","fetch_graph":"https://pith.science/api/pith-number/RB5N6HD5LF6P3OX4ZOIVEB4DI5/graph.json","fetch_events":"https://pith.science/api/pith-number/RB5N6HD5LF6P3OX4ZOIVEB4DI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5/action/storage_attestation","attest_author":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5/action/author_attestation","sign_citation":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5/action/citation_signature","submit_replication":"https://pith.science/pith/RB5N6HD5LF6P3OX4ZOIVEB4DI5/action/replication_record"}},"created_at":"2026-07-05T11:58:24.435171+00:00","updated_at":"2026-07-05T11:58:24.435171+00:00"}