{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SV546VWJQEXKAFKVVVP574IHR3","short_pith_number":"pith:SV546VWJ","schema_version":"1.0","canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","source":{"kind":"arxiv","id":"1112.1831","version":1},"attestation_state":"computed","paper":{"title":"Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Grant Schoenebeck, Rong Ge, Sanjeev Arora, Sushant Sachdeva","submitted_at":"2011-12-08T13:28:04Z","abstract_excerpt":"A \"community\" in a social network is usually understood to be a group of nodes more densely connected with each other than with the rest of the network. This is an important concept in most domains where networks arise: social, technological, biological, etc. For many years algorithms for finding communities implicitly assumed communities are nonoverlapping (leading to use of clustering-based approaches) but there is increasing interest in finding overlapping communities. A barrier to finding communities is that the solution concept is often defined in terms of an NP-complete problem such as C"},"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":"1112.1831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-08T13:28:04Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"5adaaaf4c5251763c691a83003d4dd3e68d24a14970bf21ea23ef67c1cf65a32","abstract_canon_sha256":"8d9442c719a009e593b75250ba01844a1b4c10300586159309e9712a167c8e7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:45.566599Z","signature_b64":"kDY34mPKyjwoBQ5oLGfJTu/z/WiC7uuVyzEq7dObU2uU55vPh4YMz4wBBGjvZD0Q4m5WQeYtUZTz+DGOFGumDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","last_reissued_at":"2026-05-18T04:06:45.565694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:45.565694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Grant Schoenebeck, Rong Ge, Sanjeev Arora, Sushant Sachdeva","submitted_at":"2011-12-08T13:28:04Z","abstract_excerpt":"A \"community\" in a social network is usually understood to be a group of nodes more densely connected with each other than with the rest of the network. This is an important concept in most domains where networks arise: social, technological, biological, etc. For many years algorithms for finding communities implicitly assumed communities are nonoverlapping (leading to use of clustering-based approaches) but there is increasing interest in finding overlapping communities. A barrier to finding communities is that the solution concept is often defined in terms of an NP-complete problem such as C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1831","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":"1112.1831","created_at":"2026-05-18T04:06:45.565836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1831v1","created_at":"2026-05-18T04:06:45.565836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1831","created_at":"2026-05-18T04:06:45.565836+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV546VWJQEXK","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV546VWJQEXKAFKV","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV546VWJ","created_at":"2026-05-18T12:26:41.206345+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/SV546VWJQEXKAFKVVVP574IHR3","json":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3.json","graph_json":"https://pith.science/api/pith-number/SV546VWJQEXKAFKVVVP574IHR3/graph.json","events_json":"https://pith.science/api/pith-number/SV546VWJQEXKAFKVVVP574IHR3/events.json","paper":"https://pith.science/paper/SV546VWJ"},"agent_actions":{"view_html":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3","download_json":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3.json","view_paper":"https://pith.science/paper/SV546VWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1831&json=true","fetch_graph":"https://pith.science/api/pith-number/SV546VWJQEXKAFKVVVP574IHR3/graph.json","fetch_events":"https://pith.science/api/pith-number/SV546VWJQEXKAFKVVVP574IHR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/action/storage_attestation","attest_author":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/action/author_attestation","sign_citation":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/action/citation_signature","submit_replication":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/action/replication_record"}},"created_at":"2026-05-18T04:06:45.565836+00:00","updated_at":"2026-05-18T04:06:45.565836+00:00"}