{"as_of":"2026-08-16T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5fd9a9f141910381ec5565480fac49833b383aa79f7fae9023d588f8c0cafcfa","coverage":[{"denominator":105,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:47:42.930411Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T02:34:45.089487Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T14:49:54.984753Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"cited_work":{"arxiv_id":"2510.25354","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2510.25354","snapshot_observed_at":"2026-07-20T02:18:21.174054Z","title":"Bertozzi, and Matthew Thorpe","venue":null,"work_id":"1417975f-f3f1-4152-83b5-ce9a6bfb3afa","year":null},"citing_paper":{"arxiv_id":"2606.27004","last_updated":"2026-06-25T13:20:14Z","snapshot_observed_at":"2026-08-13T12:10:00.726962Z","submitted_at":"2026-06-25T13:20:14Z","title":"Hidden critical and Morse equivalence behind duality: Theory and Applications","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-06-26T02:34:45.089487Z"},"links":{"cited_paper":"/paper/2510.25354","citing_paper":"/paper/2606.27004"},"observation_digest":"sha256:e565cf77893c6a93634b3c097a88803503377dcc6e60d72078693c97efd21c4f","observation_id":"cdfd6a9c-568a-4cf2-a50b-f6a5ab09b8bc","resolution":{"observed_at":"2026-07-20T02:18:21.174054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2510.25354/citation-record","integrity":"/paper/2510.25354/integrity","json":"/paper/2510.25354/citation-record.json","paper":"/paper/2510.25354"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:47:42.532484Z","title":"from the Computational Intelligence Group, University of the Basque Country","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.532484Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ce9334470cacec159feaf857dc6668a056844822926834c53cc1f14bca9bdb48","observation_id":"be82a4bc-1383-45a1-a3d1-77c70ba9e4eb","resolution":{"observed_at":"2026-08-15T15:47:42.532484Z","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-15T15:47:42.537744Z","title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.537744Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:f363ff3af7fe19dfe229f87e424619157f81f3fd79aaadcd2aa4ca55bb0ae926","observation_id":"af8be960-55b1-4f2e-b890-6f042e9c0613","resolution":{"observed_at":"2026-08-15T15:47:42.537744Z","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-15T15:47:42.541394Z","title":"Higher order learning with graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.541394Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:d87eeab99fee8b11dfdb3fe855fe7ea3d83157b71953806788da96b948d0dc94","observation_id":"5dabf6e6-86d8-46b0-ab9f-2fd32e4d5b08","resolution":{"observed_at":"2026-08-15T15:47:42.541394Z","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-15T15:47:42.545175Z","title":"Optical Recognition of Handwritten Digits","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.545175Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:627ff1c8c0cbddab77b8b81558e4b9d1905eb510b852268d46fa965d294ef0f3","observation_id":"a330b3c5-6e07-4117-8310-c89d86c8b11a","resolution":{"observed_at":"2026-08-15T15:47:42.545175Z","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-15T15:47:42.549160Z","title":"Using manifold structure for partially labelled classification","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.549160Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:1d15d503b020afbbea585214e1d7e0919dcf99436d01b0ce2a8d4f50b47415f9","observation_id":"c29aab51-7ab9-496a-bb29-061f23909925","resolution":{"observed_at":"2026-08-15T15:47:42.549160Z","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-15T15:47:42.552939Z","title":"Semi-supervised learning on Riemannian manifolds.Machine Learn- ing, 56(1):209–239, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.552939Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:e7e1329de78e483f8ff60d099f07a42bac2d5e46e5a474ad662e36f21524ad5b","observation_id":"8b33e8e0-960d-4eaf-8646-d9871c461bba","resolution":{"observed_at":"2026-08-15T15:47:42.552939Z","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-15T15:47:42.557111Z","title":"Convergence of Laplacian eigenmaps","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.557111Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:7b0886b99d4600683c3301cb613b90495c17f3cfd9750b8df2c0ba72685f9419","observation_id":"c1175530-9ec1-4634-a7a8-34b49a994658","resolution":{"observed_at":"2026-08-15T15:47:42.557111Z","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-15T15:47:42.560632Z","title":"Bertozzi and Arjuna Flenner","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.560632Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:3c1af1da2eef1f267de6f414aff74093842632307f5c1707e06cfba30db3c29c","observation_id":"65f54327-d284-4458-8268-6a800ef50442","resolution":{"observed_at":"2026-08-15T15:47:42.560632Z","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-15T15:47:42.564106Z","title":"Demystifying higher-order graph neural networks, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.564106Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:0002ff1820b08714cb95864411e0c9f40ba2c5622fb4d62053c43c3dd6605d8a","observation_id":"6c241682-281f-490d-b914-6301ce959abb","resolution":{"observed_at":"2026-08-15T15:47:42.564106Z","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-15T15:47:42.568501Z","title":"Another look at Sobolev spaces","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.568501Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:a1890a98cf4883db9cef59bc98741a8ed05543383a187f0969c16687c16dd793","observation_id":"c49c228b-4933-4bb6-a911-238a51b9edf9","resolution":{"observed_at":"2026-08-15T15:47:42.568501Z","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-15T15:47:42.573003Z","title":"Oxford University Press, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.573003Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:6b9b1a18a6683431ec76bc2bc6e1845665422acd2d4aebbc1360651e4358a6e3","observation_id":"8f4d08d0-db46-46df-abcd-1af5f5846f2c","resolution":{"observed_at":"2026-08-15T15:47:42.573003Z","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-15T15:47:42.577233Z","title":"Springer New York, New York, NY , USA, 1 edition, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.577233Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:7cf9d656de3ef6070d886bfe13f194494c638cb72a5aa2d57b9ea92ceae11d58","observation_id":"69bec9af-c9d1-4bdf-bd8d-e9415a2df6be","resolution":{"observed_at":"2026-08-15T15:47:42.577233Z","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-15T15:47:42.581573Z","title":"Convergence rates for Poisson learning to a Poisson equation with measure data, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.581573Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:c0494384bd79ddb1c45a8e412e1ae5df0a0292ce97e5fa4c7a95bd4ddb1ebe50","observation_id":"b3da61c7-188c-4d09-a04a-05b63c89b8f8","resolution":{"observed_at":"2026-08-15T15:47:42.581573Z","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-15T15:47:42.585049Z","title":"Uniform convergence rates for lipschitz learning on graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.585049Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:16473f3921ffcf88daaae72eec0a11c775147cbfbe6e78ac35fb5b28b31b8763","observation_id":"b0a373a3-09d0-47f5-83f7-b1439c349e85","resolution":{"observed_at":"2026-08-15T15:47:42.585049Z","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-15T15:47:42.588825Z","title":"The game theoretic p-Laplacian and semi-supervised learning with few labels.Nonlinearity, 32(1):301, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.588825Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:5c632049097b20eb4cb421239adea185fe954fb21055a791b149fccb6c386f0d","observation_id":"3653d72b-7061-47b4-a404-ea8ed66ff717","resolution":{"observed_at":"2026-08-15T15:47:42.588825Z","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-15T15:47:42.592754Z","title":"Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data.SIAM Journal on Mathematics of Data Science, 1(4):780–812, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.592754Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:9cdb789ba4885dcd015f783053c2993d3c6e8b79240dc89073c371d6bfff980d","observation_id":"0960b557-f2b8-4197-a588-43227efc03e7","resolution":{"observed_at":"2026-08-15T15:47:42.592754Z","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-15T15:47:42.596630Z","title":"Poisson learning: Graph based semi- supervised learning at very low label rates","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.596630Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:8471bcd5db5145132301bbca381437ed0787f3264454e96ebebe57bc21a469bc","observation_id":"b38e4311-678f-4178-95b8-afa997f92f0b","resolution":{"observed_at":"2026-08-15T15:47:42.596630Z","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-15T15:47:42.600288Z","title":"Improved spectral convergence rates for graph Laplacians on ε-graphs andk−nngraphs.Applied and Computational Harmonic Analysis, 60:123–175, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.600288Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:c1f828ee9889084f9f25ae5ed2fe504f655e62f287c043f13cf5263a03f118e7","observation_id":"8c806d58-c955-46d2-a95e-9d1939baa1a7","resolution":{"observed_at":"2026-08-15T15:47:42.600288Z","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-15T15:47:42.603953Z","title":"Properly-weighted graph Laplacian for semi-supervised learning.Ap- plied Mathematics & Optimization, 82(3):1111–1159, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.603953Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:4dae62a761994ae1de783bafc7d3a24a6dab3a6d85250e1b2b9d6753846123db","observation_id":"19f6e304-5907-4889-9dad-f396b845171c","resolution":{"observed_at":"2026-08-15T15:47:42.603953Z","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-15T15:47:42.607759Z","title":"Rates of convergence for Laplacian semi-supervised learning with low labeling rates.Research in the Mathematical Sciences, 10(1):10, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.607759Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:fd6902bb83abdead8cea4b3348fd3081eb8eaf7e996b93ce736d242084f3f8eb","observation_id":"2584db28-4c87-4007-88f5-11243f0028c1","resolution":{"observed_at":"2026-08-15T15:47:42.607759Z","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-15T15:47:42.611231Z","title":"Mumford–Shah functionals on graphs and their asymptotics.Nonlinearity, 33(8):3846–3888, jun 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.611231Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ed3072dd9a52ff37d40936516945615a17d18b7fb6a99bec1cb5608ed0cf6fb0","observation_id":"18a5410f-a904-4a17-b21f-726718258ba5","resolution":{"observed_at":"2026-08-15T15:47:42.611231Z","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-15T15:47:42.615464Z","title":"Dynamic hypergraph convolutional network for no-reference point cloud quality assessment.IEEE Trans","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.615464Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:3e66b1a9e48b2462281216abca022e12de6006a5a89caa029ea2548e80b38b69","observation_id":"9fa30aff-4cd6-4afa-8797-20d177ec3423","resolution":{"observed_at":"2026-08-15T15:47:42.615464Z","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-15T15:47:42.619364Z","title":"Random walks on hypergraphs with edge-dependent vertex weights","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.619364Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:822dac3b4ec1fa985dc56b4ada40713a5f72a0608ebe4e7774ed9fedcc2c2f9a","observation_id":"e82c3ab1-ee1d-411b-87c5-1c6790b7474a","resolution":{"observed_at":"2026-08-15T15:47:42.619364Z","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-15T15:47:42.623117Z","title":"Coifman and Stéphane Lafon","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.623117Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:5095f18e4d7b234943a4ceb939a6bcea1f6613e5b41f4080d49c4c9e55e3b31a","observation_id":"64e70189-0f26-4cfd-b3f6-b2b8d06c9d41","resolution":{"observed_at":"2026-08-15T15:47:42.623117Z","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-15T15:47:42.626910Z","title":"Large data limit for a phase transition model with the p- Laplacian on point clouds.European Journal of Applied Mathematics, 31(2):185–231, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.626910Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:60c003d9c615f07a215fb1e92477f811750823c2ca3d6fc3c9db2d0bdc950e92","observation_id":"dee17270-c568-449a-9dd3-d0d5a3fe62c0","resolution":{"observed_at":"2026-08-15T15:47:42.626910Z","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-15T15:47:42.630942Z","title":"Large data and zero noise limits of graph-based semi-supervised learning algorithms.Applied and Computational Harmonic Analysis, 49(2):655–697, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.630942Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:d01b575080bdb5a79cb65ab02d92a6fb76ee16a85cf14b84321d97af5e291b05","observation_id":"4f34e21f-1bd0-4609-bd80-ff66ece1af72","resolution":{"observed_at":"2026-08-15T15:47:42.630942Z","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-15T15:47:43.842489Z","title":"Wainwright, and Michael I","venue":null,"work_id":"a344d421-1d3a-4c72-b462-33831fc5b618","year":2016},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.634898Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:db9ebf5af27ab749147ce0dc519491abc5312cb58a348ebaba737babb180751c","observation_id":"13b821ad-f102-4a40-aca0-0fe9ebc943ff","resolution":{"observed_at":"2026-08-15T15:47:43.846683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08697","last_updated":"2020-10-17T02:02:53Z","snapshot_observed_at":"2026-08-15T04:01:41.802443Z","submitted_at":"2020-10-17T02:02:53Z","title":"Continuum limit of $p$-Laplacian evolution problems on graphs:$L^q$ graphons and sparse graphs","version":1},"cited_work":{"arxiv_id":"2010.08697","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.08697","snapshot_observed_at":"2026-08-15T15:47:43.029949Z","title":"Continuum limit of $p$-Laplacian evolution problems on graphs:$L^q$ graphons and sparse graphs","venue":"math.AP","work_id":"b3108655-9694-4121-bfaa-c10a5159db88","year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.639115Z"},"links":{"cited_paper":"/paper/2010.08697","citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:4f47961fa61558479d4b20d37bc5e0163eabada86ed5f6ff6b8c3a26084e31ba","observation_id":"f0f8a7ba-7bf5-41d9-a887-93958f55ee71","resolution":{"observed_at":"2026-08-15T15:47:43.034116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.830101Z","title":null,"venue":null,"work_id":"a7125acc-ea7a-4ef1-bc65-c5799dbbef1b","year":1990},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.642786Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:c2365dcc6c98749bf5de75a8008e14fa3d21266205a8a5f930bf9bf93716ca42","observation_id":"03521f97-e8d9-4ef7-b6bf-af27069965d1","resolution":{"observed_at":"2026-08-15T15:47:43.834040Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.818523Z","title":"Hypergraph p-Laplacians, scale spaces, and infor- mation flow in networks","venue":null,"work_id":"533280a0-62c0-41a5-805c-30364bf3a189","year":null},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.646252Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:9985b598b5c914c8b34cbfc4a3f2a7c02d2540e728f5a98c6da3b0553d8de793","observation_id":"12b169fe-fe89-4997-844a-114bf20d0200","resolution":{"observed_at":"2026-08-15T15:47:43.822476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:42.653621Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.653621Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:37e22c7886b0b850add4243190e097edd4ffd0034ba66891fce97d9fd31e5d4f","observation_id":"f6d9ccf1-a72a-4b8a-a7d3-3360df1bac45","resolution":{"observed_at":"2026-08-15T15:47:42.653621Z","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-15T15:47:43.799912Z","title":"Analysis and algorithms forℓ p-based semi-supervised learning on graphs.Applied and Computational Harmonic Analysis, 60:77–122, 2022","venue":null,"work_id":"359ef3f3-2c3c-4e30-8c27-9b18ebd63acb","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.657223Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:256cccad995585a5b306f63df07f3d625985de0d1fcb4ecf95ae0b089974ef0f","observation_id":"79ff6b09-65cc-438c-8d03-673de766da55","resolution":{"observed_at":"2026-08-15T15:47:43.803865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.788557Z","title":"Visual-textual joint relevance learning for tag-based social image search.IEEE Transactions on Image Processing, 22(1):363–376, 2013","venue":null,"work_id":"b16d2d3d-8c38-474e-94d6-f9cfe9dec021","year":2013},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.660708Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ddcd03670cbf2666f03b8605dac62cd033acd52052b96ff145c06e49bc6cf95a","observation_id":"c7cbdee7-129e-4fa8-a1e7-2daae0fee3a1","resolution":{"observed_at":"2026-08-15T15:47:43.792484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.778194Z","title":"Hypergraph learning: Methods and practices.IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(5):2548– 2566, 2022","venue":null,"work_id":"edbe2801-c751-4dd5-8df7-c8afd4f813c2","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.664693Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:57d337f894f2722eab8ed524f5ed71cc67cc439c944ef2346aecfd351186aeb3","observation_id":"54051b8b-c36e-437d-be0e-d1993c195f6c","resolution":{"observed_at":"2026-08-15T15:47:43.782127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.767048Z","title":"Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace–Beltrami operator","venue":null,"work_id":"50041c9a-8ce9-4fc3-9fb5-57a817576735","year":2020},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.668570Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:5beef5bf499bd40952f7dff1660962e99672d7ecea029d5fde69c941e5afe073","observation_id":"87bffb1c-6bb8-48fb-8aa0-834e3769298b","resolution":{"observed_at":"2026-08-15T15:47:43.771247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.756477Z","title":"A new analytical approach to consistency and overfitting in regularized empirical risk minimization.European Journal of Applied Mathematics, 28(6):886–921, 2017","venue":null,"work_id":"1bfa2b8a-4970-4c69-93dd-6f56f8e52b7f","year":2017},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.672048Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:eb5f88fb78c97994bf5825b5eb0fa4cd8bbbb9d2f574245d861fbd0d256a0cba","observation_id":"aaebd2f5-fec1-4772-a4de-71de1b037bfd","resolution":{"observed_at":"2026-08-15T15:47:43.760204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.745608Z","title":"From graph cuts to isoperimetric inequali- ties: Convergence rates of Cheeger cuts on data clouds.Archive for Rational Mechanics and Analysis, 244(3):541–598, 2022","venue":null,"work_id":"36c37967-ab23-4669-ba4d-210761a44bd5","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.675738Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:8597178db2861f4e3fe895f4a86878ce4d59903fc27f515cc9800650cd9a8859","observation_id":"320526c8-1ab6-467d-a459-531c7060ab9e","resolution":{"observed_at":"2026-08-15T15:47:43.749526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.734493Z","title":"Rates of convergence for regression with the graph poly-Laplacian.Sampling Theory, Signal Processing, and Data Analysis, 21(2):35, 2023","venue":null,"work_id":"c412fe2b-535f-43d5-8270-52a438bc875f","year":2023},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.680548Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:aacfdf70d77cb6cfd59bf8be0e2780d466cebf0046a402c6cdd426d00a54ce57","observation_id":"a0253270-6d1b-4a4f-b3ee-d107f144438a","resolution":{"observed_at":"2026-08-15T15:47:43.738324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.723631Z","title":"Continuum limit of total variation on point clouds.Archive for Rational Mechanics and Analysis, 220(1):193–241, 2016","venue":null,"work_id":"d7421c43-51fd-4e7f-9260-2585d50c1ab3","year":2016},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.684797Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:b4de296d195b7d12900b52c168c4221bdc9bb3c338b9347d2714019ca6bd4fc7","observation_id":"a67030e3-4843-49da-a509-d37825f454cf","resolution":{"observed_at":"2026-08-15T15:47:43.727269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.711193Z","title":"A variational approach to the consistency of spectral cluster- ing.Applied and Computational Harmonic Analysis, 45(2):239–281, 2018","venue":null,"work_id":"d0ba9358-127e-4f80-9f7b-c734bc6fedbf","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.689391Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:100d1bd277dbb1c3e6105334931efc612093ccb75e1c52ecb2f1a307d246a01b","observation_id":"6a56472a-5b17-40ae-b7d8-95870aeb409b","resolution":{"observed_at":"2026-08-15T15:47:43.715357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.698361Z","title":"Estimating perimeter using graph cuts","venue":null,"work_id":"b804db5d-f8f7-41ac-90be-dbb7c3bfbb43","year":2017},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.693295Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:267b5104385970469d3b63864d6c9e455baccb40a5b50b16ce8565588667b09a","observation_id":"5abf0cbb-5626-4be3-b2a7-a970f2e8ea3f","resolution":{"observed_at":"2026-08-15T15:47:43.702933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.686840Z","title":"Con- sistency of Cheeger and ratio graph cuts.Journal of Machine Learning Research, 17(181):1–46, 2016","venue":null,"work_id":"3e83e2fe-43f7-43fa-9b4e-b0c7e975c421","year":2016},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.697387Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:275333d4540413e0c6bc40d4ac48e6a00444037d21a9d0e5aa01f616de36af32","observation_id":"eb84dff4-2e76-46f0-8a41-3c37d6c18b6c","resolution":{"observed_at":"2026-08-15T15:47:43.691195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.676436Z","title":"On the rate of convergence of empirical measures in∞- transportation distance.Canadian Journal of Mathematics, 67(6):1358–1383, 2015","venue":null,"work_id":"7028738a-8a12-40db-b25c-b9ecfa5b8105","year":2015},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.701835Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:0f1d66ca76ebb270c7e52275916d77b04f380eb26ad8ac6d9fba0bbab882506f","observation_id":"614dc041-b37b-4ef3-b3e6-77e0be77d9f3","resolution":{"observed_at":"2026-08-15T15:47:43.680095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.665797Z","title":"Diffusion improves graph learning","venue":null,"work_id":"d88d1fe3-fe75-4a7f-bb51-8d77bcb3809e","year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.705750Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:37e23ec733c28d66787fb787ee87b49d81325a6f4e0f13231e5bc8ad1368595e","observation_id":"00b99f36-7c5b-4d9a-a69d-2830e0d52b1c","resolution":{"observed_at":"2026-08-15T15:47:43.669647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.652905Z","title":"Consistency of spectral partitioning of uniform hypergraphs under planted partition model","venue":null,"work_id":"9dabeac7-6594-4985-8027-a3f6a9fa2288","year":2014},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.709592Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:87c8e36f80dceda11c60ce1aff019298e4873d8194a00690e579c4c3752b1fd4","observation_id":"938a3a34-10ea-445f-b043-95022ff03ba6","resolution":{"observed_at":"2026-08-15T15:47:43.657164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:42.713185Z","title":"Consistency of spectral hypergraph partitioning under planted partition model.The Annals of Statistics, 45(1):289–315, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.713185Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:51a2fa52ea94bcf48882f1bcc1526110e490e1916d1fbad38bfa910247ad8f0b","observation_id":"9e6a6239-b8f3-4c90-8c9d-5af0a1084f90","resolution":{"observed_at":"2026-08-15T15:47:42.713185Z","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-15T15:47:43.635085Z","title":"Institute of Mathematical Statistics, 2006","venue":null,"work_id":"83dc7857-bef1-45f1-9685-69738221a40f","year":2006},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.716645Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:cd920cd44a0ffb53e57bca1f8fad63ac5ea74d06b42f783fa35c2bbe985ac4ee","observation_id":"d37d2741-24e4-498d-955b-092e6a0e3f8a","resolution":{"observed_at":"2026-08-15T15:47:43.639210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.623499Z","title":"Monotone properties of random geometric graphs have sharp thresholds.The Annals of Applied Probability, 15:2535–2552, 2005","venue":null,"work_id":"7e3cad9a-5af6-45a7-951c-5431d9523914","year":2005},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.720216Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:effe2793ab96daee7d7201a4df672cfafc0e2c2ff8115b2b08be4e88caee4147","observation_id":"248993d9-fc8d-421a-9a3a-eac02431deeb","resolution":{"observed_at":"2026-08-15T15:47:43.627437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.612173Z","title":"Uniform convergence of adaptive graph-based regularization","venue":null,"work_id":"ab478c55-3548-45b5-ae6d-673fb58c6ecf","year":2006},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.723663Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:4ba80379a7ea73eb372f87b2eb6c7697bac54f4286ce2c18a966f6c358e9cec8","observation_id":"7868be8a-87c9-427e-be1a-07dc9d60b606","resolution":{"observed_at":"2026-08-15T15:47:43.615778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:42.727066Z","title":"Graph Laplacians and their convergence on random neighborhood graphs.Journal of Machine Learning Research, 8(6), 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.727066Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:601621200ada3d0347aa0a242448a67435f7cdc7b74fb7acfc313ffe2df37344","observation_id":"9262c1ef-04e2-4634-9b91-5a4c68da5974","resolution":{"observed_at":"2026-08-15T15:47:42.727066Z","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-15T15:47:43.594388Z","title":"From graphs to manifolds – weak and strong pointwise consistency of graph Laplacians","venue":null,"work_id":"2638b2a1-3ab6-41f3-8535-f3e4ee0bf476","year":2005},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.730843Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ea71d531cc9ce0e4477f05c1e6b566138bca2930ecbc0e226536af95d1233a5a","observation_id":"ae0f1aa6-fad2-4053-9bce-7c9598b80e44","resolution":{"observed_at":"2026-08-15T15:47:43.598228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.583025Z","title":"The total variation on hypergraphs - learning on hypergraphs revisited","venue":null,"work_id":"3ce82960-1e5d-4640-8e26-6ffc1d44e7d6","year":null},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.734212Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:347ad33246a75edc9a9386bd1950c4d041e82637ee8030938a5ae09e5c79a34d","observation_id":"ddafe08a-071d-48ab-b3a5-8b36f64d165d","resolution":{"observed_at":"2026-08-15T15:47:43.587004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.564133Z","title":"Hypergraph Laplace operators for chemical reaction networks.Ad- vances in Mathematics, 351:870–896, 2019","venue":null,"work_id":"22d4343f-8ad6-45f1-b502-5100d2277d60","year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.742489Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:fa0fed48ab617c778abea2555bc895fc3b81d05c82db6848ef1782e806a9eaea","observation_id":"b6bf8a62-f37e-41eb-ab0c-52ade4d5d373","resolution":{"observed_at":"2026-08-15T15:47:43.568426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.552719Z","title":"p-Laplace operators for oriented hypergraphs.Vietnam Journal of Mathematics, 50(2):323–358, 2022","venue":null,"work_id":"5a7030d3-11c8-41ae-91fa-f739aef7c74f","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.746565Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:8aec82f1f5514e55fc62c2cd28fd449329a72307c844a5653bb5538342e7dc1e","observation_id":"4dbc2d18-d47c-4180-8af7-a1586dea1480","resolution":{"observed_at":"2026-08-15T15:47:43.556576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.539746Z","title":"A survey of data-efficient graph learning","venue":null,"work_id":"003059c4-f600-4223-ad66-2e0f69e55b34","year":2024},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.750332Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:a562549f76092d225869a2c3a62202055e66c98342a32e2cfeafb9daa9eb1904","observation_id":"0fa17f07-0555-471b-a7fe-6ccd9a81ab85","resolution":{"observed_at":"2026-08-15T15:47:43.543657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.01414","last_updated":"2017-05-15T07:53:13Z","snapshot_observed_at":"2026-08-14T21:27:05.104192Z","submitted_at":"2016-12-05T16:04:38Z","title":"Semi-Supervised Learning via Sparse Label Propagation","version":4},"cited_work":{"arxiv_id":"1612.01414","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.01414","snapshot_observed_at":"2026-08-15T15:47:43.012398Z","title":"Semi-Supervised Learning via Sparse Label Propagation","venue":"cs.LG","work_id":"8dcd40f9-8cdd-4701-8761-bd7aa6dd7fce","year":2016},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.754943Z"},"links":{"cited_paper":"/paper/1612.01414","citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:64e5de5bfbefbcafaec87ad5fd9ceff71405f3ea8e4eb274dbfffa1178bffa50","observation_id":"5871fb97-92d8-416f-980d-f14b879e1289","resolution":{"observed_at":"2026-08-15T15:47:43.018721Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.528490Z","title":"Balakrishnan, and Norman L","venue":null,"work_id":"03fa593c-b02e-43aa-82b4-c497da9ddcfb","year":2000},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.759014Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:2a35de316b5da40b91e0e32829127161ed6def2133a3fdaf8a9e9352edc5654b","observation_id":"98ed9644-8c79-4370-a325-0ccd90c338e4","resolution":{"observed_at":"2026-08-15T15:47:43.532209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.516204Z","title":"Spielman","venue":null,"work_id":"5d07e2db-a078-4aab-a37c-c6328f79da2f","year":2015},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.763006Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:cfadbd74689c2f619cc04dbfda935ddd4be9c55fb0e7f1df95685ad017acc1db","observation_id":"d807347d-9ddb-4e27-acb7-df06119d954e","resolution":{"observed_at":"2026-08-15T15:47:43.520544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:42.766926Z","title":"Gradient-based learning applied to document recognition.Proceedings of the IEEE, 86(11):2278–2324, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.766926Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:b1a138609125d0d070793a4f53f2a83d95f27ebddb4f275804c05fb4b6829947","observation_id":"a4c86811-8de8-4e7a-9969-5a030d838b5f","resolution":{"observed_at":"2026-08-15T15:47:42.766926Z","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-15T15:47:43.497515Z","title":"Lee.Introduction to Smooth Manifolds, volume 218 ofGraduate Texts in Mathematics","venue":null,"work_id":"9199dad1-376f-4809-a21d-8931d8586c08","year":2012},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.770573Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:bee2f6bff8d3d06682cce2ff9e8a64ca7a33087341d4a9c02750e64190b7ff98","observation_id":"3884c121-bfe6-4477-879e-71af87998830","resolution":{"observed_at":"2026-08-15T15:47:43.501534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.485749Z","title":"Graduate studies in mathematics","venue":null,"work_id":"55800f7e-fd7e-4477-b383-14ed07f000f2","year":2017},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.774192Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:4354dd7f86ebbafa7b968c9237bbdb7969227576c7cc91cbdb2a4cd3c280d0c4","observation_id":"399ec832-0e3e-4be8-88d3-1de85349ace3","resolution":{"observed_at":"2026-08-15T15:47:43.489803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.474886Z","title":"Submodular hypergraphs: p-Laplacians, Cheeger inequalities and spec- tral clustering","venue":null,"work_id":"ddc6ac3e-684e-42ca-ab14-49deb94b27a3","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.778676Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:75a54bd9610bbd15c1e95c2a8ad747e76ec39682005dd799d4fb34595e24f12d","observation_id":"e33261a7-4241-4497-88c1-ef5f84222473","resolution":{"observed_at":"2026-08-15T15:47:43.478713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.463178Z","title":"A random matrix analysis and improvement of semi-supervised learning for large dimen- sional data.Journal of Machine Learning Research, 19(79):1–27, 2018","venue":null,"work_id":"d066902b-7460-49fc-9e38-7cb0011d5e68","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.782448Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ba2041f36eaf93f13cd56170481871274f4cd31c2b2b7a7b75db42109ab29914","observation_id":"16b64af8-c37d-4b89-b49e-24f315b20d80","resolution":{"observed_at":"2026-08-15T15:47:43.467189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.452212Z","title":"On the method of bounded differences","venue":null,"work_id":"10411c9a-da58-4e14-92a4-20571377e3a8","year":1989},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.786097Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:96ade6f40a93f1d2b491bcd8c6e0f1ba2051cdbd1f5ac871122cdcc9ec8467f6","observation_id":"cae27c0a-2033-4e0b-91d1-c462d926935e","resolution":{"observed_at":"2026-08-15T15:47:43.455725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.440331Z","title":"Multiscale Laplacian learning.Applied Intelligence, 53(12):15727–15746, nov 2022","venue":null,"work_id":"f33b7bba-a036-4cba-8e1b-e49d9a7c9232","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.789582Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:c2d43d4afcd752ef33c4c46cf178fffae6f23a68178ad13686a1556449b415ce","observation_id":"28e35194-20fb-4b28-ac42-954954c07fb5","resolution":{"observed_at":"2026-08-15T15:47:43.444562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.428377Z","title":"Bronstein","venue":null,"work_id":"59bb456d-8c58-42c1-ab95-4e9d34a6bc99","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.793398Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:8a062bef73c3381d89cd6115464326d60eb4a19c3ebf76b353264f573ec5a873","observation_id":"86adcb23-1fd2-4dc4-ba01-5b79f8d75393","resolution":{"observed_at":"2026-08-15T15:47:43.432979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.416513Z","title":"Random walks and Laplacians on hypergraphs: When do they match?Discrete Applied Mathematics, 317:26–41, 2022","venue":null,"work_id":"dd50b385-8ef6-41d3-aee1-d1885ca7fa1b","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.796834Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:998715ed83250d8151eb2139f7a5d240b67e0d6ededbd29ed027e28272916f01","observation_id":"fb034028-352e-4ce7-b96b-b086ddea79d2","resolution":{"observed_at":"2026-08-15T15:47:43.420704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.405863Z","title":"Semi-supervised learning with the graph Laplacian: The limit of infinite unlabelled data","venue":null,"work_id":"9586e475-384d-43d0-b51b-793e4aac1c8e","year":2009},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.801401Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:cebc997507e0147e5fff30569cd409e9fc48ce119c25c04667ff89909f908eb1","observation_id":"3fbb1407-d5ce-43b0-94e8-a875ba11c200","resolution":{"observed_at":"2026-08-15T15:47:43.409357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.394850Z","title":null,"venue":null,"work_id":"4e25ae20-993c-4099-9efd-3850a987a174","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.804910Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ae3cf527f08cf7fb951e7978e2a5139eed32839de6b05e3e01718732efa07168","observation_id":"98521e92-f453-4c03-9a6c-fb26486d53a8","resolution":{"observed_at":"2026-08-15T15:47:43.398428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.384663Z","title":"Consistency of Dirichlet partitions.SIAM Journal on Mathemat- ical Analysis, 49(5):4251–4274, 2017","venue":null,"work_id":"2ec97bfb-5547-4e23-be39-392e95c34106","year":2017},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.808684Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:60e0969e860da684215e9ded89865c65ea204c77cbc874099e41e5b1d2f3916f","observation_id":"63c1fb1a-554c-4c98-aa68-829d771e6d02","resolution":{"observed_at":"2026-08-15T15:47:43.388225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.374237Z","title":"Operator norm convergence of spectral clustering on level sets.Journal of Machine Learning Research, 12(12):385–416, 2011","venue":null,"work_id":"f989ef06-eab6-4dd6-8f0a-282b646a9924","year":2011},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.812166Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:271654c33a744074ff500b70b1a83ae43638c1f8d8587e2673dadf401fa1e284","observation_id":"8998ff55-e7ae-4acb-a429-91b6dcfef260","resolution":{"observed_at":"2026-08-15T15:47:43.378206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.363941Z","title":"Penrose.Random Geometric Graphs","venue":null,"work_id":"ef584489-4d7b-4adf-9a0e-e0c235f988a0","year":2003},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.815513Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:610512a5bd6646b96fd82f10b236d6b8f671457d88ed29cb092467768a421048","observation_id":"37676766-f27b-4ec5-b57f-6a559198d741","resolution":{"observed_at":"2026-08-15T15:47:43.367420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.353608Z","title":"Multi-task hypergraphs for semi-supervised learning using earth observations","venue":null,"work_id":"db7fe6ab-ea70-419b-8174-68db665227df","year":2023},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.819048Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:0b6754cf51c280771b184e7a0225e01634b88abf78cff61b44fd63eeaf8609fe","observation_id":"3ecf16a3-d6f5-4e39-ab4e-072a168830e2","resolution":{"observed_at":"2026-08-15T15:47:43.357411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.342784Z","title":null,"venue":null,"work_id":"69425b72-b624-414b-a2d8-c587b4f7868c","year":2004},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.822579Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:87303563680d467d61610cfeff35ce601b10134ba19f6aacfca3d5b23a142f23","observation_id":"0bc66c77-36a9-4f5d-8837-a667f876cd06","resolution":{"observed_at":"2026-08-15T15:47:43.346686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.332189Z","title":"Continuum limit of Lipschitz learning on graphs.Foundations of Com- putational Mathematics, pages 1–39, 2022","venue":null,"work_id":"12f84f76-81d0-45e1-8324-750dbaa1380d","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.826052Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:17d8eff62ab1f0f25e1239f4c3c442350c5bb5498e28d707b56eebaf18a30c30","observation_id":"74edd411-ee94-4fa6-94be-6cca4cefbf50","resolution":{"observed_at":"2026-08-15T15:47:43.336026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.320999Z","title":"Hypergraph p-Laplacian: a differential geometry view","venue":null,"work_id":"1cc6ab05-c098-4f9a-9254-93a5fa6d1d6b","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.829847Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:72559665a6b1609541d0f9a6fbd32d15c503cf8955a73d0ceb228e56337adba8","observation_id":"8a6b3e6c-fd54-4739-9bb1-c92283fe62b5","resolution":{"observed_at":"2026-08-15T15:47:43.324898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.308906Z","title":"Birkhäuser Basel, 2015","venue":null,"work_id":"6009d288-ea71-4db5-8aca-9a4718539aba","year":2015},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.833721Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ec8769fd3fb76c9c2eaca57c88f5f604fe1463a03f9943b307c9f69f7fe341a1","observation_id":"7562e5be-6aef-4ff9-8571-e059bf94b437","resolution":{"observed_at":"2026-08-15T15:47:43.313494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.296855Z","title":"Hypergraphp-Laplacian equations for data interpolation and semi- supervised learning.Journal of Scientific Computing, 103(3):93, 2025","venue":null,"work_id":"43825792-71bf-46f7-9cd0-4ed56ef50baa","year":2025},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.838453Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:59095f333ba7e848ec344f0264930172352d7571ecf42c92f360fdaf6cf762ec","observation_id":"087677d4-f258-47ee-9ccc-d0681b815b56","resolution":{"observed_at":"2026-08-15T15:47:43.301206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.286241Z","title":"Weighted nonlocal Laplacian on interpolation from sparse data.Journal of Scientific Computing, 73(2):1164–1177, 2017","venue":null,"work_id":"be654fde-088f-4353-a555-97d5245ea3aa","year":2017},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.842442Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:046176c097314238f1b383f75a96fb4ead4d591eb72bfe9df833fa5a36024230","observation_id":"276fc768-7fc8-48d2-8802-0a65ad7ff64c","resolution":{"observed_at":"2026-08-15T15:47:43.290097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.274959Z","title":"Generalization of the weighted nonlocal Laplacian in low dimensional manifold model.Journal of Scientific Computing, 75(2):638–656, 2018","venue":null,"work_id":"2fd8b427-00ed-45da-87b3-3b8e0d087f54","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.846748Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:418dfaae3c3bf657c970bef977035774e6fb23b4c29e5f061302446d3c303f53","observation_id":"4e77817b-ce34-4824-a3db-4356d431986c","resolution":{"observed_at":"2026-08-15T15:47:43.278847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.08622","last_updated":"2018-09-23T16:04:02Z","snapshot_observed_at":"2026-08-14T18:24:46.593426Z","submitted_at":"2018-09-23T16:04:02Z","title":"Error estimation of weighted nonlocal Laplacian on random point cloud","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.08622","snapshot_observed_at":"2026-08-15T15:47:42.850447Z","title":"Error estimation of weighted nonlocal Laplacian on random point cloud.arXiv preprint arXiv:1809.08622, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.850447Z"},"links":{"cited_paper":"/paper/1809.08622","citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:cbdebf9406885a6579d733fd00ee41f334e68f8a7ecab237e2db2ffe6dddfcfe","observation_id":"94d8454f-95d6-4702-81d9-f46589a93515","resolution":{"observed_at":"2026-08-15T15:47:42.850447Z","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-15T15:47:43.264234Z","title":"From graph to manifold Laplacian: The convergence rate.Applied and Computational Harmonic Analysis, 21:128–134, 2006","venue":null,"work_id":"82e37877-1b17-4f22-be3d-57401ec20d69","year":2006},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.854844Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:192b31beed6b3f8626d45b7f3a513f3db4376404b5ea767645a85bef027c87cb","observation_id":"55f88f41-a474-4690-9861-d278f90e4330","resolution":{"observed_at":"2026-08-15T15:47:43.268137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.253624Z","title":"Spectral convergence of the connection Laplacian from random sam- ples.Information and Inference: A Journal of the IMA, 6(1):58–123, 12 2016","venue":null,"work_id":"fbc3b371-e923-4b90-8a9f-3252bbd8a202","year":2016},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.858761Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:d39166b056bf99d81018abe725b13c1f49596558bb2d72e99b026b5a487a7e8c","observation_id":"8e702a16-34a8-45bb-bce6-5852a7e8ed5c","resolution":{"observed_at":"2026-08-15T15:47:43.257718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.242694Z","title":"Analysis ofp-Laplacian regularization in semisupervised learning","venue":null,"work_id":"075d5531-3f0f-440e-a11c-3bbc05d6f6aa","year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.862844Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:0a2c27481b2e293a41f58be93e4210b54788b5b4f3dfe476fccdb9d59bc59a04","observation_id":"32164272-d758-4c12-ab51-f2cb3c18fbc7","resolution":{"observed_at":"2026-08-15T15:47:43.246374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.230889Z","title":"Asymptotic analysis of the Ginzburg–Landau functional on point clouds.Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 149(2):387–427, 2019","venue":null,"work_id":"89667a0c-9952-419c-9042-617eadfe8576","year":2019},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.867244Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:574645e28c85e172d457834d715363bd28ac8e7cfc115ecf11c4217552090011","observation_id":"2fee5125-a856-401a-8335-2e7ad7da22ea","resolution":{"observed_at":"2026-08-15T15:47:43.234863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.219565Z","title":null,"venue":null,"work_id":"36f2ad8c-a998-473b-aac7-be820b01abc5","year":2010},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.871025Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:97b134c6f494c14bbd2d0b7f254cbe45b9061b891cec63081b635496d6540cd5","observation_id":"f366931e-a87c-4a05-8b3f-984b526f606c","resolution":{"observed_at":"2026-08-15T15:47:43.223379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.207985Z","title":"Gamma-convergence of graph Ginzburg–Landau functionals","venue":null,"work_id":"8b2c07fc-fc7b-4113-bbb8-a48f22c249fd","year":2012},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.874662Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:c4299e616619bea30314e379203bcc110ede9446cbe4267509d4d2f017d5d447","observation_id":"cf49ed71-2d2a-48c2-99c1-de329cf4d660","resolution":{"observed_at":"2026-08-15T15:47:43.211742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.195837Z","title":"Springer-Verlag Berlin Heidelberg, 2009","venue":null,"work_id":"0419b509-1b94-4c9e-a9fd-573c557cca63","year":2009},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.879029Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:9d3daa5284576ae6ef2ab55d75023704b78569af0c121d306100f13042fc1d0d","observation_id":"6775da43-8311-4381-b9d3-1088e986ba58","resolution":{"observed_at":"2026-08-15T15:47:43.200237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.182295Z","title":"A tutorial on spectral clustering.Statistics and Computing, 2007","venue":null,"work_id":"ae20f40b-a514-4e73-977d-4f50dee546e2","year":2007},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.883265Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:545247b4dd7b206be1e2a828db21999321c599dd934557fa9f7a67d51009d75c","observation_id":"71f1c8c6-ac65-45cd-ac5a-24513b17d6e5","resolution":{"observed_at":"2026-08-15T15:47:43.186881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.170474Z","title":"Consistency of spectral clustering.The Annals of Statistics, 36(2):555–586, 2008","venue":null,"work_id":"a8c4abc0-81db-4c6d-a144-c90e738353ff","year":2008},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.888226Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:c0f1aa287236e531d2fb53c3f184947d70ec3a18589106bee3c406360fd1b043","observation_id":"6056a296-10d8-4b7e-b166-ced987a9b5b4","resolution":{"observed_at":"2026-08-15T15:47:43.174245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.08110","last_updated":"2015-10-27T22:05:30Z","snapshot_observed_at":"2026-08-14T22:26:02.025874Z","submitted_at":"2015-10-27T22:05:30Z","title":"Spectral Convergence Rate of Graph Laplacian","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.08110","snapshot_observed_at":"2026-08-15T15:47:42.892099Z","title":"Spectral convergence rate of graph Laplacian.arXiv preprint arXiv:1510.08110, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.892099Z"},"links":{"cited_paper":"/paper/1510.08110","citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:cde5a53c8d3e59c89d40d73bf682be1c23a4da33ea4cac6f7389999c32a17d02","observation_id":"570eb041-5db3-491b-8268-a4e425c0853e","resolution":{"observed_at":"2026-08-15T15:47:42.892099Z","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-15T15:47:43.158966Z","title":"Higher-order regularization learning on hyper- graphs, 2025","venue":null,"work_id":"4b5c2410-31b8-46bd-b72a-6826669dece4","year":2025},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.896349Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:67ae1a3aaf48cdc6b224bbdaab33689b759cbff5aa8f878f4b0ab409a1adbc82","observation_id":"35744390-d6ce-4c76-8edc-d13fd1e8fe3d","resolution":{"observed_at":"2026-08-15T15:47:43.163051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.147698Z","title":"Discrete-to-continuum rates of convergence for non- local p-Laplacian evolution problems.Information and Inference: A Journal of the IMA, 13(4):iaae031, 11 2024","venue":null,"work_id":"1cd3e2ed-8aa0-4069-816d-4dac58ed2183","year":2024},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.901131Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:797c958177f2c577fe06edf053737c3b7ab39558edc5d672e8cf6cd7a37c5560","observation_id":"e34ffcd1-221f-4054-817a-d306a17ffbf4","resolution":{"observed_at":"2026-08-15T15:47:43.152006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.136627Z","title":"Consistency of fractional graph-Laplacian regularization in semisu- pervised learning with finite labels.SIAM Journal on Mathematical Analysis, 56(4):4253–4295, 2024","venue":null,"work_id":"eb65904c-db79-4647-9a31-e4e82a6ddc5f","year":2024},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.905691Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:a14a38702f6d8adf2c5af00f14213fcefd82201e1ef031f321e28c90b0abe349","observation_id":"7ebb504f-4b4a-4377-8346-a19736244458","resolution":{"observed_at":"2026-08-15T15:47:43.140602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:42.909489Z","title":"Graph learning: A survey.IEEE Transactions on Artificial Intelligence, 2(2):109–127, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.909489Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:a7077df617c2f9884653385e6f04e8a0e5f66f77b8142f2c6f20b000b31bdee2","observation_id":"7c5fa7a2-4c5d-496e-9f51-fa358cf939a1","resolution":{"observed_at":"2026-08-15T15:47:42.909489Z","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-15T15:47:43.118210Z","title":"Semi-supervised hypergraph node classification on hypergraph line expansion","venue":null,"work_id":"6e321d1a-8019-438b-a08e-ca6146f4ce86","year":2022},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.913648Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:22355ccc1b52abc6430adc6a0cc2f5c16e1005f13fba22ffa639a82de9054f24","observation_id":"1b3c0841-dff0-4fa8-a7e3-103562985d44","resolution":{"observed_at":"2026-08-15T15:47:43.121958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.106434Z","title":null,"venue":null,"work_id":"f70468ce-75e8-400d-a9c2-6df4057efa6e","year":1901},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.917954Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:ecbe9308ec3361d7839e9efd0ec524e395b7ddddb80452e74ee8f87f2b49fd6f","observation_id":"595ff13b-68b3-4875-9040-d98aab11862f","resolution":{"observed_at":"2026-08-15T15:47:43.110721Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.095761Z","title":"Dynamic hypergraph structure learning","venue":null,"work_id":"d28310d0-a54d-4953-b7a4-faa4e09b1dda","year":2018},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.922444Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:3bc1b08d6552f15a61239bfbb3691700efb83941aa27c19ee70d54bdef5d139c","observation_id":"5d1a387f-2b44-485c-9dce-187cf22bee54","resolution":{"observed_at":"2026-08-15T15:47:43.099458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:43.084448Z","title":"Semi-supervised learning on directed graphs","venue":null,"work_id":"aaed343f-ca77-43e8-bed4-e4fedce42990","year":2004},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.926679Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:f5e7f733a0a2d4e77c2a893b7b8f7a45c11247f7bb055c6f80462a6c7a0242ff","observation_id":"2026b506-1d74-4052-ad4a-e37e58a204ad","resolution":{"observed_at":"2026-08-15T15:47:43.088455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:47:42.930411Z","title":"Learning with hypergraphs: Clustering, classification, and embedding","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs","version":3},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T15:47:42.930411Z"},"links":{"citing_paper":"/paper/2510.25354"},"observation_digest":"sha256:31b963b73681205e4c3688b67c6bd9d991d9850198319e24e676598853d7d8df","observation_id":"7e9a592e-2cca-488b-be18-015e36ec6035","resolution":{"observed_at":"2026-08-15T15:47:42.930411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.25354","last_updated":"2026-07-17T10:54:27Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T15:38:01.757121Z","submitted_at":"2025-10-29T10:19:32Z","title":"Analysis of Semi-Supervised Learning on Hypergraphs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":2,"verified_fuzzy":59},"total_outbound_references":105},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 100 of 105 outbound references and 1 inbound Pith citation observation for arXiv:2510.25354."}