{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GOAKAR65M7C4DQECGDI2UQ5URZ","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":"c22b5a495a8023cde05b674d99952d0f77bcb1e16b66f476ff308b4c20bfe2f3","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-25T20:57:35Z","title_canon_sha256":"931045c3ee00113e206cd606f9c517a89e895055f59c6d4e37f02e69447f8245"},"schema_version":"1.0","source":{"id":"1509.07892","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07892","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07892v2","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07892","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"GOAKAR65M7C4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOAKAR65M7C4DQEC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOAKAR65","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:ca7d9bce7623e081c989dac95ac8d24a12df6bfa2bff7006d2a7b532416d034e","target":"graph","created_at":"2026-05-18T01:13:30Z","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":"Classifier evasion consists in finding for a given instance $x$ the nearest instance $x'$ such that the classifier predictions of $x$ and $x'$ are different. We present two novel algorithms for systematically computing evasions for tree ensembles such as boosted trees and random forests. Our first algorithm uses a Mixed Integer Linear Program solver and finds the optimal evading instance under an expressive set of constraints. Our second algorithm trades off optimality for speed by using symbolic prediction, a novel algorithm for fast finite differences on tree ensembles. On a digit recognitio","authors_text":"Alex Kantchelian, Anthony D. Joseph, J. D. Tygar","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-25T20:57:35Z","title":"Evasion and Hardening of Tree Ensemble Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07892","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:17456aed20bbfda54072f0e7dd98465eafabea3b052c7ace02d5f7b664dcedcc","target":"record","created_at":"2026-05-18T01:13:30Z","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":"c22b5a495a8023cde05b674d99952d0f77bcb1e16b66f476ff308b4c20bfe2f3","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-25T20:57:35Z","title_canon_sha256":"931045c3ee00113e206cd606f9c517a89e895055f59c6d4e37f02e69447f8245"},"schema_version":"1.0","source":{"id":"1509.07892","kind":"arxiv","version":2}},"canonical_sha256":"3380a047dd67c5c1c08230d1aa43b48e4cc27015e67961c12eae5bfa416d49b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3380a047dd67c5c1c08230d1aa43b48e4cc27015e67961c12eae5bfa416d49b4","first_computed_at":"2026-05-18T01:13:30.853763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:30.853763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvccOmM4dBsy0w2Yxs44/62h5mPe3tCCVtFLSh2hmMImMytKoX3/XVs7/XGY1UiCGEbTtxDQBJ4Ark4EJn6eDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:30.854403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07892","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17456aed20bbfda54072f0e7dd98465eafabea3b052c7ace02d5f7b664dcedcc","sha256:ca7d9bce7623e081c989dac95ac8d24a12df6bfa2bff7006d2a7b532416d034e"],"state_sha256":"78f7a1fef776c584340d87e3ecbcb4d6eafed817a024dc9e4934c7bba278ca47"}