{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DTPJIA3GYI35PIUNQ2MWKSYZH5","short_pith_number":"pith:DTPJIA3G","canonical_record":{"source":{"id":"1901.09993","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-28T20:45:27Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d8e77e2124f7b3c121aacf0abb68f8c3f7d32a4de675f0af02d20fb6c666527c","abstract_canon_sha256":"542c7801785cebade08b86a441a62065d5ae884f52c095a33a547395f2edea65"},"schema_version":"1.0"},"canonical_sha256":"1cde940366c237d7a28d8699654b193f4f2157c0d36322b69621ffbd57abed5d","source":{"kind":"arxiv","id":"1901.09993","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09993","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09993v3","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09993","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"DTPJIA3GYI35","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DTPJIA3GYI35PIUN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DTPJIA3G","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DTPJIA3GYI35PIUNQ2MWKSYZH5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09993","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-28T20:45:27Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d8e77e2124f7b3c121aacf0abb68f8c3f7d32a4de675f0af02d20fb6c666527c","abstract_canon_sha256":"542c7801785cebade08b86a441a62065d5ae884f52c095a33a547395f2edea65"},"schema_version":"1.0"},"canonical_sha256":"1cde940366c237d7a28d8699654b193f4f2157c0d36322b69621ffbd57abed5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.565234Z","signature_b64":"uDs0ofDDpVlbgw+jTFdltOqKWOMf0oOqHmLTPl2HtPFWaVbCaIMA6EaOexNSpZzUj9mdbcjC4SazP6+nsxIwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cde940366c237d7a28d8699654b193f4f2157c0d36322b69621ffbd57abed5d","last_reissued_at":"2026-05-17T23:42:02.564640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.564640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09993","source_version":3,"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-17T23:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVAb9/6e6uWXb3xZ03ollbqhd5jUsJBmDnTSy/+S8dNpAnJl4VNSjs0Py7A4V5AX1/fqFG5ZhoQZZHx27PQxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:17:42.851342Z"},"content_sha256":"3803f70e15bb0ad82a900ad127e29ed80c780591a72b7f824d0486501c62ba76","schema_version":"1.0","event_id":"sha256:3803f70e15bb0ad82a900ad127e29ed80c780591a72b7f824d0486501c62ba76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DTPJIA3GYI35PIUNQ2MWKSYZH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Label Efficient Semi-Supervised Learning via Graph Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Liu, Qimai Li, Xiao-Ming Wu, Xiaotong Zhang, Zhichao Guan","submitted_at":"2019-01-28T20:45:27Z","abstract_excerpt":"Graph-based methods have been demonstrated as one of the most effective approaches for semi-supervised learning, as they can exploit the connectivity patterns between labeled and unlabeled data samples to improve learning performance. However, existing graph-based methods either are limited in their ability to jointly model graph structures and data features, such as the classical label propagation methods, or require a considerable amount of labeled data for training and validation due to high model complexity, such as the recent neural-network-based methods. In this paper, we address label e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09993","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":""},"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-17T23:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKUXStnWOVig07MTxMHg1VFkzfalqUY4weybVy+uGrKHZvVsn+pVBsMLUbkR89aNqR8uO3cf4kHbl6gR1DQvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:17:42.851900Z"},"content_sha256":"85045c9d14dfb5fe122b74f50abb0b77f02f882b6ac3fc34f3ccf9c2739a2db1","schema_version":"1.0","event_id":"sha256:85045c9d14dfb5fe122b74f50abb0b77f02f882b6ac3fc34f3ccf9c2739a2db1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5/bundle.json","state_url":"https://pith.science/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5/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-06-11T03:17:42Z","links":{"resolver":"https://pith.science/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5","bundle":"https://pith.science/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5/bundle.json","state":"https://pith.science/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTPJIA3GYI35PIUNQ2MWKSYZH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DTPJIA3GYI35PIUNQ2MWKSYZH5","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":"542c7801785cebade08b86a441a62065d5ae884f52c095a33a547395f2edea65","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-28T20:45:27Z","title_canon_sha256":"d8e77e2124f7b3c121aacf0abb68f8c3f7d32a4de675f0af02d20fb6c666527c"},"schema_version":"1.0","source":{"id":"1901.09993","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09993","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09993v3","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09993","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"DTPJIA3GYI35","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DTPJIA3GYI35PIUN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DTPJIA3G","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:85045c9d14dfb5fe122b74f50abb0b77f02f882b6ac3fc34f3ccf9c2739a2db1","target":"graph","created_at":"2026-05-17T23:42:02Z","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":"Graph-based methods have been demonstrated as one of the most effective approaches for semi-supervised learning, as they can exploit the connectivity patterns between labeled and unlabeled data samples to improve learning performance. However, existing graph-based methods either are limited in their ability to jointly model graph structures and data features, such as the classical label propagation methods, or require a considerable amount of labeled data for training and validation due to high model complexity, such as the recent neural-network-based methods. In this paper, we address label e","authors_text":"Han Liu, Qimai Li, Xiao-Ming Wu, Xiaotong Zhang, Zhichao Guan","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-28T20:45:27Z","title":"Label Efficient Semi-Supervised Learning via Graph Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09993","kind":"arxiv","version":3},"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:3803f70e15bb0ad82a900ad127e29ed80c780591a72b7f824d0486501c62ba76","target":"record","created_at":"2026-05-17T23:42:02Z","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":"542c7801785cebade08b86a441a62065d5ae884f52c095a33a547395f2edea65","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-28T20:45:27Z","title_canon_sha256":"d8e77e2124f7b3c121aacf0abb68f8c3f7d32a4de675f0af02d20fb6c666527c"},"schema_version":"1.0","source":{"id":"1901.09993","kind":"arxiv","version":3}},"canonical_sha256":"1cde940366c237d7a28d8699654b193f4f2157c0d36322b69621ffbd57abed5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cde940366c237d7a28d8699654b193f4f2157c0d36322b69621ffbd57abed5d","first_computed_at":"2026-05-17T23:42:02.564640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:02.564640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uDs0ofDDpVlbgw+jTFdltOqKWOMf0oOqHmLTPl2HtPFWaVbCaIMA6EaOexNSpZzUj9mdbcjC4SazP6+nsxIwCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:02.565234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09993","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3803f70e15bb0ad82a900ad127e29ed80c780591a72b7f824d0486501c62ba76","sha256:85045c9d14dfb5fe122b74f50abb0b77f02f882b6ac3fc34f3ccf9c2739a2db1"],"state_sha256":"b6f0b4951ccb10dd842828245033ff82baf2b7a7ca07099c1b74e8e4ce6d5deb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRbaE+6olUoaBuf5wC3fcy49kLrnHAW4s1EfO//8N/zuSl03rmLA08kFWc9lkTx61oAlveymop/ds8MC9vSqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:17:42.855575Z","bundle_sha256":"f834f5ec136d3385005f0cf8ee89c0f3e65f3b4c9a045859642344d33da1a792"}}