{"as_of":"2026-08-22T07:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:638b2317cf97871735879271de15b695d241e5eb1839fa214234aaf2b327def2","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:09:35.178745Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.05994/citation-record","integrity":"/paper/2506.05994/integrity","json":"/paper/2506.05994/citation-record.json","paper":"/paper/2506.05994"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:30.512686Z","title":"Tabular data: Deep learning is not all you need,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:30.512686Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:d8ea6ba7c8600a50d184b9421ca9adb8d7a5876dc7a1119aa445abeca8758ba1","observation_id":"af73ded8-e8e3-41bb-88a1-92fb91231f8e","resolution":{"observed_at":"2026-08-07T06:09:30.512686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.809641Z","title":"Why do tree-based models still outperform deep learning on typical tabular data?","venue":null,"work_id":"4180db27-a898-4a2b-9bdb-08903dcef246","year":2022},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:30.574117Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:6c41a267c6470ad9d43f2b922607e9a141a066f157d562a9cf52eaf2110f8555","observation_id":"d09c96c6-7bb8-4936-84a0-e4005ae91726","resolution":{"observed_at":"2026-08-07T06:09:41.817170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:30.648065Z","title":"From local explanations to global understanding with explainable ai for trees,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:30.648065Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:e2a6f0d9c7231d32d806b2823c642f56288b77b2c9ccc2b676895b93e2c3b662","observation_id":"a3f16018-3629-42a8-b053-c9d78e6620dc","resolution":{"observed_at":"2026-08-07T06:09:30.648065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.791508Z","title":"Explainable artificial intelligence (xai),","venue":null,"work_id":"83022ede-4391-4a2a-8c03-1ab3d55cb828","year":2017},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:30.757052Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:b5d1aeda7f2d76089044cdfe82a76ad08aa046839420351364561ddbab19162f","observation_id":"09c3cc56-6c6c-4d85-99c1-8eab7c005da5","resolution":{"observed_at":"2026-08-07T06:09:41.799962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:30.863902Z","title":"Large language models for scientific discovery in molecular property prediction,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:30.863902Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:c155646859c14a25e60878a234c47fa893f166ce5ae12efd29ce61b3beb9f0bd","observation_id":"bf9002fd-c7f0-4831-80ce-72d5ede50af4","resolution":{"observed_at":"2026-08-07T06:09:30.863902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.775235Z","title":"A supervised machine learning algorithm for detecting and predicting fraud in credit card transactions,","venue":null,"work_id":"5dab27c9-c8a3-44fd-8d38-457620ae7323","year":2023},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:30.938253Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:ddb4c28e390f19b2138c095e38d6b7a7354b11526243556edebe0e19a6481eff","observation_id":"6b4dc3f6-7333-45e8-ac8e-b4550aed9de1","resolution":{"observed_at":"2026-08-07T06:09:41.781940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1757-899x/490/7/072062","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Application of xgboost algorithm in bearing fault diagnosis,","venue":"IOP Conference Series Materials Science and Engineering","work_id":"26f92d98-47ca-4261-bd85-ef58a2b35ade","year":2019},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.013795Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:69e1f2d47b3eeca40f3d63de4a37e9a055d5a3e5013f821ed1c7104d6ad2ba96","observation_id":"33ff94af-156f-416b-9047-bfeeba75b59a","resolution":{"observed_at":"2026-08-07T06:09:35.974325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.755222Z","title":"Kaggle machine learning & data science survey 2021,","venue":null,"work_id":"76254f47-ad96-42b6-8e72-294bb620a300","year":2021},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.087606Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:b82145b0d52f01b961230e65c351eb5230f5dc23d086983f1a165d5be92f1926","observation_id":"ecab9ad4-cc07-4697-beae-5bc864e797c4","resolution":{"observed_at":"2026-08-07T06:09:41.763738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:31.195703Z","title":"Xgboost: A scalable tree boosting system,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.195703Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:1a466f4f43b103378246bd0e7a47db5f896894c531eaef88cfce19f07bddecca","observation_id":"3909e87a-b8c0-4152-b7de-515791c39e42","resolution":{"observed_at":"2026-08-07T06:09:31.195703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.737869Z","title":"Dynamic decision tree ensembles for energy-efficient inference on iot edge nodes,","venue":null,"work_id":"583e5def-6ad9-4b4c-bd81-4517713c4eb6","year":2024},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.340792Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:84f6f87c6d283f41e96cefc2b75cdfadfbf639d6ae15a0cf847fd75933fd360a","observation_id":"8661aa87-9eb5-43be-a8b8-f00c77f4f6d1","resolution":{"observed_at":"2026-08-07T06:09:41.744182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:31.448085Z","title":"Tahoe: tree structure-aware high performance inference engine for decision tree ensemble on gpu,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.448085Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:82737e4691d7e6cf771aae047b9c6e92e73b99e2fd3443534db29d0e61247fa9","observation_id":"e841c826-4668-4297-9640-0d2079ad338a","resolution":{"observed_at":"2026-08-07T06:09:31.448085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.719622Z","title":"Fpga accelerator for gradient boosting decision trees,","venue":null,"work_id":"c1d991bd-5d1d-45f5-8bbc-c636910367c5","year":2021},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.533138Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:e60c2f9fbe651f4bbf68f1f6d73c05247818ccb1cf002cf4378d9b67240c8ab9","observation_id":"004ee4a0-313d-4152-8b10-1bfabdac36f9","resolution":{"observed_at":"2026-08-07T06:09:41.727113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.702168Z","title":"Accelerating a random forest classifier: Multi-core, gp-gpu, or fpga?","venue":null,"work_id":"bb647b47-4b73-4b66-8006-06dbdbae49a7","year":2012},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.630098Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:0884277eac64f43641b9e22e0daf0f1aee549cba839715188ad6d93c2985dcd6","observation_id":"9aa96ecc-4c20-4fae-9dd7-8c5dbba5ad40","resolution":{"observed_at":"2026-08-07T06:09:41.710843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:31.708263Z","title":"Content-addressable memory (cam) circuits and architectures: a tutorial and survey,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.708263Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:f4b82213340dd06b1cf373faa2e66b21a1690780a9a50cfcbe4caf2e58f11180","observation_id":"87a42bcb-cfe2-4fc1-bc72-b9bb21f8ab03","resolution":{"observed_at":"2026-08-07T06:09:31.708263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:31.811864Z","title":"Isaac: a convolutional neural network accelerator with in-situ analog arithmetic in crossbars,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.811864Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:8947858f8528f18381cce9c1139b570b5f6cde841ad623a9103016f7cd2e80f6","observation_id":"d0f6c90e-0958-4046-b44d-e209ba3ee64c","resolution":{"observed_at":"2026-08-07T06:09:31.811864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.531002Z","title":"Prime: A novel processing-in-memory architecture for neural network computation in reram-based main memory,","venue":null,"work_id":"3b7adf2a-2985-4860-8236-f4a0815a3362","year":2016},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:31.957289Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:0f9f15ae585a08a14af6f1e1889688631ca99533aba5503431998db1fc9a768a","observation_id":"ec0bc5c8-ee84-45de-aeb0-4d0767a440ea","resolution":{"observed_at":"2026-08-07T06:09:41.599050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.251611Z","title":"An overview of computing-in-memory circuits with dram and nvm,","venue":null,"work_id":"26a59770-a0d6-418d-90b3-2477a64c4892","year":2024},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.065780Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:e271c79fc5ff5a40667c99f646674ab853b5bf0687005845e360c379faa21007","observation_id":"436e4046-1d2e-4dc7-a24e-5a8dd9c1094d","resolution":{"observed_at":"2026-08-07T06:09:41.396309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:41.032381Z","title":"Rram-based tcams for pattern search,","venue":null,"work_id":"23218976-1534-4b51-bcd9-cdc563f24eda","year":2016},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.172526Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:63b945c4a14fb26dfdb4f86fe4ada12e62cd41445eb7c3aac92fdcffc4325839","observation_id":"c13ce22b-0d1f-4f21-87bf-f501782860e2","resolution":{"observed_at":"2026-08-07T06:09:41.089736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:40.945761Z","title":"The trend of emerging non-volatile tcam for parallel search and ai applications,","venue":null,"work_id":"21518982-536e-4504-9b5a-d9f70eed4f21","year":2022},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.270736Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:438fe4efa5874cce37327c7e5ac02336fb02b16de41975d823a27f1ae5435394","observation_id":"ce6a4683-e1e1-4bae-8672-9d27b60f6f63","resolution":{"observed_at":"2026-08-07T06:09:40.984809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:40.743974Z","title":"17.5 a 3t1r nonvolatile tcam using mlc reram with sub-1ns search time,","venue":null,"work_id":"d00258e7-0a58-40d8-98d1-34caa2c54ece","year":2015},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.361657Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:6a93e678bf1f24686e178037fb93509401e36cc4e6be0c9020e2c0560c6abcf6","observation_id":"90e68545-bfdb-4d53-93b1-8b5b6267132d","resolution":{"observed_at":"2026-08-07T06:09:40.812885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:40.499385Z","title":"API design for machine learning software: experiences from the scikit-learn project,","venue":null,"work_id":"f93949fc-546f-4484-853c-40994a1b7234","year":2013},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.474151Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:a76724009ba0e4ee8ea2cc0492cb0d279f93cc76fa4a878e0451e575a2747247","observation_id":"0d4b3a02-47ee-44a6-95de-5db514692dd6","resolution":{"observed_at":"2026-08-07T06:09:40.617087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:32.613952Z","title":"Random forests,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.613952Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:c3518cb9f5cdcf080fa591519e0b253616a5c376b40428d1b69ef580355e7725","observation_id":"2d128a0a-61a6-453d-b7d9-655b6aeea579","resolution":{"observed_at":"2026-08-07T06:09:32.613952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:40.312346Z","title":"Dt2cam: A decision tree to content addressable memory framework,","venue":null,"work_id":"845bddc8-16af-4655-8e47-27057d9e23de","year":2023},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.719190Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:a5fb3652838fb926c7996c07459419d65fb5b93c38ffbba676cf15669d0cfbf3","observation_id":"75413fde-ab4d-4311-8410-174315e1d22d","resolution":{"observed_at":"2026-08-07T06:09:40.398945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:40.103723Z","title":"Tree-based machine learning performed in-memory with memristive analog cam,","venue":null,"work_id":"631ce841-7668-4c28-ac84-049a95679181","year":2021},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.832076Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:a4eb7bd8ba34d3ec4c2fdfcda8f0138acfd87e5e808a848315ada25745566e3a","observation_id":"4a829faa-c74f-42ef-8daa-cb532f5880fb","resolution":{"observed_at":"2026-08-07T06:09:40.210332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:39.931513Z","title":"X-time: Accelerating large tree ensem- bles inference for tabular data with analog cams,","venue":null,"work_id":"7df5227b-e674-413e-84d7-c3b7a96ac6a0","year":2024},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:32.941238Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:4d8773d6af251de2c86384ccb4e992476d82694bf5bcc584439031d3c38ef7b2","observation_id":"8b2837bc-b9b3-497e-80af-0447b4a0b2e8","resolution":{"observed_at":"2026-08-07T06:09:40.047156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:39.839090Z","title":"A digital 3d tcam accelerator for the inference phase of random forest,","venue":null,"work_id":"244525fc-7b0b-407e-889b-56a98686aa61","year":2023},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.016263Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:d67e8b5b1e6333007967830edda4f9d992cd3d4371c51e982cf86acca543869d","observation_id":"23d03b44-fa0f-4f84-af1c-3e503071c6eb","resolution":{"observed_at":"2026-08-07T06:09:39.873032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1126/sciadv.adk8471","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Deep random forest with ferroelectric analog content addressable memory,","venue":"Science Advances","work_id":"c83fb7ea-34d8-4e79-9698-fad252eee339","year":2024},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.124908Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:8359fc9fa6ddd5fd1a1994016d3afd51eae31741073f07a71cf4a536838a2a96","observation_id":"30247a9f-4d0d-4c58-ae62-67f4e23df9b5","resolution":{"observed_at":"2026-08-07T06:09:35.752318Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:39.562270Z","title":"Out-of-bag estimation,","venue":null,"work_id":"a218e4a0-c6f8-4af2-bcd1-588d19239979","year":1996},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.226844Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:f57108e7587b64cf82757e8fe2a7fefc62d774f2f7478a2e783cb0262a7df1ca","observation_id":"62e842a9-eac8-48f9-b53a-5d78cb91dc4f","resolution":{"observed_at":"2026-08-07T06:09:39.767034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:33.315730Z","title":"Lightgbm: A highly efficient gradient boosting decision tree,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.315730Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:a086b56ce52a95f2453e5d65ea8c18a4a823608f7da88e1388b26646f72d1309","observation_id":"a8d9bd3a-15fa-455d-9b67-26c983079148","resolution":{"observed_at":"2026-08-07T06:09:33.315730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:39.304469Z","title":"Catboost: unbiased boosting with categorical features,","venue":null,"work_id":"162d8cf1-9a10-487a-b387-dcfe71460904","year":2018},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.405646Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:cd5341224b6e046de1ded82f11b9abd4eaeead9909ddd4e35d3de36ed74655c5","observation_id":"0c6d293f-bbd6-41ab-aacb-7b61ddf46a57","resolution":{"observed_at":"2026-08-07T06:09:39.390982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:39.092036Z","title":"Breiman, J","venue":null,"work_id":"b7cde939-9612-492e-854c-5a91cf5c6014","year":1984},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.477401Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:04de8cb04dc0f707b7dd3cab334d74194779075398e1b408cae874e4861a0b5c","observation_id":"c908bffb-d123-4161-9013-b116df120d5c","resolution":{"observed_at":"2026-08-07T06:09:39.200475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:33.556276Z","title":"Bagging predictors,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.556276Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:80a77a0d0b88d11f4cc0f0fcf4cb72c5467f43ebb102ca16fb8d2e803637cafc","observation_id":"1fe29435-cdc7-4344-8545-cd648220e8af","resolution":{"observed_at":"2026-08-07T06:09:33.556276Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:38.859496Z","title":"A brief introduction to boosting,","venue":null,"work_id":"bf0c5e0a-5c10-4515-83b6-53ac7b868260","year":1999},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.638596Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:dfe6a0c2d6145409a25856659aaab414ca3b466ce7decce3d41a14eedefe27fa","observation_id":"c1ea37dc-4257-478c-a628-77d7711882b7","resolution":{"observed_at":"2026-08-07T06:09:38.963442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:38.670587Z","title":"Emerging trends in design and applications of memory-based computing and content-addressable memories,","venue":null,"work_id":"d10d1bed-978b-413a-995e-b30685dd44aa","year":2015},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.715459Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:df842ddd91cc453da8262e1900e7b262cfce89a3a6bd9fd1f060fc8415920a4a","observation_id":"996327cc-9acf-4b57-ab9c-c8b09e354073","resolution":{"observed_at":"2026-08-07T06:09:38.767223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:38.497475Z","title":"Advancements in content-addressable memory (cam) circuits: State-of-the-art, applica- tions, and future directions in the ai domain,","venue":null,"work_id":"1ed5417a-9e3b-436e-8404-0550fd1e78fd","year":2025},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.787350Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:6259ac865167811d17e48d11a9be7e956c02025d6e82bd936318f18f78f60649","observation_id":"9980b2d6-72f9-4d9c-b2c2-0cb32cc78ec8","resolution":{"observed_at":"2026-08-07T06:09:38.580892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:38.301307Z","title":"A ternary content- addressable memory (tcam) based on 4t static storage and including a current-race sensing scheme,","venue":null,"work_id":"079937e7-94b6-4bbe-b0fd-03412af87f89","year":2003},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.877719Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:91c46bc6501944ec30b1e3aa8bb6f39952bdfbe70394e26133360e638d2fce7b","observation_id":"33bb09e8-241c-468b-b5f8-e09ac24414d0","resolution":{"observed_at":"2026-08-07T06:09:38.380604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:33.963897Z","title":"Becker and R","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:33.963897Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:91087af8c309421b1af9d27c8574c3c39ce0dcf57881cd65770941e6c020f96b","observation_id":"047718e8-2417-4926-8b65-e5ee1ded205a","resolution":{"observed_at":"2026-08-07T06:09:33.963897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:34.042657Z","title":"Credit Approval,","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.042657Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:d80199f649f72443bec7b3266e50f8e2181808f54a677c6aeb6f2eaceed38ee7","observation_id":"5bfc022d-2001-43f7-a5bd-e65054889b88","resolution":{"observed_at":"2026-08-07T06:09:34.042657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:34.109785Z","title":"Dry Bean,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.109785Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:4407d9387a1d3322f2d0c923be37c8c905f6b2d3390608ff81b2c070fb7c52bf","observation_id":"0cbac6e8-463b-437c-ad62-6220a76fec71","resolution":{"observed_at":"2026-08-07T06:09:34.109785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:34.174734Z","title":"Letter Recognition,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.174734Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:e3f6e8af2c251bb305d5d4f736d13105c144b1830d88ee83523a337549351d27","observation_id":"42be6e4f-a605-4216-9404-0c05931f4da8","resolution":{"observed_at":"2026-08-07T06:09:34.174734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:38.079561Z","title":"Wine quality,","venue":null,"work_id":"55451ffe-2dc8-47bd-ab49-70a485a06110","year":2009},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.227202Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:8937bcbf1d991a6c3ce6ecd4d24707602880c69f13581427fce0b9fffcd08223","observation_id":"2010e5e3-a4fa-404f-af2e-8da21c5f0c96","resolution":{"observed_at":"2026-08-07T06:09:38.215047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41467-020-15254-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Analog content-addressable memories with memristors,","venue":"Nature Communications","work_id":"22b544fa-557b-461a-8a98-ffe753bfeee5","year":2020},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.306098Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:56743e916db36ccbc32371c93536b08c6f95e9cf22bf8765c36ccb7a23f9234b","observation_id":"e9a8cb29-2236-439a-a677-8764c8e866e4","resolution":{"observed_at":"2026-08-07T06:09:35.427703Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:34.391739Z","title":"Noise injection adaption: End-to-end reram crossbar non-ideal effect adaption for neural network mapping,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.391739Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:544ac9a607cd1424272f403c3a9d89231f5153a1063b9cc5473f50d19425721f","observation_id":"8d412468-b1a4-49d0-a5f2-fcba05bc9bcb","resolution":{"observed_at":"2026-08-07T06:09:34.391739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:37.919326Z","title":"On minimizing analog variation errors to resolve the scalability issue of reram-based crossbar accelerators,","venue":null,"work_id":"874e2854-7e3f-4861-acc8-16b403e2770b","year":2020},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.458671Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:f4335637782cf3d94422f54bd40c93c75531f891572a8eaa8c0816646c85d6d9","observation_id":"52ec8afa-d3d9-48b6-832c-6795d8a80ab4","resolution":{"observed_at":"2026-08-07T06:09:37.992764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:37.693113Z","title":"Margin optimization based pruning for random forest,","venue":null,"work_id":"83b95ffe-2d4a-4d84-aa9a-623e68519e78","year":2012},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.534628Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:20c04d16bbb00886e95e8e5884e2db01d475e96d1aaedabeac416b964d20614d","observation_id":"d8db6b7f-975a-49fc-aa35-b736988d737e","resolution":{"observed_at":"2026-08-07T06:09:37.796433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:37.525167Z","title":"Search for the smallest random forest,","venue":null,"work_id":"aa341315-05e9-43c0-8510-3f50106b5c57","year":2009},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.635005Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:ef46271fa95508c21d7c5088bcf7be2fd619ddb9e76be5423b269add73f55de2","observation_id":"ea574ba0-2b00-405a-9226-f1d8d0c2742f","resolution":{"observed_at":"2026-08-07T06:09:37.619132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:37.328783Z","title":"Smart sensors: Analysis of different types of iot sensors,","venue":null,"work_id":"904f4ec3-ced2-4fd7-b208-6eab5522af60","year":2019},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.741461Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:7c3ebfe71800eca4a1e5f6899bb78a07848b4ba8dbce0a91b3b14983df1b1d52","observation_id":"38850d95-2160-4775-8ea5-780171c1206b","resolution":{"observed_at":"2026-08-07T06:09:37.410968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:37.163358Z","title":"A survey of research and practices of network-on-chip,","venue":null,"work_id":"b0d9a242-3131-4335-8dd7-e5089c81e569","year":null},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.851297Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:3e0a754701f3491ddc4215c1b9602271f7fb05285802f0ce16f6aac17fcaa595","observation_id":"06daafa9-6941-49dd-8c63-d069ae62fdcb","resolution":{"observed_at":"2026-08-07T06:09:37.222718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:36.897858Z","title":"The uci machine learning repository,","venue":null,"work_id":"a47f22c3-fe7d-47b1-8c58-6b0f7bd74fe1","year":2024},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:35.018822Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:f7ed4f7e312a88b5b19d5925978013d26ce3ed5198282322f749082bf92fa097","observation_id":"b9e92dfa-51dd-4b11-b26f-e0d8aeede82c","resolution":{"observed_at":"2026-08-07T06:09:37.040308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:36.712092Z","title":"ranger: A fast implementation of random forests for high dimensional data in c++ and r,","venue":null,"work_id":"70269de2-4bf2-4c17-a6c9-9af3bc7643ac","year":2015},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:35.084312Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:df3c8b56514aa0897ad9d61f4dd612a00be4f99c67b395f9c025b8156e06bea9","observation_id":"dedeb78e-16da-4a87-a111-f4a54fb305cb","resolution":{"observed_at":"2026-08-07T06:09:36.793052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:36.546176Z","title":"17.5 a 3t1r nonvolatile tcam using mlc reram with sub-1ns search time,","venue":null,"work_id":"a7968e1d-281a-48c9-a629-fda016d6b8b4","year":2023},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:35.178745Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:fcd4e30c26cca1b52682bf6a49d8d8987187cb1bd69158fff3dd85c2b24e147f","observation_id":"b42d28dc-9c04-47e6-aab3-abccfb8c5979","resolution":{"observed_at":"2026-08-07T06:09:36.631555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2952.11329","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:36.184951Z","title":"Available: https://doi.org/10.1145/1132952.1132953","venue":null,"work_id":"6d83de41-5226-4744-934d-3e45a7c3a713","year":null},"citing_paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-07T06:09:34.929791Z"},"links":{"citing_paper":"/paper/2506.05994"},"observation_digest":"sha256:1995f9addd783245b6a06b3fd0c489853190514e0a0b5996db8b7799e3b277e5","observation_id":"2cca7ba0-77f1-4277-9aa6-9cf32031a7d3","resolution":{"observed_at":"2026-08-07T06:09:36.257267Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05994","last_updated":"2026-02-04T11:25:18Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:59:55.796290Z","submitted_at":"2025-06-06T11:25:51Z","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":14,"verified_exact":3,"verified_fuzzy":33},"total_outbound_references":52},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2506.05994."}