{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3XWGQKXTM5RLRI6UBG67KUY7HI","short_pith_number":"pith:3XWGQKXT","canonical_record":{"source":{"id":"1601.06683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T17:19:48Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"title_canon_sha256":"3d45fff75cab5f24879d8a6c636bbb525d233d6d2084a65bd052ab03157c23d6","abstract_canon_sha256":"0afe7ca320aa6314b1eb8b7100f1fe73cd87169f4fde644f392b6df2c6b955d9"},"schema_version":"1.0"},"canonical_sha256":"ddec682af36762b8a3d409bdf5531f3a068a1b82cece6fd78db65666c92f7992","source":{"kind":"arxiv","id":"1601.06683","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06683","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06683v2","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06683","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"3XWGQKXTM5RL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3XWGQKXTM5RLRI6U","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3XWGQKXT","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3XWGQKXTM5RLRI6UBG67KUY7HI","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T17:19:48Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"title_canon_sha256":"3d45fff75cab5f24879d8a6c636bbb525d233d6d2084a65bd052ab03157c23d6","abstract_canon_sha256":"0afe7ca320aa6314b1eb8b7100f1fe73cd87169f4fde644f392b6df2c6b955d9"},"schema_version":"1.0"},"canonical_sha256":"ddec682af36762b8a3d409bdf5531f3a068a1b82cece6fd78db65666c92f7992","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.880156Z","signature_b64":"iP733SuQxoKYcQo6oxoJJGiPp/y2ApI5jJYmqxQCsgnyhi0mj8bceaL69uKLKGyPlBoETdtZAAEzLfujDnyRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddec682af36762b8a3d409bdf5531f3a068a1b82cece6fd78db65666c92f7992","last_reissued_at":"2026-05-18T01:07:56.879650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.879650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06683","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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tk1gOwafA/7h8zmzjh5Gnjkfeo/VBJpHIqNYtzFmj9+sLHFgOf/7PT2LP8DeOpwA/6G/6DmeQGLh6YI9e1g2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T03:20:17.920508Z"},"content_sha256":"3cbab291dcfe266426edd6b12f48dc20dd2b2c380033c0b567a3a3df70801332","schema_version":"1.0","event_id":"sha256:3cbab291dcfe266426edd6b12f48dc20dd2b2c380033c0b567a3a3df70801332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3XWGQKXTM5RLRI6UBG67KUY7HI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering from Sparse Pairwise Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG"],"primary_cat":"cs.SI","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a, Marc Lelarge","submitted_at":"2016-01-25T17:19:48Z","abstract_excerpt":"We consider the problem of grouping items into clusters based on few random pairwise comparisons between the items. We introduce three closely related algorithms for this task: a belief propagation algorithm approximating the Bayes optimal solution, and two spectral algorithms based on the non-backtracking and Bethe Hessian operators. For the case of two symmetric clusters, we conjecture that these algorithms are asymptotically optimal in that they detect the clusters as soon as it is information theoretically possible to do so. We substantiate this claim for one of the spectral approaches we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06683","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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0F+NS6PtwYSNAOYJjKgNZbpqe9iD6AzwGPa/1d0iEx9H5D/e8d3ZNr/oprXHqMi+gFA+8G/7sMLYNKjQrbtOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T03:20:17.921092Z"},"content_sha256":"9fab43c4f17b1eebe643f670cce4248d510086208bf6f1ad00dcb14362bbb074","schema_version":"1.0","event_id":"sha256:9fab43c4f17b1eebe643f670cce4248d510086208bf6f1ad00dcb14362bbb074"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XWGQKXTM5RLRI6UBG67KUY7HI/bundle.json","state_url":"https://pith.science/pith/3XWGQKXTM5RLRI6UBG67KUY7HI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XWGQKXTM5RLRI6UBG67KUY7HI/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-02T03:20:17Z","links":{"resolver":"https://pith.science/pith/3XWGQKXTM5RLRI6UBG67KUY7HI","bundle":"https://pith.science/pith/3XWGQKXTM5RLRI6UBG67KUY7HI/bundle.json","state":"https://pith.science/pith/3XWGQKXTM5RLRI6UBG67KUY7HI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XWGQKXTM5RLRI6UBG67KUY7HI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3XWGQKXTM5RLRI6UBG67KUY7HI","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":"0afe7ca320aa6314b1eb8b7100f1fe73cd87169f4fde644f392b6df2c6b955d9","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T17:19:48Z","title_canon_sha256":"3d45fff75cab5f24879d8a6c636bbb525d233d6d2084a65bd052ab03157c23d6"},"schema_version":"1.0","source":{"id":"1601.06683","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06683","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06683v2","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06683","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"3XWGQKXTM5RL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3XWGQKXTM5RLRI6U","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3XWGQKXT","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:9fab43c4f17b1eebe643f670cce4248d510086208bf6f1ad00dcb14362bbb074","target":"graph","created_at":"2026-05-18T01:07: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"},"paper":{"abstract_excerpt":"We consider the problem of grouping items into clusters based on few random pairwise comparisons between the items. We introduce three closely related algorithms for this task: a belief propagation algorithm approximating the Bayes optimal solution, and two spectral algorithms based on the non-backtracking and Bethe Hessian operators. For the case of two symmetric clusters, we conjecture that these algorithms are asymptotically optimal in that they detect the clusters as soon as it is information theoretically possible to do so. We substantiate this claim for one of the spectral approaches we ","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a, Marc Lelarge","cross_cats":["cond-mat.dis-nn","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T17:19:48Z","title":"Clustering from Sparse Pairwise Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06683","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:3cbab291dcfe266426edd6b12f48dc20dd2b2c380033c0b567a3a3df70801332","target":"record","created_at":"2026-05-18T01:07: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":"0afe7ca320aa6314b1eb8b7100f1fe73cd87169f4fde644f392b6df2c6b955d9","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T17:19:48Z","title_canon_sha256":"3d45fff75cab5f24879d8a6c636bbb525d233d6d2084a65bd052ab03157c23d6"},"schema_version":"1.0","source":{"id":"1601.06683","kind":"arxiv","version":2}},"canonical_sha256":"ddec682af36762b8a3d409bdf5531f3a068a1b82cece6fd78db65666c92f7992","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddec682af36762b8a3d409bdf5531f3a068a1b82cece6fd78db65666c92f7992","first_computed_at":"2026-05-18T01:07:56.879650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:56.879650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iP733SuQxoKYcQo6oxoJJGiPp/y2ApI5jJYmqxQCsgnyhi0mj8bceaL69uKLKGyPlBoETdtZAAEzLfujDnyRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:56.880156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06683","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cbab291dcfe266426edd6b12f48dc20dd2b2c380033c0b567a3a3df70801332","sha256:9fab43c4f17b1eebe643f670cce4248d510086208bf6f1ad00dcb14362bbb074"],"state_sha256":"bebac7a101eefc7d908b9909e31366c5958a3db8b92164c3a294768244957919"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2UIMm+XiTSFHxFg5sZ5Yr72BSW9Szdahi3UPvwEUptp+b19rH0uIJIwIJLcyzEEO4cPdyiZehXRAriqXmNUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T03:20:17.924458Z","bundle_sha256":"37662dfd4325da631c4e927e0697374cb345e059f9a07e741ef9dd6b977d3528"}}