{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F6XI2RFJSDXDSMWM2TBYFEER5O","short_pith_number":"pith:F6XI2RFJ","schema_version":"1.0","canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","source":{"kind":"arxiv","id":"1307.2715","version":1},"attestation_state":"computed","paper":{"title":"Optimisation dans la d\\'etection de communaut\\'es recouvrantes et \\'equilibre de Nash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Marie Lopez, Michel Crampes, Michel Planti\\'e","submitted_at":"2013-07-10T08:54:00Z","abstract_excerpt":"Community detection in graphs has been the subject of many algorithms. Recent methods want to optimize a modularity function which shows a maximum of relationships within communities and found a minimum of inter-community relations. these algorithms are applied to unipartite, multipartite and directed graphs. However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper we introduce an algorithm which, based on an approximate solution obtained through a efficient detection algorithm, modifie it to achieve a local optimum base"},"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":"1307.2715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-10T08:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"7e31811c429f0b3aa01b8ca1e2261469aa1369da38948985ab6f4721947bdd36","abstract_canon_sha256":"4d87720c89b600aa2d9b3d407976cf0bdc45def400333a587743e4c1ccf7e0e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:50.623145Z","signature_b64":"wP7DhEJ6nxo0dncul6yQiEhtTIMtBACasQMaF9cRKQEoCQSSEBmYUL/gDheG8+xF57eia0HOqzyJAQa5OfKfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","last_reissued_at":"2026-05-18T03:18:50.622605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:50.622605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimisation dans la d\\'etection de communaut\\'es recouvrantes et \\'equilibre de Nash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Marie Lopez, Michel Crampes, Michel Planti\\'e","submitted_at":"2013-07-10T08:54:00Z","abstract_excerpt":"Community detection in graphs has been the subject of many algorithms. Recent methods want to optimize a modularity function which shows a maximum of relationships within communities and found a minimum of inter-community relations. these algorithms are applied to unipartite, multipartite and directed graphs. However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper we introduce an algorithm which, based on an approximate solution obtained through a efficient detection algorithm, modifie it to achieve a local optimum base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2715","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":"1307.2715","created_at":"2026-05-18T03:18:50.622679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2715v1","created_at":"2026-05-18T03:18:50.622679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2715","created_at":"2026-05-18T03:18:50.622679+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6XI2RFJSDXD","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6XI2RFJSDXDSMWM","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6XI2RFJ","created_at":"2026-05-18T12:27:45.050594+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/F6XI2RFJSDXDSMWM2TBYFEER5O","json":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O.json","graph_json":"https://pith.science/api/pith-number/F6XI2RFJSDXDSMWM2TBYFEER5O/graph.json","events_json":"https://pith.science/api/pith-number/F6XI2RFJSDXDSMWM2TBYFEER5O/events.json","paper":"https://pith.science/paper/F6XI2RFJ"},"agent_actions":{"view_html":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O","download_json":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O.json","view_paper":"https://pith.science/paper/F6XI2RFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2715&json=true","fetch_graph":"https://pith.science/api/pith-number/F6XI2RFJSDXDSMWM2TBYFEER5O/graph.json","fetch_events":"https://pith.science/api/pith-number/F6XI2RFJSDXDSMWM2TBYFEER5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/action/storage_attestation","attest_author":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/action/author_attestation","sign_citation":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/action/citation_signature","submit_replication":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/action/replication_record"}},"created_at":"2026-05-18T03:18:50.622679+00:00","updated_at":"2026-05-18T03:18:50.622679+00:00"}