{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HAM5BTEOTDSWLND4663GUSVVCR","short_pith_number":"pith:HAM5BTEO","schema_version":"1.0","canonical_sha256":"3819d0cc8e98e565b47cf7b66a4ab5144c733d412d7a2d686e542dfb87cca687","source":{"kind":"arxiv","id":"2607.03503","version":1},"attestation_state":"computed","paper":{"title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Oren E. Livne","submitted_at":"2026-07-03T17:24:15Z","abstract_excerpt":"Graph-based semi-supervised learning (SSL) propagates a few labels over a similarity graph by minimizing a Dirichlet-type energy. The standard quadratic ($p=2$) energy reduces to a single graph-Laplacian solve, but it degenerates exactly where SSL is most useful when labels are scarce: gathering more unlabeled data drives the $p=2$ estimate to a near-constant function whenever $d\\ge2$ (Nadler-Srebro-Zhou). Well-posedness requires the nonlinear $p$-Laplacian energy with $p>d$. Existing solvers reduce this to a sequence of weighted Laplacian solves, but their reference implementations use a dire"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.03503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-03T17:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"32d5ae7d1ae3ac86fd844148f30d44569b5e65289e199b830444648e73231bbf","abstract_canon_sha256":"5e4e6e1047a4b832904eee2cc35a1d6df1467fd5b971b1b674e383ee24a08956"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:50.465513Z","signature_b64":"MwImuqtpLcFUgZgX8wZ/fRpN0Wet1yJ8bQn259jndPd8GYurClHsll0NSkIzWe3LVPiYFYKnkcxVd/7a4pOvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3819d0cc8e98e565b47cf7b66a4ab5144c733d412d7a2d686e542dfb87cca687","last_reissued_at":"2026-07-07T02:17:50.464818Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:50.464818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Oren E. Livne","submitted_at":"2026-07-03T17:24:15Z","abstract_excerpt":"Graph-based semi-supervised learning (SSL) propagates a few labels over a similarity graph by minimizing a Dirichlet-type energy. The standard quadratic ($p=2$) energy reduces to a single graph-Laplacian solve, but it degenerates exactly where SSL is most useful when labels are scarce: gathering more unlabeled data drives the $p=2$ estimate to a near-constant function whenever $d\\ge2$ (Nadler-Srebro-Zhou). Well-posedness requires the nonlinear $p$-Laplacian energy with $p>d$. Existing solvers reduce this to a sequence of weighted Laplacian solves, but their reference implementations use a dire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03503","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.03503/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.03503","created_at":"2026-07-07T02:17:50.464921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03503v1","created_at":"2026-07-07T02:17:50.464921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03503","created_at":"2026-07-07T02:17:50.464921+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAM5BTEOTDSW","created_at":"2026-07-07T02:17:50.464921+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAM5BTEOTDSWLND4","created_at":"2026-07-07T02:17:50.464921+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAM5BTEO","created_at":"2026-07-07T02:17:50.464921+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR","json":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR.json","graph_json":"https://pith.science/api/pith-number/HAM5BTEOTDSWLND4663GUSVVCR/graph.json","events_json":"https://pith.science/api/pith-number/HAM5BTEOTDSWLND4663GUSVVCR/events.json","paper":"https://pith.science/paper/HAM5BTEO"},"agent_actions":{"view_html":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR","download_json":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR.json","view_paper":"https://pith.science/paper/HAM5BTEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03503&json=true","fetch_graph":"https://pith.science/api/pith-number/HAM5BTEOTDSWLND4663GUSVVCR/graph.json","fetch_events":"https://pith.science/api/pith-number/HAM5BTEOTDSWLND4663GUSVVCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR/action/storage_attestation","attest_author":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR/action/author_attestation","sign_citation":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR/action/citation_signature","submit_replication":"https://pith.science/pith/HAM5BTEOTDSWLND4663GUSVVCR/action/replication_record"}},"created_at":"2026-07-07T02:17:50.464921+00:00","updated_at":"2026-07-07T02:17:50.464921+00:00"}