{"as_of":"2026-08-18T11:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd210c3a0f5ae09fe27e0fde6354ae8382c64be368b0a42ca1b22437b5692737","coverage":[{"denominator":81,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":81,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:48:21.734842Z","state":"measured"},{"denominator":82,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":82,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-10T22:39:23.717294Z","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-10T22:39:23.937838Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2504.17356","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.17356","snapshot_observed_at":"2026-08-10T22:39:23.937838Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","venue":"cs.AI","work_id":"c4b517bf-654a-4090-ba9d-48e0fc00e6c1","year":2025},"citing_paper":{"arxiv_id":"2501.04718","last_updated":"2025-09-11T02:18:40Z","snapshot_observed_at":"2026-08-11T14:29:01.410013Z","submitted_at":"2025-01-02T07:57:41Z","title":"Knowledge-Guided Biomarker Identification for Label-Free Single-Cell RNA-Seq Data: A Reinforcement Learning Perspective","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:23.717294Z"},"links":{"cited_paper":"/paper/2504.17356","citing_paper":"/paper/2501.04718"},"observation_digest":"sha256:6b04eef729155e09a0b68739f4e3495b0b79cbdc618543ba3d6cfa55c75f516d","observation_id":"337225b3-a878-4764-8118-5004642bed87","resolution":{"observed_at":"2026-08-10T22:39:23.944693Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.17356/citation-record","integrity":"/paper/2504.17356/integrity","json":"/paper/2504.17356/citation-record.json","paper":"/paper/2504.17356"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:48:20.617210Z","title":"Feature selection: A data perspective,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.617210Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:22f840b33bc554b5dfe2a5b1c2da83fb90316dce080766e9bfef581992de6549","observation_id":"65abe4f3-1a10-4a3c-a768-f2d023235c0e","resolution":{"observed_at":"2026-08-16T10:48:20.617210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10555","last_updated":"2025-01-17T21:05:09Z","snapshot_observed_at":"2026-08-15T13:32:20.318743Z","submitted_at":"2025-01-17T21:05:09Z","title":"Towards Data-Centric AI: A Comprehensive Survey of Traditional, Reinforcement, and Generative Approaches for Tabular Data Transformation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10555","snapshot_observed_at":"2026-08-16T10:48:20.622400Z","title":"Towards data-centric ai: A comprehensive survey of traditional, reinforcement, and generative approaches for tabular data transformation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.622400Z"},"links":{"cited_paper":"/paper/2501.10555","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:31d0795c9a3ec81d46751d0507971e36e01d9d668fab9583a7a0caef5d3a6d62","observation_id":"2f7290a5-9f88-4c06-9f6f-4355181385e6","resolution":{"observed_at":"2026-08-16T10:48:20.622400Z","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-16T10:48:28.125503Z","title":"Recent advances in feature selection and its applications,","venue":null,"work_id":"4079365f-2325-4647-82aa-436a9309d454","year":2017},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.627880Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:20a69a458b571a062697116aaec12e06a199c5021fef7d0b797f91663d274d57","observation_id":"3571d95c-6cc0-4115-9064-183500653a50","resolution":{"observed_at":"2026-08-16T10:48:28.130392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:28.110527Z","title":"Feature selection for high-dimensional data—a pearson redundancy based filter,","venue":null,"work_id":"75ad76d7-c8d6-413a-a51b-71916e68bfde","year":2008},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.633480Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:c24b80be58118ef63eb0efec7e443e045b6c1d354413e9b1b4e219b16e99e082","observation_id":"7e93bf13-5d58-488e-88d7-87e85436042b","resolution":{"observed_at":"2026-08-16T10:48:28.115641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:28.048763Z","title":"Feature selection for high-dimensional data: A fast correlation-based filter solution,","venue":null,"work_id":"6b684aed-3651-4bf7-9327-4ca3c81401a4","year":2003},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.638431Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:1c3fe9d7f65caeafb910d76c2c014c6aef8d5a233a1d78017c1c985bf008fd2c","observation_id":"b49bc564-3968-4bff-a2fe-246f9781edd3","resolution":{"observed_at":"2026-08-16T10:48:28.099663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.951294Z","title":"A fast hybrid feature selection based on correlation-guided clustering and particle swarm optimization for high-dimensional data,","venue":null,"work_id":"165b90c6-d3e5-4685-859c-f196afce6de2","year":2021},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.643452Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:90ec42df4b10885a35a9aeafdec1126e60f8f240c3e8827f39231440b2d7cdac","observation_id":"e099a876-986c-4367-9807-3621f3f66b45","resolution":{"observed_at":"2026-08-16T10:48:27.955835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.935834Z","title":"Decision tree classifier for network intrusion detection with ga-based feature selection,","venue":null,"work_id":"f29d9dd7-9e04-4130-8d57-f3240eb564d6","year":2005},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.648489Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:23e400a091fb567c2c4c1dc53d6d55556f83811fd334794fa19b068db241b134","observation_id":"6236a572-bdec-4945-8c77-74301d184699","resolution":{"observed_at":"2026-08-16T10:48:27.940602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.828620Z","title":"Feature subset selection in large dimensionality domains,","venue":null,"work_id":"6f23a97d-1453-4409-b2cf-f4f9c1e92a7a","year":2010},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.693113Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:bb655f3a470a6c33b6926f021e0c65abc82398a97f02db4a91b63b941a3ba76c","observation_id":"043d56be-5cfd-40a7-b9cd-be722ca63a43","resolution":{"observed_at":"2026-08-16T10:48:27.925155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.721104Z","title":"Consistent feature selection for analytic deep neural networks,","venue":null,"work_id":"35f2894c-bf41-4549-860f-0363737038fc","year":2020},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.769358Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:ac54286c2ccf624947ea42bd441e019ec152301785b4760c0fe85bd83bfe7874","observation_id":"4dc1ba89-f5c1-4b12-a3a8-204850e07cce","resolution":{"observed_at":"2026-08-16T10:48:27.726052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.705747Z","title":"Deep feature selection: theory and application to identify enhancers and promoters,","venue":null,"work_id":"01d92170-c662-492a-b542-33ddb70c6de3","year":2016},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.859276Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:52fc56b37ea1752980d3b3e078fe282060d0360843957808a9f61b189b994eac","observation_id":"55cb1fa4-ca0f-48cd-a219-a93bcc87edbf","resolution":{"observed_at":"2026-08-16T10:48:27.710632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.648594Z","title":"Lassonet: Neural networks with feature sparsity,","venue":null,"work_id":"32ec7a2f-bf7a-4b39-b703-78fbae529ebc","year":2021},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.864297Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:6022b1c651f5866eabad2e0df287985eb08aa01f0652724ac2cda6705a16f83f","observation_id":"2198058f-f6b7-408b-bd5a-ecf341ba19f2","resolution":{"observed_at":"2026-08-16T10:48:27.696881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.555691Z","title":"Scihorizon: Benchmarking ai-for-science readiness from scientific data to large language models,","venue":null,"work_id":"253eea23-b056-4e39-b98d-455d6e598a41","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.868997Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:b55e382c278ea1ebe804465df9789a3fd00dd3f264d97b603ff93a4f75547ae2","observation_id":"5ac7e518-1a88-4184-b990-8b2107e2e7c9","resolution":{"observed_at":"2026-08-16T10:48:27.560538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.541371Z","title":"Gut microbiota and tuberculosis,","venue":null,"work_id":"2a831ac4-8506-4ec6-8893-6decc4133073","year":null},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.873307Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:d03b45a978c471e625156683ccc9d0aea562a8a4644e1a57e7dbb18a3e87c8cd","observation_id":"3d01beed-6022-4b26-ba88-15e38f18c0fe","resolution":{"observed_at":"2026-08-16T10:48:27.546211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:27.358662Z","title":"Beyond discrete selection: Continuous embedding space optimization for generative feature selection,","venue":null,"work_id":"672404d7-2fd7-4bb4-aed9-523e2cbc0f77","year":2023},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.879102Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:d428101f4cc060218b1ab9d22c14edf06f6a78004bc1f3a3e85cb3e11e11a841","observation_id":"2697d9c5-a572-4466-b074-570a47129069","resolution":{"observed_at":"2026-08-16T10:48:27.530054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:26.998731Z","title":"Knowledge-guided gene panel selection for label-free single-cell rna-seq data: A reinforcement learning perspective,","venue":null,"work_id":"db43773d-bc68-403e-9d31-10ecea10ceec","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.884365Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:9052643c381b703b0d42d335d0c4989a8527ad7c9021adaefa045593b08ce325","observation_id":"11df870e-c2b2-4214-8b30-6388d1584de0","resolution":{"observed_at":"2026-08-16T10:48:27.268171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:26.738971Z","title":"Revolutionizing biomarker discovery: Leveraging generative ai for bio-knowledge-embedded continuous space exploration,","venue":null,"work_id":"a3f6f741-7577-46a6-a96b-f870bffc8f08","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.889018Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:865291009bee98c30785d08fffdb94d22fb7c74b5c711fb41a7f1f78b4e5c474","observation_id":"8da50773-ab10-45c9-981c-14aaf176b489","resolution":{"observed_at":"2026-08-16T10:48:26.836912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:26.597136Z","title":"Advances, challenges and opportunities in creating data for trustworthy ai,","venue":null,"work_id":"5c6111e6-33c3-474d-b5ba-fa4b504da3c3","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.893919Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:8879c950d220c0d1c7e63bee6178d30103f58722f2ad7cea6f62c820e9d67473","observation_id":"61da8e0f-c5c6-453c-b21a-74fbbfb397c5","resolution":{"observed_at":"2026-08-16T10:48:26.664317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:20.898627Z","title":"Knowledge hierarchy guided biological-medical dataset distillation for domain llm training,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.898627Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:1d75d20ee3d40153eb4b35c1d3cb7353356f35a2919a6a2f716ad7a2872e28bc","observation_id":"56eb6add-341b-4f09-ac23-a45c91cc96ba","resolution":{"observed_at":"2026-08-16T10:48:20.898627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17355","last_updated":"2025-04-24T08:16:13Z","snapshot_observed_at":"2026-08-17T13:05:10.569890Z","submitted_at":"2025-04-24T08:16:13Z","title":"Collaborative Multi-Agent Reinforcement Learning for Automated Feature Transformation with Graph-Driven Path Optimization","version":1},"cited_work":{"arxiv_id":"2504.17355","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.17355","snapshot_observed_at":"2026-08-16T10:48:22.176690Z","title":"Collaborative Multi-Agent Reinforcement Learning for Automated Feature Transformation with Graph-Driven Path Optimization","venue":"cs.LG","work_id":"88d7354e-3972-47ee-9cf1-7ecfd4d8fe96","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.903278Z"},"links":{"cited_paper":"/paper/2504.17355","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:ebeca950bf9fa790900cd8375eca0818c3a9a354720e24464e8a91104b0026db","observation_id":"9d7ed279-ac8d-47dd-ac66-b1d7da38f096","resolution":{"observed_at":"2026-08-16T10:48:22.266698Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:20.908300Z","title":"m-kailin: Knowledge-driven agentic scientific corpus distillation framework for biomedical large language models training,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.908300Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:07a9b2b6b9ab74583afc74d42028ca51b67b06a6699b4c1c06a61bb470fbdc96","observation_id":"8ce575a0-f67f-4dd4-9918-4b156fa8c68f","resolution":{"observed_at":"2026-08-16T10:48:20.908300Z","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-16T10:48:26.428494Z","title":"Tabular data-centric ai: Challenges, techniques and future perspectives,","venue":null,"work_id":"55343811-9c29-4741-b8b2-58b1c7c93f59","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.913119Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:8ea00a45eb1f2aa01f481ca32162aae91314c896c13f1e39996d31f3a368b61b","observation_id":"9591e7e3-43a0-4e89-83df-0a5981a76202","resolution":{"observed_at":"2026-08-16T10:48:26.512196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:26.252373Z","title":"Efficient reinforced feature selection via early stopping traverse strategy,","venue":null,"work_id":"079bebd5-761a-4964-aa8b-a884a0fac6d9","year":2021},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.917292Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:a87b6824916f1180e9e8406702816de2e4b8ff6e33d2ccc1c013078c7340a20d","observation_id":"913d8580-d366-4a9b-aabb-1036b2fe81c2","resolution":{"observed_at":"2026-08-16T10:48:26.312053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.976053Z","title":"Automating feature subspace exploration via multi-agent reinforcement learning,","venue":null,"work_id":"f7e84d6c-b184-4982-aaad-92f669e9804a","year":2019},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.921630Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:8bf78df905fdb31fda6298a39ae2e4da734b4bf9f28899df0352a0963f314e68","observation_id":"a0e06455-5ac5-4226-b762-9af2cc1bdbb1","resolution":{"observed_at":"2026-08-16T10:48:26.063688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:20.926440Z","title":"Zhang, Z","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.926440Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:1a6d75fb9c382e6852c9bca202e2157221b53011858c4920ad854bd25168ff80","observation_id":"def720ad-5139-4d2a-96fe-4b6b4dc79bc1","resolution":{"observed_at":"2026-08-16T10:48:20.926440Z","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-16T10:48:25.763692Z","title":"Autogfs: Automated group-based feature selection via interactive reinforcement learning,","venue":null,"work_id":"3b18cb5a-25ad-4cb2-80a1-22998e7faaad","year":2021},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.931009Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:8a7bf0c24d632a098abd62c6b2f7aaae6c0a34c96fd7038c7462dc14639170d5","observation_id":"a5dcf1d9-c1da-40fa-974d-df239bfba1d7","resolution":{"observed_at":"2026-08-16T10:48:25.851207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.725947Z","title":"Autofs: Automated feature selection via diversity-aware interactive reinforcement learning,","venue":null,"work_id":"e974b177-6a8c-4729-bb4c-0ab7f261619c","year":2020},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.935975Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:77086e8296770a6e24d5eb4a2af3696acd165f6361693349a14f000372513ade","observation_id":"0fcdc6bb-0805-4631-aa1c-4f9e77a8bf9c","resolution":{"observed_at":"2026-08-16T10:48:25.730470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12025","last_updated":"2024-10-23T17:01:05Z","snapshot_observed_at":"2026-08-16T13:24:45.718004Z","submitted_at":"2024-08-21T22:35:19Z","title":"Exploring Large Language Models for Feature Selection: A Data-centric Perspective","version":2},"cited_work":{"arxiv_id":"2408.12025","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.12025","snapshot_observed_at":"2026-08-16T10:48:22.015993Z","title":"Exploring Large Language Models for Feature Selection: A Data-centric Perspective","venue":"cs.AI","work_id":"4b66c52c-55fb-428e-8c79-563ecb5fd0c7","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.940166Z"},"links":{"cited_paper":"/paper/2408.12025","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:ac418eee96521e9cd9dabde0ff31f7729313aeb141f07efc053b0a0eb2709f5b","observation_id":"46c9be36-3cca-4cf9-a213-d28a90a17f14","resolution":{"observed_at":"2026-08-16T10:48:22.021219Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02696","last_updated":"2024-02-05T03:20:28Z","snapshot_observed_at":"2026-08-17T19:40:57.422014Z","submitted_at":"2024-02-05T03:20:28Z","title":"Causal Feature Selection for Responsible Machine Learning","version":1},"cited_work":{"arxiv_id":"2402.02696","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.02696","snapshot_observed_at":"2026-08-16T10:48:21.874550Z","title":"Causal Feature Selection for Responsible Machine Learning","venue":"cs.LG","work_id":"8278f54a-b8fb-4e2d-b17d-08c600caae33","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.945345Z"},"links":{"cited_paper":"/paper/2402.02696","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:ad090b1ded2c2743d8a4a47512e15fed3d0a6963cc47e6a3b936ce8c1f44b16b","observation_id":"0aa76399-100b-46ed-99a9-ec72e40606f9","resolution":{"observed_at":"2026-08-16T10:48:21.996561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.711519Z","title":"Self-organizing feature maps identify proteins critical to learning in a mouse model of down syndrome,","venue":null,"work_id":"4133f99a-0482-44f8-a563-551b2016c1d5","year":2015},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.950622Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:f59d775d6b45acec0b6d57b0082b384a0a1017f3f0c018ae89c2bb9dbf9aa84e","observation_id":"f728d608-885d-41f4-bb86-55848db41863","resolution":{"observed_at":"2026-08-16T10:48:25.716412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.569849Z","title":null,"venue":null,"work_id":"9471213b-021d-48da-ae32-a3c612c5fa38","year":2012},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.955314Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:b5da68b9c082a52a6de5e2f4fa503a65dbf1d92170aeaeb6c3b12b47dda133cb","observation_id":"85c31d51-b0d8-47f4-b009-24922155d96d","resolution":{"observed_at":"2026-08-16T10:48:25.615498Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.555314Z","title":null,"venue":null,"work_id":"779857a4-f847-4974-ad85-1ca5297b235a","year":1989},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.960100Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:14f9fd9f5832ac587fdd15b7a71ffb469a780b3203a63c4c4fd1b598af262d6c","observation_id":"13d10fa0-9dc7-4749-bf00-35aa3f67af2a","resolution":{"observed_at":"2026-08-16T10:48:25.560681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.539959Z","title":"Hierarchical grouping to optimize an objective function,","venue":null,"work_id":"184a5750-46cb-48fb-8881-5a8773b728c4","year":1963},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:20.964575Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:d596297e942140e6c012fdf87d54877c8ae2cd12cd9ce10f67a7dac3e34cf38c","observation_id":"546c4bb1-cf05-4163-8958-d1641c3311f7","resolution":{"observed_at":"2026-08-16T10:48:25.544604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05952","last_updated":"2016-02-25T17:55:31Z","snapshot_observed_at":"2026-08-15T17:33:32.559096Z","submitted_at":"2015-11-18T20:54:44Z","title":"Prioritized Experience Replay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05952","snapshot_observed_at":"2026-08-16T10:48:21.007310Z","title":"Prioritized experience replay,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.007310Z"},"links":{"cited_paper":"/paper/1511.05952","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:8b269071f442e5e7e9b5a1ad4d73c6fb8a910b68d894a428f37a732ffeb189a0","observation_id":"a2be4185-61a1-4c2c-94c7-728e8b80e3cd","resolution":{"observed_at":"2026-08-16T10:48:21.007310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05905","last_updated":"2019-01-29T12:10:47Z","snapshot_observed_at":"2026-08-17T07:51:41.384508Z","submitted_at":"2018-12-13T04:44:29Z","title":"Soft Actor-Critic Algorithms and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.05905","snapshot_observed_at":"2026-08-16T10:48:21.118245Z","title":"Soft actor-critic algorithms and applications,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.118245Z"},"links":{"cited_paper":"/paper/1812.05905","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:b3a6992b636aeb78a71de8939c34642c15c77030ed0048e90ca0c8ba9c0da969","observation_id":"8472dae4-9eb6-44db-90dc-0cb807f2df95","resolution":{"observed_at":"2026-08-16T10:48:21.118245Z","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-16T10:48:25.391712Z","title":"A natural policy gradient,","venue":null,"work_id":"acef351b-5b33-41c2-bcb2-275064cc47dc","year":2001},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.164230Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:f1237a1ae36544cf965a30229d5601ff482baa3493eeb018a4c25b9a89f0339e","observation_id":"4d439c8f-69fd-4bf9-9fc3-9ab6ad2149dc","resolution":{"observed_at":"2026-08-16T10:48:25.472996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.304354Z","title":"A performance-driven benchmark for feature selection in tabular deep learning,","venue":null,"work_id":"80356213-69cb-46c5-b805-73f409b33be8","year":2023},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.245149Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:9f463ab0cff5c4fd3040233fc9c13cd2e1f69da8f0d2835bfe0d73b70acad549","observation_id":"df5930df-d6f3-4009-b61d-52dafeca3331","resolution":{"observed_at":"2026-08-16T10:48:25.326169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.287910Z","title":"Gene expression omnibus: Ncbi gene expression and hybridization array data repository,","venue":null,"work_id":"e378e26c-5a8c-45cd-aa34-2f4fccc5eee2","year":2002},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.288139Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:276dcbd1700571ec1897b621cef827b1583ff9c601c8750ff98b849f42242cbe","observation_id":"f39cf2d1-4479-427e-b43c-f198cd51183f","resolution":{"observed_at":"2026-08-16T10:48:25.293464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.272764Z","title":"Uci dataset download,","venue":null,"work_id":"c6e38865-ba44-468b-871b-a820592a1350","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.292820Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:7f9f76a8d3eca54b81644d0b388aa53d0ef39524edae6b80bf5b6b2eba2c62d7","observation_id":"c48eb617-eedb-444e-8da1-f4d64cef021f","resolution":{"observed_at":"2026-08-16T10:48:25.277004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.258027Z","title":"Kaggle dataset download,","venue":null,"work_id":"768a4389-ea1e-42aa-9d82-1f74989308d5","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.297720Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:122db8c33b1b9fcee6a3b1e96f510d35ebbd29a5e83bca642586903bac26d4f8","observation_id":"b9dd6bf9-e4f7-4996-bba8-4cd0eef9f418","resolution":{"observed_at":"2026-08-16T10:48:25.262413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.182947Z","title":"Openml dataset download,","venue":null,"work_id":"ef8c7f85-e27a-4edb-bbf0-187dc749af66","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.302393Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:5720fd0fb9f540b9f60963613f51e69151c41ab8eb6e503a48ce51374e353576","observation_id":"39658cd6-7218-435c-b7c8-a958cac607b6","resolution":{"observed_at":"2026-08-16T10:48:25.188270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.166828Z","title":"Libsvm dataset download,","venue":null,"work_id":"fa87b21a-13db-44b4-a287-656c113123ba","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.307185Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:004512041b08edb901dab73c36d98aef4d38eff36948991f7e0871b2411db1b9","observation_id":"f19e9275-4e0d-4207-9ed6-a1edccfb0660","resolution":{"observed_at":"2026-08-16T10:48:25.172250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.127275Z","title":"Group-wise reinforcement feature generation for optimal and explainable representation space reconstruction,","venue":null,"work_id":"03097e90-887c-4320-80b4-cef74a90f799","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.311787Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:6a711441ecd1c6f2334302c94a7b363723d425ce73ade769a486961eebcf722c","observation_id":"b19ffa6c-b35b-418d-93e0-6c774cf6f845","resolution":{"observed_at":"2026-08-16T10:48:25.154342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:25.017742Z","title":"Traceable group-wise self-optimizing feature transformation learning: A dual optimization perspective,","venue":null,"work_id":"2f609998-ce86-4045-bc69-50b35313451a","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.315955Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:f1c3e97cd511f26049f66f0227e588a52fae5113d2bd8532d31b7761642e3462","observation_id":"b687d994-1193-4abb-916c-8f3c83c2d02e","resolution":{"observed_at":"2026-08-16T10:48:25.023187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.986800Z","title":"A comparative study on feature selection in text categorization,","venue":null,"work_id":"5968bd8e-d813-4df8-bc3e-0ae5d6bfd21c","year":1997},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.321820Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:493ab089cc0d45192a7b6551b119597827ac9d5cdbb22f88edb517c8d8f6b3a6","observation_id":"5280157d-6d06-4c2c-aefe-ea52f56f09c5","resolution":{"observed_at":"2026-08-16T10:48:24.994822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.749466Z","title":"Ensemble of feature selection algorithms: a multi-criteria decision-making approach,","venue":null,"work_id":"a52a9b03-c61d-4d99-9769-74b02f581783","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.326106Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:1730535ea0d867fdd2c8171d9402c6d53b3c617f69248f6cc6f113a2b8570fd8","observation_id":"32863a3e-8844-41a4-903b-bbec022db5c8","resolution":{"observed_at":"2026-08-16T10:48:24.912114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.735445Z","title":"Sequential attention for feature selection,","venue":null,"work_id":"dfd15d75-3814-4c17-9377-c9f6e157bbd1","year":2023},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.330747Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:37588695485bc90ce757cb9fca61a2b9252dd8a7666c98c500d00d58bfdc81eb","observation_id":"4974bddc-528e-4c15-ab92-0937468573ec","resolution":{"observed_at":"2026-08-16T10:48:24.739627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.651106Z","title":"Composite feature selection using deep ensembles,","venue":null,"work_id":"7a72d1fe-37c2-4883-9cf4-735c497b4a16","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.335456Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:6663aff07f9c7c01717975c5ccc8536ed6683c1a4574984623ad43168ca70599","observation_id":"016e4b87-f0f8-415b-97fd-35e1bc12a71a","resolution":{"observed_at":"2026-08-16T10:48:24.725869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.587698Z","title":"Reinforcement learning guided auto-select optimization algorithm for feature selection,","venue":null,"work_id":"c4873ef6-54a7-40e5-933c-f34a411a016e","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.340189Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:dc96c1dcd3e99e1f8b30c6b85dd10167fc07d0b0cdff933951fd07aad2a85873","observation_id":"64151ec8-e635-4c25-8988-7c4fe937ea99","resolution":{"observed_at":"2026-08-16T10:48:24.592656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.572899Z","title":"A finite-time analysis of two time-scale actor-critic methods,","venue":null,"work_id":"8b7beb11-0952-43d4-8777-ba08a30ad437","year":2020},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.344970Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:f69b6b143305f7fc387a10b98404289e6cad211022f5b1da55296a7980275536","observation_id":"6dc22922-1347-4691-b578-b77562fd8be6","resolution":{"observed_at":"2026-08-16T10:48:24.577684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.557966Z","title":"New embedding models and api updates,","venue":null,"work_id":"36a79c81-538c-4dc2-82d8-2cdcd88860fc","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.349701Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:12082b351f9882eabf19e1e71c4772f623fddb406edef52ad03c23641d54d94e","observation_id":"d55d0b36-b73d-4436-ac1e-470450118ecf","resolution":{"observed_at":"2026-08-16T10:48:24.562342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.383221Z","title":"Gpt-4 is openai’s most advanced system, producing safer and more useful responses,","venue":null,"work_id":"a2794569-f69f-487a-a655-2cfc8dee28ae","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.354430Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:4472975d01e1326a698a7d062e02e1b24d9681a4c9d35f7560a32d8529c0b050","observation_id":"62fca937-9e30-4fe7-b908-762a86c17a6a","resolution":{"observed_at":"2026-08-16T10:48:24.441292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.367628Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":"4eaebe55-d0eb-474a-b7ef-1d93ef29a137","year":2019},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.358669Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:9bc6510f439ae852f9937c74e3238b8ced2cff8a29a176b97ef046d8733c3726","observation_id":"71e939e7-d307-49a9-9c2c-1513177eaad3","resolution":{"observed_at":"2026-08-16T10:48:24.372643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03281","last_updated":"2023-08-07T03:52:59Z","snapshot_observed_at":"2026-08-14T21:56:20.223557Z","submitted_at":"2023-08-07T03:52:59Z","title":"Towards General Text Embeddings with Multi-stage Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03281","snapshot_observed_at":"2026-08-16T10:48:21.363467Z","title":"Towards general text embeddings with multi-stage contrastive learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.363467Z"},"links":{"cited_paper":"/paper/2308.03281","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:09a8854f1e5f37ff8ddbfbf6b0345f93802352c0eba78e7e6b0cb68dfa36458e","observation_id":"69dfe503-e305-4876-b6f5-1ddfa254f1e8","resolution":{"observed_at":"2026-08-16T10:48:21.363467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07891","last_updated":"2025-03-10T22:16:45Z","snapshot_observed_at":"2026-08-17T08:48:49.792564Z","submitted_at":"2025-03-10T22:16:45Z","title":"Gemini Embedding: Generalizable Embeddings from Gemini","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07891","snapshot_observed_at":"2026-08-16T10:48:21.368034Z","title":"Gemini embedding: Generalizable embeddings from gemini,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.368034Z"},"links":{"cited_paper":"/paper/2503.07891","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:bdd327a74e775ee0d40cff23899ab69f75de7093bc003fe5e0542949d23b0b96","observation_id":"20cea282-a587-441a-9fc9-f13801d5ab44","resolution":{"observed_at":"2026-08-16T10:48:21.368034Z","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-16T10:48:24.352527Z","title":"Some methods for classification and analysis of multivariate observations,","venue":null,"work_id":"a6e954f7-10d3-424c-ae55-c1492702970b","year":1967},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.373119Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:861c84033b45d0630d0e2d5be7a831c9b3c42a3a137abf553f15ca3d65c6e801","observation_id":"42d09902-38d3-4fb3-a5b0-6f5b9aadb95d","resolution":{"observed_at":"2026-08-16T10:48:24.357639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.337761Z","title":"A density-based algorithm for discovering clusters in large spatial databases with noise,","venue":null,"work_id":"9a4e6c08-e092-4551-aa55-2c6266f049b7","year":1996},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.378189Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:f197d357d8272c48fd950012db0b16a1efd77343f98a405f83372541c8b9386c","observation_id":"09dd9f9b-398a-4c6a-a3a1-0c4edb6b2f72","resolution":{"observed_at":"2026-08-16T10:48:24.342589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.109232Z","title":"A tutorial on spectral clustering,","venue":null,"work_id":"ede5e17d-1230-4171-a97d-02c4c203c84b","year":2007},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.382443Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:f2b1a7b3c05640f5ac16e1ed94a50f65d4bb1b84ad0455418eeea50a1e9923fe","observation_id":"683f6d55-f0a2-40e4-a9aa-fc466095a119","resolution":{"observed_at":"2026-08-16T10:48:24.222467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.093450Z","title":"Human-level control through deep reinforcement learning,","venue":null,"work_id":"90d52e59-14d6-4b90-a33f-2189d4cd9957","year":2015},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.387691Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:742e22a959f7828b8eb72aa23dd7fabc48292ded8a635ba54db1ae19e5b08864","observation_id":"14a6c131-e323-4dd2-b022-7a1b96b4be65","resolution":{"observed_at":"2026-08-16T10:48:24.099079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.077085Z","title":"Deep reinforcement learning with double q-learning,","venue":null,"work_id":"61d40b51-b200-44ee-a086-38d3d8a2fb4f","year":2016},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.392136Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:aed59cb3356ed8f420a5b4aeee8629951d778667e942f3d514759f2941b28e94","observation_id":"e5ea0c67-86e8-4f65-a78d-cd778fd71dc6","resolution":{"observed_at":"2026-08-16T10:48:24.083153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:24.017228Z","title":"Dueling network architectures for deep reinforcement learning,","venue":null,"work_id":"bb497187-05e5-4f4e-b7f8-06284f5a6615","year":2016},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.396909Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:2cb5b3876fbe310f128c7a0c584596127a031d820b5810bd893f0dada0f417bc","observation_id":"5646f418-6dac-4ece-88fd-9e01927ecdc1","resolution":{"observed_at":"2026-08-16T10:48:24.065411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.773650Z","title":"Avl trees with relaxed balance,","venue":null,"work_id":"e1375ebf-0024-4268-bbf7-4720146c02d2","year":1994},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.401652Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:17e80e6c246b2d9bd543d5b8e9a67b0042172b4ff05811fac926a5ad9ae9790e","observation_id":"6afcfe3d-b15e-45f4-987b-9be06ddb9410","resolution":{"observed_at":"2026-08-16T10:48:23.884208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.759416Z","title":"Feature clustering based support vector machine recursive feature elimination for gene selection,","venue":null,"work_id":"43c4f3ae-29da-4a12-997c-fb06b0cf6dcc","year":2018},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.406951Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:ca9d97900b343c4846dac32df1fecfa1d92cd0d252b0956a005971edee76be02","observation_id":"a7d77566-e0f7-48eb-a8ea-55389c861b38","resolution":{"observed_at":"2026-08-16T10:48:23.764178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.744146Z","title":"Kernel feature selection via conditional covariance minimization,","venue":null,"work_id":"9b3c1117-5742-4de8-9507-61b08eaf4230","year":2017},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.411329Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:43787fe7e3161e2c7ea4bb4cf43a108a5c9b459ad40650b678d6b45862ccd5c1","observation_id":"8e83a687-17ac-4256-bb39-a1fa5ac42d36","resolution":{"observed_at":"2026-08-16T10:48:23.748399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.728704Z","title":"Traceable automatic feature transformation via cascading actor-critic agents,","venue":null,"work_id":"c6ef87b3-4acf-4aa0-bd2e-3a62e54c77e2","year":2023},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.429581Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:85d5b16507e08ade4b21fff93688619da05868045b118cc5af2fe099e7f24dd3","observation_id":"20d0234f-5518-4b68-8c6c-a35952a37646","resolution":{"observed_at":"2026-08-16T10:48:23.733214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.661957Z","title":"Deeppink: reproducible feature selection in deep neural networks,","venue":null,"work_id":"d44daa8c-65ca-4b6b-8e85-8d06b2c048f3","year":2018},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.478441Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:c4f493631e1ed9acad7a579e5334093e2d3bf782fdca9a6b548b50438c4d9262","observation_id":"ed86160f-a622-4ccb-b694-1655104d9301","resolution":{"observed_at":"2026-08-16T10:48:23.717995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.432590Z","title":"Effective nonlinear feature selection method based on hsic lasso and with variational inference,","venue":null,"work_id":"ec305424-7e7a-40a2-bf89-19c4b79b90b8","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.528840Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:72d708e7ba61b48e6d740698088a0a9dea61d909d03bf58233c35cc61b4e18ae","observation_id":"29ab14c4-a066-44ea-9e93-69e14184b37d","resolution":{"observed_at":"2026-08-16T10:48:23.539096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.415766Z","title":"Few-shot learning for feature selection with hilbert-schmidt independence criterion,","venue":null,"work_id":"f4d4afe2-f621-4c7c-88bd-2ef23bf800fb","year":2022},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.612398Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:4cd0588dc444a50fcf33e0d7c405badcd3e5a10605f4de8cc4993d535c8530fc","observation_id":"9544a984-0b65-4234-b819-6a9caa0eb382","resolution":{"observed_at":"2026-08-16T10:48:23.421955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.254752Z","title":"Reinforcement learning: An introduction,","venue":null,"work_id":"d3f9c4e7-e213-4574-b96e-5b0f06953aad","year":2018},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.659416Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:a2cb5ae83e4c2301a2b3092cfe87b91961bce776a21d7fe97e8c493d3bf28ee2","observation_id":"c393b612-dde6-46b2-994d-e4f5cf396ff3","resolution":{"observed_at":"2026-08-16T10:48:23.353303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.145835Z","title":"A partially-supervised reinforcement learning framework for visual active search,","venue":null,"work_id":"fb602a53-f454-4aa9-88c7-70b53c6d3b2b","year":2023},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.663955Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:ec177b4029fb32a1241234434f51037bad2632767f3b158a9aad487d69477072","observation_id":"d0d2d85d-e57b-4c77-b59a-dc3eec57e06a","resolution":{"observed_at":"2026-08-16T10:48:23.163445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-16T10:48:21.669152Z","title":"Gpt-4 technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.669152Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:382ad810707f9eeb2a4ee105ad2d24c11cf92c8e880a9d65882a5dc2fa3ce556","observation_id":"3ff9c653-e696-441c-bdfd-7b47ac51cee8","resolution":{"observed_at":"2026-08-16T10:48:21.669152Z","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-16T10:48:23.128947Z","title":"Large language models are semi-parametric reinforcement learning agents,","venue":null,"work_id":"a264a56b-3f97-4e1d-9c39-ed873ab3de26","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.673757Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:8b6d956c15a48f9b498d057d701b164357f76d2b8fa50621321a498ae077e1e8","observation_id":"da45f30a-ca00-4a46-a732-baeedd95065f","resolution":{"observed_at":"2026-08-16T10:48:23.134271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:23.113411Z","title":"Fastft: Accelerating reinforced feature transformation via advanced exploration strategies,","venue":null,"work_id":"e7da5557-6b8f-43ec-af13-97d51ada1de1","year":2025},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.687248Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:41ed73551ec1047174b068e311b013c3213b52c237945bb95c4e683e9ef391be","observation_id":"16bfe348-3242-4728-8d59-bfab2f1eb087","resolution":{"observed_at":"2026-08-16T10:48:23.118480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.889420Z","title":"Hierarchical reinforcement learning: A comprehensive survey,","venue":null,"work_id":"3fea3d44-09e4-47f2-b520-0abd39fc0b56","year":2021},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.693856Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:0ec0fc4de2bb517c9fd3d16d8c7c37e7300cfe071bf284abefd141f145826fac","observation_id":"fbf1098a-8a9f-400f-ba1b-d83976858ea0","resolution":{"observed_at":"2026-08-16T10:48:22.997271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.777995Z","title":"Hierarchical reinforcement learning,","venue":null,"work_id":"a723a2fd-4ef5-475b-a455-812aeb895011","year":2011},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.698812Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:28796ba8d24bd9a81fca858f3dea8491915fa1ca8fd1a4ef305ac5660f6419fb","observation_id":"2e6090be-e4d3-4fba-bc2b-0d80033aff7c","resolution":{"observed_at":"2026-08-16T10:48:22.789086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.761316Z","title":"Probabilistic subgoal representations for hierarchical reinforcement learning,","venue":null,"work_id":"f0daae0e-7b81-476e-9015-fc67fa27034a","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.704874Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:9683815d10b5c02b9e879d11c0d9f058e1c34ea1990523fb9c93a27eabbcb375","observation_id":"3fd52a09-6a45-4018-ad0f-9bbff2cda622","resolution":{"observed_at":"2026-08-16T10:48:22.766888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.736172Z","title":"Learning for decentralized control of multiagent systems in large, partially-observable stochastic environments,","venue":null,"work_id":"6e44a1ca-2fdc-4034-8d98-69ce044eee12","year":2016},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.709894Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:89a618a603d1e87d46692b55e2c90fef7e1e3a478ea4ae1030c444bf18749370","observation_id":"9f194227-661d-4003-9e81-fd397d2da093","resolution":{"observed_at":"2026-08-16T10:48:22.747289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.718614Z","title":"Hierarchical multi-agent reinforcement learning,","venue":null,"work_id":"897ec515-41b8-4cdf-96ae-29cec85df0ed","year":2006},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.714564Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:89ad3def8c0c38f5895773fd3648330df965f2a3fb137024b8a11f51c1d60748","observation_id":"f058c132-158f-4ae1-b208-bd5d8663709d","resolution":{"observed_at":"2026-08-16T10:48:22.723724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.652574Z","title":"Multi-agent reinforcement learning with hierarchical coordination for emergency responder stationing,","venue":null,"work_id":"e42abff6-056a-4731-b11b-b6242e95365b","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.719947Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:7bc4beba16df22f2f11023560d6b882391a137ec6895368873e9daaaca0a70d4","observation_id":"bc485563-4b35-4655-8ff0-c67515c40666","resolution":{"observed_at":"2026-08-16T10:48:22.706805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T10:48:22.466941Z","title":"Rethinking decision transformer via hierarchical reinforcement learning,","venue":null,"work_id":"fa987c68-050c-494a-a5d4-e346fa39080c","year":2024},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.724665Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:5de475700bb9af8fc3836b58c4548d45aa68924a57c1fd6bb3e7ee4e719b7512","observation_id":"ef05eabc-8512-4757-a6b2-fedae6d79990","resolution":{"observed_at":"2026-08-16T10:48:22.545608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.12825","last_updated":"2020-03-19T23:11:08Z","snapshot_observed_at":"2026-08-14T17:58:52.195808Z","submitted_at":"2019-11-28T18:38:19Z","title":"Option-Critic in Cooperative Multi-agent Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.12825","snapshot_observed_at":"2026-08-16T10:48:21.729260Z","title":"Option-critic in cooperative multi-agent systems,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.729260Z"},"links":{"cited_paper":"/paper/1911.12825","citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:cd361c63d2bf53da3bcf10cac14b906c8a377fc7587b69a99d691d51beb9c850","observation_id":"ace7e457-b740-4229-ad17-70fa26697fdd","resolution":{"observed_at":"2026-08-16T10:48:21.729260Z","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-16T10:48:22.453034Z","title":"Hierarchical cooperative multi-agent reinforcement learning with skill discovery,","venue":null,"work_id":"43854dea-d4a8-44bb-a3e1-741b12777321","year":2020},"citing_paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-16T10:48:21.734842Z"},"links":{"citing_paper":"/paper/2504.17356"},"observation_digest":"sha256:5c8a81eafafdeaece243cc9cddaf07df4870c259107a7fb7fe547ea5afc4d8a8","observation_id":"33acd937-5f2e-47ac-862b-847495bfbfc3","resolution":{"observed_at":"2026-08-16T10:48:22.457587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.17356","last_updated":"2026-07-20T03:05:41Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T13:05:13.180965Z","submitted_at":"2025-04-24T08:16:36Z","title":"Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learning"},"reference_resolution":{"displayed":81,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":65},"total_outbound_references":81},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 81 of 81 outbound references and 1 inbound Pith citation observation for arXiv:2504.17356."}