{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YXWR43QRDIB7N5FYNE74IZGHCX","short_pith_number":"pith:YXWR43QR","schema_version":"1.0","canonical_sha256":"c5ed1e6e111a03f6f4b8693fc464c715cd1e350b52090ff304ea061d77c6357d","source":{"kind":"arxiv","id":"1109.5593","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.5593","created_at":"2026-05-18T04:00:51.995246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5593v2","created_at":"2026-05-18T04:00:51.995246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5593","created_at":"2026-05-18T04:00:51.995246+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXWR43QRDIB7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXWR43QRDIB7N5FY","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXWR43QR","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX","json":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX.json","graph_json":"https://pith.science/api/pith-number/YXWR43QRDIB7N5FYNE74IZGHCX/graph.json","events_json":"https://pith.science/api/pith-number/YXWR43QRDIB7N5FYNE74IZGHCX/events.json","paper":"https://pith.science/paper/YXWR43QR"},"agent_actions":{"view_html":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX","download_json":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX.json","view_paper":"https://pith.science/paper/YXWR43QR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5593&json=true","fetch_graph":"https://pith.science/api/pith-number/YXWR43QRDIB7N5FYNE74IZGHCX/graph.json","fetch_events":"https://pith.science/api/pith-number/YXWR43QRDIB7N5FYNE74IZGHCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/action/storage_attestation","attest_author":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/action/author_attestation","sign_citation":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/action/citation_signature","submit_replication":"https://pith.science/pith/YXWR43QRDIB7N5FYNE74IZGHCX/action/replication_record"}},"created_at":"2026-05-18T04:00:51.995246+00:00","updated_at":"2026-05-18T04:00:51.995246+00:00"}