{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FODWEKN42YSFUZLC5JOV4Q2IJE","short_pith_number":"pith:FODWEKN4","schema_version":"1.0","canonical_sha256":"2b876229bcd6245a6562ea5d5e43484916f02107edb3e566c950a750ee038826","source":{"kind":"arxiv","id":"1910.12976","version":2},"attestation_state":"computed","paper":{"title":"Shoestring: Graph-Based Semi-Supervised Learning with Severely Limited Labeled Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Baochun Li, Wanyu Lin, Zhaolin Gao","submitted_at":"2019-10-28T21:23:01Z","abstract_excerpt":"Graph-based semi-supervised learning has been shown to be one of the most effective approaches for classification tasks from a wide range of domains, such as image classification and text classification, as they can exploit the connectivity patterns between labeled and unlabeled samples to improve learning performance. In this work, we advance this effective learning paradigm towards a scenario where labeled data are severely limited. More specifically, we address the problem of graph-based semi-supervised learning in the presence of severely limited labeled samples, and propose a new framewor"},"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":"1910.12976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-10-28T21:23:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5d1837de48854cfdb1357d41344bf0cbe7c3c0808eb9d0331d177cb29cad45c9","abstract_canon_sha256":"b09c865876a66ebb48c13e8cbaa681c41cc603a9ebfbd797b52ba85823c6fc58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:51.913179Z","signature_b64":"HH4Nf6HBkNeXK8wEGtXJnRShiGXfa06AOPISEX2V5cADqku6A/5GAKmBQxHvNtFEmZjOy+FtuJZYAC3JqaKcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b876229bcd6245a6562ea5d5e43484916f02107edb3e566c950a750ee038826","last_reissued_at":"2026-07-05T00:53:51.912730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:51.912730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shoestring: Graph-Based Semi-Supervised Learning with Severely Limited Labeled Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Baochun Li, Wanyu Lin, Zhaolin Gao","submitted_at":"2019-10-28T21:23:01Z","abstract_excerpt":"Graph-based semi-supervised learning has been shown to be one of the most effective approaches for classification tasks from a wide range of domains, such as image classification and text classification, as they can exploit the connectivity patterns between labeled and unlabeled samples to improve learning performance. In this work, we advance this effective learning paradigm towards a scenario where labeled data are severely limited. More specifically, we address the problem of graph-based semi-supervised learning in the presence of severely limited labeled samples, and propose a new framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12976","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.12976/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":"1910.12976","created_at":"2026-07-05T00:53:51.912778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12976v2","created_at":"2026-07-05T00:53:51.912778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12976","created_at":"2026-07-05T00:53:51.912778+00:00"},{"alias_kind":"pith_short_12","alias_value":"FODWEKN42YSF","created_at":"2026-07-05T00:53:51.912778+00:00"},{"alias_kind":"pith_short_16","alias_value":"FODWEKN42YSFUZLC","created_at":"2026-07-05T00:53:51.912778+00:00"},{"alias_kind":"pith_short_8","alias_value":"FODWEKN4","created_at":"2026-07-05T00:53:51.912778+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/FODWEKN42YSFUZLC5JOV4Q2IJE","json":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE.json","graph_json":"https://pith.science/api/pith-number/FODWEKN42YSFUZLC5JOV4Q2IJE/graph.json","events_json":"https://pith.science/api/pith-number/FODWEKN42YSFUZLC5JOV4Q2IJE/events.json","paper":"https://pith.science/paper/FODWEKN4"},"agent_actions":{"view_html":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE","download_json":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE.json","view_paper":"https://pith.science/paper/FODWEKN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12976&json=true","fetch_graph":"https://pith.science/api/pith-number/FODWEKN42YSFUZLC5JOV4Q2IJE/graph.json","fetch_events":"https://pith.science/api/pith-number/FODWEKN42YSFUZLC5JOV4Q2IJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE/action/storage_attestation","attest_author":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE/action/author_attestation","sign_citation":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE/action/citation_signature","submit_replication":"https://pith.science/pith/FODWEKN42YSFUZLC5JOV4Q2IJE/action/replication_record"}},"created_at":"2026-07-05T00:53:51.912778+00:00","updated_at":"2026-07-05T00:53:51.912778+00:00"}