{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7XHLQTAZ5GOZ37LWEVRFZPKXSF","short_pith_number":"pith:7XHLQTAZ","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"},"canonical_sha256":"fdceb84c19e99d9dfd7625625cbd579155f7212e4ffa96c6e8f4011714c13824","source":{"kind":"arxiv","id":"2404.06846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06846","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06846v1","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06846","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"7XHLQTAZ5GOZ","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"7XHLQTAZ5GOZ37LW","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"7XHLQTAZ","created_at":"2026-07-05T08:06:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7XHLQTAZ5GOZ37LWEVRFZPKXSF","target":"record","payload":{"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"},"canonical_sha256":"fdceb84c19e99d9dfd7625625cbd579155f7212e4ffa96c6e8f4011714c13824","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"},"source_kind":"arxiv","source_id":"2404.06846","source_version":1,"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-07-05T08:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tq6fODKdHJtN2no2mD20ulwFS4B+rFyx+4AdHvIGDRn0mMiPRd0vN5t0ayzT4qskjZyEbK6Gf64Lu0Zuxg81Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:34:02.966517Z"},"content_sha256":"fdcb912fc966ab7fcaf045586793d60b60cf2a6662a5d14743322394e0552609","schema_version":"1.0","event_id":"sha256:fdcb912fc966ab7fcaf045586793d60b60cf2a6662a5d14743322394e0552609"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7XHLQTAZ5GOZ37LWEVRFZPKXSF","target":"graph","payload":{"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"},"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-07-05T08:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYTMFMGkVB8xgXd7N3I1l6Gf9dUV9cDsXZEfy6ASKawiutFA5volyszsW5/3z7qdU8iBGAMJmqQ6yFNaomx+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:34:02.967083Z"},"content_sha256":"c63b669ef83f3a39accd9a1a598a02afeadf71d060787c91c96393e2d47fca32","schema_version":"1.0","event_id":"sha256:c63b669ef83f3a39accd9a1a598a02afeadf71d060787c91c96393e2d47fca32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/bundle.json","state_url":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/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-08-05T16:34:02Z","links":{"resolver":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF","bundle":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/bundle.json","state":"https://pith.science/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XHLQTAZ5GOZ37LWEVRFZPKXSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7XHLQTAZ5GOZ37LWEVRFZPKXSF","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":"c0652bc5c967910fc917bba7641059cf400ae572986df869c845236d4840fefa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T09:17:22Z","title_canon_sha256":"93146eb0a361f6c7ab0087e13ae5aac089f8ba982b8d8e6926f8616ffb3c06d7"},"schema_version":"1.0","source":{"id":"2404.06846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06846","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06846v1","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06846","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"7XHLQTAZ5GOZ","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"7XHLQTAZ5GOZ37LW","created_at":"2026-07-05T08:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"7XHLQTAZ","created_at":"2026-07-05T08:06:30Z"}],"graph_snapshots":[{"event_id":"sha256:c63b669ef83f3a39accd9a1a598a02afeadf71d060787c91c96393e2d47fca32","target":"graph","created_at":"2026-07-05T08:06: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.06846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christian Hakert, Daniel Biebert, Jian-Jia Chen, Kuan-Hsun Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T09:17:22Z","title":"Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06846","kind":"arxiv","version":1},"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:fdcb912fc966ab7fcaf045586793d60b60cf2a6662a5d14743322394e0552609","target":"record","created_at":"2026-07-05T08:06: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":"c0652bc5c967910fc917bba7641059cf400ae572986df869c845236d4840fefa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T09:17:22Z","title_canon_sha256":"93146eb0a361f6c7ab0087e13ae5aac089f8ba982b8d8e6926f8616ffb3c06d7"},"schema_version":"1.0","source":{"id":"2404.06846","kind":"arxiv","version":1}},"canonical_sha256":"fdceb84c19e99d9dfd7625625cbd579155f7212e4ffa96c6e8f4011714c13824","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdceb84c19e99d9dfd7625625cbd579155f7212e4ffa96c6e8f4011714c13824","first_computed_at":"2026-07-05T08:06:30.998734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:30.998734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgbYaAxM8tjh/t+Fl71aZfNliNIfUzoAyqrcR5E2YUcBkFB+jhOByQLbDIsBUOaXPBDN0Yzz1zxs9yGNCeZOBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:30.999171Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdcb912fc966ab7fcaf045586793d60b60cf2a6662a5d14743322394e0552609","sha256:c63b669ef83f3a39accd9a1a598a02afeadf71d060787c91c96393e2d47fca32"],"state_sha256":"012c84994da8b9a6ee3806f3adcb8bd48c4e584386d04fdaf89c66b26ce12ea3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LB+dEcuH9FspUE31ytupr2q0764h8VQJN/4oh2DPp4z+duT5tmEoTXDERMQJYWcS7K4TXT96dcnWncSKcJtnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T16:34:02.970346Z","bundle_sha256":"d1cab2efbf2072ec5d015953918e9ce8b2b3b1af660f3de778bb3e42500c3523"}}