{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AV3ZWY634YBX35KWCR6VYXOQNE","short_pith_number":"pith:AV3ZWY63","schema_version":"1.0","canonical_sha256":"05779b63dbe6037df556147d5c5dd069218b4244552e3c95c6167a6289002e61","source":{"kind":"arxiv","id":"1811.02314","version":1},"attestation_state":"computed","paper":{"title":"Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arun Venkitaraman, Pascal Frossard, Saikat Chatterjee","submitted_at":"2018-11-06T12:19:58Z","abstract_excerpt":"In presence of sparse noise we propose kernel regression for predicting output vectors which are smooth over a given graph. Sparse noise models the training outputs being corrupted either with missing samples or large perturbations. The presence of sparse noise is handled using appropriate use of $\\ell_1$-norm along-with use of $\\ell_2$-norm in a convex cost function. For optimization of the cost function, we propose an iteratively reweighted least-squares (IRLS) approach that is suitable for kernel substitution or kernel trick due to availability of a closed form solution. Simulations using r"},"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":"1811.02314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-06T12:19:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7e0c56f5b17cf86f95bb2916e1628be3ff7d57f9aef4c97f3c19e2da6c821dbd","abstract_canon_sha256":"390d212f5a1071d2d9415952f2300820a67568649c6445097e86dc92f115a5cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.577935Z","signature_b64":"x4aqBH/L7sxk8FMlpP9NeXoSI6oiZYxzd2KEkOkIIfSCSbI7R9vTEIwQ0081Rk4QKQlJ0DW1ltoEIhpVSSFDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05779b63dbe6037df556147d5c5dd069218b4244552e3c95c6167a6289002e61","last_reissued_at":"2026-05-18T00:01:24.577447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.577447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arun Venkitaraman, Pascal Frossard, Saikat Chatterjee","submitted_at":"2018-11-06T12:19:58Z","abstract_excerpt":"In presence of sparse noise we propose kernel regression for predicting output vectors which are smooth over a given graph. Sparse noise models the training outputs being corrupted either with missing samples or large perturbations. The presence of sparse noise is handled using appropriate use of $\\ell_1$-norm along-with use of $\\ell_2$-norm in a convex cost function. For optimization of the cost function, we propose an iteratively reweighted least-squares (IRLS) approach that is suitable for kernel substitution or kernel trick due to availability of a closed form solution. Simulations using r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02314","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":""},"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":"1811.02314","created_at":"2026-05-18T00:01:24.577519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02314v1","created_at":"2026-05-18T00:01:24.577519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02314","created_at":"2026-05-18T00:01:24.577519+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV3ZWY634YBX","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV3ZWY634YBX35KW","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV3ZWY63","created_at":"2026-05-18T12:32:13.499390+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/AV3ZWY634YBX35KWCR6VYXOQNE","json":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE.json","graph_json":"https://pith.science/api/pith-number/AV3ZWY634YBX35KWCR6VYXOQNE/graph.json","events_json":"https://pith.science/api/pith-number/AV3ZWY634YBX35KWCR6VYXOQNE/events.json","paper":"https://pith.science/paper/AV3ZWY63"},"agent_actions":{"view_html":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE","download_json":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE.json","view_paper":"https://pith.science/paper/AV3ZWY63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02314&json=true","fetch_graph":"https://pith.science/api/pith-number/AV3ZWY634YBX35KWCR6VYXOQNE/graph.json","fetch_events":"https://pith.science/api/pith-number/AV3ZWY634YBX35KWCR6VYXOQNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE/action/storage_attestation","attest_author":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE/action/author_attestation","sign_citation":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE/action/citation_signature","submit_replication":"https://pith.science/pith/AV3ZWY634YBX35KWCR6VYXOQNE/action/replication_record"}},"created_at":"2026-05-18T00:01:24.577519+00:00","updated_at":"2026-05-18T00:01:24.577519+00:00"}