{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HQWXQRWLJG3IXURFNAQB2I4Q7L","short_pith_number":"pith:HQWXQRWL","schema_version":"1.0","canonical_sha256":"3c2d7846cb49b68bd22568201d2390fac50b02e2eb22712826f1b35ad35508bf","source":{"kind":"arxiv","id":"1505.00290","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for Lipschitz Learning on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.MG"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Daniel A. Spielman, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2015-05-01T22:30:45Z","abstract_excerpt":"We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large $p$ of $p$-Laplacian regularization. We present an algorithm that computes a minimal Lipschitz extension in expected linear time, and an algorithm that computes an absolutely minimal Lipschitz extension in expected time $\\widetilde{O} (m n)$. The latter algorithm has variants that seem to run much faster i"},"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":"1505.00290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-01T22:30:45Z","cross_cats_sorted":["cs.DS","math.MG"],"title_canon_sha256":"27b90dadf051659e2fb1453105469872e8d3680f27a4dba48407cbcc2b18165c","abstract_canon_sha256":"3cb172d000504de967b431c3ce92666565c16e169a74cb442b3a99bfa5bd4a38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:34.655667Z","signature_b64":"MC5J2yZYfbDeW97RaIaEQdJ+Jt4pMnRijTLmK3xJMCdncMfKa0+QHLmd0m6fPwrg43WU64o9rg4Ye4tm8loeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c2d7846cb49b68bd22568201d2390fac50b02e2eb22712826f1b35ad35508bf","last_reissued_at":"2026-05-18T01:37:34.655130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:34.655130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Lipschitz Learning on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.MG"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Daniel A. Spielman, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2015-05-01T22:30:45Z","abstract_excerpt":"We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large $p$ of $p$-Laplacian regularization. We present an algorithm that computes a minimal Lipschitz extension in expected linear time, and an algorithm that computes an absolutely minimal Lipschitz extension in expected time $\\widetilde{O} (m n)$. The latter algorithm has variants that seem to run much faster i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00290","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1505.00290","created_at":"2026-05-18T01:37:34.655215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00290v2","created_at":"2026-05-18T01:37:34.655215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00290","created_at":"2026-05-18T01:37:34.655215+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQWXQRWLJG3I","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQWXQRWLJG3IXURF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQWXQRWL","created_at":"2026-05-18T12:29:25.134429+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/HQWXQRWLJG3IXURFNAQB2I4Q7L","json":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L.json","graph_json":"https://pith.science/api/pith-number/HQWXQRWLJG3IXURFNAQB2I4Q7L/graph.json","events_json":"https://pith.science/api/pith-number/HQWXQRWLJG3IXURFNAQB2I4Q7L/events.json","paper":"https://pith.science/paper/HQWXQRWL"},"agent_actions":{"view_html":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L","download_json":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L.json","view_paper":"https://pith.science/paper/HQWXQRWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00290&json=true","fetch_graph":"https://pith.science/api/pith-number/HQWXQRWLJG3IXURFNAQB2I4Q7L/graph.json","fetch_events":"https://pith.science/api/pith-number/HQWXQRWLJG3IXURFNAQB2I4Q7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L/action/storage_attestation","attest_author":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L/action/author_attestation","sign_citation":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L/action/citation_signature","submit_replication":"https://pith.science/pith/HQWXQRWLJG3IXURFNAQB2I4Q7L/action/replication_record"}},"created_at":"2026-05-18T01:37:34.655215+00:00","updated_at":"2026-05-18T01:37:34.655215+00:00"}