{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6SIK66Y6IJALXXSLQXDN5EMR42","short_pith_number":"pith:6SIK66Y6","canonical_record":{"source":{"id":"2406.13023","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-18T19:30:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e82f0d84d449153c673df854643d76bde1caee0f3c399f8f9dc307e4544263cc","abstract_canon_sha256":"2f96b30854182ea0d7f76a034b658e5e1630c34efb8cf74e01047876405834a7"},"schema_version":"1.0"},"canonical_sha256":"f490af7b1e4240bbde4b85c6de9191e6abeb495c0c83dae10fa34385d793dc81","source":{"kind":"arxiv","id":"2406.13023","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.13023","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"2406.13023v4","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13023","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"6SIK66Y6IJAL","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SIK66Y6IJALXXSL","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SIK66Y6","created_at":"2026-07-05T11:23:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6SIK66Y6IJALXXSLQXDN5EMR42","target":"record","payload":{"canonical_record":{"source":{"id":"2406.13023","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-18T19:30:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e82f0d84d449153c673df854643d76bde1caee0f3c399f8f9dc307e4544263cc","abstract_canon_sha256":"2f96b30854182ea0d7f76a034b658e5e1630c34efb8cf74e01047876405834a7"},"schema_version":"1.0"},"canonical_sha256":"f490af7b1e4240bbde4b85c6de9191e6abeb495c0c83dae10fa34385d793dc81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:16.664597Z","signature_b64":"pIZCPa+PbJKL2prQEmxQ8IXYsU4eP83AmJWcGl4p4sTdc7ZgoxHLH1WS4UQpXZVtiH7xJwF0qM0esvUJAQzbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f490af7b1e4240bbde4b85c6de9191e6abeb495c0c83dae10fa34385d793dc81","last_reissued_at":"2026-07-05T11:23:16.664087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:16.664087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.13023","source_version":4,"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-05T11:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqFNZ10RViuNyKwN/j0VDuGMHc03TaRibr6kYpX03TQpiYtmI7YVK59A83FFGLRpWIBiTEbOpn3Gsh298+G+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:15:25.436565Z"},"content_sha256":"db87b626c3660b51d5cbad88c09f904faea38512d2b164a1a8e2492c93db060b","schema_version":"1.0","event_id":"sha256:db87b626c3660b51d5cbad88c09f904faea38512d2b164a1a8e2492c93db060b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6SIK66Y6IJALXXSLQXDN5EMR42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$k$-Submodular Interdiction Problems under Distributional Risk-Receptiveness and Robustness: Application to Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Manish Bansal, Seonghun Park","submitted_at":"2024-06-18T19:30:46Z","abstract_excerpt":"We study submodular optimization in adversarial context, applicable to machine learning problems such as feature selection using data susceptible to uncertainties and attacks. We focus on Stackelberg games between an attacker (or interdictor) and a defender where the attacker aims to minimize the defender's objective of maximizing a $k$-submodular function. We allow uncertainties arising from the success of attacks and inherent data noise, and address challenges due to incomplete knowledge of the probability distribution of random parameters. Specifically, we introduce Distributionally Robust "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13023","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/2406.13023/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-05T11:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IK786eayKDO9PZ58V5SQ0c+Edf4zoJgMS8KQQGvl/RNmhc3ky1nrSHua03wVRMfubFT6uSt1gTDB5OOcd7kzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:15:25.438150Z"},"content_sha256":"bcefb90dfa928b0fdaa6de5bfcb5e03da68b4674b63cac84483aa83f8a7c4fa9","schema_version":"1.0","event_id":"sha256:bcefb90dfa928b0fdaa6de5bfcb5e03da68b4674b63cac84483aa83f8a7c4fa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SIK66Y6IJALXXSLQXDN5EMR42/bundle.json","state_url":"https://pith.science/pith/6SIK66Y6IJALXXSLQXDN5EMR42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SIK66Y6IJALXXSLQXDN5EMR42/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-23T05:15:25Z","links":{"resolver":"https://pith.science/pith/6SIK66Y6IJALXXSLQXDN5EMR42","bundle":"https://pith.science/pith/6SIK66Y6IJALXXSLQXDN5EMR42/bundle.json","state":"https://pith.science/pith/6SIK66Y6IJALXXSLQXDN5EMR42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SIK66Y6IJALXXSLQXDN5EMR42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6SIK66Y6IJALXXSLQXDN5EMR42","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":"2f96b30854182ea0d7f76a034b658e5e1630c34efb8cf74e01047876405834a7","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-18T19:30:46Z","title_canon_sha256":"e82f0d84d449153c673df854643d76bde1caee0f3c399f8f9dc307e4544263cc"},"schema_version":"1.0","source":{"id":"2406.13023","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.13023","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"2406.13023v4","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13023","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"6SIK66Y6IJAL","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SIK66Y6IJALXXSL","created_at":"2026-07-05T11:23:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SIK66Y6","created_at":"2026-07-05T11:23:16Z"}],"graph_snapshots":[{"event_id":"sha256:bcefb90dfa928b0fdaa6de5bfcb5e03da68b4674b63cac84483aa83f8a7c4fa9","target":"graph","created_at":"2026-07-05T11:23:16Z","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/2406.13023/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study submodular optimization in adversarial context, applicable to machine learning problems such as feature selection using data susceptible to uncertainties and attacks. We focus on Stackelberg games between an attacker (or interdictor) and a defender where the attacker aims to minimize the defender's objective of maximizing a $k$-submodular function. We allow uncertainties arising from the success of attacks and inherent data noise, and address challenges due to incomplete knowledge of the probability distribution of random parameters. Specifically, we introduce Distributionally Robust ","authors_text":"Manish Bansal, Seonghun Park","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-18T19:30:46Z","title":"$k$-Submodular Interdiction Problems under Distributional Risk-Receptiveness and Robustness: Application to Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13023","kind":"arxiv","version":4},"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:db87b626c3660b51d5cbad88c09f904faea38512d2b164a1a8e2492c93db060b","target":"record","created_at":"2026-07-05T11:23:16Z","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":"2f96b30854182ea0d7f76a034b658e5e1630c34efb8cf74e01047876405834a7","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-18T19:30:46Z","title_canon_sha256":"e82f0d84d449153c673df854643d76bde1caee0f3c399f8f9dc307e4544263cc"},"schema_version":"1.0","source":{"id":"2406.13023","kind":"arxiv","version":4}},"canonical_sha256":"f490af7b1e4240bbde4b85c6de9191e6abeb495c0c83dae10fa34385d793dc81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f490af7b1e4240bbde4b85c6de9191e6abeb495c0c83dae10fa34385d793dc81","first_computed_at":"2026-07-05T11:23:16.664087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:16.664087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIZCPa+PbJKL2prQEmxQ8IXYsU4eP83AmJWcGl4p4sTdc7ZgoxHLH1WS4UQpXZVtiH7xJwF0qM0esvUJAQzbDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:16.664597Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.13023","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db87b626c3660b51d5cbad88c09f904faea38512d2b164a1a8e2492c93db060b","sha256:bcefb90dfa928b0fdaa6de5bfcb5e03da68b4674b63cac84483aa83f8a7c4fa9"],"state_sha256":"0030dbbdd5b48e314423bf3ecc98f2a445d0e3ad0269b47c66305b6dfeaab718"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZQAbkGi8CqKcaEXMXWCMn82XhhyGeFJRfHNV/aZh4jRf8f6MVpi1vYJ4vBgu5eFzS+stpijpRwv64/8ewwxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T05:15:25.443669Z","bundle_sha256":"e2f012ce22fa060b860693047f0f283998727ca531e8987f7a3a0b6466ff130d"}}