{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TRIVVZEXJZ6KREQLTCEUM4GG6K","short_pith_number":"pith:TRIVVZEX","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"},"canonical_sha256":"9c515ae4974e7ca8920b98894670c6f2a1f2d00c44aab6e6ecf5ba06f6869b78","source":{"kind":"arxiv","id":"1902.10660","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10660","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10660v2","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10660","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"TRIVVZEXJZ6K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TRIVVZEXJZ6KREQL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TRIVVZEX","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TRIVVZEXJZ6KREQLTCEUM4GG6K","target":"record","payload":{"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"},"canonical_sha256":"9c515ae4974e7ca8920b98894670c6f2a1f2d00c44aab6e6ecf5ba06f6869b78","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"},"source_kind":"arxiv","source_id":"1902.10660","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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZhLGDbmZ0KHwav5aaxj+Ih4D4THkkrEklseVpa8LwXeuynk+xjkJA4vwUeqGj+WJoFhaGuEpxKtH+OEvlZQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:07:08.614287Z"},"content_sha256":"9373a7bf92a06c5aa78b9c6289d53347173d56a0d8ab55d998990e64b1c47cde","schema_version":"1.0","event_id":"sha256:9373a7bf92a06c5aa78b9c6289d53347173d56a0d8ab55d998990e64b1c47cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TRIVVZEXJZ6KREQLTCEUM4GG6K","target":"graph","payload":{"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"},"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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WR1ZJ4DF/3nmN8IspHRdFJp/QaDgxIc8YG7T+pFzAGqNth3TFQ6t+cYbaH0zBEj2QZguDWXIWQJxIfwZsHLYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:07:08.614985Z"},"content_sha256":"5dcdeb3fba9633d998f8922ad463ca566d4ea5442785d8793ca30dd20f125429","schema_version":"1.0","event_id":"sha256:5dcdeb3fba9633d998f8922ad463ca566d4ea5442785d8793ca30dd20f125429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/bundle.json","state_url":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/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-27T13:07:08Z","links":{"resolver":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K","bundle":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/bundle.json","state":"https://pith.science/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRIVVZEXJZ6KREQLTCEUM4GG6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TRIVVZEXJZ6KREQLTCEUM4GG6K","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":"0d66e16e1f7459c794f38e47c2f1dbf881d339e6381511e467c37563fd32eb49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T17:48:29Z","title_canon_sha256":"a48fdb47f13187032d80cdd1a9ae48d4896b322fc1f2e72d2f690cc0b42a56b9"},"schema_version":"1.0","source":{"id":"1902.10660","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10660","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10660v2","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10660","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"TRIVVZEXJZ6K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TRIVVZEXJZ6KREQL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TRIVVZEX","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:5dcdeb3fba9633d998f8922ad463ca566d4ea5442785d8793ca30dd20f125429","target":"graph","created_at":"2026-05-17T23:43:42Z","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":"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","authors_text":"Cho-Jui Hsieh, Duane Boning, Hongge Chen, Huan Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T17:48:29Z","title":"Robust Decision Trees Against Adversarial Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10660","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:9373a7bf92a06c5aa78b9c6289d53347173d56a0d8ab55d998990e64b1c47cde","target":"record","created_at":"2026-05-17T23:43:42Z","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":"0d66e16e1f7459c794f38e47c2f1dbf881d339e6381511e467c37563fd32eb49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T17:48:29Z","title_canon_sha256":"a48fdb47f13187032d80cdd1a9ae48d4896b322fc1f2e72d2f690cc0b42a56b9"},"schema_version":"1.0","source":{"id":"1902.10660","kind":"arxiv","version":2}},"canonical_sha256":"9c515ae4974e7ca8920b98894670c6f2a1f2d00c44aab6e6ecf5ba06f6869b78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c515ae4974e7ca8920b98894670c6f2a1f2d00c44aab6e6ecf5ba06f6869b78","first_computed_at":"2026-05-17T23:43:42.539234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:42.539234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XzvMjcCj5OzEOzE93hyDQDF5ED27OxxtCy42R/wYnl+0M6X38fD96441nddiT4eTiH+YxgW/FemLzW7LtHkrDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:42.539792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10660","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9373a7bf92a06c5aa78b9c6289d53347173d56a0d8ab55d998990e64b1c47cde","sha256:5dcdeb3fba9633d998f8922ad463ca566d4ea5442785d8793ca30dd20f125429"],"state_sha256":"ce9600df9d8188bf0a16e9d7cb225b1773389d598153e621fb8b9de685330ed7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIJ1b/vXT3AgJrqOF523hZpkIDRzBePPhMlKnJLPTA2laYEFExCUym0MyypSuf7Toibj6BI2uViVsRjCZDXzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:07:08.618305Z","bundle_sha256":"4159d86639f5a43294e2613b070310a0eb876cd51cc1b0fd772e4729a1774b0a"}}