{"as_of":"2026-08-11T17:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af082f890d881fba242121fb5c8ebe11c4c8e21e29432626b5cf19e3ccb96e05","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T22:55:54.884663Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2502.04312/citation-record","integrity":"/paper/2502.04312/integrity","json":"/paper/2502.04312/citation-record.json","paper":"/paper/2502.04312"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.414039Z","title":"Data augmentation: A comprehensive survey of modern ap- proaches","venue":null,"work_id":"e1ef3754-435a-4f59-96f2-b0a28906eedb","year":2022},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.723257Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:dadef7e38c23587e48ef7fa9e538b85e57f60e2f602c559f8ffe1a07534a6684","observation_id":"4ca5a6f2-3703-4675-b6f2-53cd39f60d2b","resolution":{"observed_at":"2026-08-08T22:55:55.419669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.398405Z","title":"Text data augmentation for deep learning","venue":null,"work_id":"56dfe022-f22c-4bfb-9c66-fa9a8235950a","year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.728650Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:deab6de19e077b4f89d9467e1638710196dd2fa5c6cddae8ce3c19733b626743","observation_id":"0fd67b7a-d514-40f3-a4bc-6f52447dac6a","resolution":{"observed_at":"2026-08-08T22:55:55.403064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.382556Z","title":"Nonparametric regression on low- dimensional manifolds using deep relu networks: Function approximation and statistical recovery","venue":null,"work_id":"ad78c9dd-e950-4b00-8120-d3cff1a94be9","year":2022},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.733485Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:01daf583dcfd595886884a87d603679ee46b803a55f501b7c5224c285c5acfd1","observation_id":"af8feef8-ae6d-464c-9d70-4202ba49661b","resolution":{"observed_at":"2026-08-08T22:55:55.387861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09229","last_updated":"2019-02-25T12:32:15Z","snapshot_observed_at":"2026-08-09T14:03:55.753178Z","submitted_at":"2019-02-25T12:32:15Z","title":"A Theoretical Analysis of Contrastive Unsupervised Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09229","snapshot_observed_at":"2026-08-08T22:55:54.738683Z","title":"A theoretical analysis of contrastive unsupervised representation learning","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.738683Z"},"links":{"cited_paper":"/paper/1902.09229","citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:94c98c1b4d1ac139be7a7da37117f099d014bf91cafd30dd005b5a10cc7f3490","observation_id":"e8795587-ac13-4305-9471-66499dce6ef7","resolution":{"observed_at":"2026-08-08T22:55:54.738683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.367110Z","title":"Contrastive estimation reveals topic poste- rior information to linear models","venue":null,"work_id":"206fde93-bdd9-4847-9546-599d1e484476","year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.744535Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:f60870af2e4cd2d16d059ba09d4e844d31bae25f46a36c5a2587bb6d2fe0cb14","observation_id":"3567c434-d2b0-4a42-9530-9092fa132093","resolution":{"observed_at":"2026-08-08T22:55:55.372144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.350825Z","title":"Contrastive learning, multi-view redun- dancy, and linear models","venue":null,"work_id":"0e8e7b80-a5e9-4136-ad17-613630b929b9","year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.749628Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:0141c889a1dbacdf7cb62cad5a5075ce9ba790f540cfeba04b75482cde8d9429","observation_id":"4ff37c78-7723-41c1-a205-1c374259f4b4","resolution":{"observed_at":"2026-08-08T22:55:55.356282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.333965Z","title":"Provable guarantees for self-supervised deep learning with spectral contrastive loss","venue":null,"work_id":"f2cb8d31-9f77-4aa5-bef7-dff42418feb7","year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.755083Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:46b55733c4447dd4885dd60db39149fda840cda330f293b5a1383b78bc25e444","observation_id":"a8289e3c-b7c5-48e7-bd41-4a25ee3c993a","resolution":{"observed_at":"2026-08-08T22:55:55.339549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.759904Z","title":"Elliptic partial differential equations of second order, volume 224","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.759904Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:ffc78fd454ee0c52212970162feec877833dc9ccb2a3e0e029ad6ffd81f537a3","observation_id":"28b86ce0-bbb8-49d2-b07a-3e273081cf14","resolution":{"observed_at":"2026-08-08T22:55:54.759904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.306591Z","title":"A graph discretization of the Laplace-Beltrami operator","venue":null,"work_id":"1be5aeb6-7261-49ff-a532-f1e173b140f0","year":2014},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.765865Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:1948d9662dd3b5f0461ddb2c675409810ba7fad0a3d084b12c50d86c02c95dfc","observation_id":"297ae7af-6ad0-4731-9085-d7526bf45f7f","resolution":{"observed_at":"2026-08-08T22:55:55.311646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.290544Z","title":"Error Estimates for Spectral Convergence of the Graph Laplacian on Random Geometric Graphs Toward the Laplace–Beltrami Operator","venue":null,"work_id":"3cfff860-9c95-4ba4-a36d-ef65e5ff608a","year":2020},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.770647Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:c85bf8ad431719af3109eeac5006dd78eadb6c6f8e9b139ad4e3cf873e537182","observation_id":"b6754660-87a1-4ac7-92c8-de9ca343d065","resolution":{"observed_at":"2026-08-08T22:55:55.296016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.274241Z","title":"Improved spectral convergence rates for graph laplacians on ε-graphs and k-nn graphs","venue":null,"work_id":"b712eecd-f562-408c-a38c-b86567d8a3fc","year":2022},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.775348Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:66e9e3a54faf8e2684959afa7741c86343b6b54c93a6afe60fbe98a5ebf455b9","observation_id":"b4de73bb-f45a-41a1-af5b-8cd8068972d3","resolution":{"observed_at":"2026-08-08T22:55:55.279521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.258676Z","title":"Spectral convergence of graph laplacian and heat kernel reconstruction in l∞ from random samples","venue":null,"work_id":"dbf77de6-ba66-41c4-a984-8880277e4cb6","year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.780007Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:db44910d2f6cf9dd75da69ff90fd8f018ed11effea57bbde4e4a777e64cbfeeb","observation_id":"2300ee1d-7fa5-4a14-9bac-3fbb0ee5ae24","resolution":{"observed_at":"2026-08-08T22:55:55.263593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.242885Z","title":"Spectral convergence of diffusion maps: Improved error bounds and an alternative normalization","venue":null,"work_id":"0e0d8bf5-cdaf-443e-9ae6-890c10f94329","year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.784896Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:4e7de55ac32a0c8778bc656f3223fcf40a19d36fa0aa792c1d98ebe2b694c7bd","observation_id":"184002d6-79bf-41d2-8781-889a996aeae7","resolution":{"observed_at":"2026-08-08T22:55:55.248148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.227131Z","title":"Large sample spectral analysis of graph-based multi-manifold clustering","venue":null,"work_id":"8455abca-d94e-4688-8868-e2f16703c8d0","year":2023},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.789825Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:46b3103b25c4322486d0fc7aef290b5fc662a0eda66e6b1e24aa743eb68c14f7","observation_id":"705ab865-2ea4-4bd1-8fbf-d0d6549f6ac4","resolution":{"observed_at":"2026-08-08T22:55:55.232282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.211889Z","title":"Lipschitz regularity of graph laplacians on random data clouds","venue":null,"work_id":"3f64e25f-30f7-43b7-8003-9fd1d7227cfa","year":2022},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.794629Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:b06f8844bad22d604324fcba752987e67c9829fb38696ff6f62f2f862fef9ed6","observation_id":"88a2d9e7-b384-4c1d-8f52-2b608ea5111c","resolution":{"observed_at":"2026-08-08T22:55:55.216783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.195043Z","title":"Refined shared nearest neighbors graph for combining multiple data clusterings","venue":null,"work_id":"81bf0fce-e7d6-4213-94d5-2c18222abcbf","year":2003},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.799313Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:2832d3e7d1ba17930811efc63e828ab32d8b0cd549bb90bad1d7df96e3f0bd1c","observation_id":"3c116701-ad39-46e1-97de-d38518698165","resolution":{"observed_at":"2026-08-08T22:55:55.200868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00729","last_updated":"2023-10-01T17:03:47Z","snapshot_observed_at":"2026-08-10T16:55:29.640090Z","submitted_at":"2023-10-01T17:03:47Z","title":"Spectral Neural Networks: Approximation Theory and Optimization Landscape","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00729","snapshot_observed_at":"2026-08-08T22:55:54.804127Z","title":"Spectral neural networks: Approximation theory and optimization landscape","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.804127Z"},"links":{"cited_paper":"/paper/2310.00729","citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:cc481535d1475be2d91b9ba12fa5b3cbb0cbaec7ece3a70755fa8063cfa9e120","observation_id":"249ede15-65fe-4925-a962-a221ca7265c7","resolution":{"observed_at":"2026-08-08T22:55:54.804127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.176219Z","title":"Small relu networks are powerful memorizers: a tight analysis of memorization capacity","venue":null,"work_id":"84684387-5c20-40c6-ba5f-70693c8256db","year":2019},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.809227Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:b16641865066872aa5893e5e6f458630bcb2774e0fb51243627cc528fa281779","observation_id":"2da3a56d-4b8c-478c-b2fe-94f9ddcc8dfa","resolution":{"observed_at":"2026-08-08T22:55:55.181773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.159526Z","title":"Probability inequalities for sums of bounded random variables","venue":null,"work_id":"adfe7d3f-d3b2-454c-b429-3403bdba8d68","year":1994},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.813781Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:8023624749f2f1006de7c00df03f8c850e0d78570756bb59262d695ed19cd960","observation_id":"7e199ea2-e727-4924-8524-fa61aef8cd1f","resolution":{"observed_at":"2026-08-08T22:55:55.164676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.143136Z","title":"Riemannian geometry, volume 6","venue":null,"work_id":"2ca0535f-fbb0-455b-aa19-4a410a4ee694","year":1992},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.818370Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:23a5895428b5ececa2d9d0c9f564aac5b38b6636ac98e401b195807d4c963231","observation_id":"47db814f-e5c0-4fda-a5d8-d1782777465b","resolution":{"observed_at":"2026-08-08T22:55:55.148230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.126750Z","title":"Sobolev spaces on Riemannian manifolds , volume 1635","venue":null,"work_id":"b6cb99c0-4bae-42ca-ac0a-faa749d1d5a2","year":1996},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.823616Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:d55dfe9303afca7ab17cfe71cc64330520ab7d294dd4b3f9e367200055112d10","observation_id":"acdc36f3-5b86-4f51-8e3e-95279d5b0fd3","resolution":{"observed_at":"2026-08-08T22:55:55.131856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.111520Z","title":"A tutorial on spectral clustering","venue":null,"work_id":"49db0249-c315-417d-a18a-aa83c2a87959","year":2007},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.828348Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:6ba6dd4feb43d432c739a9685bede0e6a4a332788ab108046da50541a4c1f2e6","observation_id":"76aebb2b-30c2-41c2-95be-15067a3ca822","resolution":{"observed_at":"2026-08-08T22:55:55.116482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.832946Z","title":"The approximation of one matrix by another of lower rank.Psychometrika, 1(3):211–218, 1936","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.832946Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:0d802fb12bfdd0179a15fbc17732e3096e88b0bab8910fd746ceaaa180c264c5","observation_id":"b90fbf84-2836-4af6-ac2a-e83c92057513","resolution":{"observed_at":"2026-08-08T22:55:54.832946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.837814Z","title":"Exploring simple siamese representation learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.837814Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:87198a258267f4e5fb7dd0d8e93f48045d72962def73402019fd581fc0fd7eef","observation_id":"9808311a-d46c-459e-be37-a64dee734f15","resolution":{"observed_at":"2026-08-08T22:55:54.837814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.843377Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.843377Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:dfd3bd7c4bb2a18221b7cc9a6617d02b40ded739c15272c9ecc898a866593d7e","observation_id":"7776be14-d5b3-48db-b86e-aaaa847877bc","resolution":{"observed_at":"2026-08-08T22:55:54.843377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.064992Z","title":"Big self- supervised models are strong semi-supervised learners","venue":null,"work_id":"482b2ec1-6e8c-4067-811a-75660faec185","year":2020},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.850417Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:a2f84f64d56900780ea6bb2a68d27b6b7fc9bd0c23d8f2aa8f892447b70abc2f","observation_id":"912f6844-2459-4574-943c-f609de36e696","resolution":{"observed_at":"2026-08-08T22:55:55.070329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.855734Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.855734Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:41f7a8a3eae4ca25f7482d42f859abf6a714280065436ec86f605581a39f624a","observation_id":"ae8306cf-ec83-4f14-9f81-9ade8851a821","resolution":{"observed_at":"2026-08-08T22:55:54.855734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.036749Z","title":"Error estimates for spectral convergence of the graph laplacian on random geometric graphs toward the laplace–beltrami operator","venue":null,"work_id":"fc6db37b-6dc4-4fcc-ad4b-64b7b3c710fa","year":2020},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.860816Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:12995a3917c92e052986ee1ea1f389d4c2c7243a9807843b30e14c9b3956d622","observation_id":"c6338f33-a16a-4cca-949c-9c0b790310ca","resolution":{"observed_at":"2026-08-08T22:55:55.042633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.019847Z","title":"The game theoretic p-laplacian and semi-supervised learning with few labels","venue":null,"work_id":"75d04aa5-9ad1-4c85-8f0d-1baab2a80669","year":2018},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.865818Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:6cd3210b1d1b7054c9087067b637186882725a9f884788d3e15ea287a8113e8c","observation_id":"9751e003-7066-473b-b680-b988926e9acf","resolution":{"observed_at":"2026-08-08T22:55:55.024836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:55.003695Z","title":"Large deviations for sums of partly dependent random variables","venue":null,"work_id":"c0c304c8-8b22-4c53-89b6-f078ea011c83","year":2004},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.870712Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:5f4a7886672e05d12ea732cdaf7c87219191062a17fa1534959260ea4e710f02","observation_id":"29e79fa3-bd78-481b-a45f-bc8d23448608","resolution":{"observed_at":"2026-08-08T22:55:55.009138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.988235Z","title":"Differential topology, volume 370","venue":null,"work_id":"fad7f642-7deb-4def-a2e4-bf670ebb01dc","year":2010},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.875281Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:fb3bdf516f0b5952384523c9798a8c6235023a463ca91262ea198aec167e9d22","observation_id":"188dac6c-f1a8-48a5-aa68-4b43bbb518cd","resolution":{"observed_at":"2026-08-08T22:55:54.992906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.971954Z","title":"Lectures on classical differential geometry","venue":null,"work_id":"28bddc37-a77b-4e34-a87e-d009b74f0555","year":1961},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.879829Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:7b1d87813be7bab092bc31aaa28890d1d3e1dfe7b8852c37d2b05d61a7e4d06b","observation_id":"5226737f-016a-4a17-9864-589a6db089b1","resolution":{"observed_at":"2026-08-08T22:55:54.977549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:55:54.953939Z","title":"first, second, third, fourth, fifth, sixth","venue":null,"work_id":"20eb9c39-fc01-423a-96d6-8532858c21ac","year":2022},"citing_paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T22:55:54.884663Z"},"links":{"citing_paper":"/paper/2502.04312"},"observation_digest":"sha256:7e6ae2075dfd29e26772f06fca190421c8f546072b4c23b9d2f1698b2339286c","observation_id":"58d466a3-bc67-49c4-8e87-fec5678b117d","resolution":{"observed_at":"2026-08-08T22:55:54.960662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04312","last_updated":"2025-07-04T13:24:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T22:31:41.627045Z","submitted_at":"2025-02-06T18:55:51Z","title":"Consistency of augmentation graph and network approximability in contrastive learning"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":33},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2502.04312."}