{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G5HFYZJOZSJVC6QGKO5UOUD3XW","short_pith_number":"pith:G5HFYZJO","schema_version":"1.0","canonical_sha256":"374e5c652ecc93517a0653bb47507bbdb08bc7499c78566ee5fa73086c86ca5a","source":{"kind":"arxiv","id":"2608.09036","version":1},"attestation_state":"computed","paper":{"title":"Decision-Focused Learning in Network Interdiction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.GT","authors_text":"Luca M. Hartmann, Parinaz Naghizadeh","submitted_at":"2026-08-10T02:39:03Z","abstract_excerpt":"We study decision-focused learning (DFL) in shortest-path network interdiction (SPNI) games, a Stackelberg game where an interdictor (leader) strengthens the networks' arcs against attacks, while an evader (follower) who is uncertain about costs of attacking network arcs relies on a machine-learned predictor to identify the shortest path. While DFL is highly effective as an end-to-end optimization framework, we show that it faces a fundamental structural failure when employed in this game setting: its training objective admits a broad decision-equivalence class of cost estimators that achieve "},"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":"2608.09036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-10T02:39:03Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"78516b472bd0fcbb0b816e5481acaa6afb359eaf5f0e463dee54005b9b2536bc","abstract_canon_sha256":"a705e8987c27115fa30e828598e9076e65cef719ebd9e29f1995cb5b18284429"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:21:39.239937Z","signature_b64":"LU/eh+1d68uL2NQiC0aHiq5T9zgYrxg0ClArp36vlklC+JnJKdnXpH00jg8vCP0JEgLmHalPr8EUn8HIEZg/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"374e5c652ecc93517a0653bb47507bbdb08bc7499c78566ee5fa73086c86ca5a","last_reissued_at":"2026-08-11T02:21:39.238191Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:21:39.238191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision-Focused Learning in Network Interdiction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.GT","authors_text":"Luca M. Hartmann, Parinaz Naghizadeh","submitted_at":"2026-08-10T02:39:03Z","abstract_excerpt":"We study decision-focused learning (DFL) in shortest-path network interdiction (SPNI) games, a Stackelberg game where an interdictor (leader) strengthens the networks' arcs against attacks, while an evader (follower) who is uncertain about costs of attacking network arcs relies on a machine-learned predictor to identify the shortest path. While DFL is highly effective as an end-to-end optimization framework, we show that it faces a fundamental structural failure when employed in this game setting: its training objective admits a broad decision-equivalence class of cost estimators that achieve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09036","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/2608.09036/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":"2608.09036","created_at":"2026-08-11T02:21:39.238874+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09036v1","created_at":"2026-08-11T02:21:39.238874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09036","created_at":"2026-08-11T02:21:39.238874+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5HFYZJOZSJV","created_at":"2026-08-11T02:21:39.238874+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5HFYZJOZSJVC6QG","created_at":"2026-08-11T02:21:39.238874+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5HFYZJO","created_at":"2026-08-11T02:21:39.238874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW","json":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW.json","graph_json":"https://pith.science/api/pith-number/G5HFYZJOZSJVC6QGKO5UOUD3XW/graph.json","events_json":"https://pith.science/api/pith-number/G5HFYZJOZSJVC6QGKO5UOUD3XW/events.json","paper":"https://pith.science/paper/G5HFYZJO"},"agent_actions":{"view_html":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW","download_json":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW.json","view_paper":"https://pith.science/paper/G5HFYZJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09036&json=true","fetch_graph":"https://pith.science/api/pith-number/G5HFYZJOZSJVC6QGKO5UOUD3XW/graph.json","fetch_events":"https://pith.science/api/pith-number/G5HFYZJOZSJVC6QGKO5UOUD3XW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/action/storage_attestation","attest_author":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/action/author_attestation","sign_citation":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/action/citation_signature","submit_replication":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/action/replication_record"}},"created_at":"2026-08-11T02:21:39.238874+00:00","updated_at":"2026-08-11T02:21:39.238874+00:00"}