{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:G5HFYZJOZSJVC6QGKO5UOUD3XW","short_pith_number":"pith:G5HFYZJO","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"},"canonical_sha256":"374e5c652ecc93517a0653bb47507bbdb08bc7499c78566ee5fa73086c86ca5a","source":{"kind":"arxiv","id":"2608.09036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09036","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09036v1","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09036","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"G5HFYZJOZSJV","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"pith_short_16","alias_value":"G5HFYZJOZSJVC6QG","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"pith_short_8","alias_value":"G5HFYZJO","created_at":"2026-08-11T02:21:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:G5HFYZJOZSJVC6QGKO5UOUD3XW","target":"record","payload":{"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"},"canonical_sha256":"374e5c652ecc93517a0653bb47507bbdb08bc7499c78566ee5fa73086c86ca5a","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"},"source_kind":"arxiv","source_id":"2608.09036","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-08-11T02:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5o8eQQULlBPRDK+x0Bbm2N02PR+R03yx80vPphdorJ+IBYTUdqU4vhSOwqtYabN2Uy6NdFhg5qnOsBarXc65Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:00:53.559413Z"},"content_sha256":"ae88e2ef0e0c6a1526bf9c68e9b51937e111fecd5c7f9cf3fc0cd78b1846095a","schema_version":"1.0","event_id":"sha256:ae88e2ef0e0c6a1526bf9c68e9b51937e111fecd5c7f9cf3fc0cd78b1846095a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:G5HFYZJOZSJVC6QGKO5UOUD3XW","target":"graph","payload":{"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"},"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-08-11T02:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXlo5hFZbmHXc8DA3iCxNNb17FLaBX3PJ1yygybFWAkQ+RGEOpDUwozI0/f/AB9+II75pxNgFDh73814w9guCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:00:53.559921Z"},"content_sha256":"21dc22d76286c5f8f909bc72d9682dff621d273b80c522d3dd48b6ce359d4814","schema_version":"1.0","event_id":"sha256:21dc22d76286c5f8f909bc72d9682dff621d273b80c522d3dd48b6ce359d4814"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:G5HFYZJOZSJVC6QGKO5UOUD3XW","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1002/net.20222 resolves to 'Analysis and computational study of several integer programming formulations for minimum‐energy multicasting in wireless'. A reader following the printed text alone cannot reach it.","snippet":"Bayrak, H., Bailey, M.D.: Shortest path network interdiction with asymmetric information. Networks52(3), 133–140 (2008).https://doi.org/10.1002/net. 20222","arxiv_id":"2608.09036","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":"Analysis and computational study of several integer programming formulations for minimum‐energy multicasting in wireless ad hoc networks","printed_excerpt":"10.1002/net","reconstructed_doi":"10.1002/net.20222"},"severity":"advisory","ref_index":6,"audited_at":"2026-08-14T04:38:35.907185Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/net.20222","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ee528a433384a6d8b9b0e149632b9039236d86d18ac0d84140045475b7c9ec2d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Analysis and computational study of several integer programming formulations for minimum‐energy multicasting in wireless ad hoc networks","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19507,"payload_sha256":"ccd8c0abcc305ddf03a17120a1b6151d8a1c0ce4dce2ba52e2bcf8e35a55e049","signature_b64":"QPk3XxctVX5KcBA8JlqVQKh1qBWEZe8suFau7Ehg/ka/pbsf/vDPci4BJO4FosiL2pxlCnIV+jK7CUhYRVk7CA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T04:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vu0Zyoi4Un0unAWXULy5Jm8/A6ChLsUps+1U8jTeuE0Esmjn+enD0r2me+HjQYJpJCBjish8/g9nNRW1Bm9uAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:00:53.562611Z"},"content_sha256":"afec58b50183db5fd2ead907bd3869ef0289a4a9f5a5af4c688c7f2abddd64d6","schema_version":"1.0","event_id":"sha256:afec58b50183db5fd2ead907bd3869ef0289a4a9f5a5af4c688c7f2abddd64d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/bundle.json","state_url":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/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-19T06:00:53Z","links":{"resolver":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW","bundle":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/bundle.json","state":"https://pith.science/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5HFYZJOZSJVC6QGKO5UOUD3XW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G5HFYZJOZSJVC6QGKO5UOUD3XW","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a705e8987c27115fa30e828598e9076e65cef719ebd9e29f1995cb5b18284429","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-10T02:39:03Z","title_canon_sha256":"78516b472bd0fcbb0b816e5481acaa6afb359eaf5f0e463dee54005b9b2536bc"},"schema_version":"1.0","source":{"id":"2608.09036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09036","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09036v1","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09036","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"G5HFYZJOZSJV","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"pith_short_16","alias_value":"G5HFYZJOZSJVC6QG","created_at":"2026-08-11T02:21:39Z"},{"alias_kind":"pith_short_8","alias_value":"G5HFYZJO","created_at":"2026-08-11T02:21:39Z"}],"graph_snapshots":[{"event_id":"sha256:21dc22d76286c5f8f909bc72d9682dff621d273b80c522d3dd48b6ce359d4814","target":"graph","created_at":"2026-08-11T02:21:39Z","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/2608.09036/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Luca M. Hartmann, Parinaz Naghizadeh","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-10T02:39:03Z","title":"Decision-Focused Learning in Network Interdiction Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09036","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:ae88e2ef0e0c6a1526bf9c68e9b51937e111fecd5c7f9cf3fc0cd78b1846095a","target":"record","created_at":"2026-08-11T02:21:39Z","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":"a705e8987c27115fa30e828598e9076e65cef719ebd9e29f1995cb5b18284429","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-10T02:39:03Z","title_canon_sha256":"78516b472bd0fcbb0b816e5481acaa6afb359eaf5f0e463dee54005b9b2536bc"},"schema_version":"1.0","source":{"id":"2608.09036","kind":"arxiv","version":1}},"canonical_sha256":"374e5c652ecc93517a0653bb47507bbdb08bc7499c78566ee5fa73086c86ca5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"374e5c652ecc93517a0653bb47507bbdb08bc7499c78566ee5fa73086c86ca5a","first_computed_at":"2026-08-11T02:21:39.238191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T02:21:39.238191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LU/eh+1d68uL2NQiC0aHiq5T9zgYrxg0ClArp36vlklC+JnJKdnXpH00jg8vCP0JEgLmHalPr8EUn8HIEZg/AQ==","signature_status":"signed_v1","signed_at":"2026-08-11T02:21:39.239937Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.09036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae88e2ef0e0c6a1526bf9c68e9b51937e111fecd5c7f9cf3fc0cd78b1846095a","sha256:21dc22d76286c5f8f909bc72d9682dff621d273b80c522d3dd48b6ce359d4814","sha256:afec58b50183db5fd2ead907bd3869ef0289a4a9f5a5af4c688c7f2abddd64d6"],"state_sha256":"007c560d6c4a43920f4d8e7b23bfcfd2202cd96f11a39a60b1359ac5a1fbb0e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt6gIcMmsIY8FaXDjUNq8QgjkN2a3De24iRtUiSzLI5cpdhy8wF39hYgdgujcVsohHLeN3Gn+y02Qaku8IJRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T06:00:53.564859Z","bundle_sha256":"1305c0b708940d88a3940f166df43952080baf6b10014c7c3c349b259cab404c"}}