{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3S6OMSUEPAI6SOGD6H2IEQTMWG","short_pith_number":"pith:3S6OMSUE","schema_version":"1.0","canonical_sha256":"dcbce64a847811e938c3f1f482426cb1947ad15eebb104d34e2c9bd0ea1e5f5d","source":{"kind":"arxiv","id":"1611.04924","version":2},"attestation_state":"computed","paper":{"title":"Robust Semi-Supervised Graph Classifier Learning with Negative Edge Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chia-Wen Lin, Gene Cheung, Weng-Tai Su, Yu Mao","submitted_at":"2016-11-15T16:36:29Z","abstract_excerpt":"In a semi-supervised learning scenario, (possibly noisy) partially observed labels are used as input to train a classifier, in order to assign labels to unclassified samples. In this paper, we study this classifier learning problem from a graph signal processing (GSP) perspective. Specifically, by viewing a binary classifier as a piecewise constant graph-signal in a high-dimensional feature space, we cast classifier learning as a signal restoration problem via a classical maximum a posteriori (MAP) formulation. Unlike previous graph-signal restoration works, we consider in addition edges with "},"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":"1611.04924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-15T16:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"c3bc2d01deafc6927e3ccf404390dc4d40391ce1c2faa952c9bc4e4ff47e5545","abstract_canon_sha256":"16ccc27ba582fa69abb0ccceed7c6f987d37ca4d50f49ddd6bbd97705b7f15fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:56.870277Z","signature_b64":"MJecEXahQM3rXdHjdk8cCbIdCqaU4SWYmW2fjmtPUWoG5h/xBTx/cE9yQpdiWbnN5GfsvG+n5A2Zg4Yo29ahAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcbce64a847811e938c3f1f482426cb1947ad15eebb104d34e2c9bd0ea1e5f5d","last_reissued_at":"2026-05-18T00:39:56.869797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:56.869797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Semi-Supervised Graph Classifier Learning with Negative Edge Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chia-Wen Lin, Gene Cheung, Weng-Tai Su, Yu Mao","submitted_at":"2016-11-15T16:36:29Z","abstract_excerpt":"In a semi-supervised learning scenario, (possibly noisy) partially observed labels are used as input to train a classifier, in order to assign labels to unclassified samples. In this paper, we study this classifier learning problem from a graph signal processing (GSP) perspective. Specifically, by viewing a binary classifier as a piecewise constant graph-signal in a high-dimensional feature space, we cast classifier learning as a signal restoration problem via a classical maximum a posteriori (MAP) formulation. Unlike previous graph-signal restoration works, we consider in addition edges with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04924","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":"1611.04924","created_at":"2026-05-18T00:39:56.869881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04924v2","created_at":"2026-05-18T00:39:56.869881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04924","created_at":"2026-05-18T00:39:56.869881+00:00"},{"alias_kind":"pith_short_12","alias_value":"3S6OMSUEPAI6","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3S6OMSUEPAI6SOGD","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3S6OMSUE","created_at":"2026-05-18T12:29:55.572404+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/3S6OMSUEPAI6SOGD6H2IEQTMWG","json":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG.json","graph_json":"https://pith.science/api/pith-number/3S6OMSUEPAI6SOGD6H2IEQTMWG/graph.json","events_json":"https://pith.science/api/pith-number/3S6OMSUEPAI6SOGD6H2IEQTMWG/events.json","paper":"https://pith.science/paper/3S6OMSUE"},"agent_actions":{"view_html":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG","download_json":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG.json","view_paper":"https://pith.science/paper/3S6OMSUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04924&json=true","fetch_graph":"https://pith.science/api/pith-number/3S6OMSUEPAI6SOGD6H2IEQTMWG/graph.json","fetch_events":"https://pith.science/api/pith-number/3S6OMSUEPAI6SOGD6H2IEQTMWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG/action/storage_attestation","attest_author":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG/action/author_attestation","sign_citation":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG/action/citation_signature","submit_replication":"https://pith.science/pith/3S6OMSUEPAI6SOGD6H2IEQTMWG/action/replication_record"}},"created_at":"2026-05-18T00:39:56.869881+00:00","updated_at":"2026-05-18T00:39:56.869881+00:00"}