{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JGJVN4XYNNEG3NM7G3RJEQT4PT","short_pith_number":"pith:JGJVN4XY","canonical_record":{"source":{"id":"1605.06422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-20T16:21:13Z","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"438336e2b4b1481537be2d623b516d398ad85fc156c9af8d573e65d15aef2e8d","abstract_canon_sha256":"b8536c83b419e5783117e7d0a9332213a387623d7b28198ff5c945cc19da9982"},"schema_version":"1.0"},"canonical_sha256":"499356f2f86b486db59f36e292427c7cf3417ad7ec49f868f4d430d7e92a06c5","source":{"kind":"arxiv","id":"1605.06422","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06422","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06422v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06422","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"JGJVN4XYNNEG","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JGJVN4XYNNEG3NM7","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JGJVN4XY","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JGJVN4XYNNEG3NM7G3RJEQT4PT","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-20T16:21:13Z","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"438336e2b4b1481537be2d623b516d398ad85fc156c9af8d573e65d15aef2e8d","abstract_canon_sha256":"b8536c83b419e5783117e7d0a9332213a387623d7b28198ff5c945cc19da9982"},"schema_version":"1.0"},"canonical_sha256":"499356f2f86b486db59f36e292427c7cf3417ad7ec49f868f4d430d7e92a06c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:14.485646Z","signature_b64":"+zLOXr0QhN2oAXnI7fJYFKdV3uBWK4m4dQ5yy4FMdqUf2IxdWjwiHO2QEua7Gcm+sRiovHWWhgF/EbQkb+k+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"499356f2f86b486db59f36e292427c7cf3417ad7ec49f868f4d430d7e92a06c5","last_reissued_at":"2026-05-18T00:12:14.485004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:14.485004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06422","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-18T00:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6qQh9KFvMkzvxUlxD6QmfvYliqA04bCC9upBC9ReEah7RHXJKDQ1BW10UXFvvqZAUj6ohb3t6q/bzxc4iEQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T01:33:05.678690Z"},"content_sha256":"c8b1aaeda1f4d886103f0369b136b0c23a7c1bcb614623c2208cea32c73c23a4","schema_version":"1.0","event_id":"sha256:c8b1aaeda1f4d886103f0369b136b0c23a7c1bcb614623c2208cea32c73c23a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JGJVN4XYNNEG3NM7G3RJEQT4PT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Randomized Semi-Supervised Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a, Marc Lelarge","submitted_at":"2016-05-20T16:21:13Z","abstract_excerpt":"We consider the problem of clustering partially labeled data from a minimal number of randomly chosen pairwise comparisons between the items. We introduce an efficient local algorithm based on a power iteration of the non-backtracking operator and study its performance on a simple model. For the case of two clusters, we give bounds on the classification error and show that a small error can be achieved from $O(n)$ randomly chosen measurements, where $n$ is the number of items in the dataset. Our algorithm is therefore efficient both in terms of time and space complexities. We also investigate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06422","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-18T00:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozCY6A33BTp73k9X13k3HpXRDlRu3JncxEVcjgmnpZK5ANbSq9iAz+iEGiD+7u0EPEv1OSxNCyhVQskYSdHQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T01:33:05.679059Z"},"content_sha256":"01ad8c484f94768ea498e1015c237ddbecd594dd325ce2a7c2c61482ee9ef4ea","schema_version":"1.0","event_id":"sha256:01ad8c484f94768ea498e1015c237ddbecd594dd325ce2a7c2c61482ee9ef4ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/bundle.json","state_url":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/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-02T01:33:05Z","links":{"resolver":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT","bundle":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/bundle.json","state":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JGJVN4XYNNEG3NM7G3RJEQT4PT","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":"b8536c83b419e5783117e7d0a9332213a387623d7b28198ff5c945cc19da9982","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-20T16:21:13Z","title_canon_sha256":"438336e2b4b1481537be2d623b516d398ad85fc156c9af8d573e65d15aef2e8d"},"schema_version":"1.0","source":{"id":"1605.06422","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06422","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06422v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06422","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"JGJVN4XYNNEG","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JGJVN4XYNNEG3NM7","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JGJVN4XY","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:01ad8c484f94768ea498e1015c237ddbecd594dd325ce2a7c2c61482ee9ef4ea","target":"graph","created_at":"2026-05-18T00:12:14Z","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 consider the problem of clustering partially labeled data from a minimal number of randomly chosen pairwise comparisons between the items. We introduce an efficient local algorithm based on a power iteration of the non-backtracking operator and study its performance on a simple model. For the case of two clusters, we give bounds on the classification error and show that a small error can be achieved from $O(n)$ randomly chosen measurements, where $n$ is the number of items in the dataset. Our algorithm is therefore efficient both in terms of time and space complexities. We also investigate ","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a, Marc Lelarge","cross_cats":["math.PR","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-20T16:21:13Z","title":"Fast Randomized Semi-Supervised Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06422","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:c8b1aaeda1f4d886103f0369b136b0c23a7c1bcb614623c2208cea32c73c23a4","target":"record","created_at":"2026-05-18T00:12:14Z","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":"b8536c83b419e5783117e7d0a9332213a387623d7b28198ff5c945cc19da9982","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-20T16:21:13Z","title_canon_sha256":"438336e2b4b1481537be2d623b516d398ad85fc156c9af8d573e65d15aef2e8d"},"schema_version":"1.0","source":{"id":"1605.06422","kind":"arxiv","version":3}},"canonical_sha256":"499356f2f86b486db59f36e292427c7cf3417ad7ec49f868f4d430d7e92a06c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"499356f2f86b486db59f36e292427c7cf3417ad7ec49f868f4d430d7e92a06c5","first_computed_at":"2026-05-18T00:12:14.485004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:14.485004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zLOXr0QhN2oAXnI7fJYFKdV3uBWK4m4dQ5yy4FMdqUf2IxdWjwiHO2QEua7Gcm+sRiovHWWhgF/EbQkb+k+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:14.485646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06422","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8b1aaeda1f4d886103f0369b136b0c23a7c1bcb614623c2208cea32c73c23a4","sha256:01ad8c484f94768ea498e1015c237ddbecd594dd325ce2a7c2c61482ee9ef4ea"],"state_sha256":"e4cb377e2d4599facba433547b1dd8abb2a37383b995e9a0c4f1759889b452a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2Phb1T7rlJi1yRmR8lT1GJN40oIwnUXKHNFFrfG/ufE7pd7Ff4QQvJjjAHCGHqt4ufUiO5vvDi9wkySEeVnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T01:33:05.681508Z","bundle_sha256":"01bab6442357120d20127e20399f3d510a991bff30f54730be0e97a7c972e8b1"}}