{"as_of":"2026-08-15T04:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b2fa25406e5b709edbf639f76cd1f5151470ee8182dee853a3907cfae1a011c","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T02:02:31.229058Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.03503/citation-record","integrity":"/paper/2607.03503/integrity","json":"/paper/2607.03503/citation-record.json","paper":"/paper/2607.03503"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.02041","last_updated":"2026-07-02T11:08:21Z","snapshot_observed_at":"2026-08-08T19:00:56.438664Z","submitted_at":"2026-07-02T11:08:21Z","title":"NLF: A Resistor-Network Framework and Linear-Time Solver for Convex Network-Flow Equilibria","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.02041","snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"cited_paper":"/paper/2607.02041","citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:d93a0a7467e4b03d91c538d3fc8df6ef86bdd190a182c5c3f0675dacbf1b8135","observation_id":"f5be5cfd-6324-4158-8405-1de58ccfc1d2","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Nadler, N","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:898db432ffa15f405e2c24c2678ae31fc130a1bce66fb7c0320e43420379290e","observation_id":"98dc7acd-9954-4e89-a1cd-85f4ff1412c2","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Slepˇ cev and M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:58391465c207af3a225fff5123cd9aa3b4dd61826fdb7e65647a0b9059068edb","observation_id":"3c2ef10b-989f-4911-9ca9-01680104ba85","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"El Alaoui, X","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:07655091f6bc81c3d18c5d4328b33cd15e1b6d1ae86acfc5e147fb049d338bb4","observation_id":"b5cf19a9-e592-4368-bf7d-f923d6b61360","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Calder,The game theoreticp-Laplacian and semi-supervised learning with few labels, Non- linearity, 32 (2019), pp","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:e5d3ac8c091fd6b27eaed8922ebcdb052133da2942e2147ea810db6298386329","observation_id":"29db2f77-b948-4f7f-97cd-72b79aad2148","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Calder, B","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:3a33ad846992ab0138e14310c4b4399831b3943f02a26e600419a3d3fd722d07","observation_id":"13286f5a-cac7-4cda-aa3d-176389378b56","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Flores, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:0cab7b696e16f412dfc88d25cee76129d433df11165ea8e44faee844d3bcd64b","observation_id":"c73fec47-8734-411f-be5e-cd89bba9e905","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Storn,The dual IRLS scheme for (hyper-)graphp-Laplacians andℓ p regression with large exponents, arXiv:2603.26061, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:a287f2f2543740c9d4b079df8c2e7bde59c5dcf94b46b5af2517b8be4d84b7ef","observation_id":"deb96915-456b-49ee-99a2-d658936bbece","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:f5aed9f46e044ea1ab019e2e602372bbebf0b44cb6438cb108d36fac363fc53e","observation_id":"fb88f87b-0aa3-4804-b4ce-2393303d7b4c","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:afdf15a4021b3b0947cbea609c04487c5841c70a05aa99afe8cd8bd18782c6f8","observation_id":"44beb2e1-6536-47a3-a237-d499ad1c4261","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Hein and J.-Y","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:ee163b438f7dbf0f700c8c545e1f6f6e2dd2daa66dc049d1c5ffa46de4c84fb2","observation_id":"e40029b4-ad60-4070-a9ef-fdadc78f053f","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:7500d141d234c8dbab43accfce536b2419606da25448cec2fbcb3847c63ee3db","observation_id":"78712db7-39a8-4cad-9467-42bea1e9e03d","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Kyng and S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:ed84aa1e86d594b505176bfa72b5e09e8d68e1457ea994723a82d97facb26abe","observation_id":"fd74be45-112c-46fd-aed5-4d21b3107d33","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:19233e2283e3e7e3c3fec5c59ef46a356d62aa863fdfc097c664cce521956383","observation_id":"499c32f6-067d-46fe-928e-38f52a4b02ed","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Nocedal and S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:0e26e83e6bec5453f357b20f5b2669cc5b7400ba3a5a95e76ee69680530afe73","observation_id":"5f8345d2-ce6e-4abe-acf7-0d9365201dfc","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:98e606a3de46cdc2e5d1b32a795fbf7055d993d674a4597d274c2a9465faa7e7","observation_id":"b7ccf9a1-6a1d-4c74-8e87-ddbb0a89ee8c","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.24791","last_updated":"2026-06-23T16:46:38Z","snapshot_observed_at":"2026-08-02T08:41:31.458081Z","submitted_at":"2026-06-23T16:46:38Z","title":"LAMG+: A Robust Lean Algebraic Multigrid Solver for Graph Laplacians","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.24791","snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"cited_paper":"/paper/2606.24791","citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:4b54c233559f89107798096668b26858d9012bfbc74651d5c69739b87b5cbb1e","observation_id":"2e6e9858-88dd-4c6a-8c43-3f97cccc9fec","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Huang, H","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:df0059b48762689f1a5708896d72fed8158c6163c5b43a4a8b00efa46dfe5e38","observation_id":"51cbb44d-b0ce-4630-bf84-8a21186e82a5","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16560","last_updated":"2024-06-12T05:05:02Z","snapshot_observed_at":"2026-08-13T05:40:46.470167Z","submitted_at":"2023-10-25T11:28:26Z","title":"Resurrecting Label Propagation for Graphs with Heterophily and Label Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16560","snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":"Cheng, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"cited_paper":"/paper/2310.16560","citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:3f2dadb584958863544c652dc2a68450cf76cdcd02803f7f9cb383d17897083a","observation_id":"63684015-0727-44aa-bd1c-4003626b058a","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:02:31.229058Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T02:02:31.229058Z"},"links":{"citing_paper":"/paper/2607.03503"},"observation_digest":"sha256:0922132117bf33b40fe832e68a48a8205d3b8b4e53c0d628b91965de7d0a19b2","observation_id":"91979ecf-6c66-41dc-8938-89fd6b02ab04","resolution":{"observed_at":"2026-07-12T02:02:31.229058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03503","last_updated":"2026-07-03T17:24:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T19:01:19.040794Z","submitted_at":"2026-07-03T17:24:15Z","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.03503."}