{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RR5WAAZ4HDSPN5MD4HNDBN4ZI4","short_pith_number":"pith:RR5WAAZ4","canonical_record":{"source":{"id":"1703.07280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T15:38:50Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"abb1014ad81ddf536c97c26e4931e91b79adc0ba3f8550b4d645f13b970dcdf4","abstract_canon_sha256":"5a0d034d1435396ce2971ecdb76abae8e60abfc80c73228e1b4ae213975fb6a9"},"schema_version":"1.0"},"canonical_sha256":"8c7b60033c38e4f6f583e1da30b799472aa3dd7155401493194d0ec21ac54f78","source":{"kind":"arxiv","id":"1703.07280","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07280","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07280v2","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07280","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"RR5WAAZ4HDSP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RR5WAAZ4HDSPN5MD","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RR5WAAZ4","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RR5WAAZ4HDSPN5MD4HNDBN4ZI4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T15:38:50Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"abb1014ad81ddf536c97c26e4931e91b79adc0ba3f8550b4d645f13b970dcdf4","abstract_canon_sha256":"5a0d034d1435396ce2971ecdb76abae8e60abfc80c73228e1b4ae213975fb6a9"},"schema_version":"1.0"},"canonical_sha256":"8c7b60033c38e4f6f583e1da30b799472aa3dd7155401493194d0ec21ac54f78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:41.423879Z","signature_b64":"bxPy/jy+45eh4P0kPH13rTlVvX5H8/xh6SQGwu59vpiXRX72EdgZOGHzRK2BHOCT2RYDsiXC0SjKscK14y73DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c7b60033c38e4f6f583e1da30b799472aa3dd7155401493194d0ec21ac54f78","last_reissued_at":"2026-05-18T00:31:41.423450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:41.423450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07280","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-18T00:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phNRQvQtiNyS/GyYzWaQK8u5L4GVb/ol7Twch0uvvOlbVL+Ln2mmORlFZOiAN7nT3WNGUy7f0M18VjmGjiLuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:10:40.934342Z"},"content_sha256":"d7d7f619e3970c3e991ed8ac7b9d5728c38d6692b63ac2d3f22456154d0a0a0a","schema_version":"1.0","event_id":"sha256:d7d7f619e3970c3e991ed8ac7b9d5728c38d6692b63ac2d3f22456154d0a0a0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RR5WAAZ4HDSPN5MD4HNDBN4ZI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resilient Monotone Submodular Function Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"Ali Jadbabaie, George J. Pappas, Konstantinos Gatsis, Vasileios Tzoumas","submitted_at":"2017-03-21T15:38:50Z","abstract_excerpt":"In this paper, we focus on applications in machine learning, optimization, and control that call for the resilient selection of a few elements, e.g. features, sensors, or leaders, against a number of adversarial denial-of-service attacks or failures. In general, such resilient optimization problems are hard, and cannot be solved exactly in polynomial time, even though they often involve objective functions that are monotone and submodular. Notwithstanding, in this paper we provide the first scalable, curvature-dependent algorithm for their approximate solution, that is valid for any number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07280","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrfJmKSka2Ey0uHVSfwP2/1cPr/A3Ew9/e0i2l/Xg+yix1cYodJs2xWdBGHVSszkXBulG0wyBJj7rJwN8tUYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:10:40.935071Z"},"content_sha256":"00f3d83f1639b89406eae42f608a214ba276199e976ce34776c73c62315e4be9","schema_version":"1.0","event_id":"sha256:00f3d83f1639b89406eae42f608a214ba276199e976ce34776c73c62315e4be9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4/bundle.json","state_url":"https://pith.science/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4/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-05-26T09:10:40Z","links":{"resolver":"https://pith.science/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4","bundle":"https://pith.science/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4/bundle.json","state":"https://pith.science/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RR5WAAZ4HDSPN5MD4HNDBN4ZI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RR5WAAZ4HDSPN5MD4HNDBN4ZI4","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":"5a0d034d1435396ce2971ecdb76abae8e60abfc80c73228e1b4ae213975fb6a9","cross_cats_sorted":["cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T15:38:50Z","title_canon_sha256":"abb1014ad81ddf536c97c26e4931e91b79adc0ba3f8550b4d645f13b970dcdf4"},"schema_version":"1.0","source":{"id":"1703.07280","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07280","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07280v2","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07280","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"RR5WAAZ4HDSP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RR5WAAZ4HDSPN5MD","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RR5WAAZ4","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:00f3d83f1639b89406eae42f608a214ba276199e976ce34776c73c62315e4be9","target":"graph","created_at":"2026-05-18T00:31:41Z","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"},"paper":{"abstract_excerpt":"In this paper, we focus on applications in machine learning, optimization, and control that call for the resilient selection of a few elements, e.g. features, sensors, or leaders, against a number of adversarial denial-of-service attacks or failures. In general, such resilient optimization problems are hard, and cannot be solved exactly in polynomial time, even though they often involve objective functions that are monotone and submodular. Notwithstanding, in this paper we provide the first scalable, curvature-dependent algorithm for their approximate solution, that is valid for any number of ","authors_text":"Ali Jadbabaie, George J. Pappas, Konstantinos Gatsis, Vasileios Tzoumas","cross_cats":["cs.MA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T15:38:50Z","title":"Resilient Monotone Submodular Function Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07280","kind":"arxiv","version":2},"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:d7d7f619e3970c3e991ed8ac7b9d5728c38d6692b63ac2d3f22456154d0a0a0a","target":"record","created_at":"2026-05-18T00:31:41Z","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":"5a0d034d1435396ce2971ecdb76abae8e60abfc80c73228e1b4ae213975fb6a9","cross_cats_sorted":["cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T15:38:50Z","title_canon_sha256":"abb1014ad81ddf536c97c26e4931e91b79adc0ba3f8550b4d645f13b970dcdf4"},"schema_version":"1.0","source":{"id":"1703.07280","kind":"arxiv","version":2}},"canonical_sha256":"8c7b60033c38e4f6f583e1da30b799472aa3dd7155401493194d0ec21ac54f78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c7b60033c38e4f6f583e1da30b799472aa3dd7155401493194d0ec21ac54f78","first_computed_at":"2026-05-18T00:31:41.423450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:41.423450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bxPy/jy+45eh4P0kPH13rTlVvX5H8/xh6SQGwu59vpiXRX72EdgZOGHzRK2BHOCT2RYDsiXC0SjKscK14y73DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:41.423879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07280","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7d7f619e3970c3e991ed8ac7b9d5728c38d6692b63ac2d3f22456154d0a0a0a","sha256:00f3d83f1639b89406eae42f608a214ba276199e976ce34776c73c62315e4be9"],"state_sha256":"078e989b7fc72bb97004bd78a5788c73c69e0b3795b1d6448edf2f0ebaa87355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM1jSUZZAWcZjSPzli/SBY8SlTh2pKW3eVwWN0nuhNUyxwDb0+btng6GIB+9xMIILOlwojeRpSTma5IB4DFWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:10:40.939005Z","bundle_sha256":"0abffbac38b78bf6159bc45452ec8c27edf39bd651c07b62394a5a299d26af10"}}