{"as_of":"2026-08-09T10:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:443be89ea4128e252c54f0a3fdc1d0da7d72df0bcf3b4d46aea40afbc81dea8e","coverage":[{"denominator":78,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":78,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:28:26.700206Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T16:16:07.719863Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T09:05:59.319130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"cited_work":{"arxiv_id":"2502.06209","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06209","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enhancing cost efficiency in active learning with candidate set query","venue":null,"work_id":"a6851823-a88a-4eef-a424-b78c7e401108","year":2025},"citing_paper":{"arxiv_id":"2605.01668","last_updated":"2026-05-03T01:45:58Z","snapshot_observed_at":"2026-07-31T02:36:02.190011Z","submitted_at":"2026-05-03T01:45:58Z","title":"IMPACT-Scribe: Interactive Temporal Action Segmentation with Boundary Scribbles and Query Planning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T16:16:07.719863Z"},"links":{"cited_paper":"/paper/2502.06209","citing_paper":"/paper/2605.01668"},"observation_digest":"sha256:54ff5ae5fc8e05c6a2105c4a871feb48d3b342f5c6e1f1000c988db4a0094849","observation_id":"9b7041b1-3dfb-415d-8a43-a50aa8185a3b","resolution":{"observed_at":"2026-05-11T09:05:59.321292Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06209/citation-record","integrity":"/paper/2502.06209/integrity","json":"/paper/2502.06209/citation-record.json","paper":"/paper/2502.06209"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:28:25.743453Z","title":"Conformal prediction: A gentle introduction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.743453Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:b04b94dd4065dfd2cac22d8002d2ec84f192c7a64402601335ff680f11f2a6a6","observation_id":"6529d3ff-be57-4854-9db2-4ea467355a05","resolution":{"observed_at":"2026-08-08T16:28:25.743453Z","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-08T16:28:28.695047Z","title":"Uncertainty sets for image classifiers using conformal prediction","venue":null,"work_id":"2f1b2b7a-098e-40c6-9c80-eac6d8ba8c6f","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.757306Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:e6b3788ff19c1ae570ca8608eedbece374489a616dc6219d8dee54b88150237e","observation_id":"e542cb89-518b-41d6-9f72-710906ee76a9","resolution":{"observed_at":"2026-08-08T16:28:28.698865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.686971Z","title":"Estimating annotation cost for active learning in a multi-annotator environment","venue":null,"work_id":"6f3e7b07-0e35-42f9-8a2e-aef34a2778a3","year":2009},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.764918Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:421e2424a212583769401923f4bc3c330e63486cd9a52f87f008a0311538f379","observation_id":"0f278c5e-8774-4afc-9dbc-89b7e5794629","resolution":{"observed_at":"2026-08-08T16:28:28.689834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.678634Z","title":"Deep active learning for dialogue generation","venue":null,"work_id":"aa0c6b9b-35e6-4186-a7a2-84679efb3894","year":2017},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.777579Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:b7909cef876751b96da4a8068a91f236d9f90e10266f64c2553966a0535ff57d","observation_id":"e3593199-84f7-4ad9-b6ee-080d3c61edb9","resolution":{"observed_at":"2026-08-08T16:28:28.681337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.667575Z","title":"Deep batch active learning by diverse, uncertain gradient lower bounds","venue":null,"work_id":"d4cb9b43-0abd-4e34-a040-25a9c447aa9d","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.789284Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:3043d67724b32e2310d4a11dd57ee1fcdbe2a07803808596b402a7042ee4ba51","observation_id":"d95252b4-61c8-424f-a37a-25bba7dcedcc","resolution":{"observed_at":"2026-08-08T16:28:28.671299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.10545","last_updated":"2020-08-24T16:33:37Z","snapshot_observed_at":"2026-07-06T09:49:44.919864Z","submitted_at":"2020-08-24T16:33:37Z","title":"Products-10K: A Large-scale Product Recognition Dataset","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.10545","snapshot_observed_at":"2026-08-08T16:28:25.794042Z","title":"Products-10k: A large-scale product recognition dataset","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.794042Z"},"links":{"cited_paper":"/paper/2008.10545","citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:df815bf53dcac95e4f4a6cf97f7f5257316943ee78a14ef58eaa2e1bbce75a58","observation_id":"397b87bc-b8c0-4119-8483-e941bd38663e","resolution":{"observed_at":"2026-08-08T16:28:25.794042Z","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-08T16:28:28.488677Z","title":"Active learning with n-ary queries for image recognition","venue":null,"work_id":"9c1002a0-cd05-4cc5-bba9-5a9548d6e1e6","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.798454Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c937b521304b7f132455b64aa867911ef6e9bdba74424875cb72f0798d518bb7","observation_id":"91233ef6-e0e2-4e22-98e1-2408c2e59251","resolution":{"observed_at":"2026-08-08T16:28:28.599646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.379878Z","title":null,"venue":null,"work_id":"b4b0b295-f984-46d4-a696-d2c0ac153ed8","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.801495Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:bdad12e1a1db88a4d525a750aaf30d69868476d05ce065ae6f4afe3d2caeec8e","observation_id":"578dbf97-be6c-4054-981d-20e628895cdc","resolution":{"observed_at":"2026-08-08T16:28:28.410225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08819","last_updated":"2017-08-23T16:06:20Z","snapshot_observed_at":"2026-07-06T05:52:59.445968Z","submitted_at":"2017-07-27T11:22:22Z","title":"A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08819","snapshot_observed_at":"2026-08-08T16:28:25.805163Z","title":"A downsampled variant of imagenet as an alternative to the cifar datasets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.805163Z"},"links":{"cited_paper":"/paper/1707.08819","citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:8035970014710cecbee91004f50ab37aab57462031ee1ede6f0ee3b1c260f120","observation_id":"70f06da1-de30-40f9-9fb6-2b6056be4ceb","resolution":{"observed_at":"2026-08-08T16:28:25.805163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:28:25.809264Z","title":"Support-vector networks","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.809264Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:549b7e53465fbbaa0c285853c6a98455083c7e079caedc57e858a0785d505a74","observation_id":"723f4b24-69f6-43e6-bfb2-7aeff52ed5e1","resolution":{"observed_at":"2026-08-08T16:28:25.809264Z","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-08T16:28:28.364600Z","title":"Learning from partial labels","venue":null,"work_id":"18bd62c8-974b-4dd0-8ce1-bf84a46a9bd3","year":2011},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.812672Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:cc9a496ebc46fc01ce8b88bbd4c2979ace564633aa0dc04b9b81fa6f0c1c0870","observation_id":"9d5fbcef-1b9f-49c0-94ff-97a734444e81","resolution":{"observed_at":"2026-08-08T16:28:28.368255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.354902Z","title":"Class-balanced loss based on effective number of samples","venue":null,"work_id":"853d2eb2-37f6-45e9-afb2-500cd801b746","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.816745Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c63d2ae14d3ee42a926822508e72568c27fd0066c6bda866fea38212f424d064","observation_id":"4548ebb1-6ab8-4b07-b215-3d41231cc827","resolution":{"observed_at":"2026-08-08T16:28:28.358905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.344754Z","title":"Two faces of active learning","venue":null,"work_id":"eea68e3f-875b-4127-b560-32b4bc46ad67","year":2011},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.820110Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:9938067922d60206444895d3be4162056604704786435d9caf651d44c26ea55b","observation_id":"8a1cfe8c-5dda-4887-b80f-e42c577bea7f","resolution":{"observed_at":"2026-08-08T16:28:28.348346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.333941Z","title":"ImageNet: a large-scale hierarchical image database","venue":null,"work_id":"47884fc2-c276-4f7e-8ff0-96c3a738751d","year":2009},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.822639Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:55ea2b2d1d1cdc47aeb746e5ff0487f5b6737f440d0ce825ee2bb959bcda4cd1","observation_id":"ed1d7f6c-def8-4e5a-80f2-bf63bd3c8b9d","resolution":{"observed_at":"2026-08-08T16:28:28.338528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:25.825887Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.825887Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:98cfbab9dd58949a8c7eae6a63865b0630779ff791d2ae968ffc8a7b14657f8c","observation_id":"d993fe9c-d139-4cda-8f5c-df25e4cef605","resolution":{"observed_at":"2026-08-08T16:28:25.825887Z","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-08T16:28:28.317999Z","title":"Contrastive coding for active learning under class distribution mismatch","venue":null,"work_id":"66525a3e-07ed-4c02-b853-c8082de6c580","year":2021},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.828652Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:742f7783d0759f49d64a8a78a25a7b0c63bd2bb85239ce358b56e62af30ee82d","observation_id":"1f2c438a-f06d-41ca-91d1-cb0a586d2890","resolution":{"observed_at":"2026-08-08T16:28:28.322054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.308309Z","title":"Data determines distributional robustness in contrastive language image pre-training (clip)","venue":null,"work_id":"a9ee7173-1d30-481f-9c64-e7e59d303c20","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.831200Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:caf5d4a1a547819ec710ab8601e8b4651c722356e6ac4c6d4153d60f9d826089","observation_id":"f637239d-bb92-466e-a4ce-ebcfde78313e","resolution":{"observed_at":"2026-08-08T16:28:28.311838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:25.834240Z","title":"Classification in the presence of label noise: a survey","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.834240Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:6e77ddaf425e7fd682da10c904b64d9fa4381a75034ee9aec73edf5b88f5d843","observation_id":"742439e9-c4fa-4e58-8667-ba1f2bc19605","resolution":{"observed_at":"2026-08-08T16:28:25.834240Z","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-08T16:28:28.293778Z","title":"a ger, Bertrand Charpentier, Antonio Oroz, and Stephan G \\","venue":null,"work_id":"b2f58fe5-babf-407a-8a29-3424abedbb0b","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.837131Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c6e4d4e93de9e1331638df62add1e4d2ac0b3736bc821407ca648bc22155e9df","observation_id":"4881aa4b-a4f2-49d5-94f4-bfc428341d2d","resolution":{"observed_at":"2026-08-08T16:28:28.297386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.283563Z","title":"How to select which active learning strategy is best suited for your specific problem and budget","venue":null,"work_id":"06d5eb13-bb47-401e-ad35-a6c4f878094a","year":2023},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.840220Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:20e5f21be8f7513f1148670ba83c629ae9670c6c3cc0e1e4dbebbb7ef8962a6d","observation_id":"94c388c9-953d-4e6f-bae7-3d7fc937db22","resolution":{"observed_at":"2026-08-08T16:28:28.287784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.274510Z","title":"Active learning on a budget: Opposite strategies suit high and low budgets","venue":null,"work_id":"00a47794-36ab-470e-930c-0a83a22ac109","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.843208Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:9f0aaa657956e54eec07a8cfb504483d923f57399d0e1e6561a3db1d168a489d","observation_id":"e77d1be2-8641-4230-9494-e0b8a8242011","resolution":{"observed_at":"2026-08-08T16:28:28.277800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.255665Z","title":"Theory of disagreement-based active learning","venue":null,"work_id":"820f03db-2bd6-4f3b-8849-00ab6b8544b7","year":2014},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.846721Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:a9ab928a52afd53a8aa2e86070f28e16fb86e6f5e244221bbfea9b7bd8ce6a64","observation_id":"6eae3b68-bb14-4e31-88cc-87ac72171c4a","resolution":{"observed_at":"2026-08-08T16:28:28.268928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.137398Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"954fbfb8-321a-44c4-b9f4-19a1655e9051","year":2016},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.849666Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:2880a5a76d898a9fe87a3b2eabb2d942ca6615f555fadde6a1770ebb2b12f2e5","observation_id":"fbafc429-723b-4918-8d5e-292ef1149f31","resolution":{"observed_at":"2026-08-08T16:28:28.204546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:28.065277Z","title":"Towards better uncertainty sampling: Active learning with multiple views for deep convolutional neural network","venue":null,"work_id":"eeda3c3d-4fd7-44fd-9c4c-ff914092334e","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.852538Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:2a5470230880aea9a7c3720e9880a8378207b8b0a3203da2fbc344cda6c3b502","observation_id":"4ad03d90-ddc1-4146-a2fe-5c54a2fc70b6","resolution":{"observed_at":"2026-08-08T16:28:28.093859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.983380Z","title":"A survey on cost types, interaction schemes, and annotator performance models in selection algorithms for active learning in classification","venue":null,"work_id":"568f7de1-dbb3-48ec-86ed-a86e0d9298aa","year":2021},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.855192Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:77b6e6b8d5af4a726ef153230c0f862074bebbda65886cb64b55d58acd3aa909","observation_id":"74397a98-4f1d-426f-83a4-66df2288022d","resolution":{"observed_at":"2026-08-08T16:28:28.031213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.00409","last_updated":"2017-12-01T17:13:14Z","snapshot_observed_at":"2026-07-06T06:12:18.811024Z","submitted_at":"2017-12-01T17:13:14Z","title":"Deep Learning Scaling is Predictable, Empirically","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.00409","snapshot_observed_at":"2026-08-08T16:28:25.902723Z","title":"Deep learning scaling is predictable, empirically","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.902723Z"},"links":{"cited_paper":"/paper/1712.00409","citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:caaec054303f450b76e0d38aac27dcdbe4dd5c4dfb58c06d07793a63123556a5","observation_id":"efc134c8-ad90-4cf4-8ab7-54c8abf1928a","resolution":{"observed_at":"2026-08-08T16:28:25.902723Z","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-08T16:28:27.974270Z","title":"One-bit supervision for image classification","venue":null,"work_id":"fc3efd19-fe0b-4c6d-8d6a-3f0c44e46f90","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.944796Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:a2d1901efe01b9f2dd176e0defaf8a5e2dabd053bdb13bd92a8ca6dc4ec92b48","observation_id":"2ee8cc24-a034-4dc4-81d7-abc9007d19c8","resolution":{"observed_at":"2026-08-08T16:28:27.977471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.965754Z","title":"Squeeze-and-excitation networks","venue":null,"work_id":"1ce6a35c-2156-47a0-ab62-0f7830cda377","year":2018},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:25.980096Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:dfa0ce498fd064541b878169ac875fc74f8dbb52777941107436f3b738e9e97a","observation_id":"f74cb6bf-de21-4247-b4de-9519f25bf41c","resolution":{"observed_at":"2026-08-08T16:28:27.969058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.956595Z","title":"Multi-label active learning: query type matters","venue":null,"work_id":"0f54846e-cee6-4b85-a295-4760b2ee797e","year":2015},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.059813Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:6bc5029bea0ad9c202a60d38c45d6abe441bfed34895dc47f9e8221c430b1b62","observation_id":"a4903c89-44a4-486c-951a-df2708b56959","resolution":{"observed_at":"2026-08-08T16:28:27.960063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.946329Z","title":"Combating label distribution shift for active domain adaptation","venue":null,"work_id":"4c2448dd-a68d-4018-8124-244628573be2","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.101747Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:85433524ea6ede27cd240b053f7f875699aadb7c47a328c30d04abee45644931","observation_id":"641c93dc-35d7-475f-9963-c4cd07e03918","resolution":{"observed_at":"2026-08-08T16:28:27.950287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.935871Z","title":"Active learning for semantic segmentation with multi-class label query","venue":null,"work_id":"2b56662f-de02-4a75-92b5-0fff74ba2641","year":2023},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.147178Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:2c2b0a4213ecec8379eb0c670f71d46fc07585665233b8afcd9986e5f260f160","observation_id":"a38b4f2f-51d9-41b6-b4f5-a8dde7daa2f8","resolution":{"observed_at":"2026-08-08T16:28:27.939301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.925260Z","title":"Breaking the interactive bottleneck in multi-class classification with active selection and binary feedback","venue":null,"work_id":"43982bcc-aec4-42fb-900c-c728a9ee9f20","year":2010},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.205748Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:70ce4f0129c2acc5be0ad9f1084e699778b31fbc9ac849106c37151b54b1453c","observation_id":"39519f4e-224b-4858-a731-5ab25fe0fc9c","resolution":{"observed_at":"2026-08-08T16:28:27.929053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.915585Z","title":"Active learning with complementary sampling for instructing class-biased multi-label text emotion classification","venue":null,"work_id":"4ee3f562-7f63-4a9b-8203-4fecdf1d0404","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.275964Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:22e0ca8aa880d50479d5da5da65df65f46b18d93a9bb4e3396bbe84fa2b09bdd","observation_id":"55f65268-81e9-471b-9f46-03d637dd0653","resolution":{"observed_at":"2026-08-08T16:28:27.919000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.904958Z","title":"Active label correction for semantic segmentation with foundation models","venue":null,"work_id":"9a707af5-ca85-4dd2-936a-bee5ad5778f9","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.279813Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:9bb1a96a75a019158c8cd806629c9c9b912e0e99dad8bd68770e2ddd37a7952b","observation_id":"475c69db-0b7c-4ece-a7a0-d07c77b6f3a4","resolution":{"observed_at":"2026-08-08T16:28:27.908254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.894080Z","title":"Saal: sharpness-aware active learning","venue":null,"work_id":"a3dc0098-7d1b-4421-876b-1fac6de6ef6d","year":2023},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.282802Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:79270e988ce8988a7312a1040d495bc4e82a2afa7485d07eb91b8223ba07cff8","observation_id":"4fbfe951-e2ec-4ff7-bd71-3abd5e043c21","resolution":{"observed_at":"2026-08-08T16:28:27.898200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.883400Z","title":"Nlnl: Negative learning for noisy labels","venue":null,"work_id":"b076bbde-170b-4ad4-a0ec-4296be0c4661","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.286663Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:85ef8a95d5e62da8321f1919846d6883279854591ace9a1acbcd0a079ebc4516","observation_id":"d74e9c76-b0a3-4b9d-a35f-ec64e510d389","resolution":{"observed_at":"2026-08-08T16:28:27.887117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.768143Z","title":"Segment anything","venue":null,"work_id":"4b1edef7-c72d-4b7f-9189-124eea899984","year":2023},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.290084Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:29709cfffde2c2748575fa41468e407d162a3ac9c5a664cac3ed1567c7226e10","observation_id":"03d45779-2e84-49d9-befb-59b0aba9a2ce","resolution":{"observed_at":"2026-08-08T16:28:27.876314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.707234Z","title":"Batchbald: Efficient and diverse batch acquisition for deep bayesian active learning","venue":null,"work_id":"d7da780d-c66b-49bc-a710-63fac6e63274","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.293437Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:ef8adf22083e027ffe01d3413e434fce7dcded98795752160c5901c96d4d5bd7","observation_id":"bf348e7e-b6fc-4760-abac-c7b8409b6165","resolution":{"observed_at":"2026-08-08T16:28:27.730764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.688396Z","title":"Similar: Submodular information measures based active learning in realistic scenarios","venue":null,"work_id":"2d6bbdb5-6b1f-4413-aaa2-761dd3214ff3","year":2021},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.297136Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:0fd47e97ad8eee1a8e75200a372a709197d5f8f8f48b9127afef98de673e8bb4","observation_id":"1c6326a0-57a3-444a-b167-a9705efb3b22","resolution":{"observed_at":"2026-08-08T16:28:27.692167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.678012Z","title":"Active learning for cost-sensitive classification","venue":null,"work_id":"77e8ccc4-06a7-4c64-90a7-1f4e51c2ad85","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.299877Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:a976eb2f83c04a4ed22e66f8a9ad77f772876698a2f1cdc921bbfa414cb0536e","observation_id":"b4f21eac-42da-468e-8c77-176fd8fb9f46","resolution":{"observed_at":"2026-08-08T16:28:27.681448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.303265Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.303265Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:98833e7a49a16fa25fb132fbaa4f41d65729a90094b3a17dd10d947c95114286","observation_id":"ccf53426-f261-4bd4-8f40-07479f720d37","resolution":{"observed_at":"2026-08-08T16:28:26.303265Z","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-08T16:28:27.661690Z","title":null,"venue":null,"work_id":"d4635175-aa71-4d4e-90b6-9d7433301562","year":1997},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.308639Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:7d1b162e438fabb4eb43610022e62908e7309b244a2c1ceff78e4d58c52732b5","observation_id":"147481fc-2bb5-4cef-adf4-3145b50c6dba","resolution":{"observed_at":"2026-08-08T16:28:27.665876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.652020Z","title":"Generative adversarial active learning for unsupervised outlier detection","venue":null,"work_id":"6e0ebfd6-67d7-4a88-a4e2-de6b1daeebf1","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.312146Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:50bc8e2ca93c47a7a07366d76d9a64e469c80dd37a98fc4e6a200694339dec06","observation_id":"4672533a-8ef4-4261-9c63-9175a8d1427f","resolution":{"observed_at":"2026-08-08T16:28:27.655920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-08T16:28:26.315324Z","title":"Roberta: A robustly optimized bert pretraining approach","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.315324Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:a2cf0310ebd7d8071df85f1ef1ab2eb8f38770074dc634e8c8d4c9f4f6cd1c44","observation_id":"d9e24139-81be-4c9a-b263-7a6c44dd46f0","resolution":{"observed_at":"2026-08-08T16:28:26.315324Z","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-08T16:28:27.642557Z","title":"Decoupled weight decay regularization","venue":null,"work_id":"a32d8d82-d032-493c-b035-7370c795cd2b","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.319395Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:62d68ce31a0162f0d9228cd3fee2a7c1b96f878362bd9bd1e2fa6ded84d5f3cb","observation_id":"58992014-fd87-46ad-b8d1-6977c1049d00","resolution":{"observed_at":"2026-08-08T16:28:27.645883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.322692Z","title":"An introduction to information retrieval","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.322692Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:f469143d97c62c538087b991eaee80ad22830bcf003b22d11ec82caecc2cfdbc","observation_id":"5ff159ae-a87e-491b-9942-a461f2a56567","resolution":{"observed_at":"2026-08-08T16:28:26.322692Z","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-08T16:28:27.626324Z","title":"Conformal prediction based active learning by linear regression optimization","venue":null,"work_id":"eb51c60f-fa43-4eb7-9fd6-390b699aae3c","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.326362Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:77eb7c6f3fa4587b97f383aa32075a0bd6976bbd0e3f4e750acff0688a239791","observation_id":"6a37ebbc-b109-40d3-9689-e7758424048e","resolution":{"observed_at":"2026-08-08T16:28:27.629891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.617119Z","title":"Active learning for open-set annotation","venue":null,"work_id":"93a37ab5-a836-446c-9d1f-e416645bca4a","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.329816Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:d218e9d4dd8d066b2c9e34a1dccf72f363895f46ce1e0b51b6258c2d0da56c47","observation_id":"14bfdfde-2c43-4ef3-93ca-97b72586537a","resolution":{"observed_at":"2026-08-08T16:28:27.620519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T07:30:12.213965Z","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-08T16:28:26.333161Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.333161Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:56ba762122dd692f47e23265610091a19f48bbf73c8269a7a2bf62878961e5ae","observation_id":"42b0f280-bb92-4851-a884-25451374b810","resolution":{"observed_at":"2026-08-08T16:28:26.333161Z","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-08T16:28:27.607768Z","title":"Activelink: deep active learning for link prediction in knowledge graphs","venue":null,"work_id":"f3a17931-18f2-4b56-8f1b-00fbd8a9c580","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.336449Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:10db3afc724d75e017731ddc38b0e97ee78107990435986dfecdadc929714356","observation_id":"95b8d170-9480-4753-b974-5ee015e75e3c","resolution":{"observed_at":"2026-08-08T16:28:27.611672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.597877Z","title":"Meta-query-net: Resolving purity-informativeness dilemma in open-set active learning","venue":null,"work_id":"eaa82807-d472-4ad3-bff5-10e811fe9de1","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.339713Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:872dbca9f6cdbbaae3583dd70d5896df49de133a5ba65b8ce161c7a152652ff8","observation_id":"52a74e1f-5472-4dc5-89de-0da66bb83e05","resolution":{"observed_at":"2026-08-08T16:28:27.601603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.588149Z","title":"Active learning from relative queries","venue":null,"work_id":"1db82880-4b56-4715-82f9-6f2660e20d1f","year":2013},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.343148Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c88e8d91bd512c2ec01229ed2276cf0a433216122a6b04423b317998ba353205","observation_id":"4c6408a3-6ebc-4ffc-aa19-3f058b0f14ab","resolution":{"observed_at":"2026-08-08T16:28:27.591091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.577550Z","title":"Abdomenatlas-8k: Annotating 8,000 ct volumes for multi-organ segmentation in three weeks","venue":null,"work_id":"eeb80603-dffd-42a1-8305-be0c9c57da43","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.346447Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:82c3fd6a225d1a3593e8a2b5eef5a8146258715fcb3b80a904cdd2ca682cc68f","observation_id":"d9c39f74-ac80-42e4-8313-d839f8c5f237","resolution":{"observed_at":"2026-08-08T16:28:27.581601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.536360Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":"52dcddde-c94b-45bd-a2e0-d3db15826e05","year":2021},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.349895Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:14e011390b94287199dba68fe07b76e216b67f7733164aafeda0aabc56aeb438","observation_id":"58c35231-ffa2-448a-9871-aa5939a674af","resolution":{"observed_at":"2026-08-08T16:28:27.570272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.433678Z","title":"Classification with valid and adaptive coverage","venue":null,"work_id":"0ff7bf44-991a-4ed0-9176-d3de607a2e0d","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.352842Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:6691402d498eb1a726cbf47ff058c6e2682647a4211190c5aa1a046793b96011","observation_id":"5e571591-55ab-4f53-8649-4407c7f68443","resolution":{"observed_at":"2026-08-08T16:28:27.460866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.355086Z","title":"Active learning for convolutional neural networks: A core-set approach","venue":null,"work_id":"b57cbae6-7def-4894-872d-78fdf84d4e4f","year":2018},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.356184Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:420946e3e1bc8821dd6ee05b154f4bcff84089a79b6213e78ad5baa7be7f422f","observation_id":"ea7660c3-2fa7-4b86-b86b-7c49ff96881e","resolution":{"observed_at":"2026-08-08T16:28:27.380365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.359370Z","title":"Active learning literature survey","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.359370Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:4429d0e857b72e2bc57df69d50860d08bf664aca1c6db6f6348f6cfab4303358","observation_id":"50306659-ebfe-4e5c-b321-69a6a5b8f3dd","resolution":{"observed_at":"2026-08-08T16:28:26.359370Z","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-08T16:28:27.278591Z","title":"Active learning with real annotation costs","venue":null,"work_id":"ad53a11f-989e-4cab-9e6a-3d644183169e","year":2008},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.362750Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:4f155c2a144072a6941c55545790e0948546f07d3613dc82dc6220db31d21060","observation_id":"3aa417f2-68cc-4810-84c2-903d811c8185","resolution":{"observed_at":"2026-08-08T16:28:27.311335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.366370Z","title":"A tutorial on conformal prediction","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.366370Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:f5d0edaf8cf2d7c32ec0f3b8f0e53da4f0f12287bddf1bd9c608a57f1d3e1d74","observation_id":"45284d03-481f-468f-9f34-2cc063ded2d8","resolution":{"observed_at":"2026-08-08T16:28:26.366370Z","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-08T16:28:27.254684Z","title":"Variational adversarial active learning","venue":null,"work_id":"14ac7175-898d-4c86-aca4-c183ed9cc166","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.369489Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:3ebb011d477c3c4a3307deb9e77f90f72d2f0bb7989e1980ad2028dfcbe73301","observation_id":"03f6a0c9-7326-4ff2-a68d-794d9faf3c20","resolution":{"observed_at":"2026-08-08T16:28:27.257969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.245356Z","title":"Efficientnet: Rethinking model scaling for convolutional neural networks","venue":null,"work_id":"aaca7c61-14cd-4f1e-b701-f0b9986a94e3","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.372324Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:5021c01ae7f58ed22a33b947d93b2b86b4818afc0b90b5325e75e0204b67e4e7","observation_id":"248289ce-5b13-43d9-8bb0-1dcf01cb06be","resolution":{"observed_at":"2026-08-08T16:28:27.248881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.236650Z","title":"Bayesian generative active deep learning","venue":null,"work_id":"f93c21af-9d69-4e3e-8ff6-91038301bf96","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.375101Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c6759f4416f5aacc349cb302677cbaf7dcc1a502299255af410eb4c468a50a3c","observation_id":"813da31d-2409-4735-9262-09fa04abd440","resolution":{"observed_at":"2026-08-08T16:28:27.240127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.227803Z","title":"Machine-learning applications of algorithmic randomness","venue":null,"work_id":"03c852ce-499c-452d-a4f9-da970155351e","year":1999},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.377718Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:541776cbd742eef8c9ba547e568af701d54bc03c9315f0f00d7abcb9666e2711","observation_id":"8ebd3e40-c645-48d9-bd82-f35d2c0ebb2e","resolution":{"observed_at":"2026-08-08T16:28:27.231071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.219639Z","title":"Who should label what? instance allocation in multiple expert active learning","venue":null,"work_id":"4a0af4b4-54e9-4afb-a065-a09f33bb302e","year":2011},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.428327Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:297511e01105643e082810fe20877191246fd90e71c2bc79782924fcaef45be8","observation_id":"2461ef6c-9d5b-4ea6-8551-b705fbcc8b5a","resolution":{"observed_at":"2026-08-08T16:28:27.222402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.211438Z","title":"Samrs: Scaling-up remote sensing segmentation dataset with segment anything model","venue":null,"work_id":"29dc8f28-1caf-4e2e-9abf-a606df35f90f","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.526219Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:48874cdcd5558fdfcfc1c9e4b2a6bf7a6200fb503ad553d25652a7a0618ed566","observation_id":"32ebad98-9090-4c5d-b090-8d5a0f5e92f3","resolution":{"observed_at":"2026-08-08T16:28:27.214573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.203282Z","title":"Uncertainty-based active learning for reading comprehension","venue":null,"work_id":"eabb99ae-d113-48f6-bdc6-1a93aa6884d4","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.641164Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:087ae515c89b9a7e4e3a7c359f9746e7903e79a27b7fa25fe1910cda5d91d922","observation_id":"1a6124c6-6166-44d9-88f0-f12d4cbe5c61","resolution":{"observed_at":"2026-08-08T16:28:27.206316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.194590Z","title":"Incorporating distribution matching into uncertainty for multiple kernel active learning","venue":null,"work_id":"7c06e66b-45f0-4027-9ad5-2518233133a2","year":2019},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.664212Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:9dc17dfb246b23cfb8d33a91ba6885f60298d3126224ea578fb12d56ef292441","observation_id":"0a1c3c07-100a-4e7c-9bf7-6459ea615754","resolution":{"observed_at":"2026-08-08T16:28:27.198098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.185184Z","title":"Querying discriminative and representative samples for batch mode active learning","venue":null,"work_id":"167dd7d4-67d0-4977-9c31-703d656f84b8","year":2015},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.668276Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:6038676e70cda0b9d07e44d4874a42cf5f6266f9b574a42efc941141e7c848c7","observation_id":"3f3160f5-7a6c-4675-ac1c-11fc523db030","resolution":{"observed_at":"2026-08-08T16:28:27.188504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.176329Z","title":"Multi-label learning with pairwise relevance ordering","venue":null,"work_id":"442fb396-5368-44ed-9da7-abf44634f821","year":2021},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.671470Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:47c0d9cb2554e2097aa061634c59b3a6c946b60a868c11613d3c5f3267887193","observation_id":"ae68501e-e249-4c87-9cce-13d9859cf77c","resolution":{"observed_at":"2026-08-08T16:28:27.179550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.166831Z","title":"Not all out-of-distribution data are harmful to open-set active learning","venue":null,"work_id":"0c2cd9df-d036-4e1c-bb30-adbed0523628","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.674974Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c61b94bea530af90d04a8c03f06b152646a2b070141264c60be99cc952ee7023","observation_id":"a4c52f7e-4577-4485-bb15-a2bdc6715b91","resolution":{"observed_at":"2026-08-08T16:28:27.170048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.119144Z","title":"Active learning through a covering lens","venue":null,"work_id":"77fdb886-4606-400a-8e07-aaea7004cda8","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.678268Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:c0c2b6a77b656a4856b8a8c833582ddeb0a0c43c414370a64079dc494a4312bd","observation_id":"1cfd01a8-c74f-4163-95ae-ead95d063be4","resolution":{"observed_at":"2026-08-08T16:28:27.160164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:27.020741Z","title":"Cmal: Cost-effective multi-label active learning by querying subexamples","venue":null,"work_id":"c6efac6f-fcb2-4536-9277-588b9d084da5","year":2020},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.680726Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:93fbeafd146968be39b6387b9e103501bc9959ec76a142ce463bf13ba3939079","observation_id":"c4109eff-ab11-4dd6-9c90-ac0323914e7c","resolution":{"observed_at":"2026-08-08T16:28:27.073076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.07146","last_updated":"2017-06-14T06:06:48Z","snapshot_observed_at":"2026-08-08T14:57:17.868613Z","submitted_at":"2016-05-23T19:27:13Z","title":"Wide Residual Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.07146","snapshot_observed_at":"2026-08-08T16:28:26.684105Z","title":"Wide residual networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.684105Z"},"links":{"cited_paper":"/paper/1605.07146","citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:d950148d9ec7f14cc146b19ebe3e92c17ff4875396274b12287fd6edee60976e","observation_id":"a6938536-012a-4eff-94d3-32f93e186138","resolution":{"observed_at":"2026-08-08T16:28:26.684105Z","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-08T16:28:26.922671Z","title":"Scaling vision transformers","venue":null,"work_id":"4a7034e5-6b30-4ca6-8ed2-d09595518af3","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.687769Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:ce21317f2c312fd68c5b0a00611fb9430e552bbc50483ee61d2a1d160efbe17e","observation_id":"882688bc-d806-4f4b-a056-e46ea708428d","resolution":{"observed_at":"2026-08-08T16:28:26.981939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.825243Z","title":"mixup: Beyond empirical risk minimization","venue":null,"work_id":"65fa4f2f-6c13-4b25-90e8-5e16117acadd","year":2018},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.690961Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:94bafdde2a5af1dd10d7fe3a1878831071903b73f1cbc35bece1aee1a80492ba","observation_id":"68d05b33-16ff-4bde-b5c7-b1a043c2e541","resolution":{"observed_at":"2026-08-08T16:28:26.875867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.791510Z","title":"Labelbench: A comprehensive framework for benchmarking adaptive label-efficient learning","venue":null,"work_id":"b5a6b0f6-2385-4efe-b03c-a2917e828eaf","year":2024},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.693868Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:92e5c8ff1aa60647ace2d0dcd57451444a3ca1e7789ee4d2efa8faf5f67c74c2","observation_id":"bf03e414-acb0-4730-97b4-af5acebf0a9b","resolution":{"observed_at":"2026-08-08T16:28:26.795282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.779965Z","title":"One-bit active query with contrastive pairs","venue":null,"work_id":"43ce38c3-e9f0-420f-bea2-052ceee3e7a8","year":2022},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.697197Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:4afd4589d7d77d3fd3857a7cd3a564055bacc87b5f870fd4dcc01a41a0882a06","observation_id":"3bbe770a-4d1a-4605-81dc-42fcaab6d4d6","resolution":{"observed_at":"2026-08-08T16:28:26.785448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T16:28:26.700206Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-08T16:28:26.700206Z"},"links":{"citing_paper":"/paper/2502.06209"},"observation_digest":"sha256:ef6d3f342600605579aec7dc5fa0293441a2fa6ee3f12fef76a258452100ef8b","observation_id":"6a4ef82e-26fa-4af2-96ae-96a4ce443c78","resolution":{"observed_at":"2026-08-08T16:28:26.700206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06209","last_updated":"2025-08-19T11:10:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T16:21:09.114737Z","submitted_at":"2025-02-10T07:20:28Z","title":"Enhancing Cost Efficiency in Active Learning with Candidate Set Query"},"reference_resolution":{"displayed":78,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":61},"total_outbound_references":78},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 78 of 78 outbound references and 1 inbound Pith citation observation for arXiv:2502.06209."}