{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HONYKE6YLOWDOEQRH3CIT6BNGU","short_pith_number":"pith:HONYKE6Y","schema_version":"1.0","canonical_sha256":"3b9b8513d85bac3712113ec489f82d352916167bd3d65b83f7c1de31f39825e2","source":{"kind":"arxiv","id":"1801.01229","version":1},"attestation_state":"computed","paper":{"title":"Modular Networks for Validating Community Detection Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Afra Abnar, Justin Fagnan, Osmar R. Zaiane, Reihaneh Rabbany","submitted_at":"2018-01-04T02:32:40Z","abstract_excerpt":"How can we accurately compare different community detection algorithms? These algorithms cluster nodes in a given network, and their performance is often validated on benchmark networks with explicit ground-truth communities. Given the lack of cluster labels in real-world networks, a model that generates realistic networks is required for accurate evaluation of these algorithm. In this paper, we present a simple, intuitive, and flexible benchmark generator to generate intrinsically modular networks for community validation. We show how the generated networks closely comply with the characteris"},"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":"1801.01229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-04T02:32:40Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"8bd728adb8b1e0179775b08dee43daf11f3604d37716f3d4fe9b53e6b0b994d8","abstract_canon_sha256":"886c39d6f2d8565c9434162a890336e8fa96f1f9c4d799b5d01cd3e07b207948"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:42.702041Z","signature_b64":"Ek2WGQrwvuJ7xDYH76umGHDyEMUlpUPrQ7XFzC3rqv5QP0uk4A8o0UAhJXw10qAD8njzOeVl+mvBj+NKqTtaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9b8513d85bac3712113ec489f82d352916167bd3d65b83f7c1de31f39825e2","last_reissued_at":"2026-05-18T00:26:42.701409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:42.701409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Networks for Validating Community Detection Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Afra Abnar, Justin Fagnan, Osmar R. Zaiane, Reihaneh Rabbany","submitted_at":"2018-01-04T02:32:40Z","abstract_excerpt":"How can we accurately compare different community detection algorithms? These algorithms cluster nodes in a given network, and their performance is often validated on benchmark networks with explicit ground-truth communities. Given the lack of cluster labels in real-world networks, a model that generates realistic networks is required for accurate evaluation of these algorithm. In this paper, we present a simple, intuitive, and flexible benchmark generator to generate intrinsically modular networks for community validation. We show how the generated networks closely comply with the characteris"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01229","kind":"arxiv","version":1},"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":"1801.01229","created_at":"2026-05-18T00:26:42.701506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01229v1","created_at":"2026-05-18T00:26:42.701506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01229","created_at":"2026-05-18T00:26:42.701506+00:00"},{"alias_kind":"pith_short_12","alias_value":"HONYKE6YLOWD","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HONYKE6YLOWDOEQR","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HONYKE6Y","created_at":"2026-05-18T12:32:28.185984+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/HONYKE6YLOWDOEQRH3CIT6BNGU","json":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU.json","graph_json":"https://pith.science/api/pith-number/HONYKE6YLOWDOEQRH3CIT6BNGU/graph.json","events_json":"https://pith.science/api/pith-number/HONYKE6YLOWDOEQRH3CIT6BNGU/events.json","paper":"https://pith.science/paper/HONYKE6Y"},"agent_actions":{"view_html":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU","download_json":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU.json","view_paper":"https://pith.science/paper/HONYKE6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01229&json=true","fetch_graph":"https://pith.science/api/pith-number/HONYKE6YLOWDOEQRH3CIT6BNGU/graph.json","fetch_events":"https://pith.science/api/pith-number/HONYKE6YLOWDOEQRH3CIT6BNGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU/action/storage_attestation","attest_author":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU/action/author_attestation","sign_citation":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU/action/citation_signature","submit_replication":"https://pith.science/pith/HONYKE6YLOWDOEQRH3CIT6BNGU/action/replication_record"}},"created_at":"2026-05-18T00:26:42.701506+00:00","updated_at":"2026-05-18T00:26:42.701506+00:00"}