{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GOAKAR65M7C4DQECGDI2UQ5URZ","short_pith_number":"pith:GOAKAR65","canonical_record":{"source":{"id":"1509.07892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-25T20:57:35Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"931045c3ee00113e206cd606f9c517a89e895055f59c6d4e37f02e69447f8245","abstract_canon_sha256":"c22b5a495a8023cde05b674d99952d0f77bcb1e16b66f476ff308b4c20bfe2f3"},"schema_version":"1.0"},"canonical_sha256":"3380a047dd67c5c1c08230d1aa43b48e4cc27015e67961c12eae5bfa416d49b4","source":{"kind":"arxiv","id":"1509.07892","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GOAKAR65M7C4DQECGDI2UQ5URZ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-25T20:57:35Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"931045c3ee00113e206cd606f9c517a89e895055f59c6d4e37f02e69447f8245","abstract_canon_sha256":"c22b5a495a8023cde05b674d99952d0f77bcb1e16b66f476ff308b4c20bfe2f3"},"schema_version":"1.0"},"canonical_sha256":"3380a047dd67c5c1c08230d1aa43b48e4cc27015e67961c12eae5bfa416d49b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.854403Z","signature_b64":"RvccOmM4dBsy0w2Yxs44/62h5mPe3tCCVtFLSh2hmMImMytKoX3/XVs7/XGY1UiCGEbTtxDQBJ4Ark4EJn6eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3380a047dd67c5c1c08230d1aa43b48e4cc27015e67961c12eae5bfa416d49b4","last_reissued_at":"2026-05-18T01:13:30.853763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.853763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07892","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-18T01:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoRJ/HWUt5q90PiVKuOOZtnjLXTferO4lEu7TfFi3S+rMw2RvQPWiqVL9nc9HE4PoYZqccFLgbXQX5TLSoojCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:54:26.349807Z"},"content_sha256":"17456aed20bbfda54072f0e7dd98465eafabea3b052c7ace02d5f7b664dcedcc","schema_version":"1.0","event_id":"sha256:17456aed20bbfda54072f0e7dd98465eafabea3b052c7ace02d5f7b664dcedcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GOAKAR65M7C4DQECGDI2UQ5URZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evasion and Hardening of Tree Ensemble Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Kantchelian, Anthony D. Joseph, J. D. Tygar","submitted_at":"2015-09-25T20:57:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07892","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-18T01:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ReMAVgpYbCozQZYjINmEh6DfULpQULYLkpon0y09/I4/X0X5gEXmPpywEchpXD069nfij/Y3n05cZDW6aldjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:54:26.350156Z"},"content_sha256":"ca7d9bce7623e081c989dac95ac8d24a12df6bfa2bff7006d2a7b532416d034e","schema_version":"1.0","event_id":"sha256:ca7d9bce7623e081c989dac95ac8d24a12df6bfa2bff7006d2a7b532416d034e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOAKAR65M7C4DQECGDI2UQ5URZ/bundle.json","state_url":"https://pith.science/pith/GOAKAR65M7C4DQECGDI2UQ5URZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOAKAR65M7C4DQECGDI2UQ5URZ/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-02T12:54:26Z","links":{"resolver":"https://pith.science/pith/GOAKAR65M7C4DQECGDI2UQ5URZ","bundle":"https://pith.science/pith/GOAKAR65M7C4DQECGDI2UQ5URZ/bundle.json","state":"https://pith.science/pith/GOAKAR65M7C4DQECGDI2UQ5URZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOAKAR65M7C4DQECGDI2UQ5URZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVjwF7W1uzup2witSAfhhXRO/6NnzH6/dKwh7l0s6jzIjiES5lg7pFMcl+Sre5R6hPHXIiSuIyQeBojX39jiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:54:26.352155Z","bundle_sha256":"c2a225b33c8f16559dd8c1efd2458e6c0ce25de9220d4acf4ca80a6aa71cd48d"}}