{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NNSGIXGZRNYXEUYWSQDCUH5URE","short_pith_number":"pith:NNSGIXGZ","canonical_record":{"source":{"id":"1806.01547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T08:23:42Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"f7866ab7cb29e95ddcfce6e7cce01bf9cf317fa2245592c208743c223c19a027","abstract_canon_sha256":"0a003b0a47d4dc19ba15ff80444f531397375a943e430d8a005e26eb75f0b752"},"schema_version":"1.0"},"canonical_sha256":"6b64645cd98b7172531694062a1fb48921bd7e8671f5a712433413d6abad5c1a","source":{"kind":"arxiv","id":"1806.01547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01547","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01547v2","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01547","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"NNSGIXGZRNYX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNSGIXGZRNYXEUYW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNSGIXGZ","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NNSGIXGZRNYXEUYWSQDCUH5URE","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T08:23:42Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"f7866ab7cb29e95ddcfce6e7cce01bf9cf317fa2245592c208743c223c19a027","abstract_canon_sha256":"0a003b0a47d4dc19ba15ff80444f531397375a943e430d8a005e26eb75f0b752"},"schema_version":"1.0"},"canonical_sha256":"6b64645cd98b7172531694062a1fb48921bd7e8671f5a712433413d6abad5c1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:11.028188Z","signature_b64":"z1jlCv891UM0Cd89EM54+CBFyvBg7g6G77+kqaBPzQQe+O5SF8Ax27RRB8Mg/Ss6YE+CfxQlYp16edpty2T7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b64645cd98b7172531694062a1fb48921bd7e8671f5a712433413d6abad5c1a","last_reissued_at":"2026-05-18T00:11:11.027548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:11.027548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01547","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:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2F7vgzC8DO6wFM+OcAcpLbTw9ps81pZzJYxEl7J0TpJWOOQIjNb7hkzbwzR9G9Tk+s3qmui5OX5FLcb+/cYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:25:30.932179Z"},"content_sha256":"3ddbb65ccc71af9e0f67405bfe03ba73dedc69e21d75f572c42630fcaf0ad2aa","schema_version":"1.0","event_id":"sha256:3ddbb65ccc71af9e0f67405bfe03ba73dedc69e21d75f572c42630fcaf0ad2aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NNSGIXGZRNYXEUYWSQDCUH5URE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Supervised Clustering with Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankita Shukla, Gullal Singh Cheema, Saket Anand","submitted_at":"2018-06-05T08:23:42Z","abstract_excerpt":"Clustering using neural networks has recently demonstrated promising performance in machine learning and computer vision applications. However, the performance of current approaches is limited either by unsupervised learning or their dependence on large set of labeled data samples. In this paper, we propose ClusterNet that uses pairwise semantic constraints from very few labeled data samples (<5% of total data) and exploits the abundant unlabeled data to drive the clustering approach. We define a new loss function that uses pairwise semantic similarity between objects combined with constrained"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01547","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:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lv3OWZd1CN+GDObcaDSfDrAMXzpqGTiA5WtfrUext1voOKyhtyiTQEXjLlNCkQzhjAGympqCWW0OikGk7tbMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:25:30.932917Z"},"content_sha256":"8bb3fd98cf3de79f33185d84c7db4a3c7026a27060efcdb41788cc7e31c6790a","schema_version":"1.0","event_id":"sha256:8bb3fd98cf3de79f33185d84c7db4a3c7026a27060efcdb41788cc7e31c6790a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNSGIXGZRNYXEUYWSQDCUH5URE/bundle.json","state_url":"https://pith.science/pith/NNSGIXGZRNYXEUYWSQDCUH5URE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNSGIXGZRNYXEUYWSQDCUH5URE/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-27T06:25:30Z","links":{"resolver":"https://pith.science/pith/NNSGIXGZRNYXEUYWSQDCUH5URE","bundle":"https://pith.science/pith/NNSGIXGZRNYXEUYWSQDCUH5URE/bundle.json","state":"https://pith.science/pith/NNSGIXGZRNYXEUYWSQDCUH5URE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNSGIXGZRNYXEUYWSQDCUH5URE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NNSGIXGZRNYXEUYWSQDCUH5URE","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":"0a003b0a47d4dc19ba15ff80444f531397375a943e430d8a005e26eb75f0b752","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T08:23:42Z","title_canon_sha256":"f7866ab7cb29e95ddcfce6e7cce01bf9cf317fa2245592c208743c223c19a027"},"schema_version":"1.0","source":{"id":"1806.01547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01547","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01547v2","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01547","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"NNSGIXGZRNYX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNSGIXGZRNYXEUYW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNSGIXGZ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:8bb3fd98cf3de79f33185d84c7db4a3c7026a27060efcdb41788cc7e31c6790a","target":"graph","created_at":"2026-05-18T00:11:11Z","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":"Clustering using neural networks has recently demonstrated promising performance in machine learning and computer vision applications. However, the performance of current approaches is limited either by unsupervised learning or their dependence on large set of labeled data samples. In this paper, we propose ClusterNet that uses pairwise semantic constraints from very few labeled data samples (<5% of total data) and exploits the abundant unlabeled data to drive the clustering approach. We define a new loss function that uses pairwise semantic similarity between objects combined with constrained","authors_text":"Ankita Shukla, Gullal Singh Cheema, Saket Anand","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T08:23:42Z","title":"Semi-Supervised Clustering with Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01547","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:3ddbb65ccc71af9e0f67405bfe03ba73dedc69e21d75f572c42630fcaf0ad2aa","target":"record","created_at":"2026-05-18T00:11:11Z","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":"0a003b0a47d4dc19ba15ff80444f531397375a943e430d8a005e26eb75f0b752","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T08:23:42Z","title_canon_sha256":"f7866ab7cb29e95ddcfce6e7cce01bf9cf317fa2245592c208743c223c19a027"},"schema_version":"1.0","source":{"id":"1806.01547","kind":"arxiv","version":2}},"canonical_sha256":"6b64645cd98b7172531694062a1fb48921bd7e8671f5a712433413d6abad5c1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b64645cd98b7172531694062a1fb48921bd7e8671f5a712433413d6abad5c1a","first_computed_at":"2026-05-18T00:11:11.027548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:11.027548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1jlCv891UM0Cd89EM54+CBFyvBg7g6G77+kqaBPzQQe+O5SF8Ax27RRB8Mg/Ss6YE+CfxQlYp16edpty2T7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:11.028188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ddbb65ccc71af9e0f67405bfe03ba73dedc69e21d75f572c42630fcaf0ad2aa","sha256:8bb3fd98cf3de79f33185d84c7db4a3c7026a27060efcdb41788cc7e31c6790a"],"state_sha256":"957332633d06c7e58ed3499ec180a5f08c95edc612123466649dfb59c2a735d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ui5e9EHA9fYbI/N8UMc7qR64C+jL6c34k4RzVn/vuzMaN5EvNU2iNPkI3Y6sPvb7oD+0eyv03prctNwEfvAvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:25:30.936453Z","bundle_sha256":"af3fd00caad550d0e85eaa90ab8e23eca907f119f8e39ff7ed44f091e9f2cbb0"}}