{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7YILNBSPFKJGI4CDSAJBZ2AH2M","short_pith_number":"pith:7YILNBSP","schema_version":"1.0","canonical_sha256":"fe10b6864f2a9264704390121ce807d33ca940b08fdc32ddfe6d286f63833d84","source":{"kind":"arxiv","id":"2210.03594","version":3},"attestation_state":"computed","paper":{"title":"Label Propagation with Weak Supervision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dylan Sam, Maria-Florina Balcan, Pradeep Ravikumar, Rattana Pukdee","submitted_at":"2022-10-07T14:53:02Z","abstract_excerpt":"Semi-supervised learning and weakly supervised learning are important paradigms that aim to reduce the growing demand for labeled data in current machine learning applications. In this paper, we introduce a novel analysis of the classical label propagation algorithm (LPA) (Zhu & Ghahramani, 2002) that moreover takes advantage of useful prior information, specifically probabilistic hypothesized labels on the unlabeled data. We provide an error bound that exploits both the local geometric properties of the underlying graph and the quality of the prior information. We also propose a framework to "},"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":"2210.03594","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-07T14:53:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0bb48b950908e09a960b1d5ca3af1a93a95442720e97a024d657ba7847ea2a12","abstract_canon_sha256":"cc4bdc583ca9f5bb454b8b1696d8fec05fc7d63ba9a0c60860b2ac6fd9da5cfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:21.530206Z","signature_b64":"h8yv0O3GIyJsOaGulXZXB0pG+Owc9glO4BAQMPrjR/dRieRTJgPZI74AJ7hYPeFj1Y8Wwno7zbYnLqeTrgpUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe10b6864f2a9264704390121ce807d33ca940b08fdc32ddfe6d286f63833d84","last_reissued_at":"2026-07-05T05:59:21.529769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:21.529769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Label Propagation with Weak Supervision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dylan Sam, Maria-Florina Balcan, Pradeep Ravikumar, Rattana Pukdee","submitted_at":"2022-10-07T14:53:02Z","abstract_excerpt":"Semi-supervised learning and weakly supervised learning are important paradigms that aim to reduce the growing demand for labeled data in current machine learning applications. In this paper, we introduce a novel analysis of the classical label propagation algorithm (LPA) (Zhu & Ghahramani, 2002) that moreover takes advantage of useful prior information, specifically probabilistic hypothesized labels on the unlabeled data. We provide an error bound that exploits both the local geometric properties of the underlying graph and the quality of the prior information. We also propose a framework to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03594","kind":"arxiv","version":3},"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/2210.03594/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":"2210.03594","created_at":"2026-07-05T05:59:21.529826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.03594v3","created_at":"2026-07-05T05:59:21.529826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03594","created_at":"2026-07-05T05:59:21.529826+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YILNBSPFKJG","created_at":"2026-07-05T05:59:21.529826+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YILNBSPFKJGI4CD","created_at":"2026-07-05T05:59:21.529826+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YILNBSP","created_at":"2026-07-05T05:59:21.529826+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22375","citing_title":"Exploiting Vision Language Model for Training-Free 3D Point Cloud OOD Detection via Graph Score Propagation","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M","json":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M.json","graph_json":"https://pith.science/api/pith-number/7YILNBSPFKJGI4CDSAJBZ2AH2M/graph.json","events_json":"https://pith.science/api/pith-number/7YILNBSPFKJGI4CDSAJBZ2AH2M/events.json","paper":"https://pith.science/paper/7YILNBSP"},"agent_actions":{"view_html":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M","download_json":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M.json","view_paper":"https://pith.science/paper/7YILNBSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.03594&json=true","fetch_graph":"https://pith.science/api/pith-number/7YILNBSPFKJGI4CDSAJBZ2AH2M/graph.json","fetch_events":"https://pith.science/api/pith-number/7YILNBSPFKJGI4CDSAJBZ2AH2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M/action/storage_attestation","attest_author":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M/action/author_attestation","sign_citation":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M/action/citation_signature","submit_replication":"https://pith.science/pith/7YILNBSPFKJGI4CDSAJBZ2AH2M/action/replication_record"}},"created_at":"2026-07-05T05:59:21.529826+00:00","updated_at":"2026-07-05T05:59:21.529826+00:00"}