{"as_of":"2026-08-23T20:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:315d2b6499b3ae3ba8208835252499cee962d595799bc520cc88fb65d4094ce5","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:04:15.554336Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.09691/citation-record","integrity":"/paper/2501.09691/integrity","json":"/paper/2501.09691/citation-record.json","paper":"/paper/2501.09691"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:04:16.200510Z","title":"Awasthi, M","venue":null,"work_id":"3404a4d0-3986-457c-b1ba-103121262bbe","year":2015},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.370451Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:856592c530b1ea79dc16eb8fa0a30cf7babf468b6fd0ba44233d34677f372cda","observation_id":"1a7180cb-f5e2-41f8-81a9-cbed3cd7f7a5","resolution":{"observed_at":"2026-08-10T20:04:16.205357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.182800Z","title":"Awasthi, M","venue":null,"work_id":"41d6cad4-afa7-4617-ad2e-2023ec48ecb6","year":2016},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.376176Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:16af33128aee8952045d37e4032495c47bd2c3016d025bfacba5917f18076010","observation_id":"b4143f3d-087f-4821-8bf7-c9e190ae3ef0","resolution":{"observed_at":"2026-08-10T20:04:16.189117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.165927Z","title":"Angluin and P","venue":null,"work_id":"74da3c3c-964d-4458-93c9-2bdf2b0a9ce2","year":1988},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.381517Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:75ee74eb85dbc5a6565c1dd0f7d282c885a14e5c269080913e588127a3ef068b","observation_id":"ef6b0d32-3229-4cec-8f95-de8fd92a1ff3","resolution":{"observed_at":"2026-08-10T20:04:16.171331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.148201Z","title":null,"venue":null,"work_id":"4241cbca-f7e6-431e-ada6-0b87b37c4674","year":2003},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.386973Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:6e2e7a1e96861fcb862ea981e7ddcd84e2e8511cae4a8e8a39f6f969edb35112","observation_id":"08e03aa7-24d7-4e54-a4eb-ea13cb3bebd9","resolution":{"observed_at":"2026-08-10T20:04:16.153911Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.130612Z","title":null,"venue":null,"work_id":"40f24cd5-f5af-48d9-8828-c5e805e7971a","year":2020},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.392569Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:bb6a993a13be2f92e1abc2bb35efc43984dd933d08ba043a93dfb8cc83c998e6","observation_id":"6b39a80b-3003-4b01-ad5d-b7110aa6528c","resolution":{"observed_at":"2026-08-10T20:04:16.136177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.114306Z","title":null,"venue":null,"work_id":"994671ef-fffb-49ca-859b-0081d81252da","year":2021},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.397862Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:2acede5a215ade383e37b2ae37e4e2e4da88338099c1d65614a24be39a87fd0c","observation_id":"4885eb3d-cce8-45bb-b4bb-dfc1ba20ba78","resolution":{"observed_at":"2026-08-10T20:04:16.119375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.098446Z","title":"Chandrasekaran, V","venue":null,"work_id":"e9af92f1-b5a0-47d2-afa2-7b678355e198","year":2024},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.403815Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:55bb2d1adb38f36b72d9d606deb044923664d40f80f88ab92c2018d53963bfdc","observation_id":"278199eb-8092-4148-88d4-61546c0c0a4c","resolution":{"observed_at":"2026-08-10T20:04:16.103028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.081838Z","title":"Diakonikolas, J","venue":null,"work_id":"03503670-fc67-43fa-a852-b8c990cd36d3","year":2023},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.409360Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:41f287e814d993485d89d8cf99929f859efca80b71dfc308e39c7fc61d15e6a5","observation_id":"5a6418b5-531a-497e-9fb2-0662f9314aa0","resolution":{"observed_at":"2026-08-10T20:04:16.087654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.063801Z","title":"Diakonikolas, J","venue":null,"work_id":"215209d8-18d9-4471-80f6-c043a91c94b4","year":2023},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.413906Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:5ff6c4ba6d3611482d040f89179346e68c278d733dbaa8fcf5dfb0e710199f9b","observation_id":"74560497-c531-411a-abf8-98cac4ba9dc7","resolution":{"observed_at":"2026-08-10T20:04:16.069018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.046484Z","title":"Diakonikolas, T","venue":null,"work_id":"6789ba63-cf3e-4965-bf4c-d8125cd4d210","year":2019},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.419089Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:d8d142638889607e16f749506d86916928bac111b90919fce1206091aa249fa3","observation_id":"1923b111-2ab4-4a45-a6a6-d171b5e5e748","resolution":{"observed_at":"2026-08-10T20:04:16.051699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:16.028759Z","title":"Diakonikolas, R","venue":null,"work_id":"11c3f51e-cf46-465a-9c85-ab863db0e7b3","year":2021},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.423947Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:c42aaba1bf44cee6ee603f9a698cec8a5762c8fd4e10a5de1bc220be5b0e403a","observation_id":"e3b86d34-8698-4d4e-a113-b1f9babbca82","resolution":{"observed_at":"2026-08-10T20:04:16.034178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09720","last_updated":"2021-11-08T18:19:54Z","snapshot_observed_at":"2026-08-16T18:57:44.226990Z","submitted_at":"2020-12-17T16:43:11Z","title":"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09720","snapshot_observed_at":"2026-08-10T20:04:15.429555Z","title":"Diakonikolas and D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.429555Z"},"links":{"cited_paper":"/paper/2012.09720","citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:c6689f14db6537cadf4ee4b97608e71c13d4fc2f418a93d7aea5a6c1a3930ca1","observation_id":"b190860a-16ec-4e6b-b3e6-f8132d8bb49a","resolution":{"observed_at":"2026-08-10T20:04:15.429555Z","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-10T20:04:16.013013Z","title":"Diakonikolas, D","venue":null,"work_id":"5fe8bc30-afe2-4da4-a341-5b0fd77f313b","year":2020},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.434628Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:abe37282c448fcff09308078bad7e332449ff8a9e7848245f7091899a6c3be62","observation_id":"ce576050-4bcd-4ba0-b995-5f9043ba43cd","resolution":{"observed_at":"2026-08-10T20:04:16.017623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.997102Z","title":"Diakonikolas, D","venue":null,"work_id":"b79e84b9-6221-4cf9-a8df-e89e3ee04816","year":2021},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.439138Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:b16277e79a7cfcdb128ef14d5ae6e86c4570c62bc2da945c82983e6284315f72","observation_id":"6dc81df6-7ce0-49d5-885f-85a4aefad0a0","resolution":{"observed_at":"2026-08-10T20:04:16.001894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.979080Z","title":"Diakonikolas, D","venue":null,"work_id":"b710ba4f-f583-43da-a394-2b1b3c45ea41","year":2022},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.443699Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:d56b53c7f2953648e8dfced889cebe6ed504a50b70fd371b9196db299f014775","observation_id":"d10d9b5e-d113-4bb8-a61c-40ce30321df6","resolution":{"observed_at":"2026-08-10T20:04:15.984749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.958319Z","title":"Diakonikolas, D","venue":null,"work_id":"5a9dd3c2-2a8c-4597-b80e-a4b40c2d2b38","year":2022},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.448312Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:c45948dfd0094c8dd987fcf61236d14f8de1ec4937c5234f054f0b5daf85c891","observation_id":"cadcf1f0-3dbe-44ff-964e-4bd8549f9b5e","resolution":{"observed_at":"2026-08-10T20:04:15.963858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.941544Z","title":"Diakonikolas, D","venue":null,"work_id":"df78a95d-fb75-4349-906a-99a276f06704","year":2022},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.454042Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:df10ef7caa19b61c3d68f876dc397496e96c4c3c122d4dcd51297a6609fcd569","observation_id":"93dba13e-f9f5-4cc5-8735-eeabd00c86a1","resolution":{"observed_at":"2026-08-10T20:04:15.946813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.924683Z","title":"Diakonikolas, D","venue":null,"work_id":"e62479d8-7971-4cc7-8e7b-6b84727d9366","year":2021},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.459278Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:0532bd99ec581da225db45bde6e1dbaf79e9b7bc32109055fc220d431c47b301","observation_id":"4b88d3d2-8156-4f45-83a2-647e7d33c7b8","resolution":{"observed_at":"2026-08-10T20:04:15.930005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.909047Z","title":"Diakonikolas, V","venue":null,"work_id":"12d42664-0c03-4192-bccb-cc9040f0b85c","year":2020},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.464696Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:b0131da288232590900579da603b176b41102c98fe8025aad10017f450ecfcdf","observation_id":"6d203739-0d53-4a1a-b2cb-8db8eb2ec75c","resolution":{"observed_at":"2026-08-10T20:04:15.913660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.893407Z","title":"Diakonikolas, V","venue":null,"work_id":"9170dbea-e482-4fea-901e-f87b34f9680f","year":2020},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.469885Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:0c381e1b1d2589bce7bdc19941f284563e1d5edbbf744aa358f29c6bb503990e","observation_id":"1c77b601-2feb-4ce4-a28f-6c18f326ba35","resolution":{"observed_at":"2026-08-10T20:04:15.898285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12958","last_updated":"2024-05-21T17:31:10Z","snapshot_observed_at":"2026-08-16T13:50:52.990292Z","submitted_at":"2024-05-21T17:31:10Z","title":"Online Learning of Halfspaces with Massart Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12958","snapshot_observed_at":"2026-08-10T20:04:15.475030Z","title":"Diakonikolas, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.475030Z"},"links":{"cited_paper":"/paper/2405.12958","citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:d0432c90ee641888d269a3333fe36afa9f53c6fdead08573bf6685ffee716b2f","observation_id":"50658655-44eb-4b89-a5c6-f729f4b6672a","resolution":{"observed_at":"2026-08-10T20:04:15.475030Z","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-10T20:04:15.877678Z","title":"Diakonikolas, J","venue":null,"work_id":"e7a61dc3-7e34-43a8-85fb-26549c9be4ea","year":2021},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.480169Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:0e5be25d2677add7e7a9f5e4aff9aaa6a0cf5ec07c3111130c1ee31bf76e07a9","observation_id":"76535e83-63f0-4d03-ab66-b8b383e2403d","resolution":{"observed_at":"2026-08-10T20:04:15.882306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.860532Z","title":"Diakonikolas, C","venue":null,"work_id":"3124dbc3-f17f-4be3-9295-b379bbc7a9fd","year":2023},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.484655Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:9c8dfed0709c8df75bff138ca902b0f9d6b0e02acae1b90f2db65bb26ca7b4e2","observation_id":"3a60a12e-78bb-4592-b115-a4af6ef249ee","resolution":{"observed_at":"2026-08-10T20:04:15.865847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.841938Z","title":"Dunagan and S","venue":null,"work_id":"57f8aef7-8914-4e4a-b774-989eb841744e","year":2004},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.489398Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:7463091d9661cdbaabf88ca8b8fcdbce4e82e03a18d74af7762ebe70250a2a63","observation_id":"9da4c8ad-ada9-4f46-9e64-3ea272f7b09f","resolution":{"observed_at":"2026-08-10T20:04:15.848098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.823657Z","title":"Johnson and J","venue":null,"work_id":"4d8970f8-4961-43aa-a1d6-130b6f0a4c03","year":1984},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.494171Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:d9d6b13b7af33650a6c4821c05737c85f9547e4c81e004552d7e8b08022ee1e8","observation_id":"546f1248-6a6f-48f2-b531-3df3169f15dd","resolution":{"observed_at":"2026-08-10T20:04:15.828954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.806205Z","title":"Kontonis, F","venue":null,"work_id":"756f06d1-f527-4a8c-965c-0260d12ef94e","year":2023},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.498704Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:88114015d206297dd9188866edb71cf8acb3befa1aaf765643c57c52f2e608d1","observation_id":"1c1b6585-c6f0-4c2f-b0d7-9d6d321c5eed","resolution":{"observed_at":"2026-08-10T20:04:15.811763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.788661Z","title":"Massart and E","venue":null,"work_id":"8698e9d8-8cce-4242-a899-0f2bb6f76fe7","year":2006},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.503211Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:792e31c94fa0021b0ef546aac9ad900ae78cec8bd30e2e1e55b9c0577db4a29b","observation_id":"a6a3f483-7f1f-4008-b214-d05b0541e781","resolution":{"observed_at":"2026-08-10T20:04:15.793574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.772650Z","title":"Nasser and S","venue":null,"work_id":"ab6c0738-514e-48a3-ae10-bdeba66050c7","year":2022},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.508113Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:24add86cf50050fd48bcda64e83279a0a45c8a49e529bffdf46b1042cf4cff13","observation_id":"133dd81c-4f34-4843-85c0-9e5d314211a0","resolution":{"observed_at":"2026-08-10T20:04:15.777447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.756064Z","title":"Rosenblatt","venue":null,"work_id":"437931fd-1aa8-49a4-bbdb-6c688dc7a56f","year":1958},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.513447Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:ae3b05f2d24ad9f5bed7051750633e777359e7b901d6d23f26d3f7581b2ce4f8","observation_id":"b5e0394c-acb1-4330-88ea-95abefdc73cc","resolution":{"observed_at":"2026-08-10T20:04:15.761343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.518668Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.518668Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:db281a42171979e96e6b659b518d982bd6ecaffe75b96a3d0212ee3d2e4b0c06","observation_id":"492092c1-6fa0-4124-811b-20e6998a8788","resolution":{"observed_at":"2026-08-10T20:04:15.518668Z","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-10T20:04:15.728886Z","title":null,"venue":null,"work_id":"61c28ea6-6437-4cad-8540-8e79138858d0","year":1992},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.523588Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:fd12e7c61805256c66c21e59dfc6420b12d5d49b75c575f254542891d54c5361","observation_id":"6c0c85b8-f3f3-4c0c-bbde-fa8be0cd0841","resolution":{"observed_at":"2026-08-10T20:04:15.733646Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.710519Z","title":"Shalev-Shwartz and S","venue":null,"work_id":"cccc88ce-376a-4dbb-912c-ccdc705cf111","year":2014},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.528492Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:c60ba7e62b97421c07ec44cdc54b5a8d2274b0453059ac5c76d08a42359e93b8","observation_id":"bfe72f7a-ceca-4a72-a941-200ee52c3e0e","resolution":{"observed_at":"2026-08-10T20:04:15.716574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.691382Z","title":"Smale and D","venue":null,"work_id":"e112b47c-9c47-4656-8909-a87ede494e6f","year":2007},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.533587Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:cd0ee8f8c85520b11c5dbf67bf080dee858dbecba7aed311aa759a1d8051bbd4","observation_id":"b7ffa797-1232-4826-a261-e346141b8d14","resolution":{"observed_at":"2026-08-10T20:04:15.696651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.674415Z","title":null,"venue":null,"work_id":"af9b13e0-0c43-47e3-a206-4c556f679b5a","year":1984},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.538820Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:9bf1007f3b1127d003553d9f74fd72a65d08c087e2922b19a1dde1c90b0fe063","observation_id":"ad477db1-fb3f-4627-bacd-ff7a643b491c","resolution":{"observed_at":"2026-08-10T20:04:15.679504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.657321Z","title":"Vershynin","venue":null,"work_id":"93d45dd7-88c3-4c22-a781-5981623a64ae","year":2018},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.543915Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:11a7d214ec2dfe8f21418442d879755d65b9e47c1d27806d56e966f095fe6768","observation_id":"1281a00d-5077-44b7-b3c8-d0979d7d45e7","resolution":{"observed_at":"2026-08-10T20:04:15.662011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.641398Z","title":"Yan and C","venue":null,"work_id":"65edee1b-6cc2-4502-b912-6bae199d2e40","year":2017},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.548857Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:faf4caaa0f2426e67face350e9fc6dc7130e441398e0cb095e2f1a4fb7e6693e","observation_id":"deaf5ee4-57d6-444c-ba9a-2021841ce4fb","resolution":{"observed_at":"2026-08-10T20:04:15.646046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T20:04:15.623762Z","title":"Zhang, P","venue":null,"work_id":"88eddb4e-d695-4475-98ab-0f8f0dab267f","year":2017},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.554336Z"},"links":{"citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:badf13cc26e4fd57a9d4504e8caf5765378eb8813114b50540977fa771a6b6b0","observation_id":"0cb66f3d-8f7e-416b-95db-6f4e7a9a3ea3","resolution":{"observed_at":"2026-08-10T20:04:15.629771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":37},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2501.09691."}