{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AF6VNL2O2A7B4PLHGA6BZMVGD2","short_pith_number":"pith:AF6VNL2O","schema_version":"1.0","canonical_sha256":"017d56af4ed03e1e3d67303c1cb2a61ebf5ac4ab744dd115900b9d2b480cc767","source":{"kind":"arxiv","id":"1305.5136","version":3},"attestation_state":"computed","paper":{"title":"Group detection in complex networks: An algorithm and comparison of the state of the art","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lovro \\v{S}ubelj, Marko Bajec","submitted_at":"2013-05-22T13:45:43Z","abstract_excerpt":"Complex real-world networks commonly reveal characteristic groups of nodes like communities and modules. These are of value in various applications, especially in the case of large social and information networks. However, while numerous community detection techniques have been presented in the literature, approaches for other groups of nodes are relatively rare and often limited in some way. We present a simple propagation-based algorithm for general group detection that requires no a priori knowledge and has near ideal complexity. The main novelty here is that different types of groups are r"},"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":"1305.5136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-22T13:45:43Z","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"title_canon_sha256":"de3e95d709f35eee7f8fddc1ca823c58150cfffc0b9e1c816d104902ea22d217","abstract_canon_sha256":"d67971d5ff2c9c9caf45a849a497a740ac470c6e9df0b7635e5b73b1c69f9080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:54.771568Z","signature_b64":"oESODnKcCJnY0I492Q9hW/+YB4eEOGD67M9JtjemDTGaYBA0qc3dev8zK/f5zrnlIoNX3K4d/0BPIjKj8/PTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017d56af4ed03e1e3d67303c1cb2a61ebf5ac4ab744dd115900b9d2b480cc767","last_reissued_at":"2026-05-18T03:03:54.770967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:54.770967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group detection in complex networks: An algorithm and comparison of the state of the art","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lovro \\v{S}ubelj, Marko Bajec","submitted_at":"2013-05-22T13:45:43Z","abstract_excerpt":"Complex real-world networks commonly reveal characteristic groups of nodes like communities and modules. These are of value in various applications, especially in the case of large social and information networks. However, while numerous community detection techniques have been presented in the literature, approaches for other groups of nodes are relatively rare and often limited in some way. We present a simple propagation-based algorithm for general group detection that requires no a priori knowledge and has near ideal complexity. The main novelty here is that different types of groups are r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5136","kind":"arxiv","version":3},"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":"1305.5136","created_at":"2026-05-18T03:03:54.771057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5136v3","created_at":"2026-05-18T03:03:54.771057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5136","created_at":"2026-05-18T03:03:54.771057+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF6VNL2O2A7B","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF6VNL2O2A7B4PLH","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF6VNL2O","created_at":"2026-05-18T12:27:38.830355+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/AF6VNL2O2A7B4PLHGA6BZMVGD2","json":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2.json","graph_json":"https://pith.science/api/pith-number/AF6VNL2O2A7B4PLHGA6BZMVGD2/graph.json","events_json":"https://pith.science/api/pith-number/AF6VNL2O2A7B4PLHGA6BZMVGD2/events.json","paper":"https://pith.science/paper/AF6VNL2O"},"agent_actions":{"view_html":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2","download_json":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2.json","view_paper":"https://pith.science/paper/AF6VNL2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5136&json=true","fetch_graph":"https://pith.science/api/pith-number/AF6VNL2O2A7B4PLHGA6BZMVGD2/graph.json","fetch_events":"https://pith.science/api/pith-number/AF6VNL2O2A7B4PLHGA6BZMVGD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2/action/storage_attestation","attest_author":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2/action/author_attestation","sign_citation":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2/action/citation_signature","submit_replication":"https://pith.science/pith/AF6VNL2O2A7B4PLHGA6BZMVGD2/action/replication_record"}},"created_at":"2026-05-18T03:03:54.771057+00:00","updated_at":"2026-05-18T03:03:54.771057+00:00"}