{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TRIVVZEXJZ6KREQLTCEUM4GG6K","short_pith_number":"pith:TRIVVZEX","schema_version":"1.0","canonical_sha256":"9c515ae4974e7ca8920b98894670c6f2a1f2d00c44aab6e6ecf5ba06f6869b78","source":{"kind":"arxiv","id":"1902.10660","version":2},"attestation_state":"computed","paper":{"title":"Robust Decision Trees Against Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Duane Boning, Hongge Chen, Huan Zhang","submitted_at":"2019-02-27T17:48:29Z","abstract_excerpt":"Although adversarial examples and model robustness have been extensively studied in the context of linear models and neural networks, research on this issue in tree-based models and how to make tree-based models robust against adversarial examples is still limited. In this paper, we show that tree based models are also vulnerable to adversarial examples and develop a novel algorithm to learn robust trees. At its core, our method aims to optimize the performance under the worst-case perturbation of input features, which leads to a max-min saddle point problem. Incorporating this saddle point ob"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1902.10660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T17:48:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a48fdb47f13187032d80cdd1a9ae48d4896b322fc1f2e72d2f690cc0b42a56b9","abstract_canon_sha256":"0d66e16e1f7459c794f38e47c2f1dbf881d339e6381511e467c37563fd32eb49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:42.539792Z","signature_b64":"XzvMjcCj5OzEOzE93hyDQDF5ED27OxxtCy42R/wYnl+0M6X38fD96441nddiT4eTiH+YxgW/FemLzW7LtHkrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c515ae4974e7ca8920b98894670c6f2a1f2d00c44aab6e6ecf5ba06f6869b78","last_reissued_at":"2026-05-17T23:43:42.539234Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:42.539234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Decision Trees Against Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Duane Boning, Hongge Chen, Huan Zhang","submitted_at":"2019-02-27T17:48:29Z","abstract_excerpt":"Although adversarial examples and model robustness have been extensively studied in the context of linear models and neural networks, research on this issue in tree-based models and how to make tree-based models robust against adversarial examples is still limited. In this paper, we show that tree based models are also vulnerable to adversarial examples and develop a novel algorithm to learn robust trees. At its core, our method aims to optimize the performance under the worst-case perturbation of input features, which leads to a max-min saddle point problem. Incorporating this saddle point ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10660","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.10660","created_at":"2026-05-17T23:43:42.539308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10660v2","created_at":"2026-05-17T23:43:42.539308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10660","created_at":"2026-05-17T23:43:42.539308+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRIVVZEXJZ6K","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRIVVZEXJZ6KREQL","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRIVVZEX","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K","json":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K.json","graph_json":"https://pith.science/api/pith-number/TRIVVZEXJZ6KREQLTCEUM4GG6K/graph.json","events_json":"https://pith.science/api/pith-number/TRIVVZEXJZ6KREQLTCEUM4GG6K/events.json","paper":"https://pith.science/paper/TRIVVZEX"},"agent_actions":{"view_html":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K","download_json":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K.json","view_paper":"https://pith.science/paper/TRIVVZEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10660&json=true","fetch_graph":"https://pith.science/api/pith-number/TRIVVZEXJZ6KREQLTCEUM4GG6K/graph.json","fetch_events":"https://pith.science/api/pith-number/TRIVVZEXJZ6KREQLTCEUM4GG6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/action/storage_attestation","attest_author":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/action/author_attestation","sign_citation":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/action/citation_signature","submit_replication":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/action/replication_record"}},"created_at":"2026-05-17T23:43:42.539308+00:00","updated_at":"2026-05-17T23:43:42.539308+00:00"}