{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NZPNQYJOURXYUCGA2NYWUZENRL","short_pith_number":"pith:NZPNQYJO","canonical_record":{"source":{"id":"1302.5607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-22T14:32:33Z","cross_cats_sorted":["cs.DC","math.PR"],"title_canon_sha256":"446ecf49f53ec994c2b665f2c80d4784ad4f160064730a70f1438f728970beec","abstract_canon_sha256":"24260727f2bda4de7c7345398c14a89d916d26064a92b670808098568700ebb7"},"schema_version":"1.0"},"canonical_sha256":"6e5ed8612ea46f8a08c0d3716a648d8ae1f56d37cc63e579e7cfa57d462d4d1e","source":{"kind":"arxiv","id":"1302.5607","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5607","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5607v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5607","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"NZPNQYJOURXY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZPNQYJOURXYUCGA","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZPNQYJO","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NZPNQYJOURXYUCGA2NYWUZENRL","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-22T14:32:33Z","cross_cats_sorted":["cs.DC","math.PR"],"title_canon_sha256":"446ecf49f53ec994c2b665f2c80d4784ad4f160064730a70f1438f728970beec","abstract_canon_sha256":"24260727f2bda4de7c7345398c14a89d916d26064a92b670808098568700ebb7"},"schema_version":"1.0"},"canonical_sha256":"6e5ed8612ea46f8a08c0d3716a648d8ae1f56d37cc63e579e7cfa57d462d4d1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.467628Z","signature_b64":"GwJHVqBzE6/fCE+7YX7kBpB/Y0/PL9E92zahLtdadvMfGO65iknthbrcQB0hpia9pCUD8nRqEEUkI5zBGTaNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e5ed8612ea46f8a08c0d3716a648d8ae1f56d37cc63e579e7cfa57d462d4d1e","last_reissued_at":"2026-05-18T02:48:02.467108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.467108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5607","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAGlyLfPCiFpC4UAw8wan9OAcjvk8wNTKoNVt+G3nC23mQMuDDXQQmcXXFQTOG9SGA/oz6Nq22HOSbzT3QyHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:59.056933Z"},"content_sha256":"7119b57a1ac4a1fbe5182022a13966f50fa6510266e7814966b4741df17656a3","schema_version":"1.0","event_id":"sha256:7119b57a1ac4a1fbe5182022a13966f50fa6510266e7814966b4741df17656a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NZPNQYJOURXYUCGA2NYWUZENRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Community Detection in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.PR"],"primary_cat":"cs.SI","authors_text":"Andrea Clementi, Emanuele Natale, Giorgio Gambosi, Miriam di Ianni, Riccardo Silvestri","submitted_at":"2013-02-22T14:32:33Z","abstract_excerpt":"Inspired by the increasing interest in self-organizing social opportunistic networks, we investigate the problem of distributed detection of unknown communities in dynamic random graphs. As a formal framework, we consider the dynamic version of the well-studied \\emph{Planted Bisection Model} $\\sdG(n,p,q)$ where the node set $[n]$ of the network is partitioned into two unknown communities and, at every time step, each possible edge $(u,v)$ is active with probability $p$ if both nodes belong to the same community, while it is active with probability $q$ (with $q<<p$) otherwise. We also consider "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5607","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kCU17e264Ifau8L4kNNJlgq2sKsnfYOA+ziCwaUiKfBGwo9XRkoGWNXAw/cZxiRvEkmLijMNuh5H2cRowkbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:59.057282Z"},"content_sha256":"928d777cf5abbe4c5be87a7fda9110d2627e2d33e088a0e77caf836148228aca","schema_version":"1.0","event_id":"sha256:928d777cf5abbe4c5be87a7fda9110d2627e2d33e088a0e77caf836148228aca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZPNQYJOURXYUCGA2NYWUZENRL/bundle.json","state_url":"https://pith.science/pith/NZPNQYJOURXYUCGA2NYWUZENRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZPNQYJOURXYUCGA2NYWUZENRL/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-28T12:52:59Z","links":{"resolver":"https://pith.science/pith/NZPNQYJOURXYUCGA2NYWUZENRL","bundle":"https://pith.science/pith/NZPNQYJOURXYUCGA2NYWUZENRL/bundle.json","state":"https://pith.science/pith/NZPNQYJOURXYUCGA2NYWUZENRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZPNQYJOURXYUCGA2NYWUZENRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NZPNQYJOURXYUCGA2NYWUZENRL","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":"24260727f2bda4de7c7345398c14a89d916d26064a92b670808098568700ebb7","cross_cats_sorted":["cs.DC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-22T14:32:33Z","title_canon_sha256":"446ecf49f53ec994c2b665f2c80d4784ad4f160064730a70f1438f728970beec"},"schema_version":"1.0","source":{"id":"1302.5607","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5607","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5607v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5607","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"NZPNQYJOURXY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZPNQYJOURXYUCGA","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZPNQYJO","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:928d777cf5abbe4c5be87a7fda9110d2627e2d33e088a0e77caf836148228aca","target":"graph","created_at":"2026-05-18T02:48:02Z","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":"Inspired by the increasing interest in self-organizing social opportunistic networks, we investigate the problem of distributed detection of unknown communities in dynamic random graphs. As a formal framework, we consider the dynamic version of the well-studied \\emph{Planted Bisection Model} $\\sdG(n,p,q)$ where the node set $[n]$ of the network is partitioned into two unknown communities and, at every time step, each possible edge $(u,v)$ is active with probability $p$ if both nodes belong to the same community, while it is active with probability $q$ (with $q<<p$) otherwise. We also consider ","authors_text":"Andrea Clementi, Emanuele Natale, Giorgio Gambosi, Miriam di Ianni, Riccardo Silvestri","cross_cats":["cs.DC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-22T14:32:33Z","title":"Distributed Community Detection in Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5607","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:7119b57a1ac4a1fbe5182022a13966f50fa6510266e7814966b4741df17656a3","target":"record","created_at":"2026-05-18T02:48:02Z","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":"24260727f2bda4de7c7345398c14a89d916d26064a92b670808098568700ebb7","cross_cats_sorted":["cs.DC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-22T14:32:33Z","title_canon_sha256":"446ecf49f53ec994c2b665f2c80d4784ad4f160064730a70f1438f728970beec"},"schema_version":"1.0","source":{"id":"1302.5607","kind":"arxiv","version":2}},"canonical_sha256":"6e5ed8612ea46f8a08c0d3716a648d8ae1f56d37cc63e579e7cfa57d462d4d1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e5ed8612ea46f8a08c0d3716a648d8ae1f56d37cc63e579e7cfa57d462d4d1e","first_computed_at":"2026-05-18T02:48:02.467108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:02.467108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GwJHVqBzE6/fCE+7YX7kBpB/Y0/PL9E92zahLtdadvMfGO65iknthbrcQB0hpia9pCUD8nRqEEUkI5zBGTaNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:02.467628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5607","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7119b57a1ac4a1fbe5182022a13966f50fa6510266e7814966b4741df17656a3","sha256:928d777cf5abbe4c5be87a7fda9110d2627e2d33e088a0e77caf836148228aca"],"state_sha256":"73350d19cf0f314682359a16623ac4c63f823b88e6183e1dd7f5fb0a4c50bbc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIUDwMiLAhFnewvIr6fvUHU7DfZYWDJqM94Js6Ti3bHRfcC/HE1ELz5VhI8kqhEsfbeVHoKFpO2tcbbaeQyqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:52:59.059235Z","bundle_sha256":"c88e802aaaef5cdfcd482b1def2322027facd066c2baac055bf6332ebaad110a"}}