{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FQILULVRUAHRKQKBRRK7PHL7TD","short_pith_number":"pith:FQILULVR","schema_version":"1.0","canonical_sha256":"2c10ba2eb1a00f1541418c55f79d7f98d95d9ec4213068f4c02b8bfc09d35a1c","source":{"kind":"arxiv","id":"1706.00544","version":1},"attestation_state":"computed","paper":{"title":"Bias-Variance Tradeoff of Graph Laplacian Regularizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Pin-Yu Chen, Sijia Liu","submitted_at":"2017-06-02T03:28:50Z","abstract_excerpt":"This paper presents a bias-variance tradeoff of graph Laplacian regularizer, which is widely used in graph signal processing and semi-supervised learning tasks. The scaling law of the optimal regularization parameter is specified in terms of the spectral graph properties and a novel signal-to-noise ratio parameter, which suggests selecting a mediocre regularization parameter is often suboptimal. The analysis is applied to three applications, including random, band-limited, and multiple-sampled graph signals. Experiments on synthetic and real-world graphs demonstrate near-optimal performance of"},"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":"1706.00544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-02T03:28:50Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"ac66dbc03d4c8a5b525e1b2b2b3df8852d99e0f05d695d5b4f341221ac74fe5e","abstract_canon_sha256":"d321b75e844c3bd6de4172b45f757d76450e4bff45cbc281f0dbd4cc23670cef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:51.860910Z","signature_b64":"IvWAn/mfRx0dY29q1dI+aUbaF2ySC4O+I5mIWFgRaqKagU5OOLRLJpTpsx1wNzNanA0lrZz/c3aBEJ+PkADMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c10ba2eb1a00f1541418c55f79d7f98d95d9ec4213068f4c02b8bfc09d35a1c","last_reissued_at":"2026-05-18T00:38:51.860385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:51.860385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bias-Variance Tradeoff of Graph Laplacian Regularizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Pin-Yu Chen, Sijia Liu","submitted_at":"2017-06-02T03:28:50Z","abstract_excerpt":"This paper presents a bias-variance tradeoff of graph Laplacian regularizer, which is widely used in graph signal processing and semi-supervised learning tasks. The scaling law of the optimal regularization parameter is specified in terms of the spectral graph properties and a novel signal-to-noise ratio parameter, which suggests selecting a mediocre regularization parameter is often suboptimal. The analysis is applied to three applications, including random, band-limited, and multiple-sampled graph signals. Experiments on synthetic and real-world graphs demonstrate near-optimal performance of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00544","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":"1706.00544","created_at":"2026-05-18T00:38:51.860469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00544v1","created_at":"2026-05-18T00:38:51.860469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00544","created_at":"2026-05-18T00:38:51.860469+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQILULVRUAHR","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQILULVRUAHRKQKB","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQILULVR","created_at":"2026-05-18T12:31:15.632608+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/FQILULVRUAHRKQKBRRK7PHL7TD","json":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD.json","graph_json":"https://pith.science/api/pith-number/FQILULVRUAHRKQKBRRK7PHL7TD/graph.json","events_json":"https://pith.science/api/pith-number/FQILULVRUAHRKQKBRRK7PHL7TD/events.json","paper":"https://pith.science/paper/FQILULVR"},"agent_actions":{"view_html":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD","download_json":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD.json","view_paper":"https://pith.science/paper/FQILULVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00544&json=true","fetch_graph":"https://pith.science/api/pith-number/FQILULVRUAHRKQKBRRK7PHL7TD/graph.json","fetch_events":"https://pith.science/api/pith-number/FQILULVRUAHRKQKBRRK7PHL7TD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD/action/storage_attestation","attest_author":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD/action/author_attestation","sign_citation":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD/action/citation_signature","submit_replication":"https://pith.science/pith/FQILULVRUAHRKQKBRRK7PHL7TD/action/replication_record"}},"created_at":"2026-05-18T00:38:51.860469+00:00","updated_at":"2026-05-18T00:38:51.860469+00:00"}