{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RND66K66K7SBZ42SK3RPFCHGVV","short_pith_number":"pith:RND66K66","schema_version":"1.0","canonical_sha256":"8b47ef2bde57e41cf35256e2f288e6ad74f8e5fc5ededc6e4d19e66136cafd41","source":{"kind":"arxiv","id":"1401.7375","version":1},"attestation_state":"computed","paper":{"title":"Detecting Cohesive and 2-mode Communities in Directed and Undirected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jaewon Yang, Julian McAuley, Jure Leskovec","submitted_at":"2014-01-29T00:19:02Z","abstract_excerpt":"Networks are a general language for representing relational information among objects. An effective way to model, reason about, and summarize networks, is to discover sets of nodes with common connectivity patterns. Such sets are commonly referred to as network communities. Research on network community detection has predominantly focused on identifying communities of densely connected nodes in undirected networks.\n  In this paper we develop a novel overlapping community detection method that scales to networks of millions of nodes and edges and advances research along two dimensions: the conn"},"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":"1401.7375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-29T00:19:02Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"036bbbe3de58bbf6adeb5e6901de433c6ead97580d166dc2b796def34239072e","abstract_canon_sha256":"b0c1086564a9235f5a9c40374b53aae46ac560eabb708050b335d93be602099c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.670800Z","signature_b64":"GSIErUwKtgHVVprhoNPFHSPYNeT2usJ0c9lu9G1+01AWDt+COVBk9v7Dm33Q4jTC7Zu5DQZr+Vn3gAAdCPq/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b47ef2bde57e41cf35256e2f288e6ad74f8e5fc5ededc6e4d19e66136cafd41","last_reissued_at":"2026-05-18T03:00:48.670115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.670115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Cohesive and 2-mode Communities in Directed and Undirected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jaewon Yang, Julian McAuley, Jure Leskovec","submitted_at":"2014-01-29T00:19:02Z","abstract_excerpt":"Networks are a general language for representing relational information among objects. An effective way to model, reason about, and summarize networks, is to discover sets of nodes with common connectivity patterns. Such sets are commonly referred to as network communities. Research on network community detection has predominantly focused on identifying communities of densely connected nodes in undirected networks.\n  In this paper we develop a novel overlapping community detection method that scales to networks of millions of nodes and edges and advances research along two dimensions: the conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7375","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":"1401.7375","created_at":"2026-05-18T03:00:48.670235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7375v1","created_at":"2026-05-18T03:00:48.670235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7375","created_at":"2026-05-18T03:00:48.670235+00:00"},{"alias_kind":"pith_short_12","alias_value":"RND66K66K7SB","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RND66K66K7SBZ42S","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RND66K66","created_at":"2026-05-18T12:28:46.137349+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/RND66K66K7SBZ42SK3RPFCHGVV","json":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV.json","graph_json":"https://pith.science/api/pith-number/RND66K66K7SBZ42SK3RPFCHGVV/graph.json","events_json":"https://pith.science/api/pith-number/RND66K66K7SBZ42SK3RPFCHGVV/events.json","paper":"https://pith.science/paper/RND66K66"},"agent_actions":{"view_html":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV","download_json":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV.json","view_paper":"https://pith.science/paper/RND66K66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7375&json=true","fetch_graph":"https://pith.science/api/pith-number/RND66K66K7SBZ42SK3RPFCHGVV/graph.json","fetch_events":"https://pith.science/api/pith-number/RND66K66K7SBZ42SK3RPFCHGVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV/action/storage_attestation","attest_author":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV/action/author_attestation","sign_citation":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV/action/citation_signature","submit_replication":"https://pith.science/pith/RND66K66K7SBZ42SK3RPFCHGVV/action/replication_record"}},"created_at":"2026-05-18T03:00:48.670235+00:00","updated_at":"2026-05-18T03:00:48.670235+00:00"}