{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V4FI7STSR2ACYFAY5OF3DCH6GG","short_pith_number":"pith:V4FI7STS","schema_version":"1.0","canonical_sha256":"af0a8fca728e802c1418eb8bb188fe31a8aa175fe8028f54656a9f1d04fc9f45","source":{"kind":"arxiv","id":"1310.2959","version":2},"attestation_state":"computed","paper":{"title":"Scaling Graph-based Semi Supervised Learning to Large Number of Labels Using Count-Min Sketch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Partha Pratim Talukdar, William Cohen","submitted_at":"2013-10-10T20:30:06Z","abstract_excerpt":"Graph-based Semi-supervised learning (SSL) algorithms have been successfully used in a large number of applications. These methods classify initially unlabeled nodes by propagating label information over the structure of graph starting from seed nodes. Graph-based SSL algorithms usually scale linearly with the number of distinct labels (m), and require O(m) space on each node. Unfortunately, there exist many applications of practical significance with very large m over large graphs, demanding better space and time complexity. In this paper, we propose MAD-SKETCH, a novel graph-based SSL algori"},"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":"1310.2959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-10T20:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"7db2756058377821809b7d449bb0552e75418a79c19d5cf67fbe7023a73bc3ed","abstract_canon_sha256":"3388554e7500acca837bc3b198f4da41a56079670d40bb4d000544cfa218fd3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:35.577391Z","signature_b64":"QDD0JR4Qnq704zeSZu46RNuGl82F8pTltkQpwp6y1IJKrkgDSvGIrcBv2TlG7dDwT1plU+eocmzJE9N6PKuPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0a8fca728e802c1418eb8bb188fe31a8aa175fe8028f54656a9f1d04fc9f45","last_reissued_at":"2026-05-18T02:57:35.576721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:35.576721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Graph-based Semi Supervised Learning to Large Number of Labels Using Count-Min Sketch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Partha Pratim Talukdar, William Cohen","submitted_at":"2013-10-10T20:30:06Z","abstract_excerpt":"Graph-based Semi-supervised learning (SSL) algorithms have been successfully used in a large number of applications. These methods classify initially unlabeled nodes by propagating label information over the structure of graph starting from seed nodes. Graph-based SSL algorithms usually scale linearly with the number of distinct labels (m), and require O(m) space on each node. Unfortunately, there exist many applications of practical significance with very large m over large graphs, demanding better space and time complexity. In this paper, we propose MAD-SKETCH, a novel graph-based SSL algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2959","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":"1310.2959","created_at":"2026-05-18T02:57:35.576806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2959v2","created_at":"2026-05-18T02:57:35.576806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2959","created_at":"2026-05-18T02:57:35.576806+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4FI7STSR2AC","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4FI7STSR2ACYFAY","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4FI7STS","created_at":"2026-05-18T12:28:04.890932+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/V4FI7STSR2ACYFAY5OF3DCH6GG","json":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG.json","graph_json":"https://pith.science/api/pith-number/V4FI7STSR2ACYFAY5OF3DCH6GG/graph.json","events_json":"https://pith.science/api/pith-number/V4FI7STSR2ACYFAY5OF3DCH6GG/events.json","paper":"https://pith.science/paper/V4FI7STS"},"agent_actions":{"view_html":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG","download_json":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG.json","view_paper":"https://pith.science/paper/V4FI7STS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2959&json=true","fetch_graph":"https://pith.science/api/pith-number/V4FI7STSR2ACYFAY5OF3DCH6GG/graph.json","fetch_events":"https://pith.science/api/pith-number/V4FI7STSR2ACYFAY5OF3DCH6GG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG/action/storage_attestation","attest_author":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG/action/author_attestation","sign_citation":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG/action/citation_signature","submit_replication":"https://pith.science/pith/V4FI7STSR2ACYFAY5OF3DCH6GG/action/replication_record"}},"created_at":"2026-05-18T02:57:35.576806+00:00","updated_at":"2026-05-18T02:57:35.576806+00:00"}