{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JGJVN4XYNNEG3NM7G3RJEQT4PT","short_pith_number":"pith:JGJVN4XY","schema_version":"1.0","canonical_sha256":"499356f2f86b486db59f36e292427c7cf3417ad7ec49f868f4d430d7e92a06c5","source":{"kind":"arxiv","id":"1605.06422","version":3},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.06422","created_at":"2026-05-18T00:12:14.485077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06422v3","created_at":"2026-05-18T00:12:14.485077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06422","created_at":"2026-05-18T00:12:14.485077+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGJVN4XYNNEG","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGJVN4XYNNEG3NM7","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGJVN4XY","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT","json":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT.json","graph_json":"https://pith.science/api/pith-number/JGJVN4XYNNEG3NM7G3RJEQT4PT/graph.json","events_json":"https://pith.science/api/pith-number/JGJVN4XYNNEG3NM7G3RJEQT4PT/events.json","paper":"https://pith.science/paper/JGJVN4XY"},"agent_actions":{"view_html":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT","download_json":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT.json","view_paper":"https://pith.science/paper/JGJVN4XY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06422&json=true","fetch_graph":"https://pith.science/api/pith-number/JGJVN4XYNNEG3NM7G3RJEQT4PT/graph.json","fetch_events":"https://pith.science/api/pith-number/JGJVN4XYNNEG3NM7G3RJEQT4PT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/action/storage_attestation","attest_author":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/action/author_attestation","sign_citation":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/action/citation_signature","submit_replication":"https://pith.science/pith/JGJVN4XYNNEG3NM7G3RJEQT4PT/action/replication_record"}},"created_at":"2026-05-18T00:12:14.485077+00:00","updated_at":"2026-05-18T00:12:14.485077+00:00"}