{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JYV5DDGSSKABDDDXJHRPWI7MRU","short_pith_number":"pith:JYV5DDGS","canonical_record":{"source":{"id":"1906.03526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T21:44:34Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"c6ad838ca420f5ab40615cc1b0c0a4cf595dd77f46b0c5ace95be2c91a58a73d","abstract_canon_sha256":"baa3eddd6fa69fbc67cc4ff3ef9b602ba992c827471a464d151e1f7745b90a39"},"schema_version":"1.0"},"canonical_sha256":"4e2bd18cd29280118c7749e2fb23ec8d2aa07053c377bd45c8d7c7af3a128ab7","source":{"kind":"arxiv","id":"1906.03526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03526","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03526v2","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03526","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"JYV5DDGSSKAB","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_16","alias_value":"JYV5DDGSSKABDDDX","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_8","alias_value":"JYV5DDGS","created_at":"2026-07-05T00:16:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JYV5DDGSSKABDDDXJHRPWI7MRU","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T21:44:34Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"c6ad838ca420f5ab40615cc1b0c0a4cf595dd77f46b0c5ace95be2c91a58a73d","abstract_canon_sha256":"baa3eddd6fa69fbc67cc4ff3ef9b602ba992c827471a464d151e1f7745b90a39"},"schema_version":"1.0"},"canonical_sha256":"4e2bd18cd29280118c7749e2fb23ec8d2aa07053c377bd45c8d7c7af3a128ab7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:04.186689Z","signature_b64":"gLeSEw9ifhknDsoZb43F8QD5VaR6BfVaV6cUaOQj7GMvOj0HoPr/WGYcDMUF1+ZOG08J/fnqchIJTca8EtwpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e2bd18cd29280118c7749e2fb23ec8d2aa07053c377bd45c8d7c7af3a128ab7","last_reissued_at":"2026-07-05T00:16:04.186258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:04.186258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03526","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-05T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YaHPE63ZhNbCgQgb9CRgodnwHj+5k8ZA4cpmbONK66Ax64JGBXz0N+pCekpghze8/uu3LrXTl1ni4HbLqiF2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:32:24.723276Z"},"content_sha256":"45d4ea2509cc7cc6fee16fa1718210f7ef7135f05eee6bcd4c50b227cd337929","schema_version":"1.0","event_id":"sha256:45d4ea2509cc7cc6fee16fa1718210f7ef7135f05eee6bcd4c50b227cd337929"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JYV5DDGSSKABDDDXJHRPWI7MRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Maksym Andriushchenko, Matthias Hein","submitted_at":"2019-06-08T21:44:34Z","abstract_excerpt":"The problem of adversarial robustness has been studied extensively for neural networks. However, for boosted decision trees and decision stumps there are almost no results, even though they are widely used in practice (e.g. XGBoost) due to their accuracy, interpretability, and efficiency. We show in this paper that for boosted decision stumps the \\textit{exact} min-max robust loss and test error for an $l_\\infty$-attack can be computed in $O(T\\log T)$ time per input, where $T$ is the number of decision stumps and the optimal update step of the ensemble can be done in $O(n^2\\,T\\log T)$, where $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03526","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/1906.03526/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-05T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RrwfLRhHx02vyr3f/FUYP14YgvVuGCihT90+heo/aL5mMbY1xnDLKrkkDGr4paicp1+/QtNXrT37THOfuqLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:32:24.723661Z"},"content_sha256":"36831deddcfc2188b8d39766ef23da3c93bcd2f8e43ab4ef5e22721c48f3bf5f","schema_version":"1.0","event_id":"sha256:36831deddcfc2188b8d39766ef23da3c93bcd2f8e43ab4ef5e22721c48f3bf5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYV5DDGSSKABDDDXJHRPWI7MRU/bundle.json","state_url":"https://pith.science/pith/JYV5DDGSSKABDDDXJHRPWI7MRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYV5DDGSSKABDDDXJHRPWI7MRU/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-07T04:32:24Z","links":{"resolver":"https://pith.science/pith/JYV5DDGSSKABDDDXJHRPWI7MRU","bundle":"https://pith.science/pith/JYV5DDGSSKABDDDXJHRPWI7MRU/bundle.json","state":"https://pith.science/pith/JYV5DDGSSKABDDDXJHRPWI7MRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYV5DDGSSKABDDDXJHRPWI7MRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JYV5DDGSSKABDDDXJHRPWI7MRU","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":"baa3eddd6fa69fbc67cc4ff3ef9b602ba992c827471a464d151e1f7745b90a39","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T21:44:34Z","title_canon_sha256":"c6ad838ca420f5ab40615cc1b0c0a4cf595dd77f46b0c5ace95be2c91a58a73d"},"schema_version":"1.0","source":{"id":"1906.03526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03526","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03526v2","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03526","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"JYV5DDGSSKAB","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_16","alias_value":"JYV5DDGSSKABDDDX","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_8","alias_value":"JYV5DDGS","created_at":"2026-07-05T00:16:04Z"}],"graph_snapshots":[{"event_id":"sha256:36831deddcfc2188b8d39766ef23da3c93bcd2f8e43ab4ef5e22721c48f3bf5f","target":"graph","created_at":"2026-07-05T00:16:04Z","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/1906.03526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of adversarial robustness has been studied extensively for neural networks. However, for boosted decision trees and decision stumps there are almost no results, even though they are widely used in practice (e.g. XGBoost) due to their accuracy, interpretability, and efficiency. We show in this paper that for boosted decision stumps the \\textit{exact} min-max robust loss and test error for an $l_\\infty$-attack can be computed in $O(T\\log T)$ time per input, where $T$ is the number of decision stumps and the optimal update step of the ensemble can be done in $O(n^2\\,T\\log T)$, where $","authors_text":"Maksym Andriushchenko, Matthias Hein","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T21:44:34Z","title":"Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03526","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:45d4ea2509cc7cc6fee16fa1718210f7ef7135f05eee6bcd4c50b227cd337929","target":"record","created_at":"2026-07-05T00:16:04Z","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":"baa3eddd6fa69fbc67cc4ff3ef9b602ba992c827471a464d151e1f7745b90a39","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T21:44:34Z","title_canon_sha256":"c6ad838ca420f5ab40615cc1b0c0a4cf595dd77f46b0c5ace95be2c91a58a73d"},"schema_version":"1.0","source":{"id":"1906.03526","kind":"arxiv","version":2}},"canonical_sha256":"4e2bd18cd29280118c7749e2fb23ec8d2aa07053c377bd45c8d7c7af3a128ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e2bd18cd29280118c7749e2fb23ec8d2aa07053c377bd45c8d7c7af3a128ab7","first_computed_at":"2026-07-05T00:16:04.186258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:04.186258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLeSEw9ifhknDsoZb43F8QD5VaR6BfVaV6cUaOQj7GMvOj0HoPr/WGYcDMUF1+ZOG08J/fnqchIJTca8EtwpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:04.186689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45d4ea2509cc7cc6fee16fa1718210f7ef7135f05eee6bcd4c50b227cd337929","sha256:36831deddcfc2188b8d39766ef23da3c93bcd2f8e43ab4ef5e22721c48f3bf5f"],"state_sha256":"eebc8151fd4f82dc7e9d87cc41677d43579ce7318e2e254928b5337199bfd6b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0HuyRCuwiIhOOwH344GfM/BMKQTXOYXSH4kt86viJaee5kpUTozpnkPI8kOFIMF8vADk0Untv/JNs3Jji0mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:32:24.725600Z","bundle_sha256":"2b1a9b446db671057a1e92bcb523792597adfeaf3b3291e552cce4c36877586d"}}