{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YXWR43QRDIB7N5FYNE74IZGHCX","short_pith_number":"pith:YXWR43QR","canonical_record":{"source":{"id":"1109.5593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-09-26T15:04:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2f8bc540cb9dc2f172b49449e1b1a0cad064713c47906ff302683e4232397f84","abstract_canon_sha256":"2e152e1b9e934762dc405b5579b5f0a99604611277f18f205d17fcec8b0e9402"},"schema_version":"1.0"},"canonical_sha256":"c5ed1e6e111a03f6f4b8693fc464c715cd1e350b52090ff304ea061d77c6357d","source":{"kind":"arxiv","id":"1109.5593","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5593","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5593v2","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5593","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"YXWR43QRDIB7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YXWR43QRDIB7N5FY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YXWR43QR","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YXWR43QRDIB7N5FYNE74IZGHCX","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-09-26T15:04:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2f8bc540cb9dc2f172b49449e1b1a0cad064713c47906ff302683e4232397f84","abstract_canon_sha256":"2e152e1b9e934762dc405b5579b5f0a99604611277f18f205d17fcec8b0e9402"},"schema_version":"1.0"},"canonical_sha256":"c5ed1e6e111a03f6f4b8693fc464c715cd1e350b52090ff304ea061d77c6357d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:51.995831Z","signature_b64":"FREVOw0u0pzy442+cYwvPsPdFdkLTVUKsXfAiYZTqF4YNeDmgNj2ie3LvIS/ZVlY3PHTn5JK/DrJz91zinHJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ed1e6e111a03f6f4b8693fc464c715cd1e350b52090ff304ea061d77c6357d","last_reissued_at":"2026-05-18T04:00:51.995154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:51.995154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5593","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-18T04:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZa1XttWteKNMDQHSEq2VGOtD0wF01qPf+rV5vZJ/PUxNScEfoT+0r5sh+kyHlWjNk8oa6I0PAE/FgscVCfzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:19:56.777237Z"},"content_sha256":"cd3ae82f5569605ffcc10f09e93f0856dfa9119137e8f88b280efdf6d0b233ad","schema_version":"1.0","event_id":"sha256:cd3ae82f5569605ffcc10f09e93f0856dfa9119137e8f88b280efdf6d0b233ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YXWR43QRDIB7N5FYNE74IZGHCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Jean-Charles Delvenne, Mauricio Barahona, Michael T. Schaub, Sophia N. Yaliraki","submitted_at":"2011-09-26T15:04:32Z","abstract_excerpt":"In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the `right' split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5593","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-18T04:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taTZtZAnNUOiZ90sVeKx+AJOAnHqis2m4F049YCvZ9fEzLknrL46bDg3g1vvRLQhoOuAaXVHs9v/CYG1eFqlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:19:56.777908Z"},"content_sha256":"fd8819f8db6f515ab23311c8285f587ca79d4e5e0464e2cd56a961fd9a64967a","schema_version":"1.0","event_id":"sha256:fd8819f8db6f515ab23311c8285f587ca79d4e5e0464e2cd56a961fd9a64967a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/bundle.json","state_url":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXWR43QRDIB7N5FYNE74IZGHCX/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-26T13:19:56Z","links":{"resolver":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX","bundle":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/bundle.json","state":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXWR43QRDIB7N5FYNE74IZGHCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YXWR43QRDIB7N5FYNE74IZGHCX","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":"2e152e1b9e934762dc405b5579b5f0a99604611277f18f205d17fcec8b0e9402","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-09-26T15:04:32Z","title_canon_sha256":"2f8bc540cb9dc2f172b49449e1b1a0cad064713c47906ff302683e4232397f84"},"schema_version":"1.0","source":{"id":"1109.5593","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5593","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5593v2","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5593","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"YXWR43QRDIB7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YXWR43QRDIB7N5FY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YXWR43QR","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:fd8819f8db6f515ab23311c8285f587ca79d4e5e0464e2cd56a961fd9a64967a","target":"graph","created_at":"2026-05-18T04:00:51Z","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":"In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the `right' split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be ev","authors_text":"Jean-Charles Delvenne, Mauricio Barahona, Michael T. Schaub, Sophia N. Yaliraki","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-09-26T15:04:32Z","title":"Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5593","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:cd3ae82f5569605ffcc10f09e93f0856dfa9119137e8f88b280efdf6d0b233ad","target":"record","created_at":"2026-05-18T04:00:51Z","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":"2e152e1b9e934762dc405b5579b5f0a99604611277f18f205d17fcec8b0e9402","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-09-26T15:04:32Z","title_canon_sha256":"2f8bc540cb9dc2f172b49449e1b1a0cad064713c47906ff302683e4232397f84"},"schema_version":"1.0","source":{"id":"1109.5593","kind":"arxiv","version":2}},"canonical_sha256":"c5ed1e6e111a03f6f4b8693fc464c715cd1e350b52090ff304ea061d77c6357d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5ed1e6e111a03f6f4b8693fc464c715cd1e350b52090ff304ea061d77c6357d","first_computed_at":"2026-05-18T04:00:51.995154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:51.995154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FREVOw0u0pzy442+cYwvPsPdFdkLTVUKsXfAiYZTqF4YNeDmgNj2ie3LvIS/ZVlY3PHTn5JK/DrJz91zinHJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:51.995831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5593","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd3ae82f5569605ffcc10f09e93f0856dfa9119137e8f88b280efdf6d0b233ad","sha256:fd8819f8db6f515ab23311c8285f587ca79d4e5e0464e2cd56a961fd9a64967a"],"state_sha256":"1394922e616bf92356abce4712589d80f58ca975f9c11b8edf936c5e401bdd66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3YWImW7mF6omqCKllUK25R2tRcg3y42CFAHHURQoKLvfSTuk3QEAHwT9HKDSPts50RwUu86l2eK1WOZ90/2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:19:56.781361Z","bundle_sha256":"6710efbb900e92c7898c71fe924a1812bcce911be335a8b51f6403cb20635a25"}}