{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JE7KDXKZCIB2QFFSOQZG66DWDB","short_pith_number":"pith:JE7KDXKZ","schema_version":"1.0","canonical_sha256":"493ea1dd591203a814b274326f7876185e537bab17829275f5639984aa65ec93","source":{"kind":"arxiv","id":"2506.05994","version":2},"attestation_state":"computed","paper":{"title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.ET"],"primary_cat":"cs.LG","authors_text":"Cam\\'elia Slimani, Chieh-Lin Tsai, Jalil Boukhobza, Tei-Wei Kuo, Yi-Chun Liao, Yuan-Hao Chang","submitted_at":"2025-06-06T11:25:51Z","abstract_excerpt":"Although deep learning has demonstrated remarkable capability in learning from unstructured data, modern tree-based ensemble models remain superior in extracting relevant information and learning from structured datasets. While several efforts have been made to accelerate tree-based models, the inherent characteristics of the models pose significant challenges for conventional accelerators. Recent research leveraging content-addressable memory (CAM) offers a promising solution for accelerating tree-based models, yet existing designs suffer from excessive memory consumption and low utilization."},"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":"2506.05994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-06T11:25:51Z","cross_cats_sorted":["cs.AR","cs.ET"],"title_canon_sha256":"1c9abab5a10fa2dc082d1efa0df9a2e8f9966e7362453b8a9e7e5c207e334cbc","abstract_canon_sha256":"2b6670f94faabae4722bb60414a1aadd02d1d6d188f94343d8f366c025264a59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:24.296827Z","signature_b64":"aTnO1ageqaaMJ8N7yHXmAQYGgXy8ejPZ6bHYbLHasB3hS9KPCujQeXzh0zpHiljQEqrSS2K3hLt29v7G1EWaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"493ea1dd591203a814b274326f7876185e537bab17829275f5639984aa65ec93","last_reissued_at":"2026-06-01T02:03:24.295801Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:24.295801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.ET"],"primary_cat":"cs.LG","authors_text":"Cam\\'elia Slimani, Chieh-Lin Tsai, Jalil Boukhobza, Tei-Wei Kuo, Yi-Chun Liao, Yuan-Hao Chang","submitted_at":"2025-06-06T11:25:51Z","abstract_excerpt":"Although deep learning has demonstrated remarkable capability in learning from unstructured data, modern tree-based ensemble models remain superior in extracting relevant information and learning from structured datasets. While several efforts have been made to accelerate tree-based models, the inherent characteristics of the models pose significant challenges for conventional accelerators. Recent research leveraging content-addressable memory (CAM) offers a promising solution for accelerating tree-based models, yet existing designs suffer from excessive memory consumption and low utilization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05994","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05994/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":"2506.05994","created_at":"2026-06-01T02:03:24.295926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05994v2","created_at":"2026-06-01T02:03:24.295926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05994","created_at":"2026-06-01T02:03:24.295926+00:00"},{"alias_kind":"pith_short_12","alias_value":"JE7KDXKZCIB2","created_at":"2026-06-01T02:03:24.295926+00:00"},{"alias_kind":"pith_short_16","alias_value":"JE7KDXKZCIB2QFFS","created_at":"2026-06-01T02:03:24.295926+00:00"},{"alias_kind":"pith_short_8","alias_value":"JE7KDXKZ","created_at":"2026-06-01T02:03:24.295926+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/JE7KDXKZCIB2QFFSOQZG66DWDB","json":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB.json","graph_json":"https://pith.science/api/pith-number/JE7KDXKZCIB2QFFSOQZG66DWDB/graph.json","events_json":"https://pith.science/api/pith-number/JE7KDXKZCIB2QFFSOQZG66DWDB/events.json","paper":"https://pith.science/paper/JE7KDXKZ"},"agent_actions":{"view_html":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB","download_json":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB.json","view_paper":"https://pith.science/paper/JE7KDXKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05994&json=true","fetch_graph":"https://pith.science/api/pith-number/JE7KDXKZCIB2QFFSOQZG66DWDB/graph.json","fetch_events":"https://pith.science/api/pith-number/JE7KDXKZCIB2QFFSOQZG66DWDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB/action/storage_attestation","attest_author":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB/action/author_attestation","sign_citation":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB/action/citation_signature","submit_replication":"https://pith.science/pith/JE7KDXKZCIB2QFFSOQZG66DWDB/action/replication_record"}},"created_at":"2026-06-01T02:03:24.295926+00:00","updated_at":"2026-06-01T02:03:24.295926+00:00"}