{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ALJAOYCOAPJ4CQX22XTFDXQHML","short_pith_number":"pith:ALJAOYCO","schema_version":"1.0","canonical_sha256":"02d207604e03d3c142fad5e651de0762caaf438d47b45a9caebf2c8565fb2e8e","source":{"kind":"arxiv","id":"1609.04903","version":1},"attestation_state":"computed","paper":{"title":"Ensemble-Based Algorithms to Detect Disjoint and Overlapping Communities in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Noseong Park, Tanmoy Chakraborty, V.S. Subrahmanian","submitted_at":"2016-09-16T03:20:51Z","abstract_excerpt":"Given a set ${\\cal AL}$ of community detection algorithms and a graph $G$ as inputs, we propose two ensemble methods $\\mathtt{EnDisCO}$ and $\\mathtt{MeDOC}$ that (respectively) identify disjoint and overlapping communities in $G$. $\\mathtt{EnDisCO}$ transforms a graph into a latent feature space by leveraging multiple base solutions and discovers disjoint community structure. $\\mathtt{MeDOC}$ groups similar base communities into a meta-community and detects both disjoint and overlapping community structures. Experiments are conducted at different scales on both synthetically generated networks"},"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":"1609.04903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-16T03:20:51Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"9560a5d1b5d171daea5ca5afe5ddc721cdf7c63bca18b0b2bcc378ea8c567f18","abstract_canon_sha256":"4790f684f903f498232cfc18e9f630ea4b193566e2771700e6868579478f408b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:32.162118Z","signature_b64":"VBYfmaOGGDHX3EiGMEgzGdh52BdYzKegpg6pXXq0ca4yuKnRRlOn9/7RAT6alOd3OjVrdVgJ2/j1qcudoq3TDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02d207604e03d3c142fad5e651de0762caaf438d47b45a9caebf2c8565fb2e8e","last_reissued_at":"2026-05-18T01:04:32.161538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:32.161538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble-Based Algorithms to Detect Disjoint and Overlapping Communities in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Noseong Park, Tanmoy Chakraborty, V.S. Subrahmanian","submitted_at":"2016-09-16T03:20:51Z","abstract_excerpt":"Given a set ${\\cal AL}$ of community detection algorithms and a graph $G$ as inputs, we propose two ensemble methods $\\mathtt{EnDisCO}$ and $\\mathtt{MeDOC}$ that (respectively) identify disjoint and overlapping communities in $G$. $\\mathtt{EnDisCO}$ transforms a graph into a latent feature space by leveraging multiple base solutions and discovers disjoint community structure. $\\mathtt{MeDOC}$ groups similar base communities into a meta-community and detects both disjoint and overlapping community structures. Experiments are conducted at different scales on both synthetically generated networks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04903","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":"1609.04903","created_at":"2026-05-18T01:04:32.161632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04903v1","created_at":"2026-05-18T01:04:32.161632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04903","created_at":"2026-05-18T01:04:32.161632+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALJAOYCOAPJ4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALJAOYCOAPJ4CQX2","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALJAOYCO","created_at":"2026-05-18T12:30:07.202191+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/ALJAOYCOAPJ4CQX22XTFDXQHML","json":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML.json","graph_json":"https://pith.science/api/pith-number/ALJAOYCOAPJ4CQX22XTFDXQHML/graph.json","events_json":"https://pith.science/api/pith-number/ALJAOYCOAPJ4CQX22XTFDXQHML/events.json","paper":"https://pith.science/paper/ALJAOYCO"},"agent_actions":{"view_html":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML","download_json":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML.json","view_paper":"https://pith.science/paper/ALJAOYCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04903&json=true","fetch_graph":"https://pith.science/api/pith-number/ALJAOYCOAPJ4CQX22XTFDXQHML/graph.json","fetch_events":"https://pith.science/api/pith-number/ALJAOYCOAPJ4CQX22XTFDXQHML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML/action/storage_attestation","attest_author":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML/action/author_attestation","sign_citation":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML/action/citation_signature","submit_replication":"https://pith.science/pith/ALJAOYCOAPJ4CQX22XTFDXQHML/action/replication_record"}},"created_at":"2026-05-18T01:04:32.161632+00:00","updated_at":"2026-05-18T01:04:32.161632+00:00"}