{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RFJFRDCSSO3SYLCZHGXXC6JOLH","short_pith_number":"pith:RFJFRDCS","schema_version":"1.0","canonical_sha256":"8952588c5293b72c2c5939af71792e59de9e560788411d24f0f40fcef9c1babc","source":{"kind":"arxiv","id":"1806.07300","version":1},"attestation_state":"computed","paper":{"title":"Forest Packing: Fast, Parallel Decision Forests","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Disa Mhembere, James Browne, Joshua T. Vogelstein, Randal Burns, Tyler M. Tomita","submitted_at":"2018-06-19T15:11:17Z","abstract_excerpt":"Machine learning has an emerging critical role in high-performance computing to modulate simulations, extract knowledge from massive data, and replace numerical models with efficient approximations. Decision forests are a critical tool because they provide insight into model operation that is critical to interpreting learned results. While decision forests are trivially parallelizable, the traversals of tree data structures incur many random memory accesses and are very slow. We present memory packing techniques that reorganize learned forests to minimize cache misses during classification. Th"},"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":"1806.07300","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PF","submitted_at":"2018-06-19T15:11:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a859e5a87fe44f7ba8738960a1aaa4f84462f13f652436137f10c437db58c142","abstract_canon_sha256":"5e59840b6ced9dd2d76ab7c6f39e1176350cc4b74f1f1dd3f34b58c3cc57d2fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:42.823384Z","signature_b64":"fO2KSwq9YnGCWvdBkhss2GwhVywohQIh7q5J+qmtDA8ONYYDpW7d4/tkjEPW1b/z8QdZqJPZ4yMMJhD7ceFIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8952588c5293b72c2c5939af71792e59de9e560788411d24f0f40fcef9c1babc","last_reissued_at":"2026-05-18T00:12:42.822754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:42.822754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forest Packing: Fast, Parallel Decision Forests","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Disa Mhembere, James Browne, Joshua T. Vogelstein, Randal Burns, Tyler M. Tomita","submitted_at":"2018-06-19T15:11:17Z","abstract_excerpt":"Machine learning has an emerging critical role in high-performance computing to modulate simulations, extract knowledge from massive data, and replace numerical models with efficient approximations. Decision forests are a critical tool because they provide insight into model operation that is critical to interpreting learned results. While decision forests are trivially parallelizable, the traversals of tree data structures incur many random memory accesses and are very slow. We present memory packing techniques that reorganize learned forests to minimize cache misses during classification. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07300","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":""},"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":"1806.07300","created_at":"2026-05-18T00:12:42.822829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07300v1","created_at":"2026-05-18T00:12:42.822829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07300","created_at":"2026-05-18T00:12:42.822829+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFJFRDCSSO3S","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFJFRDCSSO3SYLCZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFJFRDCS","created_at":"2026-05-18T12:32:50.500415+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/RFJFRDCSSO3SYLCZHGXXC6JOLH","json":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH.json","graph_json":"https://pith.science/api/pith-number/RFJFRDCSSO3SYLCZHGXXC6JOLH/graph.json","events_json":"https://pith.science/api/pith-number/RFJFRDCSSO3SYLCZHGXXC6JOLH/events.json","paper":"https://pith.science/paper/RFJFRDCS"},"agent_actions":{"view_html":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH","download_json":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH.json","view_paper":"https://pith.science/paper/RFJFRDCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07300&json=true","fetch_graph":"https://pith.science/api/pith-number/RFJFRDCSSO3SYLCZHGXXC6JOLH/graph.json","fetch_events":"https://pith.science/api/pith-number/RFJFRDCSSO3SYLCZHGXXC6JOLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH/action/storage_attestation","attest_author":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH/action/author_attestation","sign_citation":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH/action/citation_signature","submit_replication":"https://pith.science/pith/RFJFRDCSSO3SYLCZHGXXC6JOLH/action/replication_record"}},"created_at":"2026-05-18T00:12:42.822829+00:00","updated_at":"2026-05-18T00:12:42.822829+00:00"}