{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7XHLQTAZ5GOZ37LWEVRFZPKXSF","short_pith_number":"pith:7XHLQTAZ","schema_version":"1.0","canonical_sha256":"fdceb84c19e99d9dfd7625625cbd579155f7212e4ffa96c6e8f4011714c13824","source":{"kind":"arxiv","id":"2404.06846","version":1},"attestation_state":"computed","paper":{"title":"Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christian Hakert, Daniel Biebert, Jian-Jia Chen, Kuan-Hsun Chen","submitted_at":"2024-04-10T09:17:22Z","abstract_excerpt":"Bringing high-level machine learning models to efficient and well-suited machine implementations often invokes a bunch of tools, e.g.~code generators, compilers, and optimizers. Along such tool chains, abstractions have to be applied. This leads to not optimally used CPU registers. This is a shortcoming, especially in resource constrained embedded setups. In this work, we present a code generation approach for decision tree ensembles, which produces machine assembly code within a single conversion step directly from the high-level model representation. Specifically, we develop various approach"},"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":"2404.06846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T09:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"93146eb0a361f6c7ab0087e13ae5aac089f8ba982b8d8e6926f8616ffb3c06d7","abstract_canon_sha256":"c0652bc5c967910fc917bba7641059cf400ae572986df869c845236d4840fefa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:30.999171Z","signature_b64":"rgbYaAxM8tjh/t+Fl71aZfNliNIfUzoAyqrcR5E2YUcBkFB+jhOByQLbDIsBUOaXPBDN0Yzz1zxs9yGNCeZOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdceb84c19e99d9dfd7625625cbd579155f7212e4ffa96c6e8f4011714c13824","last_reissued_at":"2026-07-05T08:06:30.998734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:30.998734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christian Hakert, Daniel Biebert, Jian-Jia Chen, Kuan-Hsun Chen","submitted_at":"2024-04-10T09:17:22Z","abstract_excerpt":"Bringing high-level machine learning models to efficient and well-suited machine implementations often invokes a bunch of tools, e.g.~code generators, compilers, and optimizers. Along such tool chains, abstractions have to be applied. This leads to not optimally used CPU registers. This is a shortcoming, especially in resource constrained embedded setups. In this work, we present a code generation approach for decision tree ensembles, which produces machine assembly code within a single conversion step directly from the high-level model representation. Specifically, we develop various approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06846","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.06846/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.06846","created_at":"2026-07-05T08:06:30.998800+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.06846v1","created_at":"2026-07-05T08:06:30.998800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06846","created_at":"2026-07-05T08:06:30.998800+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XHLQTAZ5GOZ","created_at":"2026-07-05T08:06:30.998800+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XHLQTAZ5GOZ37LW","created_at":"2026-07-05T08:06:30.998800+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XHLQTAZ","created_at":"2026-07-05T08:06:30.998800+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/7XHLQTAZ5GOZ37LWEVRFZPKXSF","json":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF.json","graph_json":"https://pith.science/api/pith-number/7XHLQTAZ5GOZ37LWEVRFZPKXSF/graph.json","events_json":"https://pith.science/api/pith-number/7XHLQTAZ5GOZ37LWEVRFZPKXSF/events.json","paper":"https://pith.science/paper/7XHLQTAZ"},"agent_actions":{"view_html":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF","download_json":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF.json","view_paper":"https://pith.science/paper/7XHLQTAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.06846&json=true","fetch_graph":"https://pith.science/api/pith-number/7XHLQTAZ5GOZ37LWEVRFZPKXSF/graph.json","fetch_events":"https://pith.science/api/pith-number/7XHLQTAZ5GOZ37LWEVRFZPKXSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/action/storage_attestation","attest_author":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/action/author_attestation","sign_citation":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/action/citation_signature","submit_replication":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/action/replication_record"}},"created_at":"2026-07-05T08:06:30.998800+00:00","updated_at":"2026-07-05T08:06:30.998800+00:00"}