{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4ETQ4OX66WEJZJW3WH2VUFZ2LN","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":"c6e860ab5915d120b2d07801aff128b35fd41ee9dd6b0652b14fa20c54e63af0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T04:08:53Z","title_canon_sha256":"cbed32a6934e5e9b842d4cf923d8b7cea5309fcf70e22ccac28e6e14158a19ad"},"schema_version":"1.0","source":{"id":"1802.03882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03882","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03882v2","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03882","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"4ETQ4OX66WEJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ETQ4OX66WEJZJW3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ETQ4OX6","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:a234673b60650e05403ea472ef02cf5bbebc08440f85c1394cb0d960add3703f","target":"graph","created_at":"2026-05-18T00:22:15Z","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":"We propose random hinge forests, a simple, efficient, and novel variant of decision forests. Importantly, random hinge forests can be readily incorporated as a general component within arbitrary computation graphs that are optimized end-to-end with stochastic gradient descent or variants thereof. We derive random hinge forest and ferns, focusing on their sparse and efficient nature, their min-max margin property, strategies to initialize them for arbitrary network architectures, and the class of optimizers most suitable for optimizing random hinge forest. The performance and versatility of ran","authors_text":"Adam P. Harrison, Adrian Barbu, Gitesh Dawer, Nathan Lay, Sharon Schreiber","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T04:08:53Z","title":"Random Hinge Forest for Differentiable Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03882","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:7ff427cec778ec06f34188817f54cb89d32a4bc68a819ea98d313500e22fe217","target":"record","created_at":"2026-05-18T00:22:15Z","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":"c6e860ab5915d120b2d07801aff128b35fd41ee9dd6b0652b14fa20c54e63af0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T04:08:53Z","title_canon_sha256":"cbed32a6934e5e9b842d4cf923d8b7cea5309fcf70e22ccac28e6e14158a19ad"},"schema_version":"1.0","source":{"id":"1802.03882","kind":"arxiv","version":2}},"canonical_sha256":"e1270e3afef5889ca6dbb1f55a173a5b508fed96d6bc6dfe0e050b6a3904cd28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1270e3afef5889ca6dbb1f55a173a5b508fed96d6bc6dfe0e050b6a3904cd28","first_computed_at":"2026-05-18T00:22:15.620350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:15.620350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZIi9cmceBJ2cURIP9TYT/eFQ5w7rihZ0FbuTOy9tA1dzqr68/bCDj7h+/sqREto8olPn65JIsRsrNQO/Yb4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:15.620929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ff427cec778ec06f34188817f54cb89d32a4bc68a819ea98d313500e22fe217","sha256:a234673b60650e05403ea472ef02cf5bbebc08440f85c1394cb0d960add3703f"],"state_sha256":"dd938f44f67f7e7a12eba9f61b7b1efcb95dc308a9b9fb03b85d1f2005b7c86d"}