{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCOGMCELVAGYBSP7RYQIK2VP4C","short_pith_number":"pith:DCOGMCEL","canonical_record":{"source":{"id":"1809.03073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-10T01:12:26Z","cross_cats_sorted":["cs.AI","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"e90f73a563958ed770f133bfa703c7be889781c2de55c018fc60d3b839e20227","abstract_canon_sha256":"215c71ef9af97d646d59b916e415449f80d396d04fda46cce94fc5471ec9c84d"},"schema_version":"1.0"},"canonical_sha256":"189c66088ba80d80c9ff8e20856aafe0aef4d2e0e4dfbbe92ceb92757b3c0d05","source":{"kind":"arxiv","id":"1809.03073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03073","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03073v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03073","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"DCOGMCELVAGY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCOGMCELVAGYBSP7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCOGMCEL","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCOGMCELVAGYBSP7RYQIK2VP4C","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-10T01:12:26Z","cross_cats_sorted":["cs.AI","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"e90f73a563958ed770f133bfa703c7be889781c2de55c018fc60d3b839e20227","abstract_canon_sha256":"215c71ef9af97d646d59b916e415449f80d396d04fda46cce94fc5471ec9c84d"},"schema_version":"1.0"},"canonical_sha256":"189c66088ba80d80c9ff8e20856aafe0aef4d2e0e4dfbbe92ceb92757b3c0d05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.148374Z","signature_b64":"ucsOw5dYtImbP0OGSdvD/72qNlRuV53dx4nWxaQegTQLIM9kdC4e9l1AYWwnbrGVobnJ5Yd5X+u0v1JBuMvCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"189c66088ba80d80c9ff8e20856aafe0aef4d2e0e4dfbbe92ceb92757b3c0d05","last_reissued_at":"2026-05-18T00:06:10.147731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.147731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03073","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQcEf7L03qhGJwcvHuXOpBtPSb/9pHnVHITHBWojpT1m5i9d167AgN1/RU8hpe6Py34vvKKGsfF5n3IeKRLjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:29:51.489644Z"},"content_sha256":"1770f57d59c622018115e8fd589b2a6726c12af2b2afd25c46c0077b12fb5356","schema_version":"1.0","event_id":"sha256:1770f57d59c622018115e8fd589b2a6726c12af2b2afd25c46c0077b12fb5356"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCOGMCELVAGYBSP7RYQIK2VP4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Complexity of Nonparametric Semi-Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Bryon Aragam, Chen Dan, Eric P. Xing, Liu Leqi, Pradeep Ravikumar","submitted_at":"2018-09-10T01:12:26Z","abstract_excerpt":"We study the sample complexity of semi-supervised learning (SSL) and introduce new assumptions based on the mismatch between a mixture model learned from unlabeled data and the true mixture model induced by the (unknown) class conditional distributions. Under these assumptions, we establish an $\\Omega(K\\log K)$ labeled sample complexity bound without imposing parametric assumptions, where $K$ is the number of classes. Our results suggest that even in nonparametric settings it is possible to learn a near-optimal classifier using only a few labeled samples. Unlike previous theoretical work which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03073","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fg4SaePMnPe5uueywqo8npK/J7GhFHd3yeqZFtblGQFlIDYFVkLyWdhYmizb6g8rhyK/CpOtt0PE9lUtj/vfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:29:51.490297Z"},"content_sha256":"85a4ed93d7691bc0f5a341a4251048b5427e96ca7a956c0ec5413554c8925524","schema_version":"1.0","event_id":"sha256:85a4ed93d7691bc0f5a341a4251048b5427e96ca7a956c0ec5413554c8925524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCOGMCELVAGYBSP7RYQIK2VP4C/bundle.json","state_url":"https://pith.science/pith/DCOGMCELVAGYBSP7RYQIK2VP4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCOGMCELVAGYBSP7RYQIK2VP4C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T16:29:51Z","links":{"resolver":"https://pith.science/pith/DCOGMCELVAGYBSP7RYQIK2VP4C","bundle":"https://pith.science/pith/DCOGMCELVAGYBSP7RYQIK2VP4C/bundle.json","state":"https://pith.science/pith/DCOGMCELVAGYBSP7RYQIK2VP4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCOGMCELVAGYBSP7RYQIK2VP4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCOGMCELVAGYBSP7RYQIK2VP4C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"215c71ef9af97d646d59b916e415449f80d396d04fda46cce94fc5471ec9c84d","cross_cats_sorted":["cs.AI","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-10T01:12:26Z","title_canon_sha256":"e90f73a563958ed770f133bfa703c7be889781c2de55c018fc60d3b839e20227"},"schema_version":"1.0","source":{"id":"1809.03073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03073","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03073v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03073","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"DCOGMCELVAGY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCOGMCELVAGYBSP7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCOGMCEL","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:85a4ed93d7691bc0f5a341a4251048b5427e96ca7a956c0ec5413554c8925524","target":"graph","created_at":"2026-05-18T00:06:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the sample complexity of semi-supervised learning (SSL) and introduce new assumptions based on the mismatch between a mixture model learned from unlabeled data and the true mixture model induced by the (unknown) class conditional distributions. Under these assumptions, we establish an $\\Omega(K\\log K)$ labeled sample complexity bound without imposing parametric assumptions, where $K$ is the number of classes. Our results suggest that even in nonparametric settings it is possible to learn a near-optimal classifier using only a few labeled samples. Unlike previous theoretical work which","authors_text":"Bryon Aragam, Chen Dan, Eric P. Xing, Liu Leqi, Pradeep Ravikumar","cross_cats":["cs.AI","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-10T01:12:26Z","title":"Sample Complexity of Nonparametric Semi-Supervised Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03073","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1770f57d59c622018115e8fd589b2a6726c12af2b2afd25c46c0077b12fb5356","target":"record","created_at":"2026-05-18T00:06:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"215c71ef9af97d646d59b916e415449f80d396d04fda46cce94fc5471ec9c84d","cross_cats_sorted":["cs.AI","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-10T01:12:26Z","title_canon_sha256":"e90f73a563958ed770f133bfa703c7be889781c2de55c018fc60d3b839e20227"},"schema_version":"1.0","source":{"id":"1809.03073","kind":"arxiv","version":1}},"canonical_sha256":"189c66088ba80d80c9ff8e20856aafe0aef4d2e0e4dfbbe92ceb92757b3c0d05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"189c66088ba80d80c9ff8e20856aafe0aef4d2e0e4dfbbe92ceb92757b3c0d05","first_computed_at":"2026-05-18T00:06:10.147731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:10.147731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ucsOw5dYtImbP0OGSdvD/72qNlRuV53dx4nWxaQegTQLIM9kdC4e9l1AYWwnbrGVobnJ5Yd5X+u0v1JBuMvCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:10.148374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1770f57d59c622018115e8fd589b2a6726c12af2b2afd25c46c0077b12fb5356","sha256:85a4ed93d7691bc0f5a341a4251048b5427e96ca7a956c0ec5413554c8925524"],"state_sha256":"74d0ead62b85a9e737bfb634dd23fef24b4ffb94bb0ca1d696acc1b7be00fd24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlzaesJ0742H7eA3lqJCmSw42NdSQdbQpq3KrXTt22gkIExW26O9hpY76DZJL+cmGbyZFWyzZEcfRW2UhBrIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:29:51.494562Z","bundle_sha256":"b8947ff65ae76a658b8f53e346b727095c349f60c7e82d2bbaf66be91379925d"}}