{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MACV2LLNMA2HGE6WQPSZLC6PEB","short_pith_number":"pith:MACV2LLN","schema_version":"1.0","canonical_sha256":"60055d2d6d60347313d683e5958bcf20734d2c0168d9cdbce7b8f0bc8dc9035d","source":{"kind":"arxiv","id":"1907.02277","version":1},"attestation_state":"computed","paper":{"title":"Discovering Communities of Community Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Michele Coscia","submitted_at":"2019-07-04T08:47:20Z","abstract_excerpt":"Discovering communities in complex networks means grouping nodes similar to each other, to uncover latent information about them. There are hundreds of different algorithms to solve the community detection task, each with its own understanding and definition of what a \"community\" is. Dozens of review works attempt to order such a diverse landscape -- classifying community discovery algorithms by the process they employ to detect communities, by their explicitly stated definition of community, or by their performance on a standardized task. In this paper, we classify community discovery algorit"},"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":"1907.02277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-04T08:47:20Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2f3bbeec488baad872e20439c08b4c8928d67dd6cdc40b26ef8f0be2c1a6cb75","abstract_canon_sha256":"15e861ab9dfe3be4362041db27ef6377d0a7873586e6545b73c858b97e71d95d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.168393Z","signature_b64":"+DMIp8yvigOZJYPf2xfXtr8H6Uid1kfuO7ytI73NB9JZVxrr4nwQdtzjYBW+bWy7HP3Rqm7Fb5bMoJOi8pCFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60055d2d6d60347313d683e5958bcf20734d2c0168d9cdbce7b8f0bc8dc9035d","last_reissued_at":"2026-05-17T23:41:29.167642Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.167642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Communities of Community Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Michele Coscia","submitted_at":"2019-07-04T08:47:20Z","abstract_excerpt":"Discovering communities in complex networks means grouping nodes similar to each other, to uncover latent information about them. There are hundreds of different algorithms to solve the community detection task, each with its own understanding and definition of what a \"community\" is. Dozens of review works attempt to order such a diverse landscape -- classifying community discovery algorithms by the process they employ to detect communities, by their explicitly stated definition of community, or by their performance on a standardized task. In this paper, we classify community discovery algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02277","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":"1907.02277","created_at":"2026-05-17T23:41:29.167760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02277v1","created_at":"2026-05-17T23:41:29.167760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02277","created_at":"2026-05-17T23:41:29.167760+00:00"},{"alias_kind":"pith_short_12","alias_value":"MACV2LLNMA2H","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MACV2LLNMA2HGE6W","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MACV2LLN","created_at":"2026-05-18T12:33:21.387695+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/MACV2LLNMA2HGE6WQPSZLC6PEB","json":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB.json","graph_json":"https://pith.science/api/pith-number/MACV2LLNMA2HGE6WQPSZLC6PEB/graph.json","events_json":"https://pith.science/api/pith-number/MACV2LLNMA2HGE6WQPSZLC6PEB/events.json","paper":"https://pith.science/paper/MACV2LLN"},"agent_actions":{"view_html":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB","download_json":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB.json","view_paper":"https://pith.science/paper/MACV2LLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02277&json=true","fetch_graph":"https://pith.science/api/pith-number/MACV2LLNMA2HGE6WQPSZLC6PEB/graph.json","fetch_events":"https://pith.science/api/pith-number/MACV2LLNMA2HGE6WQPSZLC6PEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB/action/storage_attestation","attest_author":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB/action/author_attestation","sign_citation":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB/action/citation_signature","submit_replication":"https://pith.science/pith/MACV2LLNMA2HGE6WQPSZLC6PEB/action/replication_record"}},"created_at":"2026-05-17T23:41:29.167760+00:00","updated_at":"2026-05-17T23:41:29.167760+00:00"}