{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DWLLL6OCRXZBUKQWCR4PIMHXLM","short_pith_number":"pith:DWLLL6OC","schema_version":"1.0","canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","source":{"kind":"arxiv","id":"1406.6832","version":1},"attestation_state":"computed","paper":{"title":"Overlapping Community Detection Optimization and Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Michel Crampes, Michel Planti\\'e","submitted_at":"2014-06-26T10:28:36Z","abstract_excerpt":"Community detection using both graphs and social networks is the focus of many algorithms. Recent methods aimed at optimizing the so-called modularity function proceed by maximizing relations within communities while minimizing inter-community relations.\n  However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper, we introduce a new algorithm along with a function that takes an approximate solution and modifies it in order to reach an optimum. This reassignment function is considered a 'potential function' and becomes a n"},"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":"1406.6832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-26T10:28:36Z","cross_cats_sorted":["physics.soc-ph","stat.ML"],"title_canon_sha256":"1c1a47a40045df5c0114e181be308fd2ee1e4df3f4ec54719b353368c887218e","abstract_canon_sha256":"f18d3d6a348b72d57d6f4e63531c884dbbdac6aa0db69577da79c3a5678f7a4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.726548Z","signature_b64":"a28OBGLXB4sz5GuV7OhHjH5xsQ5SRQ0v4m/oXwkQChYogYK/4RPKK8ujn11FjWbxqkcBbic5xxuddM5l7rucCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","last_reissued_at":"2026-05-18T02:48:55.725998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.725998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overlapping Community Detection Optimization and Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Michel Crampes, Michel Planti\\'e","submitted_at":"2014-06-26T10:28:36Z","abstract_excerpt":"Community detection using both graphs and social networks is the focus of many algorithms. Recent methods aimed at optimizing the so-called modularity function proceed by maximizing relations within communities while minimizing inter-community relations.\n  However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper, we introduce a new algorithm along with a function that takes an approximate solution and modifies it in order to reach an optimum. This reassignment function is considered a 'potential function' and becomes a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6832","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":"1406.6832","created_at":"2026-05-18T02:48:55.726086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6832v1","created_at":"2026-05-18T02:48:55.726086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6832","created_at":"2026-05-18T02:48:55.726086+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWLLL6OCRXZB","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWLLL6OCRXZBUKQW","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWLLL6OC","created_at":"2026-05-18T12:28:25.294606+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/DWLLL6OCRXZBUKQWCR4PIMHXLM","json":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM.json","graph_json":"https://pith.science/api/pith-number/DWLLL6OCRXZBUKQWCR4PIMHXLM/graph.json","events_json":"https://pith.science/api/pith-number/DWLLL6OCRXZBUKQWCR4PIMHXLM/events.json","paper":"https://pith.science/paper/DWLLL6OC"},"agent_actions":{"view_html":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM","download_json":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM.json","view_paper":"https://pith.science/paper/DWLLL6OC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6832&json=true","fetch_graph":"https://pith.science/api/pith-number/DWLLL6OCRXZBUKQWCR4PIMHXLM/graph.json","fetch_events":"https://pith.science/api/pith-number/DWLLL6OCRXZBUKQWCR4PIMHXLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/action/storage_attestation","attest_author":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/action/author_attestation","sign_citation":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/action/citation_signature","submit_replication":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/action/replication_record"}},"created_at":"2026-05-18T02:48:55.726086+00:00","updated_at":"2026-05-18T02:48:55.726086+00:00"}