{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZZFT7YKSDGXJQNE73NS5GEUXAV","short_pith_number":"pith:ZZFT7YKS","schema_version":"1.0","canonical_sha256":"ce4b3fe15219ae98349fdb65d31297054e3ac86c6ad1b4a961525d88f1992dcf","source":{"kind":"arxiv","id":"1409.7615","version":1},"attestation_state":"computed","paper":{"title":"Overlapping Communities in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jan Dreier","submitted_at":"2014-09-26T16:14:15Z","abstract_excerpt":"Communities are subsets of a network that are densely connected inside and share only few connections to the rest of the network. The aim of this research is the development and evaluation of an efficient algorithm for detection of overlapping, fuzzy communities. The algorithm gets as input some members of each community that we aim to discover. We call these members seed nodes. The algorithm then propagates this information by using random walks that start at non-seed nodes and end as they reach a seed node. The probability that a random walk starting at a non-seed node $v$ ends at a seed nod"},"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":"1409.7615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-26T16:14:15Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"be3da37326675335bb693f5caa328dda3f9f1866ce74585d6c0f8fd78a8fd4be","abstract_canon_sha256":"336d7e4d4d8a26a09d2d93c73ccb6535a9defa36a13c94e5c771feb7d4c1a25f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.267106Z","signature_b64":"rJMgW+WWhqVVk7vS5zsE7gCvZEVcRKjNYzF59XHyQyPvkL8NaAjjJNK9REVHVdFTnOda82P6rlmV3tREkd7aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce4b3fe15219ae98349fdb65d31297054e3ac86c6ad1b4a961525d88f1992dcf","last_reissued_at":"2026-05-18T02:41:52.266648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.266648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overlapping Communities in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jan Dreier","submitted_at":"2014-09-26T16:14:15Z","abstract_excerpt":"Communities are subsets of a network that are densely connected inside and share only few connections to the rest of the network. The aim of this research is the development and evaluation of an efficient algorithm for detection of overlapping, fuzzy communities. The algorithm gets as input some members of each community that we aim to discover. We call these members seed nodes. The algorithm then propagates this information by using random walks that start at non-seed nodes and end as they reach a seed node. The probability that a random walk starting at a non-seed node $v$ ends at a seed nod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7615","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":"1409.7615","created_at":"2026-05-18T02:41:52.266727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7615v1","created_at":"2026-05-18T02:41:52.266727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7615","created_at":"2026-05-18T02:41:52.266727+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZFT7YKSDGXJ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZFT7YKSDGXJQNE7","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZFT7YKS","created_at":"2026-05-18T12:28:59.999130+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/ZZFT7YKSDGXJQNE73NS5GEUXAV","json":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV.json","graph_json":"https://pith.science/api/pith-number/ZZFT7YKSDGXJQNE73NS5GEUXAV/graph.json","events_json":"https://pith.science/api/pith-number/ZZFT7YKSDGXJQNE73NS5GEUXAV/events.json","paper":"https://pith.science/paper/ZZFT7YKS"},"agent_actions":{"view_html":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV","download_json":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV.json","view_paper":"https://pith.science/paper/ZZFT7YKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7615&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZFT7YKSDGXJQNE73NS5GEUXAV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZFT7YKSDGXJQNE73NS5GEUXAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV/action/storage_attestation","attest_author":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV/action/author_attestation","sign_citation":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV/action/citation_signature","submit_replication":"https://pith.science/pith/ZZFT7YKSDGXJQNE73NS5GEUXAV/action/replication_record"}},"created_at":"2026-05-18T02:41:52.266727+00:00","updated_at":"2026-05-18T02:41:52.266727+00:00"}