{"as_of":"2026-08-21T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d56f705963ae3ba44901f175053de899f7c0631191040fa1810171eb4b436616","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T10:41:06.158296Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.23568/citation-record","integrity":"/paper/2507.23568/integrity","json":"/paper/2507.23568/citation-record.json","paper":"/paper/2507.23568"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.841452Z","title":null,"venue":null,"work_id":"4de4592e-10a8-4648-81bf-969416ba0de2","year":2009},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.733065Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:b7d188fd50925c1707ae90d148127328764375e170b6b4b5c7c494ea31c51054","observation_id":"92e11190-59c7-4046-9385-0bc36bb0abf7","resolution":{"observed_at":"2026-08-06T10:41:07.848838Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.805886Z","title":"2013 Applied predictive modeling vol 26 (Springer)","venue":null,"work_id":"48f45739-6518-4ca7-a863-d140b8ca8183","year":2013},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.740823Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:060d6f56fb267f834bcbfc9fab29a54a74901b504cd35d30d583ee749b6fd70c","observation_id":"2046d315-3d7a-445f-bbd8-cce04df91456","resolution":{"observed_at":"2026-08-06T10:41:07.820213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.774571Z","title":null,"venue":null,"work_id":"3bedcfda-a6d9-46f4-bf28-34f41b95c32b","year":2003},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.746785Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:7101f0c868ee6e3e1e236d60e58b76b2439ee9cc1b595ee2299807f86e8547e3","observation_id":"e3603afc-2cfb-471e-9be1-6b6a1500bfc1","resolution":{"observed_at":"2026-08-06T10:41:07.780300Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.749810Z","title":null,"venue":null,"work_id":"1c235fee-0a0a-4c33-bd00-f76ec6473318","year":2008},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.753471Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:413d31bb182f4e5c4c439aeec5d4e3101e250aae79b32ca2d9ef377fd62fc89c","observation_id":"dca3c3ed-3ebb-43fb-9201-e7939cc10bc6","resolution":{"observed_at":"2026-08-06T10:41:07.758215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.723186Z","title":null,"venue":null,"work_id":"5e569600-35be-4454-9733-370964445416","year":2014},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.759149Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:e2b720aa34ee686b50dd0a999e68f32a7bbbb4ae4af0f2c7060c7d173670052c","observation_id":"1344e585-e838-410b-9c6b-b81e2997ab4e","resolution":{"observed_at":"2026-08-06T10:41:07.733367Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.700392Z","title":null,"venue":null,"work_id":"5d1f525d-d4cc-44d8-a217-e819befab0c1","year":2002},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.765090Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:769168e9b4ba4f72da77a35fb4b93c91fd2b79c782b3febdb306f4c4a76a92de","observation_id":"593066e0-5f4e-439f-ab12-f38f108bf3dc","resolution":{"observed_at":"2026-08-06T10:41:07.707561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.662663Z","title":null,"venue":null,"work_id":"8671bd6f-ee98-41f4-a5fa-01e02b462b43","year":2007},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.773945Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:12dce689e00fb313f782d80a56c4982da4ff1f87eca64c6d7f1b38abd0c8c3a4","observation_id":"075ed7ce-20cc-4d3d-8f01-121dff322623","resolution":{"observed_at":"2026-08-06T10:41:07.682955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.621608Z","title":null,"venue":null,"work_id":"d096b762-07af-41ba-ac07-3d77ed55d1f4","year":2003},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.780563Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:d5186c915e4c44e22dfc82671382d3c776b10d1509f6bb2e9e017df6545e864b","observation_id":"31ce7d80-6a50-4d6c-b1bb-02cfa7085dda","resolution":{"observed_at":"2026-08-06T10:41:07.631627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.586118Z","title":null,"venue":null,"work_id":"93aefb41-4b56-42be-9a7a-1dfa16994bad","year":2008},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.790538Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:e943b923dc02e22c2dbb2d2c83f70b2e386a335a42b525a7d439b45fc06e01a7","observation_id":"26cb7085-2367-47f7-bc05-e4ce13a26305","resolution":{"observed_at":"2026-08-06T10:41:07.593406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.557918Z","title":null,"venue":null,"work_id":"bb718858-4b17-4c8c-88eb-e60b23c6731d","year":2005},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.799755Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:c9c02971956012fe0d2aa4659fa6dc3567c5b5e9f1d6efd01234e8b2f2c6b47f","observation_id":"7dea177b-352d-4be8-8b51-a43e4b17c765","resolution":{"observed_at":"2026-08-06T10:41:07.566933Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.524507Z","title":null,"venue":null,"work_id":"b8054470-2eef-4864-9bbd-d49b967341d2","year":2002},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.806313Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:b8efdb518a258c93dc7e5b20dc77fe23338aa69f4243a81c9200dfac028a4070","observation_id":"5bfa9167-d691-4740-8526-6acacc607db9","resolution":{"observed_at":"2026-08-06T10:41:07.534894Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.495290Z","title":null,"venue":null,"work_id":"f424194f-e7a7-40cd-8a61-eb5b24911958","year":2024},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.816548Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:9e716f080e9685e3c46ef4088a97108b0daad54e065238028b896d0c2c2a82b9","observation_id":"b7748fa8-c15c-4bf9-b818-513a0bd2766b","resolution":{"observed_at":"2026-08-06T10:41:07.502205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.471022Z","title":null,"venue":null,"work_id":"b67e551d-3093-4398-8193-622e606b3b8d","year":2016},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.823577Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:e88712893436a05909e1ae8aa7421a8f3ccdc744da9fb05114fd2e3910b04a12","observation_id":"0488a429-7920-46f1-8185-c012819ba627","resolution":{"observed_at":"2026-08-06T10:41:07.476220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.434688Z","title":null,"venue":null,"work_id":"c31d04b1-3cf4-49a9-8418-570e010bb98d","year":2016},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.829870Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:8ede456f8f6f502ed3c28f5cfe8f167555345d9d7a14cae490a94bdbba882b5e","observation_id":"9f4fd182-2704-4481-b212-a7d56d7c6323","resolution":{"observed_at":"2026-08-06T10:41:07.446313Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.409558Z","title":null,"venue":null,"work_id":"28c910b5-a9f3-4b16-a244-7669ea013a5d","year":2021},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.836276Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:7c41f17376788eb77bf98a85767352bdd50d8d2814bfe509ffc008b6649108c9","observation_id":"8e98f555-7387-4554-b53c-1b4f80da087e","resolution":{"observed_at":"2026-08-06T10:41:07.415324Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.373940Z","title":null,"venue":null,"work_id":"ea2c2a50-c250-46c1-87c2-1a0cf843d1e5","year":2006},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.866030Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:3451fabc8b6d69f291b8e7d0c6600cb1f6ce85b985732cb458cc51b449325a42","observation_id":"cd126f77-ee83-4cb5-ab8e-e2bc23d61b67","resolution":{"observed_at":"2026-08-06T10:41:07.389135Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.334547Z","title":null,"venue":null,"work_id":"c0f4058d-c349-44ea-a0c7-19c2d8c6ab81","year":2010},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.871790Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:451ce88fcf5921e60d7987591a6776fe859736b9c4786ddd1f81dec58bfb983f","observation_id":"c977f47f-ea56-4710-aeb3-c73cbe51755e","resolution":{"observed_at":"2026-08-06T10:41:07.341089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.288159Z","title":null,"venue":null,"work_id":"b6c1997a-b391-4a2a-85a3-0b29973d86e4","year":2007},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.878436Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:694c99e0ae75e22a8ed6c86d7f0de3d4df7e72ca473a4e9bfb35c358ab4a411b","observation_id":"f5271695-0fd0-463e-8277-0fd7a1d93e2c","resolution":{"observed_at":"2026-08-06T10:41:07.302471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.262308Z","title":null,"venue":null,"work_id":"7692d117-cff6-494d-bded-332fa299d912","year":2018},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.883999Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:c9321bbaec05c1fb9b0d4043edd4f69425afde8da1b0ebe64de8471dd571fcbd","observation_id":"3caf8942-7236-4f38-a34b-6771c6f459ae","resolution":{"observed_at":"2026-08-06T10:41:07.273140Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.229790Z","title":null,"venue":null,"work_id":"47fea107-0121-45fa-967e-3d68f3880d4c","year":2023},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.889883Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:651d38a55921ec4e910998fe8be784a0bb0b79c3c8368f32be44ddc6b8dc419d","observation_id":"cc23ed97-8217-4cde-8e0f-ad13dbeb5e7c","resolution":{"observed_at":"2026-08-06T10:41:07.236659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.184055Z","title":null,"venue":null,"work_id":"40a1c439-55b2-4137-b189-d79a022cdbe7","year":1975},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.894973Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:b93bee256752a41242af1bba13536b6af886003c240ed4fb287af3e8239d2cd9","observation_id":"500f370d-efcf-44c2-ac60-5ca2eb11beb0","resolution":{"observed_at":"2026-08-06T10:41:07.206887Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.142339Z","title":null,"venue":null,"work_id":"04f20395-9339-45cc-a357-ec231f158dce","year":1982},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.901037Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:8fc7708236141bf5b311dc1e63d208a79e868274723387adb5f88c83ae279838","observation_id":"2f4e5783-a865-454f-a379-63429fd5c6f0","resolution":{"observed_at":"2026-08-06T10:41:07.152254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.110292Z","title":null,"venue":null,"work_id":"49d1d1bd-858b-4533-b431-e5462750e61a","year":null},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.907984Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:536a358c7ba5537afd4e81b7f06d0b3c10e7fd3691674faa5a292ea19bb8d7db","observation_id":"4206e542-6207-4dfe-96db-708ebf9e4c96","resolution":{"observed_at":"2026-08-06T10:41:07.119715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.066079Z","title":null,"venue":null,"work_id":"1978ebcb-15b7-416b-be2c-59e537e82288","year":1983},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.912740Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:f044d4dba03369b9a3afac520a03dc8c1d12cd6f4b482f96891c759a452073f3","observation_id":"4277e5f8-0028-44c9-8dae-dfe68df9b0ed","resolution":{"observed_at":"2026-08-06T10:41:07.080307Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.043515Z","title":null,"venue":null,"work_id":"2239ccdb-904e-4a3a-8794-8181b97c3ea3","year":2015},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.917565Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:4f99943354bce8028e6ae95def2cac7c4789b4f415feb9e626a794c2413e42be","observation_id":"17b5e81f-a5ff-4d91-b66d-7775e5ce779d","resolution":{"observed_at":"2026-08-06T10:41:07.049209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07638","last_updated":"2025-08-25T10:17:04Z","snapshot_observed_at":"2026-08-17T21:38:31.731846Z","submitted_at":"2025-01-13T19:01:48Z","title":"Problem hardness of diluted Ising models: Population Annealing versus Simulated Annealing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07638","snapshot_observed_at":"2026-08-06T10:41:05.923554Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.923554Z"},"links":{"cited_paper":"/paper/2501.07638","citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:ad8df2a51feb4c9bdb909d08209e7a318a9685aaaf27fa49496d79656055018b","observation_id":"6e6d2f44-ecc7-49db-a5aa-651ef7cb45a7","resolution":{"observed_at":"2026-08-06T10:41:05.923554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00807","last_updated":"2022-10-03T10:39:05Z","snapshot_observed_at":"2026-08-16T16:27:22.310107Z","submitted_at":"2022-10-03T10:39:05Z","title":"Portfolio optimization with discrete simulated annealing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00807","snapshot_observed_at":"2026-08-06T10:41:05.929359Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.929359Z"},"links":{"cited_paper":"/paper/2210.00807","citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:ed4afd68912412ac792ec74d018f01884cf770f11b512c135439fd720aa1105c","observation_id":"d91d2296-79d9-4bab-b09d-12e8a124bd56","resolution":{"observed_at":"2026-08-06T10:41:05.929359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:07.012403Z","title":null,"venue":null,"work_id":"c5aedf9a-104a-4b93-a964-3e737d9fccce","year":null},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.938397Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:76b9afd888361f97799ae77d4ab636bc66fc863233f376adb26326d953735285","observation_id":"3705fe79-4d1f-49e0-b2c4-6c2b241ebf31","resolution":{"observed_at":"2026-08-06T10:41:07.028129Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.988376Z","title":null,"venue":null,"work_id":"f92800f7-62e8-4ced-9238-15ef6f01776b","year":2013},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.950501Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:0ac62045d05d2ad7c41ab09e149367f47c832cc300267c41721bf1d425b5c18b","observation_id":"09be4364-5cff-4bcf-b0f3-43c602f49c31","resolution":{"observed_at":"2026-08-06T10:41:06.995563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.963313Z","title":null,"venue":null,"work_id":"cd1ff13d-7af8-43e9-a3f2-b4318752d558","year":1936},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.956666Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:edc33e8ab27bc922643eba4fe5daaadfb6d6d0a6cdcdca5f8797b6f2e1291d03","observation_id":"30f96aed-7543-4a03-8d5f-1bfeaa34fff2","resolution":{"observed_at":"2026-08-06T10:41:06.968845Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.943927Z","title":null,"venue":null,"work_id":"6073e894-faf2-49cb-b9dc-9292668fce7a","year":2015},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.966074Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:e70cb9e8c0c367c63a518abd749064287db3a017d871ec1e089505433539e11b","observation_id":"8880684d-95d7-473f-a2c8-ba290c9492f2","resolution":{"observed_at":"2026-08-06T10:41:06.949447Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.913547Z","title":null,"venue":null,"work_id":"f59cb5d1-3fa9-4dcb-8234-7364de4ae8db","year":1999},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.971665Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:be3d7afff85e1f965ce2f54e89822a9655cb9477fe0a60533e60c7a31e96880f","observation_id":"930c219e-7112-427f-bee3-f538a4d4c099","resolution":{"observed_at":"2026-08-06T10:41:06.925070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.882009Z","title":null,"venue":null,"work_id":"762b838e-657c-4d2a-a804-e4681e39aec2","year":2000},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.981559Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:a86c73b0b6c48f4d1c5f122907a971e090dcf9ee4f0a9870f5c715e0f3cdd95d","observation_id":"c82f1225-b35b-41a1-b70a-ad4032668cc4","resolution":{"observed_at":"2026-08-06T10:41:06.891537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.857802Z","title":null,"venue":null,"work_id":"6f5929b1-b3f8-439b-ade3-bfa65d2a9c89","year":1998},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:05.997898Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:a694364d150aabffe78f227256dcede4ae8211d3e1217f2f57252961b62493b7","observation_id":"94efb2d3-3a54-460b-8aaa-e213d7bd2e39","resolution":{"observed_at":"2026-08-06T10:41:06.866198Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.822307Z","title":null,"venue":null,"work_id":"1882c525-855c-44fc-9cdf-f345f5a49b87","year":2012},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.004701Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:436daaf57de0786d9e2b86b3174f9524122833217df6416d8ffba59162cf1532","observation_id":"21f25c99-1f6d-470c-92e3-5560b324e93d","resolution":{"observed_at":"2026-08-06T10:41:06.827371Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.798113Z","title":null,"venue":null,"work_id":"a364def4-25b4-4505-b860-482b6531ffb6","year":1999},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.011542Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:da55e8565ad6019ce11db55a1ca1f6c940e15622328236d87c2329034e6f40a6","observation_id":"95dc49fd-bc42-4d0e-869e-272c7fb1d4a9","resolution":{"observed_at":"2026-08-06T10:41:06.804948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.768587Z","title":null,"venue":null,"work_id":"ff830002-5c05-40a6-bbe4-781429b8e17b","year":1986},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.021825Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:f4dfd2ac3cb5cf2bf722601b4c7337fa2b47f402f8c5f8487b7fdc1a5e913212","observation_id":"96467941-d257-493a-91e5-dcbc1e578247","resolution":{"observed_at":"2026-08-06T10:41:06.776195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.737597Z","title":"2013 An introduction to statistical learning vol 112 (Springer)","venue":null,"work_id":"4055db0c-87f8-49fe-bfb5-52619cf3e0ae","year":2013},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.026679Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:b11558cd80c2f599c8809049f7c52a9b5f793d42d5cd740a1df3f1d9b4d3cd2f","observation_id":"5e949b8f-cfcd-4776-8a17-54198967c1dd","resolution":{"observed_at":"2026-08-06T10:41:06.745886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.695947Z","title":null,"venue":null,"work_id":"cb7516b3-a1a3-422e-b77e-4fe1b10c18cb","year":2006},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.031099Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:29a8d55ab350b723d7cc9747015be0f59ddd50b904f6a0358a48fde2dad91793","observation_id":"5c84a121-acb0-4938-9d5a-8d602d7b85d1","resolution":{"observed_at":"2026-08-06T10:41:06.711033Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.670385Z","title":null,"venue":null,"work_id":"97d26384-0f4d-40c5-9ab8-cc27b10cbfc5","year":1996},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.036868Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:85e7baf44df37370bc8eecf3d275b35b1c1296504389e27f909f33e3e9b4f478","observation_id":"a6ea328d-1523-43b9-bdbd-c68c439ac71f","resolution":{"observed_at":"2026-08-06T10:41:06.676769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.644877Z","title":null,"venue":null,"work_id":"9d44f76f-38dc-4b9e-84e0-f185bdceb6cd","year":2011},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.043483Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:1c16462d37bebcb92bf3556414eef3100976ede26b4bc44b2c94c3b0a2b82716","observation_id":"34e9d635-4a2d-409d-ad2a-f89321dd9337","resolution":{"observed_at":"2026-08-06T10:41:06.653370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.613399Z","title":null,"venue":null,"work_id":"868db252-3049-4ba1-b1a9-cfb0fd934e45","year":2023},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.050800Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:b2d5967cba7daadba1b59aead88e342b9c44dd759408d376e73d07bc3ee0417f","observation_id":"1cd87581-9313-4d74-85f4-a0d63079c8a1","resolution":{"observed_at":"2026-08-06T10:41:06.623583Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.583951Z","title":null,"venue":null,"work_id":"1109cc55-75ec-4826-9ef1-a27f2e17cb06","year":2001},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.059587Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:fa9a53113dd5a532b973af87040cf921586be13f9214b222a5e1e3fd23af220e","observation_id":"a2dc272c-7150-43df-afe9-771df31731f1","resolution":{"observed_at":"2026-08-06T10:41:06.590990Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.564031Z","title":null,"venue":null,"work_id":"a42a534d-bc6f-462c-9806-703a78f75459","year":1993},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.071129Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:3becbd3982ca3b2e2940e84ed0ce27397d3df990c2e16d57dceb3e858a7ef8e8","observation_id":"bae49177-90e7-431e-8857-03a22ea52ab7","resolution":{"observed_at":"2026-08-06T10:41:06.569220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.545426Z","title":null,"venue":null,"work_id":"3d94352e-42b6-412e-ab57-e1f69667baa7","year":2008},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.081541Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:8925a65a5fc8282e8195c38777cc0472b042f1624cd158be6ad1b6d8a8f733ad","observation_id":"1679b842-9fdd-41de-a42b-d98a5f43091f","resolution":{"observed_at":"2026-08-06T10:41:06.551467Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.506014Z","title":null,"venue":null,"work_id":"cc852a4e-5e0a-4f19-acbe-b80cf73089d5","year":1999},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.087793Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:15ccd257d64d93949f6b4a02dcb179bb012e629876fd7f31fce325e5e5856fb1","observation_id":"b0666c35-fa64-4b5a-b285-3faea1c98da9","resolution":{"observed_at":"2026-08-06T10:41:06.512187Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.483631Z","title":null,"venue":null,"work_id":"1c771adf-3ed0-447e-ab2e-1bb1a13300f7","year":2021},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.098175Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:2a0f80f1b8c3017b08b11adcccced4632ef85a3c2e68d162242f6335370b12c0","observation_id":"eea7e11b-3e04-4d48-8af8-2e6e948d2211","resolution":{"observed_at":"2026-08-06T10:41:06.488795Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.455770Z","title":null,"venue":null,"work_id":"1dad672e-319f-4c01-9821-757d39724a61","year":2020},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.106819Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:abdb7501ead174af51554f91169fbcce533f16995e58f80e20de2f34f2176e0e","observation_id":"9aeebc2a-02f6-4480-90b1-e0aeb0297635","resolution":{"observed_at":"2026-08-06T10:41:06.462977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.433850Z","title":null,"venue":null,"work_id":"7311a9df-e44d-4276-bb85-fd4923b25320","year":2004},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.117785Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:d017863c22b5bc6bb303875ffc973bdd44a3fd986b53dad796bebe8238185d6b","observation_id":"86221a22-0914-4529-8e44-0a3492827cf4","resolution":{"observed_at":"2026-08-06T10:41:06.440094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.399447Z","title":null,"venue":null,"work_id":"9084ee9d-8126-4848-b62e-2f18c2d3beff","year":2009},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.131053Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:fcd7772ef42979b9222a79ab433f3d31682a44aa7d0152ecd6a0d910b6baae6b","observation_id":"d597561e-1f0d-4ff2-98cc-8b5e9fd975c3","resolution":{"observed_at":"2026-08-06T10:41:06.408609Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.372461Z","title":null,"venue":null,"work_id":"3f09ec41-a040-46b8-8c73-da194f10b542","year":2022},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.140793Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:f727e892c16ea8a91f2d33b17170f29eff0b867adb0746af101d27764afe87da","observation_id":"4ab49804-d4e9-456f-9b53-2e39fdec06d6","resolution":{"observed_at":"2026-08-06T10:41:06.381100Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.348350Z","title":null,"venue":null,"work_id":"064280b8-3461-491a-b2ec-0a7936d51f08","year":2013},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.148438Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:7efba5fac5345849dbb9379f37d9122836d8873d25d577985bf23e33a32b6a3e","observation_id":"e7d0013d-fe97-4606-8641-7e6e7cb46568","resolution":{"observed_at":"2026-08-06T10:41:06.353957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T10:41:06.307177Z","title":null,"venue":null,"work_id":"d19c48ee-6511-4356-8b93-4841e78be664","year":2017},"citing_paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:06.158296Z"},"links":{"citing_paper":"/paper/2507.23568"},"observation_digest":"sha256:86eb2ad46e8b5a39aecac5b84d6ed7c25aecac756e48bc435d3974a798161b91","observation_id":"bfc7a507-8493-4888-8b5d-3897384dffca","resolution":{"observed_at":"2026-08-06T10:41:06.321223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.23568","last_updated":"2025-07-31T13:57:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T12:13:41.459493Z","submitted_at":"2025-07-31T13:57:38Z","title":"Optimised Feature Subset Selection via Simulated Annealing"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":53},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2507.23568."}