{"as_of":"2026-08-16T15:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b699ba22ab9d6479534c61c9992d4dd6f84f8a6e962c8c16af5387c41870f3d","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:20:02.785309Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T04:45:38.684903Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T04:53:05.185020Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"cited_work":{"arxiv_id":"1908.05376","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.05376","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximum relevance and minimum redundancy feature selection methods for a marketing machine learning platform","venue":null,"work_id":"603a5df7-e7b2-4898-aade-6a45fb97c13b","year":1908},"citing_paper":{"arxiv_id":"2605.19655","last_updated":"2026-05-19T10:46:12Z","snapshot_observed_at":"2026-08-15T01:55:25.236810Z","submitted_at":"2026-05-19T10:46:12Z","title":"Equalized Coverage in Motion Control Performance Prediction for Self-Adaptive Road Vehicles","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-20T04:45:38.684903Z"},"links":{"cited_paper":"/paper/1908.05376","citing_paper":"/paper/2605.19655"},"observation_digest":"sha256:f1cbd091cde8d1001452aec2efe5b05a2ac1e2fc1f90c5c6cf2478a9d5ad7e89","observation_id":"c9b03555-ead5-46e3-8b74-08d195bdb803","resolution":{"observed_at":"2026-05-20T04:53:05.189060Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.05376/citation-record","integrity":"/paper/1908.05376/integrity","json":"/paper/1908.05376/citation-record.json","paper":"/paper/1908.05376"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:20:03.046465Z","title":"Katsov, Introduction to Algorithmic Marketing: Artificial Intelligence for Marketing Operations","venue":null,"work_id":"89977bcd-2f31-4bf2-93c5-f5ed98c34425","year":2017},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.696785Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:a981a4216fae136af2f9fb97913d7543672625edc19eb07ce205fc1dfe4ac28b","observation_id":"2f8acba2-64cc-4177-8545-840f19bb170c","resolution":{"observed_at":"2026-08-14T13:20:03.050224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:03.035418Z","title":"A review of feature selection methods on synthetic data,","venue":null,"work_id":"fc075fee-b900-4869-9344-2a882a505405","year":2013},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.701236Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:811b6d1218da9005e1794e527f02109c4f5f74844b7e54d59af88b155d4dab46","observation_id":"f2ad41b2-ef96-4389-a608-adeb300c38a1","resolution":{"observed_at":"2026-08-14T13:20:03.039309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.705022Z","title":"A survey on feature selection methods,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.705022Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:652642dfc1f9c00b512b79bca312c53b9b7b38ff2e013f2d0728eac73d504cde","observation_id":"b1e5543c-1ff5-4bbd-8e2d-d15bdceb1e60","resolution":{"observed_at":"2026-08-14T13:20:02.705022Z","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-14T13:20:03.015856Z","title":"Feature selection for classification: A review,","venue":null,"work_id":"578a4b6e-f36d-4bf6-bfe4-52c4b86f5d6a","year":2014},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.709024Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:4d617723476c6b385fc0e696313996e93bc494020c79db8c72e667defaf1c8e4","observation_id":"95f453ea-b363-4d55-b185-0ea4159e4fb5","resolution":{"observed_at":"2026-08-14T13:20:03.019858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:03.003319Z","title":"The best two independent measurements are not the two best,","venue":null,"work_id":"57dfc957-1a84-4b95-afc9-ab60a9b2dbcf","year":1974},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.712774Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:46444df63a12145b4e1ece9cde1e46e86c7c7b9d31ef520a19bdd2a0f796bb70","observation_id":"12ca5c0a-7954-443c-befe-92c6a499edfe","resolution":{"observed_at":"2026-08-14T13:20:03.007657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.990869Z","title":"Feature selection based on mu- tual information: criteria of max-dependency, max-relevance, and min- redundancy,","venue":null,"work_id":"26bf3b02-3ac0-40b9-acf4-caa016b6be92","year":2005},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.716534Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:168852e0a340c3dde8a03bb9d81651be8d612bb1f54eff23ab05163fb377957c","observation_id":"788eba24-4736-4c74-a809-4e50a00a6426","resolution":{"observed_at":"2026-08-14T13:20:02.995206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.979138Z","title":"Normalized mutual information feature selection,","venue":null,"work_id":"87a2ab35-c891-48a4-a90b-1227f7c594dd","year":2009},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.720833Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:8da2398023c24660f9e6e155bb9142037cce9e985c01beee4f9449395304bf70","observation_id":"f2dbb076-c632-4c5e-a68c-6e3df9351541","resolution":{"observed_at":"2026-08-14T13:20:02.982974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.967239Z","title":"An improved maximum relevance and minimum redundancy feature selection algorithm based on normalized mutual information,","venue":null,"work_id":"bb0f10c8-0dff-4b56-8bab-7fdab9c0cbff","year":2010},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.725407Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:a06d4e9c38382c7168d2c22d5d8241f5fd34e8fa7c3e38d9d9016be467064dcd","observation_id":"0c828520-72f9-4298-8c29-34fa59ab20f4","resolution":{"observed_at":"2026-08-14T13:20:02.971212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.728860Z","title":"Conditional likelihood maximisation: a unifying framework for information theoretic feature selection,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.728860Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:25273c5298ea7e13168a761a93281e8357373045a5e9f02f04ef68dc66a4744b","observation_id":"6826a2fb-438e-49a1-962f-a4c3d088a525","resolution":{"observed_at":"2026-08-14T13:20:02.728860Z","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-14T13:20:02.948571Z","title":"Fast-mrmr: Fast minimum redundancy maximum relevance algorithm for high- dimensional big data,","venue":null,"work_id":"917010ff-0e9e-473f-a7b0-3e6629729664","year":2017},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.732922Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:e62fd94927c4ce53cd93d3a328bd3580f9b56b8390e55ed917b6247ca7742972","observation_id":"1f733308-3fe3-46af-87a5-e6d1db5cd072","resolution":{"observed_at":"2026-08-14T13:20:02.952825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.736712Z","title":"Minimum redundancy feature selection from microarray gene expression data,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.736712Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:c801c18e28079e807485b1ee3e6c08614fd819224ec1a84fe85496ba7d2ab3cb","observation_id":"b27c5f11-c4b0-4e8b-9700-c388443d8654","resolution":{"observed_at":"2026-08-14T13:20:02.736712Z","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-14T13:20:02.930508Z","title":"A new maximum relevance- minimum multicollinearity (mrmmc) method for feature selection and ranking,","venue":null,"work_id":"256e1841-cc0e-4731-8a51-02d2054e262e","year":2017},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.740149Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:6d209b80f538a60364d330cbced3ba6cdea1943ce7e8e19e5419d74b8276ed35","observation_id":"6538a24c-296f-4b50-a44c-d47626372bd0","resolution":{"observed_at":"2026-08-14T13:20:02.934591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.744012Z","title":"Random forests,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.744012Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:1de458a9c3b355429767f708d9bce6c2d666187189654871081bcbbbe881dca3","observation_id":"a66fc134-a456-4587-ba77-37f9c0d38f4d","resolution":{"observed_at":"2026-08-14T13:20:02.744012Z","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-14T13:20:02.912274Z","title":"Churn prediction in telecom using random forest and pso based data balancing in combination with vari- ous feature selection strategies,","venue":null,"work_id":"10a865c9-53b4-454e-b14a-e272e9f1a885","year":2012},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.748400Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:ad820e661746a4dc184f032d7c42d996983c1005a8c488d499b36eb754bece89","observation_id":"5e24d5ab-77e1-4156-af9d-48740a892d9f","resolution":{"observed_at":"2026-08-14T13:20:02.916275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.900358Z","title":"The randomized de- pendence coefficient,","venue":null,"work_id":"f239469d-a812-4e76-a94c-58911973d98d","year":2013},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.751956Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:1f30a3d34578d20649ed4be21aade187a7eb06f42cdf498aed778bdbb673fe1a","observation_id":"55990a69-8a32-4a84-8047-53239d1e0b67","resolution":{"observed_at":"2026-08-14T13:20:02.904893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.887657Z","title":"Stochastic gradient boosting,","venue":null,"work_id":"62212352-e5d2-4adf-933a-cd0fb76af302","year":2002},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.756065Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:32f7049205654f39648dd16eefffe69809aeedfae90c6b5595255537f006d351","observation_id":"93cc1771-935b-4d9d-9689-89ffcede389a","resolution":{"observed_at":"2026-08-14T13:20:02.892467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.759645Z","title":"Xgboost: A scalable tree boosting system,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.759645Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:e221a464397168ecc4547910d2aa1e569da202635c6eb37e9e4d966857afebc0","observation_id":"fbb5bd65-f5e9-43bc-9bbd-32c97935e1cb","resolution":{"observed_at":"2026-08-14T13:20:02.759645Z","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-14T13:20:02.868514Z","title":"A comparison of random forest and its gini importance with standard chemometric methods for the fea- ture selection and classification of spectral data,","venue":null,"work_id":"71ecaf29-f59d-47df-b10d-02d5c3978273","year":2009},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.763123Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:1d79ad53eb7a7c46d42fca8ccde4e28d15b4b4a1bc7b301bb4a024b84cf6369d","observation_id":"d64855e5-4155-4a50-8060-70125a674ef4","resolution":{"observed_at":"2026-08-14T13:20:02.872756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.766861Z","title":"Evaluation: from precision, recall and f-measure to roc, informedness, markedness and correlation,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.766861Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:9c50930cab120433674b560446b9d3d166b4784632c8257a56f78ebd4b1b7101","observation_id":"1f9badd7-3dc6-46ac-855b-33029cd4c34c","resolution":{"observed_at":"2026-08-14T13:20:02.766861Z","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-14T13:20:02.770368Z","title":"An empirical study of the naive bayes classifier,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.770368Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:ba386a1f2d3af9fbeed80b3f83efe2ffd0a6609879c903cf5a6f540ea59389f6","observation_id":"3e9599da-342a-477f-8166-172ccdcf09a7","resolution":{"observed_at":"2026-08-14T13:20:02.770368Z","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-14T13:20:02.773918Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.773918Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:6ab35916a300b4a38e56cb8c08f1d2e1e83e2222b7331003641ff86b01b6d9af","observation_id":"f0545af6-ad44-4d90-a518-b003867dc780","resolution":{"observed_at":"2026-08-14T13:20:02.773918Z","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-14T13:20:02.833034Z","title":"A study of cross-validation and bootstrap for accuracy estimation and model selection,","venue":null,"work_id":"6181eb94-6d86-46a1-81bc-464e98d442eb","year":1995},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.777748Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:84505c943e02477bf2277a76b72e4ca1f6254e977efd85dcd2eda39d06973ae2","observation_id":"f5206ecc-19fc-4331-99cf-46689f096eaf","resolution":{"observed_at":"2026-08-14T13:20:02.837949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.820291Z","title":"Smoothing by spline functions,","venue":null,"work_id":"55d0a437-b8ce-4484-87fb-a375b4acb810","year":1967},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.781219Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:7b2d7f844ac0bcb2f24e56c871b588668a5d6c267444fd260b54aac941df07de","observation_id":"b44c3921-1b67-4591-8e9b-9cc33aa65db7","resolution":{"observed_at":"2026-08-14T13:20:02.824981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:20:02.785309Z","title":"Scikit-learn: Machine learning in Python,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:02.785309Z"},"links":{"citing_paper":"/paper/1908.05376"},"observation_digest":"sha256:e209fe2758cb334454cb705096dd78daae10bf999ac102441a5073c9ebe71b7c","observation_id":"f4096fad-bd04-4db2-b9a7-b7c65c5db3ab","resolution":{"observed_at":"2026-08-14T13:20:02.785309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.05376","last_updated":"2019-08-15T00:06:23Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-16T14:19:14.716457Z","submitted_at":"2019-08-15T00:06:23Z","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":24},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:1908.05376."}