{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:GGNP3Z6JNS724VWQXDFO22HFVQ","short_pith_number":"pith:GGNP3Z6J","canonical_record":{"source":{"id":"0910.2098","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-10-12T07:27:54Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"d4beb09163f3b8233547f776999695e9a7cbbaf123dcd6878f46eebbec7d7f04","abstract_canon_sha256":"34d1907f12f9bf742a21717ff11b8dd1654bfda8c9680f34d79540e5c4ac36ac"},"schema_version":"1.0"},"canonical_sha256":"319afde7c96cbfae56d0b8caed68e5ac35ac952f53e601a806b415c8c57908a9","source":{"kind":"arxiv","id":"0910.2098","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2098","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2098v4","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2098","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"GGNP3Z6JNS72","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"GGNP3Z6JNS724VWQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"GGNP3Z6J","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:GGNP3Z6JNS724VWQXDFO22HFVQ","target":"record","payload":{"canonical_record":{"source":{"id":"0910.2098","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-10-12T07:27:54Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"d4beb09163f3b8233547f776999695e9a7cbbaf123dcd6878f46eebbec7d7f04","abstract_canon_sha256":"34d1907f12f9bf742a21717ff11b8dd1654bfda8c9680f34d79540e5c4ac36ac"},"schema_version":"1.0"},"canonical_sha256":"319afde7c96cbfae56d0b8caed68e5ac35ac952f53e601a806b415c8c57908a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:46.843002Z","signature_b64":"ejtyUgRiMtIytHOndMJkIPrOgyIr3V1PZpV0N3q7qKt1oSL3VofXRGbnst8njTdDF93af2VzPZpLzjw8uItCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"319afde7c96cbfae56d0b8caed68e5ac35ac952f53e601a806b415c8c57908a9","last_reissued_at":"2026-05-18T02:24:46.842510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:46.842510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.2098","source_version":4,"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-18T02:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7mv3xr/DVT54PyLiXznRKphtzHLno+Mt/ohQNnrR0m2xmYDI4Eej0Xkj3eURJOPEBjevqYJ6pPNc7qkRIKVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:34:04.542445Z"},"content_sha256":"c658a22fbd15b9ae55f186769b09ff0c11b298adbaac9439a61b04199364113b","schema_version":"1.0","event_id":"sha256:c658a22fbd15b9ae55f186769b09ff0c11b298adbaac9439a61b04199364113b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:GGNP3Z6JNS724VWQXDFO22HFVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overlapping stochastic block models with application to the French political blogosphere","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Christophe Ambroise, Etienne Birmel\\'e, Pierre Latouche","submitted_at":"2009-10-12T07:27:54Z","abstract_excerpt":"Complex systems in nature and in society are often represented as networks, describing the rich set of interactions between objects of interest. Many deterministic and probabilistic clustering methods have been developed to analyze such structures. Given a network, almost all of them partition the vertices into disjoint clusters, according to their connection profile. However, recent studies have shown that these techniques were too restrictive and that most of the existing networks contained overlapping clusters. To tackle this issue, we present in this paper the Overlapping Stochastic Block "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2098","kind":"arxiv","version":4},"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-18T02:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQweUTIk0KBlFGy7QtBLX7gJLIu1lKPSjFxI8Xcq5yfypYwmuS5o8nBARR47ag9kY1Gg7t6ZAVucmWnrbJihAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:34:04.542996Z"},"content_sha256":"33d8dbcaa4bafd31c991040a0c2ff2a3fddd26974e8d8ff157c54a8e39187609","schema_version":"1.0","event_id":"sha256:33d8dbcaa4bafd31c991040a0c2ff2a3fddd26974e8d8ff157c54a8e39187609"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGNP3Z6JNS724VWQXDFO22HFVQ/bundle.json","state_url":"https://pith.science/pith/GGNP3Z6JNS724VWQXDFO22HFVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGNP3Z6JNS724VWQXDFO22HFVQ/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-06-24T10:34:04Z","links":{"resolver":"https://pith.science/pith/GGNP3Z6JNS724VWQXDFO22HFVQ","bundle":"https://pith.science/pith/GGNP3Z6JNS724VWQXDFO22HFVQ/bundle.json","state":"https://pith.science/pith/GGNP3Z6JNS724VWQXDFO22HFVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGNP3Z6JNS724VWQXDFO22HFVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:GGNP3Z6JNS724VWQXDFO22HFVQ","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":"34d1907f12f9bf742a21717ff11b8dd1654bfda8c9680f34d79540e5c4ac36ac","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-10-12T07:27:54Z","title_canon_sha256":"d4beb09163f3b8233547f776999695e9a7cbbaf123dcd6878f46eebbec7d7f04"},"schema_version":"1.0","source":{"id":"0910.2098","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2098","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2098v4","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2098","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"GGNP3Z6JNS72","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"GGNP3Z6JNS724VWQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"GGNP3Z6J","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:33d8dbcaa4bafd31c991040a0c2ff2a3fddd26974e8d8ff157c54a8e39187609","target":"graph","created_at":"2026-05-18T02:24:46Z","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":"Complex systems in nature and in society are often represented as networks, describing the rich set of interactions between objects of interest. Many deterministic and probabilistic clustering methods have been developed to analyze such structures. Given a network, almost all of them partition the vertices into disjoint clusters, according to their connection profile. However, recent studies have shown that these techniques were too restrictive and that most of the existing networks contained overlapping clusters. To tackle this issue, we present in this paper the Overlapping Stochastic Block ","authors_text":"Christophe Ambroise, Etienne Birmel\\'e, Pierre Latouche","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-10-12T07:27:54Z","title":"Overlapping stochastic block models with application to the French political blogosphere"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2098","kind":"arxiv","version":4},"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:c658a22fbd15b9ae55f186769b09ff0c11b298adbaac9439a61b04199364113b","target":"record","created_at":"2026-05-18T02:24:46Z","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":"34d1907f12f9bf742a21717ff11b8dd1654bfda8c9680f34d79540e5c4ac36ac","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-10-12T07:27:54Z","title_canon_sha256":"d4beb09163f3b8233547f776999695e9a7cbbaf123dcd6878f46eebbec7d7f04"},"schema_version":"1.0","source":{"id":"0910.2098","kind":"arxiv","version":4}},"canonical_sha256":"319afde7c96cbfae56d0b8caed68e5ac35ac952f53e601a806b415c8c57908a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"319afde7c96cbfae56d0b8caed68e5ac35ac952f53e601a806b415c8c57908a9","first_computed_at":"2026-05-18T02:24:46.842510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:46.842510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ejtyUgRiMtIytHOndMJkIPrOgyIr3V1PZpV0N3q7qKt1oSL3VofXRGbnst8njTdDF93af2VzPZpLzjw8uItCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:46.843002Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.2098","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c658a22fbd15b9ae55f186769b09ff0c11b298adbaac9439a61b04199364113b","sha256:33d8dbcaa4bafd31c991040a0c2ff2a3fddd26974e8d8ff157c54a8e39187609"],"state_sha256":"94a2cfc73e39478cb1001e67ebe2a89a010515945a74116e4c5a69e545966e76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOzyM5onOGLUmfPWHlWVDPILtAS2gA+rkfiJkVD0nEHEZz4AVvjMzN5fDEaKaQmTKepJifaBYar2v2OTph7VDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T10:34:04.545046Z","bundle_sha256":"19979d99c3c83bb9417738cc553911169b9a7aecaec13f027ee829781a189b47"}}