{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4ETQ4OX66WEJZJW3WH2VUFZ2LN","short_pith_number":"pith:4ETQ4OX6","schema_version":"1.0","canonical_sha256":"e1270e3afef5889ca6dbb1f55a173a5b508fed96d6bc6dfe0e050b6a3904cd28","source":{"kind":"arxiv","id":"1802.03882","version":2},"attestation_state":"computed","paper":{"title":"Random Hinge Forest for Differentiable Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Adam P. Harrison, Adrian Barbu, Gitesh Dawer, Nathan Lay, Sharon Schreiber","submitted_at":"2018-02-12T04:08:53Z","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"},"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":"1802.03882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T04:08:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cbed32a6934e5e9b842d4cf923d8b7cea5309fcf70e22ccac28e6e14158a19ad","abstract_canon_sha256":"c6e860ab5915d120b2d07801aff128b35fd41ee9dd6b0652b14fa20c54e63af0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:15.620929Z","signature_b64":"yZIi9cmceBJ2cURIP9TYT/eFQ5w7rihZ0FbuTOy9tA1dzqr68/bCDj7h+/sqREto8olPn65JIsRsrNQO/Yb4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1270e3afef5889ca6dbb1f55a173a5b508fed96d6bc6dfe0e050b6a3904cd28","last_reissued_at":"2026-05-18T00:22:15.620350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:15.620350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Hinge Forest for Differentiable Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Adam P. Harrison, Adrian Barbu, Gitesh Dawer, Nathan Lay, Sharon Schreiber","submitted_at":"2018-02-12T04:08:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03882","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":"1802.03882","created_at":"2026-05-18T00:22:15.620437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03882v2","created_at":"2026-05-18T00:22:15.620437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03882","created_at":"2026-05-18T00:22:15.620437+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ETQ4OX66WEJ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ETQ4OX66WEJZJW3","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ETQ4OX6","created_at":"2026-05-18T12:32:05.422762+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/4ETQ4OX66WEJZJW3WH2VUFZ2LN","json":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN.json","graph_json":"https://pith.science/api/pith-number/4ETQ4OX66WEJZJW3WH2VUFZ2LN/graph.json","events_json":"https://pith.science/api/pith-number/4ETQ4OX66WEJZJW3WH2VUFZ2LN/events.json","paper":"https://pith.science/paper/4ETQ4OX6"},"agent_actions":{"view_html":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN","download_json":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN.json","view_paper":"https://pith.science/paper/4ETQ4OX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03882&json=true","fetch_graph":"https://pith.science/api/pith-number/4ETQ4OX66WEJZJW3WH2VUFZ2LN/graph.json","fetch_events":"https://pith.science/api/pith-number/4ETQ4OX66WEJZJW3WH2VUFZ2LN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN/action/storage_attestation","attest_author":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN/action/author_attestation","sign_citation":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN/action/citation_signature","submit_replication":"https://pith.science/pith/4ETQ4OX66WEJZJW3WH2VUFZ2LN/action/replication_record"}},"created_at":"2026-05-18T00:22:15.620437+00:00","updated_at":"2026-05-18T00:22:15.620437+00:00"}