{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QBEOETSL26BG7NLETFGYWMUKQ2","short_pith_number":"pith:QBEOETSL","canonical_record":{"source":{"id":"2411.14728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-22T04:48:58Z","cross_cats_sorted":[],"title_canon_sha256":"ffcfa72459c79e5b576965a503fe48eb39a30f39876c98ba55590a1f7f338207","abstract_canon_sha256":"9120474ea7febd69088e8082ac6e176fc5a5f82d8786e81aaea2827c3fca6700"},"schema_version":"1.0"},"canonical_sha256":"8048e24e4bd7826fb564994d8b328a86b694ec55810664f959fc0aed88eaa0ab","source":{"kind":"arxiv","id":"2411.14728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14728","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14728v1","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14728","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"QBEOETSL26BG","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"pith_short_16","alias_value":"QBEOETSL26BG7NLE","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"pith_short_8","alias_value":"QBEOETSL","created_at":"2026-07-05T09:38:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QBEOETSL26BG7NLETFGYWMUKQ2","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-22T04:48:58Z","cross_cats_sorted":[],"title_canon_sha256":"ffcfa72459c79e5b576965a503fe48eb39a30f39876c98ba55590a1f7f338207","abstract_canon_sha256":"9120474ea7febd69088e8082ac6e176fc5a5f82d8786e81aaea2827c3fca6700"},"schema_version":"1.0"},"canonical_sha256":"8048e24e4bd7826fb564994d8b328a86b694ec55810664f959fc0aed88eaa0ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:56.371287Z","signature_b64":"XfEWxhGQ83Y0yjoxzCKl7pq8TGwdivSzuoT/OfuAkN4RZfYqjuwCD+YJmm7qLdEvvGvL+sv/QJzZ2Yy0RrSuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8048e24e4bd7826fb564994d8b328a86b694ec55810664f959fc0aed88eaa0ab","last_reissued_at":"2026-07-05T09:38:56.370769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:56.370769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14728","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-07-05T09:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzv8s5eQZnS7/9rWh9+KKpFtlB0duHkl2zAEZOMx2fMepe9IwOZdGi9AUlJHB9lWdgegohwSNwm0G5NP3CGwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:16:13.900474Z"},"content_sha256":"69ee8965d6bff1e36985219ff8a07cd2969dd7bd5eef5c07bfdd3a6eb57ffe2a","schema_version":"1.0","event_id":"sha256:69ee8965d6bff1e36985219ff8a07cd2969dd7bd5eef5c07bfdd3a6eb57ffe2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QBEOETSL26BG7NLETFGYWMUKQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"K-GBS3FCM -- KNN Graph-Based Safe Semi-Supervised Fuzzy C-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gabriel Santos, Marcelo Nascimento, Rita Julia","submitted_at":"2024-11-22T04:48:58Z","abstract_excerpt":"Clustering data using prior domain knowledge, starting from a partially labeled set, has recently been widely investigated. Often referred to as semi-supervised clustering, this approach leverages labeled data to enhance clustering accuracy. To maximize algorithm performance, it is crucial to ensure the safety of this prior knowledge. Methods addressing this concern are termed safe semi-supervised clustering (S3C) algorithms. This paper introduces the KNN graph-based safety-aware semi-supervised fuzzy c-means algorithm (K-GBS3FCM), which dynamically assesses neighborhood relationships between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14728","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14728/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vlyowb6KQ/NKBkkauyAlEWBp7nRDJE3Ll9JG71x7wnsYlmV9xpJUxxgWX6p8bJQzLKf2qj0K3f2UcVSTxJ5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:16:13.900862Z"},"content_sha256":"5d8dd7f76cc5c563645ab49f66f47ae1913cce14219ca8e0ef7a64095995c52b","schema_version":"1.0","event_id":"sha256:5d8dd7f76cc5c563645ab49f66f47ae1913cce14219ca8e0ef7a64095995c52b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBEOETSL26BG7NLETFGYWMUKQ2/bundle.json","state_url":"https://pith.science/pith/QBEOETSL26BG7NLETFGYWMUKQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBEOETSL26BG7NLETFGYWMUKQ2/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-08-12T23:16:13Z","links":{"resolver":"https://pith.science/pith/QBEOETSL26BG7NLETFGYWMUKQ2","bundle":"https://pith.science/pith/QBEOETSL26BG7NLETFGYWMUKQ2/bundle.json","state":"https://pith.science/pith/QBEOETSL26BG7NLETFGYWMUKQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBEOETSL26BG7NLETFGYWMUKQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QBEOETSL26BG7NLETFGYWMUKQ2","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":"9120474ea7febd69088e8082ac6e176fc5a5f82d8786e81aaea2827c3fca6700","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-22T04:48:58Z","title_canon_sha256":"ffcfa72459c79e5b576965a503fe48eb39a30f39876c98ba55590a1f7f338207"},"schema_version":"1.0","source":{"id":"2411.14728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14728","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14728v1","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14728","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"QBEOETSL26BG","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"pith_short_16","alias_value":"QBEOETSL26BG7NLE","created_at":"2026-07-05T09:38:56Z"},{"alias_kind":"pith_short_8","alias_value":"QBEOETSL","created_at":"2026-07-05T09:38:56Z"}],"graph_snapshots":[{"event_id":"sha256:5d8dd7f76cc5c563645ab49f66f47ae1913cce14219ca8e0ef7a64095995c52b","target":"graph","created_at":"2026-07-05T09:38:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.14728/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering data using prior domain knowledge, starting from a partially labeled set, has recently been widely investigated. Often referred to as semi-supervised clustering, this approach leverages labeled data to enhance clustering accuracy. To maximize algorithm performance, it is crucial to ensure the safety of this prior knowledge. Methods addressing this concern are termed safe semi-supervised clustering (S3C) algorithms. This paper introduces the KNN graph-based safety-aware semi-supervised fuzzy c-means algorithm (K-GBS3FCM), which dynamically assesses neighborhood relationships between ","authors_text":"Gabriel Santos, Marcelo Nascimento, Rita Julia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-22T04:48:58Z","title":"K-GBS3FCM -- KNN Graph-Based Safe Semi-Supervised Fuzzy C-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14728","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:69ee8965d6bff1e36985219ff8a07cd2969dd7bd5eef5c07bfdd3a6eb57ffe2a","target":"record","created_at":"2026-07-05T09:38:56Z","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":"9120474ea7febd69088e8082ac6e176fc5a5f82d8786e81aaea2827c3fca6700","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-22T04:48:58Z","title_canon_sha256":"ffcfa72459c79e5b576965a503fe48eb39a30f39876c98ba55590a1f7f338207"},"schema_version":"1.0","source":{"id":"2411.14728","kind":"arxiv","version":1}},"canonical_sha256":"8048e24e4bd7826fb564994d8b328a86b694ec55810664f959fc0aed88eaa0ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8048e24e4bd7826fb564994d8b328a86b694ec55810664f959fc0aed88eaa0ab","first_computed_at":"2026-07-05T09:38:56.370769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:56.370769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XfEWxhGQ83Y0yjoxzCKl7pq8TGwdivSzuoT/OfuAkN4RZfYqjuwCD+YJmm7qLdEvvGvL+sv/QJzZ2Yy0RrSuCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:56.371287Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69ee8965d6bff1e36985219ff8a07cd2969dd7bd5eef5c07bfdd3a6eb57ffe2a","sha256:5d8dd7f76cc5c563645ab49f66f47ae1913cce14219ca8e0ef7a64095995c52b"],"state_sha256":"d675e092ab5ee635c113d7da4e6f4163378af5431afc313499c4258a7c873c30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGlj+Cq2VU/pnQxYWAVZa+rxkbH5EoWW2e0A5cac87Qqb+xg6BZrjfgBC6vl/R7SCWiu8wEd+ZOwfyVmzE9eBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:16:13.903295Z","bundle_sha256":"b5d3ae4a3e0d2090c64198ccd261885bbdf98a3a9729a75c3fae3863767fc616"}}