{"as_of":"2026-08-22T10:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74fd169761c077acc591a7137f3bd3539cde6e1b261cf0d6cb10a4bdcc9edb9e","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T10:19:14.889675Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-08-06T10:03:22.975907Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T10:03:23.069763Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"cited_work":{"arxiv_id":"2508.00954","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.00954","snapshot_observed_at":"2026-08-06T10:03:23.069763Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","venue":"cs.LG","work_id":"70c51069-ae0f-4f2c-9830-68d62e77c6f9","year":2025},"citing_paper":{"arxiv_id":"2508.00961","last_updated":"2025-08-01T13:27:35Z","snapshot_observed_at":"2026-08-14T00:17:13.957493Z","submitted_at":"2025-08-01T13:27:35Z","title":"FinKario: Event-Enhanced Automated Construction of Financial Knowledge Graph","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T10:03:22.975907Z"},"links":{"cited_paper":"/paper/2508.00954","citing_paper":"/paper/2508.00961"},"observation_digest":"sha256:79d3a857df99c54b86e5c3ec663fe1da08e429eb92cd2b6077a05cad81422f91","observation_id":"e790c7db-0663-4456-b4e9-055f60c5e1dd","resolution":{"observed_at":"2026-08-06T10:03:23.187471Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.00954/citation-record","integrity":"/paper/2508.00954/integrity","json":"/paper/2508.00954/citation-record.json","paper":"/paper/2508.00954"},"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-06T10:19:25.613037Z","title":null,"venue":null,"work_id":"258bab67-5973-4f26-9e66-620cfb2f63c2","year":2016},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:08.466763Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:e307db5cd995a2d4ad92f01d09a1d1a18e53102829b3fbbfd84af97c9a75bb1a","observation_id":"4a8e7a92-88b1-4411-875a-492cc279d30e","resolution":{"observed_at":"2026-08-06T10:19:25.765254Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T10:19:08.593045Z","title":"Feature selection: A data perspective,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:08.593045Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:cf1c9f8dcb99eda1de7d47907065a242a72f15a987cbfed96232128bb70c30f0","observation_id":"5b671814-94e2-4183-9117-5ebd4f6a1579","resolution":{"observed_at":"2026-08-06T10:19:08.593045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-06T10:19:08.687155Z","title":"Language models are few-shot learners,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:08.687155Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:cacb21ed5ef74cc343e5fa9eceb4faf767436bbe8bb490ac9d4ccab6282f9b1e","observation_id":"5dc034d3-b0e0-47c4-9dca-8b114fa6408d","resolution":{"observed_at":"2026-08-06T10:19:08.687155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-06T10:19:08.876363Z","title":"On the opportunities and risks of foundation models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:08.876363Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:5d9c1eb99caa5befd1bb9c238cefca19f9dc34325e9ae319d6b50f6cfbef70ae","observation_id":"693de6c7-35bd-495c-a92b-a081cb8af7b6","resolution":{"observed_at":"2026-08-06T10:19:08.876363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.08144","last_updated":"2016-10-08T19:10:41Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-09-26T19:59:55Z","title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.08144","snapshot_observed_at":"2026-08-06T10:19:09.025114Z","title":"Google’s neural machine translation system: Bridging the gap between human and machine translation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.025114Z"},"links":{"cited_paper":"/paper/1609.08144","citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:80a50cd2682022f92e4361576f8af81679e06363338187b14a42348afae7daae","observation_id":"9aaa9dc0-31fe-4463-b000-dde0dd713457","resolution":{"observed_at":"2026-08-06T10:19:09.025114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1601.07996","last_updated":"2018-08-26T20:43:57Z","snapshot_observed_at":"2026-08-18T19:31:20.939138Z","submitted_at":"2016-01-29T08:32:10Z","title":"Feature Selection: A Data Perspective","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1601.07996","snapshot_observed_at":"2026-08-06T10:19:09.193206Z","title":"Feature selection: A data perspective,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.193206Z"},"links":{"cited_paper":"/paper/1601.07996","citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:d60689227f6d94b855b641f878ccb36f86d1add633184c0ffbaad02e161180e6","observation_id":"cfe40c77-f5ff-4299-a383-6fb6793b7288","resolution":{"observed_at":"2026-08-06T10:19:09.193206Z","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":"10.2478/cait-2019-0001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A review of feature selection and its methods,","venue":"Cybernetics and Information Technologies","work_id":"7b47cb08-e701-4019-afe2-3eb6b9c93a80","year":2019},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.339669Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:b004608b6f5c63594d87f5d426ac6de5e3213cce6a0af53fc72e2c5db8271afd","observation_id":"a8b1728f-dcde-4a01-9553-751427ac868d","resolution":{"observed_at":"2026-08-06T10:19:17.285674Z","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-06T10:19:25.254074Z","title":"A review on feature selection methods for classification tasks,","venue":null,"work_id":"fdf3ee64-1f0a-4bb5-99e5-2c2f95971f5d","year":2016},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.433213Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:095799bf71b0e8f3809b4c50395fb849b17e0dab8b10520250b98535c991dc30","observation_id":"ab866385-9d83-48f4-9ef8-afd0a9d2183d","resolution":{"observed_at":"2026-08-06T10:19:25.420411Z","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-06T10:19:24.946062Z","title":"Feature selection methods: Case of filter and wrapper approaches for maximising classifi- cation accuracy,","venue":null,"work_id":"b61e94ad-b36d-4d1f-a71d-427bdd8c9a64","year":2018},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.618470Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:dadd13638a0cf0f350d1793798bf5ac554cdb0138721d30e579317a93ec7e752","observation_id":"f73011f9-5e5f-4bde-80bd-d2cddcdf5a80","resolution":{"observed_at":"2026-08-06T10:19:25.083591Z","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-06T10:19:24.609604Z","title":"A hybrid genetic algorithm with wrapper-embedded approaches for feature selection,","venue":null,"work_id":"c47b7214-4cd9-4918-82be-81b90916a475","year":2018},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.771446Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:24795712801c8a574b28dff5e9688f561d4b64c6b42c808ac473d3bfd9a61756","observation_id":"09932971-c637-45c2-b626-e624bc04e5d1","resolution":{"observed_at":"2026-08-06T10:19:24.740812Z","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-06T10:19:24.268868Z","title":"Evolutionary computation for feature selection in classification: A comprehensive survey of solutions, applications and challenges,","venue":null,"work_id":"5c65eaaf-9468-4c71-b596-3349d50e0310","year":2024},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:09.937215Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:072e38bad8a1ec4b929c9bb9432473d2a5317b420ef1281818bf4c3e4287bd9b","observation_id":"17954939-dd18-4226-b7da-32c309ba3e84","resolution":{"observed_at":"2026-08-06T10:19:24.414101Z","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.1371/journal.pone.0303088","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Feature selection algorithm based on optimized genetic algorithm and the application in high-dimensional data processing,","venue":"PLoS ONE","work_id":"879168c4-5509-4944-bf4b-afed7926e300","year":2024},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:10.097288Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:243981fc0a4ed7de53b478b0881516841f11ea159075ee5e922da3aafbfb49a9","observation_id":"c172c548-4b85-4ef1-965f-21999d5e48cf","resolution":{"observed_at":"2026-08-06T10:19:17.013208Z","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-06T10:19:23.965210Z","title":"Feature selec- tion in high dimensional data by a filter-based genetic algorithm,","venue":null,"work_id":"73f3473d-2f12-441f-a2e7-70318cc99656","year":2017},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:10.319767Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:a3b3c8872de82adf90d0fcd146acba169562e74cb12c639263bdd8682e71497d","observation_id":"fc334736-9132-4c60-bbe4-61eb2c8b6193","resolution":{"observed_at":"2026-08-06T10:19:24.132193Z","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-06T10:19:23.646702Z","title":"Hybrid filter and genetic algorithm-based feature selection for improving cancer classification in high-dimensional microarray data,","venue":null,"work_id":"3f2ac3e3-eae1-4419-ab69-5078f0306d37","year":2023},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:10.477281Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:37056a6e6adbbe223265c0aff8b3a034dd1b803e294e6f25ac51a1b27ebce47d","observation_id":"47046317-4b26-4e49-8870-8d967c568af5","resolution":{"observed_at":"2026-08-06T10:19:23.811731Z","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.1142/s0219649220400195","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Practical challenges and recommendations of filter methods for feature selection,","venue":"Journal of Information & Knowledge Management","work_id":"9536f448-8510-4628-bad7-9b05d6e58a5c","year":2020},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:10.619307Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:f1ab83fbc6f87c14d7bc4ad49b72d8878670df5ee2531970431bbece7c69460b","observation_id":"115b91f5-9116-40d8-9dde-359e9b198da4","resolution":{"observed_at":"2026-08-06T10:19:16.730757Z","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":"10.1371/journal.pone.0202705","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"uefs: An efficient and comprehensive ensemble-based feature selection methodology to select informative features,","venue":"PLoS ONE","work_id":"6ec0af95-26a0-4df2-8525-7370a8cc09c9","year":2018},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:10.795157Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:4c2bb0f1e3766f083eedaad212dda1313f368a7dca16f522b6fb8af525ff609b","observation_id":"52abe968-87f5-4e07-8ee4-00b30b290739","resolution":{"observed_at":"2026-08-06T10:19:16.426381Z","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":"10.1109/ems.2014.44","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A hybrid feature selection method for classification purposes,","venue":null,"work_id":"ef1b0f53-2c84-472f-b9e2-ebb399ab52d5","year":2014},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:10.950197Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:b3dc62e8a251ee0716a43faa2ac490d4a015388327765ddae3330786935fac53","observation_id":"3ccd0c06-c95d-4254-aec4-c7275e9b103f","resolution":{"observed_at":"2026-08-06T10:19:16.114264Z","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-06T10:19:23.229340Z","title":"Hybrid binary bat enhanced particle swarm optimization algorithm for solving feature selection problems,","venue":null,"work_id":"a2a27188-5bd4-4574-8c44-05cc002a58aa","year":2018},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.113799Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:0791f2a851835b38f8beaba4be84ff2e5a945d53ab7d362a622bd0141da7f0ff","observation_id":"111e6551-1a5f-4234-be75-cf62c49cb0e3","resolution":{"observed_at":"2026-08-06T10:19:23.440739Z","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-06T10:19:22.961621Z","title":"A feature selection algorithm performance metric for comparative analysis,","venue":null,"work_id":"329eff70-36ec-4de6-9834-d5d0773551a9","year":2021},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.234773Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:09668afaf2fb0434fc8996e3f6cbdeb34fe408b9234ebce928b74b58f0b460f5","observation_id":"4f6832e8-34bf-44ef-b40a-536427307a11","resolution":{"observed_at":"2026-08-06T10:19:23.071572Z","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-06T10:19:22.646948Z","title":"Hierarchical harris hawks optimizer for feature selection,","venue":null,"work_id":"f0004a36-07a4-4f63-a03c-8d85309cf5b4","year":2023},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.338521Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:c828e473c72dc5ce7dc4f5a7fa3bd8645bb1ed63cde9166c9b67b17b87355ac2","observation_id":"eb3f9a8f-8e2a-430c-ae77-49de393ebd8e","resolution":{"observed_at":"2026-08-06T10:19:22.800263Z","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-06T10:19:11.490182Z","title":"Bayesian Optimization: Open source constrained global optimization tool for Python,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.490182Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:ee02f9d76969c7a1369d97907575ec9985f1a0ebc879743e01a1a90fa3f44d0b","observation_id":"a897b40a-fe47-4ba7-80d8-f3c7f4619cab","resolution":{"observed_at":"2026-08-06T10:19:11.490182Z","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-06T10:19:22.399024Z","title":"Golden-section search,","venue":null,"work_id":"4a0084d3-d59d-464c-a0a9-4ed31abb402a","year":2022},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.646080Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:af4c7accc78a1130110dd956d358f8f4b67290b8a9ff1d538cdf3a9948b5fb26","observation_id":"8fc14caa-6028-43ec-ab46-c3ac751303fb","resolution":{"observed_at":"2026-08-06T10:19:22.487627Z","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-06T10:19:22.067426Z","title":"Py fs: A python package for feature selection using meta-heuristic optimization algorithms,","venue":null,"work_id":"9315ce88-4968-4264-ba18-c9aa0f3750a5","year":2022},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.780727Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:eaf57d57051841a1f9b5097241ee45ff6b3187052e459cc08e2b2fefa0e9f6af","observation_id":"70546303-0f62-484c-b668-f8e02a3ad6bb","resolution":{"observed_at":"2026-08-06T10:19:22.268733Z","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-06T10:19:21.776332Z","title":"Binary genetic swarm optimization: A combination of ga and pso for feature selection,","venue":null,"work_id":"6d402dec-fd0e-4b62-b20e-116926cde899","year":2019},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:11.971573Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:b56b5f8ac226e318d7379ba9f29bff3a3327ed6d703c94934b292d064df12ffa","observation_id":"e528471b-7897-4b83-b34d-d75989dab1f5","resolution":{"observed_at":"2026-08-06T10:19:21.913638Z","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-06T10:19:21.531173Z","title":"Selective oppo- sition based grey wolf optimization,","venue":null,"work_id":"8679627b-313e-4111-bcbe-ad20a690f3ce","year":2020},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.096272Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:10dd7f95bddc3fc8ffec3accf31de238d26eb0dcc5428b7cc1b57edf047fd5f0","observation_id":"ab141a2a-b14b-43c7-abaf-8c5ec26370c7","resolution":{"observed_at":"2026-08-06T10:19:21.623396Z","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.1007/s00500-020-05183-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Embedded chaotic whale survival algorithm for filter–wrapper feature selection,","venue":"Soft Computing","work_id":"556ef7b2-cf7d-4983-ac41-43537b383333","year":2020},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.262803Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:f27934ff240a515b300d4f1a6620cdd94ec192b72c06437e886cf5aba631d404","observation_id":"be417847-231b-479b-a748-d238370dc281","resolution":{"observed_at":"2026-08-06T10:19:15.853652Z","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-06T10:19:21.169108Z","title":"Feature selection using the sine cosine algorithm,","venue":null,"work_id":"8381ee36-44db-4f39-8f75-6f5fde1255cc","year":2021},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.414618Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:e3291baee2b614e4c001e4630df883dabed2998b94dce2dee25385698674ac84","observation_id":"9669e854-3b2e-4818-93b6-5082679bd92a","resolution":{"observed_at":"2026-08-06T10:19:21.293124Z","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-06T10:19:20.911656Z","title":"The uci machine learning repository,","venue":null,"work_id":"59dd8b3f-d893-41db-98df-93abe8408820","year":2024},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.565293Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:fa709958dbba6c1433e4f4794ad32df7089cb3450f90c2021e39260d5ebd1d96","observation_id":"31ea68a2-7b03-4458-81a0-48ec7640c4bc","resolution":{"observed_at":"2026-08-06T10:19:21.035747Z","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-06T10:19:20.624527Z","title":"Kaggle: Your machine learning and data science community,","venue":null,"work_id":"ae9b0755-ad51-4d4c-97d4-7ce783f9e4d9","year":2024},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.721236Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:6449b6b1280796c7257cc14ba38ec5c7891b487138b01266d1888b75a6ad1433","observation_id":"00e994a6-70cc-400c-b2ed-117899bbc373","resolution":{"observed_at":"2026-08-06T10:19:20.779212Z","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-06T10:19:20.300997Z","title":"Airline Dataset — kaggle.com,","venue":null,"work_id":"88cf2df9-c635-474c-82da-d19b3d55b366","year":2020},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.845782Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:fd0c804a8e4c9119625b398c5dd999ac2c35d1f6dc125283c1379b935225b37c","observation_id":"f9c70fc8-ee80-47fd-9cfc-2d9a2794e8c9","resolution":{"observed_at":"2026-08-06T10:19:20.426637Z","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-06T10:19:20.043756Z","title":"News Articles — kaggle.com,","venue":null,"work_id":"9ed2479e-0c68-4ab6-80f2-38bd35598ffe","year":2017},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:12.984979Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:489b439bbdfb3bfbac8caf0248a48dd6e9130a3b813a8f761dea6f194cab5a12","observation_id":"d2a27481-1858-4395-adc7-ccd5654104d0","resolution":{"observed_at":"2026-08-06T10:19:20.147937Z","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-06T10:19:13.112986Z","title":"BlogFeedback,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:13.112986Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:ea18561ae33e23f16b9e28931f0d5368474e92f524a3c4dfefa5990a31a2fdca","observation_id":"67442434-fa87-4762-ac4e-33ac78d5ed01","resolution":{"observed_at":"2026-08-06T10:19:13.112986Z","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-06T10:19:19.724017Z","title":"CARER: Contextualized affect representations for emotion recognition,","venue":null,"work_id":"facb7378-3fcb-48d1-b30a-5cc89679b3ee","year":2018},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:13.324617Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:f497ba2fd06feb738570d133874086b4ec9a46dbcc11ffd7c0d53cab4d983ff5","observation_id":"ea56e7bc-7833-49d2-8ff5-a8291751cc75","resolution":{"observed_at":"2026-08-06T10:19:19.876088Z","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.1016/j.patcog.2007.02.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Markov blanket-embedded genetic algorithm for gene selection,","venue":"Pattern Recognition","work_id":"c60e0319-dc7d-4fa2-a1dd-73b79287ec0b","year":2007},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:13.475053Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:002b85776a9d4f5d877973d43fbb72bd751e54ac5a428ce4da1f4a18d7c414c9","observation_id":"5eb2d100-a1d3-451e-98ac-804fa99e6eb1","resolution":{"observed_at":"2026-08-06T10:19:15.565390Z","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-06T10:19:19.410279Z","title":"Sosnet: A graph convolutional network approach to fine-grained cyberbullying detection,","venue":null,"work_id":"31219a4b-6b74-403c-97c3-bfc1379133c0","year":2020},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:13.636530Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:4fd14d419db1262c083c09cc5f62f64d1b6ec57b6f1d77484d52474aee62e1ed","observation_id":"e20d5cf5-bc23-47f7-a181-c1066f630e93","resolution":{"observed_at":"2026-08-06T10:19:19.543997Z","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-06T10:19:13.730868Z","title":"Gisette,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:13.730868Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:f69f9ed4a69ef6e340cda13d77e87fcb50275c7ec2f5881af18527502ccaaa6e","observation_id":"1195c997-d777-4c6f-a6be-e7231fe73fca","resolution":{"observed_at":"2026-08-06T10:19:13.730868Z","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-06T10:19:19.088679Z","title":"House prices - advanced regression techniques,","venue":null,"work_id":"dc386eec-35f8-4959-a640-4567d61d1a66","year":2016},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:13.864134Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:3821757143be252eb9034ddd281f296b8280c77f11967a66045ed0e3dc39c824","observation_id":"7d092b6d-a2f8-47ac-835d-331a1511b2e6","resolution":{"observed_at":"2026-08-06T10:19:19.262818Z","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-06T10:19:14.024316Z","title":"Cole and M","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.024316Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:3c8ce75cd87a914398235f68cf46575db1d6cf6749238c3b1e7b8ed71cde6138","observation_id":"5c39fe4b-cffd-419e-a837-aa5290ea7828","resolution":{"observed_at":"2026-08-06T10:19:14.024316Z","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":"10.24432/c5602h","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Madelon,","venue":"UC Irvine","work_id":"d8302bc5-e490-4710-a63d-3f9e4ea7b25f","year":2004},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.116509Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:4a7fdc2b5bac08f4410abfa95e161b3db6563f14a3bd3327f086876460e25bc0","observation_id":"8133d214-e0de-4838-96b6-de66c0ece573","resolution":{"observed_at":"2026-08-06T10:19:15.252719Z","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-06T10:19:18.779139Z","title":"MNIST Dataset — kaggle.com,","venue":null,"work_id":"639ea377-9cec-4c87-ae14-f3a62d492cba","year":1997},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.256879Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:546a6168b4f0aace3c4db48c19fbf9fd0b217369129a3f1a199914564c2b8d60","observation_id":"555d2024-2edb-4f6b-bfec-66960280e9d9","resolution":{"observed_at":"2026-08-06T10:19:18.949471Z","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-06T10:19:18.456794Z","title":"Newsweeder: Learning to filter netnews,","venue":null,"work_id":"0cfcbec2-25b0-4696-9002-84567aaa9da6","year":1995},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.402563Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:9839a4df46dc5cb1399790222d05cf581214518492224e4efbd41d852fc8f7ad","observation_id":"2c6fb32e-6d3b-4e1f-9621-9a9f93820bf2","resolution":{"observed_at":"2026-08-06T10:19:18.649080Z","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-06T10:19:18.205148Z","title":"190k+ spam — ham email dataset for classifi- cation,","venue":null,"work_id":"fc98aeca-89bf-48ef-b763-c03b62b1446e","year":2024},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.580856Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:e87e8d064093b4e0ed12587d83a12ddb1d7e9c4b2992ac11ce8417707819bf09","observation_id":"4e8dd7e2-9493-4d77-bcc1-cd83ed92414f","resolution":{"observed_at":"2026-08-06T10:19:18.315841Z","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-06T10:19:17.874599Z","title":"Feature selection with the boruta package,","venue":null,"work_id":"e1f3c6f0-3bdd-4428-b200-93176aaaf97d","year":2010},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.727130Z"},"links":{"citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:711378dcd8b2f534a4d9b0e02225dbedf561ece2b897d371edf1e9edaef75fc0","observation_id":"104544ed-7e43-4196-a3e3-0e152e622a98","resolution":{"observed_at":"2026-08-06T10:19:18.016842Z","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":{"arxiv_id":"1711.08477","last_updated":"2018-04-03T00:55:05Z","snapshot_observed_at":"2026-08-20T05:13:26.315046Z","submitted_at":"2017-11-22T19:18:47Z","title":"Benchmarking Relief-Based Feature Selection Methods for Bioinformatics Data Mining","version":2},"cited_work":{"arxiv_id":"1711.08477","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.08477","snapshot_observed_at":"2026-08-06T10:19:17.496672Z","title":"Benchmarking Relief-Based Feature Selection Methods for Bioinformatics Data Mining","venue":"cs.LG","work_id":"778ca759-e28d-4c7e-9df7-6cedbce88ebe","year":2017},"citing_paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T10:19:14.889675Z"},"links":{"cited_paper":"/paper/1711.08477","citing_paper":"/paper/2508.00954"},"observation_digest":"sha256:63ab527f0ba622e18e25f8444ac45bb6fc39edf1c0e28c4b90969f064d42d74d","observation_id":"365e0b3c-5e7c-44c4-9e02-3b201ff5392e","resolution":{"observed_at":"2026-08-06T10:19:17.577030Z","resolver_source":"local_arxiv","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"}}],"paper":{"arxiv_id":"2508.00954","last_updated":"2025-08-01T03:32:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T10:19:06.467422Z","submitted_at":"2025-08-01T03:32:41Z","title":"FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":9,"verified_fuzzy":25},"total_outbound_references":44},"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 44 of 44 outbound references and 1 inbound Pith citation observation for arXiv:2508.00954."}