{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2J3IJBM6GYN2XEEMYFHYTGM2HH","short_pith_number":"pith:2J3IJBM6","canonical_record":{"source":{"id":"1806.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-07T13:41:56Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"fe9896df248e3a2bbf41e50be46a657966cd01c22f2c26a3be6679256a86dad3","abstract_canon_sha256":"939006cedd86603a3a54740241e85b60718685e72a9b284476685963d461752e"},"schema_version":"1.0"},"canonical_sha256":"d27684859e361bab908cc14f89999a39cb731edef07bb14574ad153081b84066","source":{"kind":"arxiv","id":"1806.02679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02679","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02679v2","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02679","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"2J3IJBM6GYN2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2J3IJBM6GYN2XEEM","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2J3IJBM6","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2J3IJBM6GYN2XEEMYFHYTGM2HH","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-07T13:41:56Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"fe9896df248e3a2bbf41e50be46a657966cd01c22f2c26a3be6679256a86dad3","abstract_canon_sha256":"939006cedd86603a3a54740241e85b60718685e72a9b284476685963d461752e"},"schema_version":"1.0"},"canonical_sha256":"d27684859e361bab908cc14f89999a39cb731edef07bb14574ad153081b84066","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:35.523603Z","signature_b64":"ZpoHdVFJk7Rph+1xMKB/Euw9zLyczmC7VKX5u+hzPG1u1W3LQkteVrEuMDebL68K88O69fDSIwU5djprenEvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d27684859e361bab908cc14f89999a39cb731edef07bb14574ad153081b84066","last_reissued_at":"2026-05-18T00:09:35.523162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:35.523162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02679","source_version":2,"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:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sjl4p3eaocG0+a9HxsnD0MKRDFS/kEZlzhkvfA3+nI8vB6ro/aAcVNj1GB1ledxEQ0YxlhX2GdzBlGq8D2FTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:51:06.651876Z"},"content_sha256":"282a580b0f0f71fc0594dbf5e3f93bf57d73d3912e0dc2677beeca55f09d6e0e","schema_version":"1.0","event_id":"sha256:282a580b0f0f71fc0594dbf5e3f93bf57d73d3912e0dc2677beeca55f09d6e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2J3IJBM6GYN2XEEMYFHYTGM2HH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Supervised Learning via Compact Latent Space Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Nori, Antonio Criminisi, Ben Glocker, Daniel C. Castro, Daniel Rueckert, Ian Walker, Konstantinos Kamnitsas, Loic Le Folgoc, Ryutaro Tanno","submitted_at":"2018-06-07T13:41:56Z","abstract_excerpt":"We present a novel cost function for semi-supervised learning of neural networks that encourages compact clustering of the latent space to facilitate separation. The key idea is to dynamically create a graph over embeddings of labeled and unlabeled samples of a training batch to capture underlying structure in feature space, and use label propagation to estimate its high and low density regions. We then devise a cost function based on Markov chains on the graph that regularizes the latent space to form a single compact cluster per class, while avoiding to disturb existing clusters during optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02679","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"},"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:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWR50ccXOZiZs1E1N0DNMQ1iBmytcw3T+U7FkgVizwM2J+u/CYI2OJuJ3RNBqO18TnQWGO5DNoveAEx8dTWzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:51:06.652221Z"},"content_sha256":"56b6d485d0f0719df166a9276b842ae61d387a509ee7e19a3449f098ff7accc2","schema_version":"1.0","event_id":"sha256:56b6d485d0f0719df166a9276b842ae61d387a509ee7e19a3449f098ff7accc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH/bundle.json","state_url":"https://pith.science/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH/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-07-01T12:51:06Z","links":{"resolver":"https://pith.science/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH","bundle":"https://pith.science/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH/bundle.json","state":"https://pith.science/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2J3IJBM6GYN2XEEMYFHYTGM2HH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2J3IJBM6GYN2XEEMYFHYTGM2HH","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":"939006cedd86603a3a54740241e85b60718685e72a9b284476685963d461752e","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-07T13:41:56Z","title_canon_sha256":"fe9896df248e3a2bbf41e50be46a657966cd01c22f2c26a3be6679256a86dad3"},"schema_version":"1.0","source":{"id":"1806.02679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02679","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02679v2","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02679","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"2J3IJBM6GYN2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2J3IJBM6GYN2XEEM","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2J3IJBM6","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:56b6d485d0f0719df166a9276b842ae61d387a509ee7e19a3449f098ff7accc2","target":"graph","created_at":"2026-05-18T00:09:35Z","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 present a novel cost function for semi-supervised learning of neural networks that encourages compact clustering of the latent space to facilitate separation. The key idea is to dynamically create a graph over embeddings of labeled and unlabeled samples of a training batch to capture underlying structure in feature space, and use label propagation to estimate its high and low density regions. We then devise a cost function based on Markov chains on the graph that regularizes the latent space to form a single compact cluster per class, while avoiding to disturb existing clusters during optim","authors_text":"Aditya Nori, Antonio Criminisi, Ben Glocker, Daniel C. Castro, Daniel Rueckert, Ian Walker, Konstantinos Kamnitsas, Loic Le Folgoc, Ryutaro Tanno","cross_cats":["cs.CV","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-07T13:41:56Z","title":"Semi-Supervised Learning via Compact Latent Space Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02679","kind":"arxiv","version":2},"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:282a580b0f0f71fc0594dbf5e3f93bf57d73d3912e0dc2677beeca55f09d6e0e","target":"record","created_at":"2026-05-18T00:09:35Z","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":"939006cedd86603a3a54740241e85b60718685e72a9b284476685963d461752e","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-07T13:41:56Z","title_canon_sha256":"fe9896df248e3a2bbf41e50be46a657966cd01c22f2c26a3be6679256a86dad3"},"schema_version":"1.0","source":{"id":"1806.02679","kind":"arxiv","version":2}},"canonical_sha256":"d27684859e361bab908cc14f89999a39cb731edef07bb14574ad153081b84066","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d27684859e361bab908cc14f89999a39cb731edef07bb14574ad153081b84066","first_computed_at":"2026-05-18T00:09:35.523162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:35.523162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZpoHdVFJk7Rph+1xMKB/Euw9zLyczmC7VKX5u+hzPG1u1W3LQkteVrEuMDebL68K88O69fDSIwU5djprenEvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:35.523603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:282a580b0f0f71fc0594dbf5e3f93bf57d73d3912e0dc2677beeca55f09d6e0e","sha256:56b6d485d0f0719df166a9276b842ae61d387a509ee7e19a3449f098ff7accc2"],"state_sha256":"dacef0469aac8917dee4713e26f060632d4054a3ef28df83d5ef75d2da3f2df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jehu3JpG2eEEfHIcY1//IGNHTJtDKMGRyh23UFAnFj/xkRdheptajTsYnhaAyn+ATIygIhX75c5k9fgFDg9kCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:51:06.654210Z","bundle_sha256":"257dadc9291ae700f5ea5194cf788e6d21c268f6561a8dad194fe5618b41e436"}}