{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U2OZQFXAHOPBSDXDEATPRAM62T","short_pith_number":"pith:U2OZQFXA","canonical_record":{"source":{"id":"1506.04158","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T20:08:54Z","cross_cats_sorted":[],"title_canon_sha256":"2d59c057f17572b51264d3231acccbc75e8b29483edb2394784388d0f689de7a","abstract_canon_sha256":"194f6ffe21d70d87aec9a5f3146e849dffb021959d6eb1e9ab633c8f5a1b00e9"},"schema_version":"1.0"},"canonical_sha256":"a69d9816e03b9e190ee32026f8819ed4f328555c4bc426f2ea853731e5209cbc","source":{"kind":"arxiv","id":"1506.04158","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04158","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04158v3","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04158","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"U2OZQFXAHOPB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U2OZQFXAHOPBSDXD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U2OZQFXA","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U2OZQFXAHOPBSDXDEATPRAM62T","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04158","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T20:08:54Z","cross_cats_sorted":[],"title_canon_sha256":"2d59c057f17572b51264d3231acccbc75e8b29483edb2394784388d0f689de7a","abstract_canon_sha256":"194f6ffe21d70d87aec9a5f3146e849dffb021959d6eb1e9ab633c8f5a1b00e9"},"schema_version":"1.0"},"canonical_sha256":"a69d9816e03b9e190ee32026f8819ed4f328555c4bc426f2ea853731e5209cbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.814354Z","signature_b64":"aLini+lWql9ih/yQlVg1OBjD8lxhVm58DwCAJcQK6P7B1rs0UP8HMdYXCwsd9rz4O5cvQGY+XK4Cy96es5oJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69d9816e03b9e190ee32026f8819ed4f328555c4bc426f2ea853731e5209cbc","last_reissued_at":"2026-05-18T00:31:22.813730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.813730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04158","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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uXrtIezUl1KVQkx8Y/+ia993FZtppNSOLNj0YdUGkbjgeQEbS5PYZZJOWlAVrI2jRHzbHXxPs3UcjXX9o53Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:24:39.203997Z"},"content_sha256":"b3b1651b31f962f55f70eaaa7e043e0be22f8ed1c218ec524bb50addec23b556","schema_version":"1.0","event_id":"sha256:b3b1651b31f962f55f70eaaa7e043e0be22f8ed1c218ec524bb50addec23b556"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U2OZQFXAHOPBSDXDEATPRAM62T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"CNRS), CRIStAL, DYOGENE), Emilie Kaufmann (SEQUEL, LINCS), Marc Lelarge (LINCS, Thomas Bonald (LTCI","submitted_at":"2015-06-12T20:08:54Z","abstract_excerpt":"This paper presents a novel spectral algorithm with additive clustering designed to identify overlapping communities in networks.  The algorithm is based on geometric properties of the spectrum of the expected adjacency matrix in a random graph model that we call stochastic blockmodel with overlap (SBMO). An adaptive version of the algorithm, that does not require the knowledge of the number of hidden communities, is proved to be consistent under the SBMO when the degrees in the graph are (slightly more than) logarithmic. The algorithm is shown to perform well on simulated data and on real-wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04158","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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JHL/63fFWMmMWXvXkYCQIgUSYiXdUNaLQD41gw+Dfd3YOhmDE087YIIyWIXQn9ZoEqLv7m099lztIULcx2o+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:24:39.204665Z"},"content_sha256":"19f2b86d53ddd9fe3402cc149d5dad20d3ea8c9820baa706e3263f10151b35c9","schema_version":"1.0","event_id":"sha256:19f2b86d53ddd9fe3402cc149d5dad20d3ea8c9820baa706e3263f10151b35c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2OZQFXAHOPBSDXDEATPRAM62T/bundle.json","state_url":"https://pith.science/pith/U2OZQFXAHOPBSDXDEATPRAM62T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2OZQFXAHOPBSDXDEATPRAM62T/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-23T17:24:39Z","links":{"resolver":"https://pith.science/pith/U2OZQFXAHOPBSDXDEATPRAM62T","bundle":"https://pith.science/pith/U2OZQFXAHOPBSDXDEATPRAM62T/bundle.json","state":"https://pith.science/pith/U2OZQFXAHOPBSDXDEATPRAM62T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2OZQFXAHOPBSDXDEATPRAM62T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U2OZQFXAHOPBSDXDEATPRAM62T","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":"194f6ffe21d70d87aec9a5f3146e849dffb021959d6eb1e9ab633c8f5a1b00e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T20:08:54Z","title_canon_sha256":"2d59c057f17572b51264d3231acccbc75e8b29483edb2394784388d0f689de7a"},"schema_version":"1.0","source":{"id":"1506.04158","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04158","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04158v3","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04158","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"U2OZQFXAHOPB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U2OZQFXAHOPBSDXD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U2OZQFXA","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:19f2b86d53ddd9fe3402cc149d5dad20d3ea8c9820baa706e3263f10151b35c9","target":"graph","created_at":"2026-05-18T00:31:22Z","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":"This paper presents a novel spectral algorithm with additive clustering designed to identify overlapping communities in networks.  The algorithm is based on geometric properties of the spectrum of the expected adjacency matrix in a random graph model that we call stochastic blockmodel with overlap (SBMO). An adaptive version of the algorithm, that does not require the knowledge of the number of hidden communities, is proved to be consistent under the SBMO when the degrees in the graph are (slightly more than) logarithmic. The algorithm is shown to perform well on simulated data and on real-wor","authors_text":"CNRS), CRIStAL, DYOGENE), Emilie Kaufmann (SEQUEL, LINCS), Marc Lelarge (LINCS, Thomas Bonald (LTCI","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T20:08:54Z","title":"A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04158","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:b3b1651b31f962f55f70eaaa7e043e0be22f8ed1c218ec524bb50addec23b556","target":"record","created_at":"2026-05-18T00:31:22Z","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":"194f6ffe21d70d87aec9a5f3146e849dffb021959d6eb1e9ab633c8f5a1b00e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T20:08:54Z","title_canon_sha256":"2d59c057f17572b51264d3231acccbc75e8b29483edb2394784388d0f689de7a"},"schema_version":"1.0","source":{"id":"1506.04158","kind":"arxiv","version":3}},"canonical_sha256":"a69d9816e03b9e190ee32026f8819ed4f328555c4bc426f2ea853731e5209cbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a69d9816e03b9e190ee32026f8819ed4f328555c4bc426f2ea853731e5209cbc","first_computed_at":"2026-05-18T00:31:22.813730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:22.813730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aLini+lWql9ih/yQlVg1OBjD8lxhVm58DwCAJcQK6P7B1rs0UP8HMdYXCwsd9rz4O5cvQGY+XK4Cy96es5oJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:22.814354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04158","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3b1651b31f962f55f70eaaa7e043e0be22f8ed1c218ec524bb50addec23b556","sha256:19f2b86d53ddd9fe3402cc149d5dad20d3ea8c9820baa706e3263f10151b35c9"],"state_sha256":"43a4a9f4a1010f60231390a56ce48f8378fd24a5e36dff8149443861a51dca28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4bLWr7QmGZbuciMoyujphuvTTl+VXz8QGBvoHdiqnt2QavmP30jUr1q5vTSYBtPtf5AnLhOAiJ5lh4xMzPZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:24:39.208666Z","bundle_sha256":"2789ef2dce32ef224d0e49aa2c60ab17c15cba0784d6e2d51f665862a56628f5"}}