{"as_of":"2026-08-15T03:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:760bc804ec7a57922ff7910572b46dee8d4900c1e41a1f38134f18408bc3f6cd","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T12:12:44.455418Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2607.04869/citation-record","integrity":"/paper/2607.04869/integrity","json":"/paper/2607.04869/citation-record.json","paper":"/paper/2607.04869"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"Proceedings of the forty-second ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:e940a1b5d885340f9e5a0f56c61d1f21a9f279e10e19427b82c9be6899cbe0ff","observation_id":"4b82d6ba-9df4-4d32-bc26-716774fd85d6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:174919c5c626351d8792cfaf78c552b34a02ec9be15848028fe478e83afc4724","observation_id":"19d116d9-466d-46a7-b5ed-9f23bc9a8586","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:cb1fcc2407e0d1be120890e9a11e1b073b9d104e34efb1fccfac27695535ffc2","observation_id":"3a778978-0eec-4ca7-b340-8a2900e1b72e","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:ee4b10428bb86297be281ed1da85e3ddf0b1635d29939ab8c6ee7c0d34904d72","observation_id":"68595436-9103-4c19-a0e2-4e1720223fc6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:85d7a36d9e68d9b2e4d9aa901dbf58aa6256b729760ec4a838971fb7627ca565","observation_id":"735a8cd4-1c2c-4d66-b714-e1bf263b8338","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Theory of Computing , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:f5f51d282385a9ad10729ab8474df2dc198aeae35054f6c8141c883c439d39d4","observation_id":"d042f033-6196-4509-86dc-4004d25a4ae7","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:2412.17115 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:a435b8f4559870ed2170e2c829651025c2c531bcb05cc5fc1d709eef607d36d3","observation_id":"ad5e8502-1aab-4a38-8950-a0bb4363da07","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Ergun and Zhili Feng and Sandeep Silwal and David P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:bda0f4bd9bee0a5a4d8a5595c3b70bb5319e6504b419b530711a2a8a016e1da4","observation_id":"1384e0ac-3566-4db5-bf36-f6fb7e83e5a6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:358f1e6f7151f7bfdf7702ef96319b1fd955e4e388557adca721cb94266cbfab","observation_id":"bcdd291e-c30b-43f7-9ecf-63b7bd076c1a","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:f4f9eee5303ba3c7f5a8e2407ee097d5ccf51d05dc7763b6a699ecefa53696b9","observation_id":"38c7cb61-eae9-4a2b-9b3f-6b6d7b504e96","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:3c127d2b001a3a8a3ed6f1be36945a045802e7e89930483767a83d2f351c45eb","observation_id":"571d2b70-45a7-4785-b5db-ee0301072d44","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of The Web Conference 2020 , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:8cfb60e2702f2e018d1db363f96df6dd91090da60c1d17a0c8f1c6d682b08976","observation_id":"b6791e7b-1ae3-4f53-89e4-262ef0b44f22","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:ff131f5871a82433256ebddbaccf051541d77e6c88cfe8aaeeefcbe2e9007876","observation_id":"59b6ade0-4a82-49eb-aa5a-7fdc556e0f45","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"9th Innovations in Theoretical Computer Science Conference (ITCS 2018) , year=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:e84eda31ae0a0c1faf0a7a3f6ef399fd72971dd7b98f06614f7a52cb4aa1dd5f","observation_id":"ffba6ca0-ff4a-4c9a-9c0f-2b09bcc4587b","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:b24dbeae15c62364aca975d7a9c9238bc6f7d64840f8b7d82afb3f9f314cf989","observation_id":"c00ec95f-f673-4295-bf9e-6132ceedb50e","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:dc41d70b0d811bd7c2caf611e4ce764bef4cbf64084747700dc99dc429f2208a","observation_id":"9720d610-72a3-4b77-a3ce-f6571d518b54","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:888e776b37e4bd7ddc03b7645ae3ec674a33a0d0ec954c5d3ebc98b93999a7dc","observation_id":"ea6d9d4d-7a20-46b1-a071-94247d6108a6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:4a0662a02eca775864eb42f8fa40403f1336494f853a8b0887327ee3bca28723","observation_id":"40e85649-4be7-4ee4-b144-d1ae757239bc","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:ef9132464161db0c38ec307ac5dd0b5ca8bfb54716b1a99d82cd60fe614940c1","observation_id":"3f25e5de-61d4-4bff-b58d-f21750889acd","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.11581","last_updated":"2017-12-23T22:24:18Z","snapshot_observed_at":"2026-08-14T20:08:13.366031Z","submitted_at":"2017-11-30T18:54:33Z","title":"Outlier-robust moment-estimation via sum-of-squares","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.11581","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1711.11581 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1711.11581","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:c231a00e4a173f1a3e87205d4af169d2cb77a288b2d71af1c98dd47e61489e1e","observation_id":"929cebff-3097-473b-a2a2-6d25021d40a6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:163b1080d33b6132ea19b9e4377e3f274919bc8e4cf2d27324c2264ce6d86b68","observation_id":"6b4369cb-3cca-48a5-bc8e-e5f88f5c681c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) , pages=","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:649b5bd98f0b0207b69a7de18cf9af1d1da689b55e06b8a92327db2e1d435cfe","observation_id":"0e25df63-40c3-40ad-94b8-1a573e904ab4","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Annals of mathematics , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:6b36caea2d5eddb967aba03ec8767e35f47d06ca23f2956e66a7cf8dfe141e01","observation_id":"d4eabbc1-d1b1-471a-8f12-1d21b5dd0671","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Mathematische Zeitschrift , volume=","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:c6490dd443165c231c64bb8410ba34ca6490a14681659cf15b80331f7a0d6f8a","observation_id":"6a7a9de1-2569-442a-bdbe-cc5c7007ab88","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"The Thirty-eighth Annual Conference on Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:27a439026436ea2557cd7dbf0ef92f1c5b2e850166706e9702d86f5a40bbf497","observation_id":"22cc7fa6-dec2-4601-9a22-231441245a0c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Forty-first International Conference on Machine Learning,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:427b97f8afa2c1f116a3a502101bd3be4601c5f87b5ffbdb1a14ad32ed852de0","observation_id":"7e1f72f7-1fde-4c19-9cb6-8d24fdee3b8c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Internet Mathematics , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:f5946f082e37e6373f835fb6f09b48e7295aa34ece3a7f621d43b8efcfa047eb","observation_id":"fe4e3b42-8882-4766-8f82-37b7615216f8","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:7d7befd306d35f542b281107899e9637aa9ad306d9a9ca6c0bd3141241f4a1f6","observation_id":"39083b90-a499-44f6-9131-f500d7a13f6a","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07284","last_updated":"2023-04-14T17:53:26Z","snapshot_observed_at":"2026-08-14T08:25:37.076000Z","submitted_at":"2023-04-14T17:53:26Z","title":"Solving Unique Games over Globally Hypercontractive Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07284","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:2304.07284 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/2304.07284","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:2905743549b3b95f8e33eeb484c266621abf58e24c87acfa9cb9215363628638","observation_id":"4040d0e3-b31f-4564-a316-e076aa0b869c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:ab73700db55331d3e7c2da79946d130065dcaeec643d86c794444fbc1a388994","observation_id":"62aaf973-e9fe-4684-8a13-27e80555f06f","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:61ebce739c2c891611ed960896d4ab007eb15531c482c8fb0c569115904a22d2","observation_id":"ed75c37a-e140-470d-8236-6cf054244547","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:f8b568fa34cc88647e72858daa0fe82e0953bd3191afc053164d2e42d97bb067","observation_id":"6f462c29-567f-4032-84da-a557d5e74f19","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:c73f49432f89c4cdddc28f066e2f120ebafc3a83691668b1a18a2adc6eb3eede","observation_id":"51782fff-f0c5-47eb-9224-32623fdba41f","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of 37th conference on foundations of computer science , pages=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:c47a5c34b07b438da6255213c322b204c22cc5f0c1bf04a62644e21a8aee94b1","observation_id":"5f004a78-424e-4ebe-94d8-cb82d4c81e31","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2009 , institution=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:0761cd0de13e7ec8986a3dd2c20a5c4345f0fff140fb689116088004bbc10ecb","observation_id":"e954b366-231d-4de4-b9c8-4f2e8e4ffbc8","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:92d0bc0a3c027f3377bbd188e6d7c691b9ba1d34b79d625196d078fcaaca7745","observation_id":"fb6becf9-c358-4622-adde-327bd95bc384","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the fortieth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:305a8f8c9194c150b24d848367b3568bfb285c8937f0372961e76123db28f5d7","observation_id":"70c7d9fc-8479-4a3a-91ea-69136bfe7e78","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0806.1745","last_updated":"2009-03-26T12:05:10Z","snapshot_observed_at":"2026-07-06T01:38:47.314040Z","submitted_at":"2008-06-10T20:34:17Z","title":"Eigenvalue multiplicity and volume growth","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0806.1745","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:0806.1745 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/0806.1745","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:1dd701db977a569ff5681a791f62c4f6b4cb235b3d0e9ae2a3143c14d1b8aaa6","observation_id":"f41f3dc1-f804-4722-a11f-1eb459d48b3a","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Czechoslovak mathematical journal , volume=","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:ce889845448e491d606d6c9019c598460d73eb04ff249b497d0787788f3f428a","observation_id":"8be8c60c-171d-4d68-b7bb-b3a5244e28e4","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Journal of the American Mathematical Society , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:378712a12b9b6baae2a2d8c82e728d3995e055c7d47c336591383e9ce43a58e7","observation_id":"372ebf5a-af3d-4bdc-b2cf-0d480aa565b6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Geometric & Functional Analysis GAFA , volume=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:d07de62b0cbfffc01c171a16d8aab5027d45c5f17a1976c20fb27ce55ab53d98","observation_id":"aa0f65e7-a226-4cee-8f5d-82ccea08128f","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Geometry and Combinatorics , pages=","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:af2bed5eafb6ce6f5e680b40b61b1210925e85731c24f1e060ae92f8ba3d4248","observation_id":"8aa91e07-4e71-471d-b4ab-8ef2aec425c1","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:ede60428c7351ee6cb22a329499821c4d9aa90a357ab11cdc6ccb33daa93e462","observation_id":"864b8bd5-0899-4ab7-8094-b66de3fd11f2","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Journal of Functional Analysis , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:e875bbef516ffc50bfe2f3618d93b09c9ddb57527887ebf971587b3d8f449122","observation_id":"705b8f86-1fc2-421c-9624-33f88f8a023d","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Geometric and Functional Analysis , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:989e655e14a3bc05b5f9b8531414b0bda0ae6c9ec8440aace57a38532f8663c5","observation_id":"5acd6842-db16-4c9c-b50c-86d0f8a60901","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Annales scientifiques de l'","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:6efd8e3b51e9c16f04fb0c09642c459667372760bc2392e415372d6731b306ee","observation_id":"bf6c4cdd-8896-4f37-9285-750ee60473d3","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2021.24","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T12:17:59.535028Z","title":"Near-Optimal Cayley Expanders for Abelian Groups , booktitle =","venue":null,"work_id":"d37dedb1-a335-467d-b919-2e5691425276","year":2021},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:d24c711634fabcaa3017d34618e49b471bd9d9539e24a5494ff0cde8f55b3f9c","observation_id":"66ce8193-4b2d-437a-a409-600c12d8a1c0","resolution":{"observed_at":"2026-07-11T12:17:59.538966Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-12T00:49:25.948008+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T00:49:25.948008+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-07-11T12:12:44.455418Z","title":"Journal of Combinatorial Theory, Series B , volume=","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:49cde222e4fe506fb9d4442dceb331b750f6d1a1afd50f03c5eea27cd9ec8c97","observation_id":"26bb45ed-1b83-4040-b90d-d71604c2f182","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 8th International Conference, AAECC-8 Tokyo, Japan, August 20--24, 1990 Proceedings 8 , pages=","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:b1749f5c001f5a9eca89302a78a7d8904de709d8f7efa650cb2cd9841b9f2099","observation_id":"3c9384f7-2836-4ceb-9ee8-293362dcfd0c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09829","last_updated":"2022-04-22T17:53:59Z","snapshot_observed_at":"2026-08-14T18:23:28.614064Z","submitted_at":"2018-09-26T07:15:12Z","title":"Eigenvalues of Cayley graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.09829","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1809.09829 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1809.09829","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:d97e5828f9d4195f9572136c0a4522d4853fb602f931ddc10f70edc88db4960c","observation_id":"e037201f-2729-4a0f-9e88-33e5cfca9a54","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Eurocomb 2003 , volume=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:35ef4f9ca54fc16de3a96d7be50ff6cdc7a3546d1e5feafb7589099bf96702ae","observation_id":"94e90670-3df2-452a-b71c-474061a268c3","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Journal of Combinatorial Theory, Series B , volume=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:01fd1da00697f1eb761cbdf70b2017df7f7204037ed60b96e15aff0242938a09","observation_id":"9e0118cc-fd15-480b-b8cf-d00a4e350135","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the London Mathematical Society , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:78ecc3823e727ddacff503a03a2e2de26f3068a92ec4d6326a426873f9b1dab9","observation_id":"96c907c4-95bf-48fc-b1c2-4ee4080e9da0","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:84ee33398e07124cc49cba3c5197ace8d8bf72e94e03f6b74aab056fa9aac664","observation_id":"08d2561b-2666-4838-990a-927e750577fa","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"International Workshop on Approximation Algorithms for Combinatorial Optimization , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:34991b404fb881d7bfeec24c1a7b0f2b2b9d90d7c1993c470e36cf3293585461","observation_id":"15ac7ad3-2e7f-4d7e-9fb2-19a8424fd909","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:2abfcae518f26a99a6dd0c1bc79fb353629ae04e2a8012081340a3d3984493a5","observation_id":"f288f425-ff43-42ab-9c30-ada1f3c8508d","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:91665e7ed1309cd4fcbc1799427ca23d0db7a8a888ff73a2b6522e7c9063c537","observation_id":"e7ade0f1-cf27-43a8-84fc-6692c16c4478","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2011 IEEE 52nd Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:690de30ab5d4689ad051a93df0ae93f4aa9bc71d53d7a813419263497b2a0d77","observation_id":"2e31d054-003b-4be3-a53b-9ec680b16aae","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"computational complexity , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:138bf563d3bf752656cebd63d0f2b4fd17a6acf0d4b7967b58c04fdfeebc5a04","observation_id":"958046e8-a957-4ebb-9c15-028982e97491","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.09898","last_updated":"2018-07-25T23:26:43Z","snapshot_observed_at":"2026-08-14T18:47:40.303862Z","submitted_at":"2018-07-25T23:26:43Z","title":"Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.09898","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1807.09898 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1807.09898","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:5d643a0c6686a30ce3dd6e21daa0d7e1255be1abe915ce0feefaeef3d0ecf8d4","observation_id":"76f17284-db1c-4631-b1e3-4d85f44bb11b","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"computational complexity , volume=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:a8855a0f25c23b595e2595c19f6a62eb781f8c6e62f2b0848e43fcbf694485cc","observation_id":"720d67ca-c559-48ca-bd76-d4069840416f","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the forty-second ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:d71113142a5de40833d95f1708456d5511d8bfadc35ca7627109323c423a5a51","observation_id":"da55769c-abcd-4055-a05d-1a200993d8d0","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:b0775c60650162ffa59a481fdae106ceda2019f39de37c913f828f2fad6995da","observation_id":"b3c426ba-b714-4388-93bc-6131524e5c86","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:77a538f908233a9d201c6e0e8bfcb1ef670a75e586dafd8943f4f5ba10eae386","observation_id":"2c67044d-ed38-4419-b3c5-dc0bebcb231c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Problems in analysis , volume=","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:2464151603dcc6f3a037d75e19af43edc6b2014f035d272d07b130f09975d24a","observation_id":"30ef8aee-18de-432f-8a10-fad200027412","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:777f5b42f5bee9734f2413a44e901162a4acf9eea149564a04443f9eaa1a579a","observation_id":"324c7daa-77a3-4d1d-9e6e-906edae041ec","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:a356f2422eba5ecc83628661017b0201ea6af3f0e46b40073957693265efe865","observation_id":"117fee1a-f12a-4441-ad3f-6e294eb02d7c","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:d15f4268651f1eaaa1adb9a675f5f7f771ce7f583a15081461a2b3f84c16ad8f","observation_id":"70d094c7-a1d6-4e3a-b577-b9583a1ecf40","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:4df1d12e1e061998d591751ce2d18b996160472f1b65948530248873adf1b9b8","observation_id":"5e297f03-67df-403e-ab2d-52de79420fb6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:b11454c642f58e5ec0c9a8bf5451917abb9ad7976437ffa2ba1f369ffb4f2b97","observation_id":"3aeccbfa-3027-4de4-9455-ee21435bd840","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:a6c7dfc3e422b61d3b322a66d6b8c744ea44f8dd97ee764f080106dd8adabd3d","observation_id":"740ccad4-74ca-4053-b042-4e5b71fdcfda","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:6256147dec93eaf50ccee40c52e14a90ea1ff43dc8a4c10dfcc983db84e8f12e","observation_id":"eafad846-90d8-40e8-b970-75fb8d02f419","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"parse_uncertain"},"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-07-11T12:12:44.455418Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:7da31be52dc02c0c01000b1d69e82ef469b5280153e58ad84897902cc8abce48","observation_id":"2f196225-e88a-4aef-a4a5-5a080321b7a9","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:357ebd21abf9aa30edc01b96797e0314f24705c52445307b58e5468e5ea89dd4","observation_id":"817bb964-d669-47b5-a4d8-7dda7215d7b8","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Non-negative Ollivier curvature on graphs, reverse Poincar","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:aca6c73dc55539907450833736815bf63eea6d5c70c41146e7fe5a4176298c09","observation_id":"0de66120-274a-424a-b16c-7ea974438526","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"URl: https://people","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:4598d039b8fa61fc35539c962bdb6bf842648f8e8a9b06a4f18756a40da48169","observation_id":"067f597d-9af8-4885-a6eb-c631cd3bd171","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"University of California, Berkeley, https://lucatrevisan.github.io/books/expanders-2016.pdf , year=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:15695cc3e337dd4e30ca2e687da3763a0682ca7bb264d162201db82cf33fba64","observation_id":"dcc6b200-811f-440e-a101-7ddc04339321","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:bd575e6726723f2f351191b723d27b662c73acf2fcb039f63508d76a21d0d025","observation_id":"d8a42e15-13f1-46e4-a69f-105fb9ccbdcc","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Canadian Journal of Mathematics , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:b56b69fa92bf81c171767284444d4c8b6ca2842a32a06c16d7c88aa181072ee2","observation_id":"6f0df387-46bc-4647-9e92-96d92463f987","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:fe2d9c1157011b859637d2de19267a08753bd994e4a1824f9e20b8852a649504","observation_id":"2a5474aa-60f6-4321-8001-61ad6ebc4203","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.03037","last_updated":"2015-12-09T20:39:58Z","snapshot_observed_at":"2026-08-14T22:19:15.580114Z","submitted_at":"2015-12-09T20:39:58Z","title":"The independence number of a subset of an abelian group","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.03037","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1512.03037 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1512.03037","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:076a7e87a6fb4387db1b3cabbb839f19700baf3e62d70e968b28f473c0fb808a","observation_id":"b7c5bc1c-c9e3-413f-94fa-4faebe992cb5","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:0a463c9618c331511aae88793d6f6afd41b2d709956f7823f392fc8455d43308","observation_id":"293886a7-d64a-4377-98cd-877b0ed9efbb","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:cc3f17a30df266b31a2e649ccf957b8b6f81f6014bafdf8dcb1d259acab72700","observation_id":"4b9c2eba-0e55-4fef-975c-b9134007138f","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:3877e0c67791222a56e1232c8171fb5832fbcc3eaead9564110b400227dbdbe9","observation_id":"d65a42b8-3a59-42e4-97a7-941f4335dc20","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"On Rings of Operators","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:80d9c1ed77654cdd972fc9facefd6b9dcc53e9f68dd38a966ccb1cab3d32e414","observation_id":"d95066fa-6487-47a8-bd8f-e92a6ec73ff6","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2019 IEEE Symposium on Security and Privacy (SP) , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:46e14576b95c6d68ca6769fc50e5bdaca5e80c59b4d55bcc7b4d6f05061fe38f","observation_id":"3ed2ccbf-23e6-465f-9d18-daaf8a27caf2","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:151e64ec5dd220c8f1dc9bb410ad1961393261c808bab74c0ce2c503b20cd7a0","observation_id":"3d18248e-70aa-40df-a79e-61fd338003ea","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:1b271dada7411bb73d9ee00a9fa1c00451ca42bca6191bf97f2d1734f590e342","observation_id":"3db50c84-da6e-41ae-8774-92ac4fe0d076","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:13b2847fc8ceca6257c4c20d3e0af94adafa61d58d1087dcd778cafe24a205c3","observation_id":"2566f6a6-66a5-4b81-a858-73f38a88165a","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Innovations in Computer Science (poster) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:551cf7037fe84a5aea3b173137495adbcbbdb19da695b9b8ed96d9a0e7c7a33d","observation_id":"ef8caf83-0c87-48ab-9500-bbe3380ca6d5","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:a1aa3774aeab6656fe4c6f6522922c9faff1c443ae7c985a4e83570c34358971","observation_id":"84438339-9cce-4951-b1d0-ea3f963e65b1","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"rem , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:2621096a68b9f76a97527b3901c44828a02975b66d20e2caf70297f8a98e2149","observation_id":"85deac74-06dd-456d-8d48-81ba4d1aa532","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:fce6a80de401b80cf473994be4b502622b23206e6e7233dcc9ff8ddc195f2d54","observation_id":"84a8c8bb-75c7-42f9-a9e5-c40d3b5190f0","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:74b0e409cc70fe6858a4d284d2804ed94d00e8d1fce589e6e98e2c5885098abb","observation_id":"a9af2ce0-1090-498f-bb49-73dc9a722a97","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:41a5457c060878c8964b970d672cb66c95dc8f2aa53fd6f0bc932ab07d07afd5","observation_id":"ececd51e-308e-4933-9f50-a650c386ce19","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:24d809170e900c071e7cdc6c7de12a08a3309a1e29a0680641fbb4100bac2c48","observation_id":"2284a380-e3f7-4cde-8c21-1b4fa9122a6d","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:c676e3bdf1529b776ee6ad72c55c2bb575d6c7d11b3b493c2778f02338c7825e","observation_id":"3530462a-5608-4fed-87e1-be230a2c57a0","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:0fad22b3d87ff145de5c338649cf4dc197a2f84e564eb34ff822861ded933812","observation_id":"021fe835-f962-4b6b-a2fb-f7530b00dd62","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Israel Journal of Mathematics , volume=","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:672429a774f4df85076e24e680768341535e25c128672d360b3354fd8aae22de","observation_id":"3894ece6-c166-455c-b568-b429e8cd3b02","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","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-07-11T12:12:44.455418Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:7c0ce8c6c3a60a7453c50fc9b547229405a4889dfe8004014a3c6f024c3db26d","observation_id":"835aab0c-6d84-4f6d-9d55-8b2376403223","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":98,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":300},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2607.04869."}