{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WBLG3NMYJBOVKNW4B27M263Y7D","short_pith_number":"pith:WBLG3NMY","canonical_record":{"source":{"id":"2005.05587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T07:38:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5ca09683ea42e1375c150cbdc0ead4607fefb2aed7f890a57570db37db954b31","abstract_canon_sha256":"2111cc55611a311bee0d6a2c321de22c00629c7e32165883f81f4010c48f1e2c"},"schema_version":"1.0"},"canonical_sha256":"b0566db598485d5536dc0ebecd7b78f8d12e1be74adee9db0f3feb8b9185ff0c","source":{"kind":"arxiv","id":"2005.05587","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.05587","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"2005.05587v2","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05587","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"WBLG3NMYJBOV","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"pith_short_16","alias_value":"WBLG3NMYJBOVKNW4","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"pith_short_8","alias_value":"WBLG3NMY","created_at":"2026-07-05T01:17:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WBLG3NMYJBOVKNW4B27M263Y7D","target":"record","payload":{"canonical_record":{"source":{"id":"2005.05587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T07:38:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5ca09683ea42e1375c150cbdc0ead4607fefb2aed7f890a57570db37db954b31","abstract_canon_sha256":"2111cc55611a311bee0d6a2c321de22c00629c7e32165883f81f4010c48f1e2c"},"schema_version":"1.0"},"canonical_sha256":"b0566db598485d5536dc0ebecd7b78f8d12e1be74adee9db0f3feb8b9185ff0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:27.854834Z","signature_b64":"yBDbxj/mdN7HNdZmkQhVJifPJeuZyGiwCKHORuYX01ozEFX7+nqn+6rCketp+iqeotPUJWiQyLjmsEyURpHNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0566db598485d5536dc0ebecd7b78f8d12e1be74adee9db0f3feb8b9185ff0c","last_reissued_at":"2026-07-05T01:17:27.854418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:27.854418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.05587","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-07-05T01:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JImYJrfRwF8eEGN0bNI4K9WbH5fjcDYhWBWNcPxmdY2QShj0F4TZ7Xep6rmRjBCsLT0YU7O2QSSDOfWYoOOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:08:58.387910Z"},"content_sha256":"b48ff2fd1693ca2c2d16fdd267974d41ffef5ed53573208b24bd995fdaaef22c","schema_version":"1.0","event_id":"sha256:b48ff2fd1693ca2c2d16fdd267974d41ffef5ed53573208b24bd995fdaaef22c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WBLG3NMYJBOVKNW4B27M263Y7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness Verification for Classifier Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dennis Gross, Guillermo A. P\\'erez, Nils Jansen, Stephan Raaijmakers","submitted_at":"2020-05-12T07:38:43Z","abstract_excerpt":"We give a formal verification procedure that decides whether a classifier ensemble is robust against arbitrary randomized attacks. Such attacks consist of a set of deterministic attacks and a distribution over this set. The robustness-checking problem consists of assessing, given a set of classifiers and a labelled data set, whether there exists a randomized attack that induces a certain expected loss against all classifiers. We show the NP-hardness of the problem and provide an upper bound on the number of attacks that is sufficient to form an optimal randomized attack. These results provide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05587","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.05587/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-05T01:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gD1PPCdedCU8aMqzKKLCg693HwXZ0SoreeNwincFfZtzzlYs1+iDI82nmpqgzBdtInageCNK6IeNVDu/coYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:08:58.388280Z"},"content_sha256":"7952ba8915268222decad1c7661cb2ef1ab440f2222f38c4461fad83a39e9f4e","schema_version":"1.0","event_id":"sha256:7952ba8915268222decad1c7661cb2ef1ab440f2222f38c4461fad83a39e9f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBLG3NMYJBOVKNW4B27M263Y7D/bundle.json","state_url":"https://pith.science/pith/WBLG3NMYJBOVKNW4B27M263Y7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBLG3NMYJBOVKNW4B27M263Y7D/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-07-05T11:08:58Z","links":{"resolver":"https://pith.science/pith/WBLG3NMYJBOVKNW4B27M263Y7D","bundle":"https://pith.science/pith/WBLG3NMYJBOVKNW4B27M263Y7D/bundle.json","state":"https://pith.science/pith/WBLG3NMYJBOVKNW4B27M263Y7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBLG3NMYJBOVKNW4B27M263Y7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WBLG3NMYJBOVKNW4B27M263Y7D","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":"2111cc55611a311bee0d6a2c321de22c00629c7e32165883f81f4010c48f1e2c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T07:38:43Z","title_canon_sha256":"5ca09683ea42e1375c150cbdc0ead4607fefb2aed7f890a57570db37db954b31"},"schema_version":"1.0","source":{"id":"2005.05587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.05587","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"2005.05587v2","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05587","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"WBLG3NMYJBOV","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"pith_short_16","alias_value":"WBLG3NMYJBOVKNW4","created_at":"2026-07-05T01:17:27Z"},{"alias_kind":"pith_short_8","alias_value":"WBLG3NMY","created_at":"2026-07-05T01:17:27Z"}],"graph_snapshots":[{"event_id":"sha256:7952ba8915268222decad1c7661cb2ef1ab440f2222f38c4461fad83a39e9f4e","target":"graph","created_at":"2026-07-05T01:17:27Z","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/2005.05587/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a formal verification procedure that decides whether a classifier ensemble is robust against arbitrary randomized attacks. Such attacks consist of a set of deterministic attacks and a distribution over this set. The robustness-checking problem consists of assessing, given a set of classifiers and a labelled data set, whether there exists a randomized attack that induces a certain expected loss against all classifiers. We show the NP-hardness of the problem and provide an upper bound on the number of attacks that is sufficient to form an optimal randomized attack. These results provide ","authors_text":"Dennis Gross, Guillermo A. P\\'erez, Nils Jansen, Stephan Raaijmakers","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T07:38:43Z","title":"Robustness Verification for Classifier Ensembles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05587","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:b48ff2fd1693ca2c2d16fdd267974d41ffef5ed53573208b24bd995fdaaef22c","target":"record","created_at":"2026-07-05T01:17:27Z","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":"2111cc55611a311bee0d6a2c321de22c00629c7e32165883f81f4010c48f1e2c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T07:38:43Z","title_canon_sha256":"5ca09683ea42e1375c150cbdc0ead4607fefb2aed7f890a57570db37db954b31"},"schema_version":"1.0","source":{"id":"2005.05587","kind":"arxiv","version":2}},"canonical_sha256":"b0566db598485d5536dc0ebecd7b78f8d12e1be74adee9db0f3feb8b9185ff0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0566db598485d5536dc0ebecd7b78f8d12e1be74adee9db0f3feb8b9185ff0c","first_computed_at":"2026-07-05T01:17:27.854418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:27.854418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBDbxj/mdN7HNdZmkQhVJifPJeuZyGiwCKHORuYX01ozEFX7+nqn+6rCketp+iqeotPUJWiQyLjmsEyURpHNBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:27.854834Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.05587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b48ff2fd1693ca2c2d16fdd267974d41ffef5ed53573208b24bd995fdaaef22c","sha256:7952ba8915268222decad1c7661cb2ef1ab440f2222f38c4461fad83a39e9f4e"],"state_sha256":"db49839abf5c8d8de518eac6fbe8b7dbda829917d96df7e99e99993dda076d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPqwLZG+qhHWXEEQjphOm6ItUi7lNdIGb0rw7yWjiBMUE763aiew6dE84Zqrl+nCNEavNDh4CyVYPfDML3m3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:08:58.390235Z","bundle_sha256":"e7e11e52776626ef842da82995dc353b97f4b78a574272ee37c1ea9e673393dc"}}